Struct DirectedGraph 

pub struct DirectedGraph<NodeData> { /* private fields */ }

Implementations

impl<NodeData> DirectedGraph<NodeData>

pub fn new() -> Self

pub fn add_node(&mut self, node_id: OperatorId, data: NodeData) -> OperatorId

pub fn add_edge(&mut self, edge: FlowEdge) -> FlowEdgeId

pub fn get_node(&self, node_id: &OperatorId) -> Option<&NodeData>

pub fn get_node_mut(&mut self, node_id: &OperatorId) -> Option<&mut NodeData>

pub fn node_count(&self) -> usize

pub fn edge_count(&self) -> usize

pub fn neighbors(&self, node_id: &OperatorId) -> Vec<OperatorId>

pub fn predecessors(&self, node_id: &OperatorId) -> Vec<OperatorId>

pub fn topological_sort(&self) -> Vec<OperatorId>

pub fn dfs_from(&self, start: &OperatorId) -> Vec<OperatorId>

pub fn nodes(&self) -> impl Iterator<Item = (&OperatorId, &NodeData)>

pub fn edges(&self) -> impl Iterator<Item = &FlowEdge>

pub fn is_empty(&self) -> bool

pub fn clear(&mut self)

Trait Implementations

impl<NodeData: Clone> Clone for DirectedGraph<NodeData>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<NodeData: Debug> Debug for DirectedGraph<NodeData>

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

Formats the value using the given formatter.

impl<NodeData> Default for DirectedGraph<NodeData>

fn default() -> Self

Returns the “default value” for a type.

impl<NodeData: PartialEq> PartialEq for DirectedGraph<NodeData>

fn eq(&self, other: &Self) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<NodeData: PartialEq> StructuralPartialEq for DirectedGraph<NodeData>