Struct cairo_lang_utils::graph_algos::scc_graph_node::SccGraphNode

pub struct SccGraphNode<Node: GraphNode>(_);

A node whose neighbors are only the subset of its neighbors in the full graph, which are also in the same SCC (strongly-connected-component) with it.

Trait Implementations

impl<Node: Clone + GraphNode> Clone for SccGraphNode<Node>

fn clone(&self) -> SccGraphNode<Node>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<Node: GraphNode> From<Node> for SccGraphNode<Node>

fn from(value: Node) -> Self

Converts to this type from the input type.

impl<Node: GraphNode + ComputeScc> GraphNode for SccGraphNode<Node>

type NodeId = <Node as GraphNode>::NodeId

The type used to identify the nodes in the graph.

fn get_neighbors(&self) -> Vec<Self>

Returns a list of the node’s neighbors. Must be stable for the SCC result to be stable. i.e. if the output for a node here doesn’t change between different runs, the computed SCC of the node is guaranteed to also not change.

fn get_id(&self) -> Self::NodeId

Gets the node’s ID.

fn get_neighbors_in_given_scc(&self, scc: Vec<Self::NodeId>) -> Vec<Self>

Helper function to get the neighbors of the node, given its SCC. Default-implemented and thus can be used in simple implementations of get_neighbors_in_scc.