Struct AttributedDiGraph

pub struct AttributedDiGraph<N: Node, E: EdgeWeight, Ix: IndexType = u32> { /* private fields */ }

Directed graph with node and edge attributes

Implementations

impl<N: Node, E: EdgeWeight, Ix: IndexType> AttributedDiGraph<N, E, Ix>

pub fn new() -> Self

Create a new empty attributed directed graph

pub fn from_digraph(graph: DiGraph<N, E, Ix>) -> Self

Create an attributed directed graph from an existing directed graph

pub fn add_node(&mut self, node: N)

Add a node to the graph

pub fn add_node_with_attributes(&mut self, node: N, attributes: Attributes)

Add a node with initial attributes

pub fn add_edge(&mut self, source: N, target: N, weight: E) -> Result<()>

Add an edge between two nodes with a given weight

pub fn add_edge_with_attributes( &mut self, source: N, target: N, weight: E, attributes: Attributes, ) -> Result<()>

Add an edge with initial attributes

pub fn set_node_attribute<K: Into<String>>( &mut self, node: &N, key: K, value: AttributeValue, )

Set a node attribute

pub fn get_node_attribute(&self, node: &N, key: &str) -> Option<&AttributeValue>

Get a node attribute

pub fn set_edge_attribute<K: Into<String>>( &mut self, source: &N, target: &N, key: K, value: AttributeValue, ) -> Result<()>

Set an edge attribute

pub fn get_edge_attribute( &self, source: &N, target: &N, key: &str, ) -> Option<&AttributeValue>

Get an edge attribute

pub fn set_graph_attribute<K: Into<String>>( &mut self, key: K, value: AttributeValue, )

Set a graph-level attribute

pub fn get_graph_attribute(&self, key: &str) -> Option<&AttributeValue>

Get a graph-level attribute

pub fn predecessors(&self, node: &N) -> Result<Vec<N>>

where N: Clone,

Get predecessors of a node

pub fn successors(&self, node: &N) -> Result<Vec<N>>

where N: Clone,

Get successors of a node

pub fn graph(&self) -> &DiGraph<N, E, Ix>

Get the underlying directed graph

pub fn graph_mut(&mut self) -> &mut DiGraph<N, E, Ix>

Get a mutable reference to the underlying directed graph

pub fn into_digraph(self) -> DiGraph<N, E, Ix>

Convert back to a regular directed graph (losing attributes)

Trait Implementations

impl<N: Node, E: EdgeWeight, Ix: IndexType> Default for AttributedDiGraph<N, E, Ix>

fn default() -> Self

Returns the “default value” for a type.