Struct graph_rs::MapGraph

pub struct MapGraph<M>(_);

Methods

impl<M> MapGraph<M>

fn unwrap(self) -> M

Returns the inner Map of this graph.

Trait Implementations

impl<M> From<M> for MapGraph<M>

fn from(map: M) -> Self

Performs the conversion.

impl<'m, N, W, M> DirectedWeightedGraph<'m, N, W> for MapGraph<M> where
    M: Map<'m, (N, N), W>,
    N: 'm + Eq + Clone,
    W: 'm, 

type AllWeightedEdges = Map<M::Iter, fn(_: (&'m (N, N), &'m W)) -> (&'m N, &'m N, &'m W)>

An iterator that iterates over all edges.

type AllWeightedEdgesMut = Map<M::IterMut, fn(_: (&'m (N, N), &'m mut W)) -> (&'m N, &'m N, &'m mut W)>

An iterator that iterates over all edges, giving mutable access to the weight.

fn all_edges(&'m self) -> Self::AllWeightedEdges

Returns an iterator over all the edges in this graph.

fn all_edges_mut(&'m mut self) -> Self::AllWeightedEdgesMut

Returns an iterator over all the ediges in this graph, with mutable access to the weight.

fn add_edge(&'m mut self, source: N, sink: N, weight: W) -> Option<(N, N, W)>

Adds an edge to this graph.

fn remove_edge(&'m mut self, source: &N, sink: &N) -> Option<(N, N, W)>

Removes an edge from the graph.

fn edge_weight(&'m self, source: &N, sink: &N) -> Option<&W>

Gets a borrow to the weight of the requested edge, if it exist.

fn edge_weight_mut(&'m mut self, source: &N, sink: &N) -> Option<&mut W>

Gets a mutable borrow to the weight of the requested edge, if it exist.

fn has_edge(&'g self, source: &N, sink: &N) -> bool

Checks if a graph has an edge or not.