pub fn add_start_node(&mut self, node: NodeId) {
        assert!(self.dump.has_node(node));
        self.visited.insert(node, None);
        self.front.push_back(node);
    }
/// Add `node` to the set of nodes from which traversal should begin.
Add `node` to the set of nodes from which traversal should begin.
Add ` node ` to the set of nodes from which traversal should begin .
pub fn add_start_node(&mut self, node: NodeId) {
        assert!(self.dump.has_node(node));
        self.visited.insert(node, None);
        self.front.push_back(node);
    }
pub fn add_start_node ( & mut self , node : NodeId ) { assert ! ( self dump has_node ( node ) ) ; self . visited . insert ( node , None ) ; self . front . push_back ( node ) ; }
Add `node` to the set of nodes from which traversal should begin.
Add ` node ` to the set of nodes from which traversal should begin .
&mut self
node
NodeId
&mut self
node
NodeId