Handle holes in graph node indices

Qiskit · May 27, 2022 · 889dff5 · 889dff5
1 parent 6634fdf
commit 889dff5
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/src/tree.rs b/src/tree.rs
@@ -179,7 +179,7 @@ pub fn bipartition_tree(
     let mut pops = pops;
     let spanning_tree_graph = &spanning_tree.graph;
     let mut same_partition_tracker: Vec<Vec<usize>> =
-        vec![vec![]; spanning_tree_graph.node_count()]; // Keeps track of all all the nodes on the same side of the partition
+        vec![vec![]; spanning_tree_graph.node_bound()]; // Keeps track of all all the nodes on the same side of the partition
 
     let mut node_queue: VecDeque<NodeIndex> = VecDeque::<NodeIndex>::new();
     for leaf_node in spanning_tree_graph.node_indices() {