Struct hexodsp::nodes::node_graph_ordering::NodeGraphOrdering

pub struct NodeGraphOrdering {
    node2idx: HashMap<NodeId, usize>,
    node_count: usize,
    nodes: Vec<Node>,
    in_degree: Vec<usize>,
}

Fields

node2idx: HashMap<NodeId, usize>

node_count: usize

nodes: Vec<Node>

in_degree: Vec<usize>

Implementations

impl NodeGraphOrdering

pub fn new() -> Self

pub fn clear(&mut self)

pub fn add_node(&mut self, node_id: NodeId) -> usize

fn get_node(&self, node_id: NodeId) -> Option<&Node>

fn get_node_mut(&mut self, node_id: NodeId) -> Option<&mut Node>

pub fn add_edge(&mut self, from_node_id: NodeId, to_node_id: NodeId)

pub fn has_path(&self, from_node_id: NodeId, to_node_id: NodeId) -> Option<bool>

pub fn calculate_order(&mut self, out: &mut Vec<NodeId>) -> bool

Run Kahn’s Algorithm to find the node order for the directed graph. out will contain the order the nodes should be executed in. If false is returned, the graph contains cycles and no proper order can be computed. out will be cleared in this case.

Trait Implementations

impl Clone for NodeGraphOrdering

fn clone(&self) -> NodeGraphOrdering

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for NodeGraphOrdering

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

Formats the value using the given formatter.