An undirected graph.
type NodeIterator: Iterator<Item = &'a N>
type NeighborIterator: Iterator<Item = &'a N>
Returns true if there are no nodes, or false otherwise.
Returns the number of nodes in this graph.
Returns the number of edges in this graph.
fn nodes(&'a self) -> Self::NodeIterator
Iterates the nodes of this graph
Returns true if node is a member, or false otherwise.
fn neighbors(&'a self, node: &N) -> Result<Self::NeighborIterator, Error>
Iterates the neighbors of node.
Returns the number of neighbors connected to node.
fn edges(&'a self) -> Self::EdgeIterator
Iterates the edges of this graph.
Returns true if an edge exists between source and target.