gamma 0.1.1

Graph primitives and traversals for Rust.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34

use crate::graph::Error;

pub trait Graph<'a, N: 'a> {
    type NodeIterator: Iterator<Item=&'a N>;
    type NeighborIterator: Iterator<Item=&'a N>;
    type EdgeIterator: Iterator<Item=(&'a N, &'a N)>;

    /// Returns true if there are no nodes, or false otherwise.
    fn is_empty(&self) -> bool;

    // /// Returns the number of nodes in this graph.
    fn order(&self) -> usize;

    // /// Returns the number of edges in this graph.
    fn size(&self) -> usize;

    // /// Iterates the nodes of this graph
    fn nodes(&'a self) -> Self::NodeIterator;

    // /// Returns true if node is a member, or false otherwise. 
    fn has_node(&self, node: &N) -> bool;

    // /// Iterates the neighbors of node.
    fn neighbors(&'a self, node: &N) -> Result<Self::NeighborIterator, Error>;

    // /// Returns the number of neighbors connected to node.
    fn degree(&self, node: &N) -> Result<usize, Error>;

    // /// Iterates the edges of this graph.
    fn edges(&'a self) -> Self::EdgeIterator;
    
    // /// Returns true if an edge exists between source and target.
    fn has_edge(&self, source: &N, target: &N) -> Result<bool, Error>;
}