Struct leo_passes::common::graph::DiGraph

pub struct DiGraph<N: Node> {
    nodes: IndexSet<N>,
    edges: IndexMap<N, IndexSet<N>>,
}

A directed graph.

Fields

nodes: IndexSet<N>

The set of nodes in the graph.

edges: IndexMap<N, IndexSet<N>>

The directed edges in the graph. Each entry in the map is a node in the graph, and the set of nodes that it points to.

Implementations

impl<N: Node> DiGraph<N>

pub fn new(nodes: IndexSet<N>) -> Self

Initializes a new DiGraph from a vector of source nodes.

pub fn add_edge(&mut self, from: N, to: N)

Adds an edge to the graph.

pub fn contains_node(&self, node: N) -> bool

Returns true if the graph contains the given node.

pub fn post_order(&self) -> Result<IndexSet<N>, DiGraphError<N>>

Returns the post-order ordering of the graph. Detects if there is a cycle in the graph.

pub fn retain_nodes(&mut self, nodes: &IndexSet<N>)

Retains a subset of the nodes, and removes all edges in which the source or destination is not in the subset.

fn contains_cycle_from( &self, node: N, discovered: &mut IndexSet<N>, finished: &mut IndexSet<N>, ) -> Option<N>

Trait Implementations

impl<N: Debug + Node> Debug for DiGraph<N>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<N: PartialEq + Node> PartialEq for DiGraph<N>

fn eq(&self, other: &DiGraph<N>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<N: Eq + Node> Eq for DiGraph<N>

impl<N: Node> StructuralPartialEq for DiGraph<N>