[−][src]Trait gamma::graph::Graph
An undirected graph.
Associated Types
type NodeIterator: Iterator<Item = &'a N>
type NeighborIterator: Iterator<Item = &'a N>
type EdgeIterator: Iterator<Item = (&'a N, &'a N)>
Required methods
fn is_empty(&self) -> bool
Returns true if there are no nodes, or false otherwise.
fn order(&self) -> usize
Returns the number of nodes in this graph.
fn size(&self) -> usize
Returns the number of edges in this graph.
fn nodes(&'a self) -> Self::NodeIterator
Iterates the nodes of this graph
fn has_node(&self, node: &N) -> bool
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.
fn degree(&self, node: &N) -> Result<usize, Error>
Returns the number of neighbors connected to node.
fn edges(&'a self) -> Self::EdgeIterator
Iterates the edges of this graph.
fn has_edge(&self, source: &N, target: &N) -> Result<bool, Error>
Returns true if an edge exists between source and target.