Struct DiGraph

pub struct DiGraph<NId, NL, EL>
where
    NId: Eq + Hash,
{ /* private fields */ }

The base structure denoting a directed graph with a start in the first added node.

• NId: id of the node. should be unique and implement Eq + Hash
• NL: payload for node
• EL: payload for edge

Implementations

impl DiGraph<usize, EmptyPayload, EmptyPayload>

pub fn empty() -> Self

Default empty payload graph

impl<NId, NL, EL> DiGraph<NId, NL, EL>

where NId: Clone + Eq + Hash,

pub fn new() -> Self

pub fn remove_node(&mut self, id: NId) -> Option<NL>

Removes a node. Returns a payload if the node is presented.

Note: this operation should be accompanied by the remove_edge operations.

pub fn add_edge(&mut self, from: NId, to: NId, payload: EL) -> Option<EL>

Adds new edge. Returns prev.

pub fn remove_edge(&mut self, from: NId, to: NId) -> Option<EL>

Removes edge. Returns a payload on the edge if it exists.

pub fn successors(&self, from: NId) -> Option<&HashMap<NId, EL>>

Returns a reference to the successors.

pub fn start(&self) -> &Option<NId>

Returns a reference to a start node.

pub fn analyze(&self) -> GraphAnalyzer<'_, NId, NL, EL>

Invokes a graph analyzer GraphAnalyzer

pub fn visualize(&self) -> DotGraphVisualizer<'_, NId, NL, EL>

Invokes a graph visualizer DotGraphVisualizer

impl<NId, NL, EL> DiGraph<NId, NL, EL>

where NId: Clone + Eq + Hash, NL: Default,

pub fn add_bare_node(&mut self, id: NId) -> Option<NId>

Adds a node with an EmptyPayload

impl<NId, NL, EL> DiGraph<NId, NL, EL>

where NId: Clone + Eq + Hash, EL: Default,

pub fn add_bare_edge(&mut self, from: NId, to: NId) -> Option<EL>

Adds an edge with an EmptyPayload

Trait Implementations

impl<NId, NL: Debug, EL: Debug> Debug for DiGraph<NId, NL, EL>

where NId: Eq + Hash + Debug,

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

Formats the value using the given formatter.