perf!: Fix Subgraph O(n) complexity (#157)

Replaced the `Subgraph = FilteredGraph` alias with a concrete definition that avoids traversing the whole graph to filter nodes all the time. Now `Subgraph::iter_nodes` is `O(nodes in subgraph)` instead of `O(n)`. Closes #155. BREAKING CHANGE: `Subgraph` is no longer an alias for `FilteredGraph` --------- Co-authored-by: Douglas Wilson <[email protected]>
CQCL · Nov 19, 2024 · c2cd701 · c2cd701
1 parent 9868d7b
commit c2cd701
Show file tree

Hide file tree

Showing 2 changed files with 388 additions and 63 deletions.
diff --git a/src/view/filter.rs b/src/view/filter.rs
@@ -52,10 +52,6 @@ where
     pub fn context(&self) -> &Ctx {
         &self.context
     }
-
-    pub(super) fn graph(&self) -> G {
-        self.graph.clone()
-    }
 }
 
 impl<G, F, Ctx> NodeFiltered<G, F, Ctx>