implementing BDD::compose

shnarazk · Feb 4, 2024 · d75f9af · d75f9af
1 parent caa3cf5
commit d75f9af
Showing 1 changed file with 2 additions and 19 deletions.
diff --git a/src/bdd.rs b/src/bdd.rs
@@ -199,32 +199,15 @@ impl ReducedDecisionDiagram for BDD<Node> {
     fn compose(&self, other: &Self, var_index: usize) -> Self {
         let v1 = self.graph.clone();
         let v2 = other.graph.clone();
-        let mut node: HashMap<usize, Node> = HashMap::new();
-        node.insert(0, Node::new_constant(false));
-        node.insert(1, Node::new_constant(true));
-        let mut index: HashMap<Node, usize> = HashMap::new();
-        for (i, n) in self
-            .graph
-            .all_nodes()
-            .iter()
-            .chain(other.graph.all_nodes().iter())
-            .enumerate()
-        {
-            node.insert(i + 2, (*n).clone());
-            if let Some(b) = n.is_constant() {
-                index.insert((*n).clone(), b as usize);
-            } else {
-                index.insert((*n).clone(), i + 2);
-            }
-        }
+        let mut indexer = Node::build_indexer(&[v1.clone(), v2.clone()]);
         let mut links: HashMap<(usize, usize, usize), Node> = HashMap::new();
         let mut values: HashMap<Node, bool> = HashMap::new();
         BDD::new_from(compose_aux(
             &v1,
             &v1,
             &v2,
             var_index,
-            &mut (index, node),
+            &mut indexer,
             &mut links,
             &mut values,
         ))