sad/raptorq
1
0
Fork 0
mirror of https://github.com/cberner/raptorq.git synced 2024-06-27 09:19:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Reduce length of merge chains in union-find data structure

Browse Source
This commit is contained in:
Christopher Berner 2020-12-26 19:32:55 -08:00
parent 3cc21f5b42
commit 602fc8711d
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
src/graph.rs
View File

@ -1,4 +1,5 @@
use crate::arraymap::U16ArrayMap;
use std::cmp::{max, min};
const NO_CONNECTED_COMPONENT: u16 = 0;
@ -125,9 +126,9 @@ impl ConnectedComponentGraph {
self.node_connected_component
.insert(node2, connected_component1 as u16);
} else if connected_component1 != connected_component2 {
// Arbitrarily merge into the first one
let merge_to = connected_component1;
let merge_from = connected_component2;
// Merge into the lowest to keep chains short
let merge_to = min(connected_component1, connected_component2);
let merge_from = max(connected_component1, connected_component2);
let to_size = self.connected_component_size.get(merge_to as usize);
let from_size = self.connected_component_size.get(merge_from as usize);
self.connected_component_size.insert(merge_from as usize, 0);