[−][src]Trait rs_graph::traits::GraphType
Base information of a graph.
Associated Types
Loading content...Implementations on Foreign Types
impl<'a, G> GraphType<'a> for &'a G where
G: GraphType<'a>,
[src]
Loading content...
G: GraphType<'a>,
Implementors
impl<'a, 'g: 'a, G> GraphType<'a> for InEdges<'g, G> where
G: Directed<'g>,
[src]
G: Directed<'g>,
impl<'a, 'g: 'a, G> GraphType<'a> for Neighbors<'g, G> where
G: GraphType<'g>,
[src]
G: GraphType<'g>,
impl<'a, 'g: 'a, G> GraphType<'a> for OutEdges<'g, G> where
G: Directed<'g>,
[src]
G: Directed<'g>,
impl<'a, A, P> GraphType<'a> for FilterAdjacencies<A, P> where
A: Adjacencies<'a>,
[src]
A: Adjacencies<'a>,
impl<'a, G> GraphType<'a> for ReverseDigraph<G> where
G: GraphType<'a>,
[src]
G: GraphType<'a>,
impl<'a, G, Gx, Nx, Ex, Ax> GraphType<'a> for Attributed<G, Gx, Nx, Ex, Ax> where
G: GraphType<'a>,
Gx: Default,
Nx: Default,
Ex: Default,
Ax: Default,
[src]
G: GraphType<'a>,
Gx: Default,
Nx: Default,
Ex: Default,
Ax: Default,
impl<'a, G, P> GraphType<'a> for FilteredGraph<'a, G, P> where
G: GraphType<'a>,
P: 'a + for<'r> Fn(&'r G::Edge) -> bool,
[src]
G: GraphType<'a>,
P: 'a + for<'r> Fn(&'r G::Edge) -> bool,
impl<'a, ID> GraphType<'a> for LinkedListGraph<ID> where
ID: 'a + PrimInt + Unsigned,
[src]
ID: 'a + PrimInt + Unsigned,