Struct gamma::graph::HashGraph

pub struct HashGraph<'a, N, E> { /* fields omitted */ }

Implements an undirected, labeled, graph. Node, neighbor, and edge iteration order are stable and set by build order.

use gamma::graph::Graph;
use gamma::graph::HashGraph;
 
let mut graph = HashGraph::build(vec![ 0, 1, 2 ], vec![
    (&0, &1, "a"),
    (&1, &2, "b")
]
).unwrap();
 
assert_eq!(graph.is_empty(), false);
assert_eq!(graph.order(), 3);
assert_eq!(graph.size(), 2);
assert_eq!(graph.nodes().collect::<Vec<_>>(), vec![ &0, &1, &2 ]);
assert_eq!(graph.has_node(&0), true);
assert_eq!(graph.neighbors(&1).unwrap().collect::<Vec<_>>(), vec![ &0, &2 ]);
assert_eq!(graph.degree(&1).unwrap(), 2);
assert_eq!(graph.edges().collect::<Vec<_>>(), vec![
    (&0, &1), (&1, &2)
]);
assert_eq!(graph.has_edge(&0, &1).unwrap(), true);
assert_eq!(graph.has_edge(&1, &0).unwrap(), true);
assert_eq!(graph.has_edge(&0, &2).unwrap(), false);

Methods

impl<'a, N: Eq + Hash, E> HashGraph<'a, N, E>

pub fn new() -> Self

pub fn build(
    nodes: Vec<N>,
    edges: Vec<(&'a N, &'a N, E)>
) -> Result<Self, Error>

pub fn add_node(&mut self, node: N) -> Result<(), Error>

pub fn add_edge(&mut self, source: &'a N, target: &'a N) -> Result<(), Error>

Trait Implementations

impl<'a, N: Eq + Hash, E> Graph<'a, N> for HashGraph<'a, N, E>

type NodeIterator = Keys<'a, N, Vec<&'a N>>

type NeighborIterator = Cloned<Iter<'a, &'a N>>

type EdgeIterator = Cloned<Iter<'a, (&'a N, &'a N)>>

fn is_empty(&self) -> bool

Returns true if there are no nodes, or false otherwise.

fn order(&self) -> usize

fn size(&self) -> usize

fn nodes(&'a self) -> Self::NodeIterator

fn has_node(&self, node: &N) -> bool

fn neighbors(&'a self, node: &N) -> Result<Self::NeighborIterator, Error>

fn degree(&self, node: &N) -> Result<usize, Error>

fn edges(&'a self) -> Self::EdgeIterator

fn has_edge(&self, source: &N, target: &N) -> Result<bool, Error>

impl<'a, N: Eq + Hash, E> WeightedGraph<'a, N, E> for HashGraph<'a, N, E>

fn weight(&self, source: &'a N, target: &'a N) -> Result<Option<&E>, Error>

Returns the weight between source and target.