Method push_start_node

libs/@local/hashql/core/src/graph/algorithms/mod.rs:154–161

Adds a starting node to the traversal. If the node has already been visited, this has no effect. This allows traversing disconnected components by adding multiple starting nodes. # Examples ```rust # use hashql_core::graph::{LinkedGraph, algorithms::DepthFirstTraversal}; # let mut graph = LinkedGraph::new(); let n1 = graph.add_node("A"); let n2 = graph.add_node("B"); let n3 = graph.add_node("C"

(&mut self, start_node: N)

    /// # assert_eq!(visited, [n3, n1, n2]);
    /// ```
    pub fn push_start_node(&mut self, start_node: N)
    where
        G: DirectedGraph<NodeId = N>,
    {
        if self.visited.insert(start_node) {
            self.stack.push(start_node);
        }
    }

    /// Returns whether the given node has been visited.
    ///