Struct rs_graph::linkedlistgraph::LinkedListGraph [−][src]
The linked list based graph data structure.
Implementations
impl<ID, N, E> LinkedListGraph<ID, N, E> where
ID: PrimInt + Unsigned,
[src]
impl<ID, N, E> LinkedListGraph<ID, N, E> where
ID: PrimInt + Unsigned,
[src]pub fn new() -> LinkedListGraph<ID, N, E>
[src]
Trait Implementations
impl<ID, N, E> Buildable for LinkedListGraph<ID, N, E> where
ID: PrimInt + Unsigned,
N: Default,
E: Default,
[src]
impl<ID, N, E> Buildable for LinkedListGraph<ID, N, E> where
ID: PrimInt + Unsigned,
N: Default,
E: Default,
[src]type Builder = LinkedListGraphBuilder<ID, N, E>
fn new_builder() -> Self::Builder
[src]
fn new_with<F>(f: F) -> Self where
F: FnOnce(&mut Self::Builder),
[src]
F: FnOnce(&mut Self::Builder),
impl<ID, N, E> Default for LinkedListGraph<ID, N, E> where
ID: PrimInt + Unsigned,
[src]
impl<ID, N, E> Default for LinkedListGraph<ID, N, E> where
ID: PrimInt + Unsigned,
[src]impl<'de, ID, N, E> Deserialize<'de> for LinkedListGraph<ID, N, E> where
ID: Deserialize<'de>,
N: Deserialize<'de>,
E: Deserialize<'de>,
[src]
impl<'de, ID, N, E> Deserialize<'de> for LinkedListGraph<ID, N, E> where
ID: Deserialize<'de>,
N: Deserialize<'de>,
E: Deserialize<'de>,
[src]fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
[src]
__D: Deserializer<'de>,
impl<'a, ID, N: 'a, E: 'a> Directed<'a> for LinkedListGraph<ID, N, E> where
ID: 'a + PrimInt + Unsigned,
[src]
impl<'a, ID, N: 'a, E: 'a> Directed<'a> for LinkedListGraph<ID, N, E> where
ID: 'a + PrimInt + Unsigned,
[src]type OutIt = OutIt<ID>
Type of a graph iterator over edges leaving a node.
type InIt = InIt<ID>
Type of a graph iterator over edges entering a node.
type IncidentIt = IncidentIt<ID>
Type of an iterator over all incident edges.
type DirectedEdge = Self::Edge
Type of a directed edge.
fn src(&self, e: Self::Edge) -> Self::Node
[src]
fn snk(&self, e: Self::Edge) -> Self::Node
[src]
fn out_iter(&'a self, u: Self::Node) -> Self::OutIt
[src]
fn in_iter(&'a self, u: Self::Node) -> Self::InIt
[src]
fn incident_iter(&'a self, u: Self::Node) -> Self::IncidentIt
[src]
fn outedges(&'a self, u: Self::Node) -> GraphIter<'a, Self, Self::OutIt>ⓘ where
Self: Sized,
[src]
Self: Sized,
fn outgoing(&'a self) -> OutEdges<'a, Self> where
Self: Sized,
[src]
Self: Sized,
fn inedges(&'a self, u: Self::Node) -> GraphIter<'a, Self, Self::InIt>ⓘ where
Self: Sized,
[src]
Self: Sized,
fn incoming(&'a self) -> InEdges<'a, Self> where
Self: Sized,
[src]
Self: Sized,
fn incident_edges(
&'a self,
u: Self::Node
) -> GraphIter<'a, Self, Self::IncidentIt>ⓘ where
Self: Sized,
[src]
&'a self,
u: Self::Node
) -> GraphIter<'a, Self, Self::IncidentIt>ⓘ where
Self: Sized,
impl<'a, ID, N: 'a, E: 'a> EdgeAttributes<'a, LinkedListGraph<ID, N, E>, E> for LinkedListGraph<ID, N, E> where
ID: 'a + PrimInt + Unsigned,
[src]
impl<'a, ID, N: 'a, E: 'a> EdgeAttributes<'a, LinkedListGraph<ID, N, E>, E> for LinkedListGraph<ID, N, E> where
ID: 'a + PrimInt + Unsigned,
[src]impl<'a, ID, N: 'a, E: 'a> GraphIterator<LinkedListGraph<ID, N, E>> for NodeIt<ID> where
ID: 'a + PrimInt + Unsigned,
[src]
impl<'a, ID, N: 'a, E: 'a> GraphIterator<LinkedListGraph<ID, N, E>> for NodeIt<ID> where
ID: 'a + PrimInt + Unsigned,
[src]type Item = Node<ID>
fn next(&mut self, _g: &LinkedListGraph<ID, N, E>) -> Option<Self::Item>
[src]
fn size_hint(&self, _g: &LinkedListGraph<ID, N, E>) -> (usize, Option<usize>)
[src]
fn count(self, _g: &LinkedListGraph<ID, N, E>) -> usize
[src]
fn iter<'a>(self, g: &'a G) -> GraphIter<'a, G, Self>ⓘ where
G: Sized,
[src]
G: Sized,
impl<'a, ID, N: 'a, E: 'a> GraphIterator<LinkedListGraph<ID, N, E>> for EdgeIt<ID> where
ID: 'a + PrimInt + Unsigned,
[src]
impl<'a, ID, N: 'a, E: 'a> GraphIterator<LinkedListGraph<ID, N, E>> for EdgeIt<ID> where
ID: 'a + PrimInt + Unsigned,
[src]type Item = Edge<ID>
fn next(&mut self, _g: &LinkedListGraph<ID, N, E>) -> Option<Self::Item>
[src]
fn size_hint(&self, _g: &LinkedListGraph<ID, N, E>) -> (usize, Option<usize>)
[src]
fn count(self, _g: &LinkedListGraph<ID, N, E>) -> usize
[src]
fn iter<'a>(self, g: &'a G) -> GraphIter<'a, G, Self>ⓘ where
G: Sized,
[src]
G: Sized,
impl<'a, ID, N, E> GraphIterator<LinkedListGraph<ID, N, E>> for NeighIt<ID> where
ID: 'a + PrimInt + Unsigned,
[src]
impl<'a, ID, N, E> GraphIterator<LinkedListGraph<ID, N, E>> for NeighIt<ID> where
ID: 'a + PrimInt + Unsigned,
[src]impl<'a, ID, N, E> GraphIterator<LinkedListGraph<ID, N, E>> for OutIt<ID> where
ID: 'a + PrimInt + Unsigned,
[src]
impl<'a, ID, N, E> GraphIterator<LinkedListGraph<ID, N, E>> for OutIt<ID> where
ID: 'a + PrimInt + Unsigned,
[src]impl<'a, ID, N, E> GraphSize<'a> for LinkedListGraph<ID, N, E> where
ID: 'a + PrimInt + Unsigned,
[src]
impl<'a, ID, N, E> GraphSize<'a> for LinkedListGraph<ID, N, E> where
ID: 'a + PrimInt + Unsigned,
[src]type NodeIt = NodeIt<ID>
Type of an iterator over all nodes.
type EdgeIt = EdgeIt<ID>
Type of an iterator over all edges.
fn num_nodes(&self) -> usize
[src]
fn num_edges(&self) -> usize
[src]
fn nodes_iter(&self) -> Self::NodeIt
[src]
fn edges_iter(&self) -> Self::EdgeIt
[src]
fn nodes(&'a self) -> NodeIterator<'a, Self> where
Self: Sized,
[src]
Self: Sized,
fn edges(&'a self) -> EdgeIterator<'a, Self> where
Self: Sized,
[src]
Self: Sized,
impl<'a, ID, N, E> GraphType<'a> for LinkedListGraph<ID, N, E> where
ID: 'a + PrimInt + Unsigned,
[src]
impl<'a, ID, N, E> GraphType<'a> for LinkedListGraph<ID, N, E> where
ID: 'a + PrimInt + Unsigned,
[src]impl<'a, ID, N: 'a, E: 'a> IndexGraph<'a> for LinkedListGraph<ID, N, E> where
ID: 'a + PrimInt + Unsigned,
[src]
impl<'a, ID, N: 'a, E: 'a> IndexGraph<'a> for LinkedListGraph<ID, N, E> where
ID: 'a + PrimInt + Unsigned,
[src]impl<'a, ID, N: 'a, E: 'a> NodeAttributes<'a, LinkedListGraph<ID, N, E>, N> for LinkedListGraph<ID, N, E> where
ID: 'a + PrimInt + Unsigned,
[src]
impl<'a, ID, N: 'a, E: 'a> NodeAttributes<'a, LinkedListGraph<ID, N, E>, N> for LinkedListGraph<ID, N, E> where
ID: 'a + PrimInt + Unsigned,
[src]impl<ID, N, E> Serialize for LinkedListGraph<ID, N, E> where
ID: Serialize,
N: Serialize,
E: Serialize,
[src]
impl<ID, N, E> Serialize for LinkedListGraph<ID, N, E> where
ID: Serialize,
N: Serialize,
E: Serialize,
[src]impl<'a, ID, N: 'a, E: 'a> Undirected<'a> for LinkedListGraph<ID, N, E> where
ID: 'a + PrimInt + Unsigned,
[src]
impl<'a, ID, N: 'a, E: 'a> Undirected<'a> for LinkedListGraph<ID, N, E> where
ID: 'a + PrimInt + Unsigned,
[src]type NeighIt = NeighIt<ID>
Type of a graph iterator over all incident edges.
fn enodes(&self, e: Self::Edge) -> (Self::Node, Self::Node)
[src]
fn neigh_iter(&'a self, u: Self::Node) -> Self::NeighIt
[src]
fn neighs(&'a self, u: Self::Node) -> GraphIter<'a, Self, Self::NeighIt>ⓘ where
Self: Sized,
[src]
Self: Sized,
fn neighbors(&'a self) -> Neighbors<'a, Self> where
Self: Sized,
[src]
Self: Sized,
Auto Trait Implementations
impl<ID, N, E> RefUnwindSafe for LinkedListGraph<ID, N, E> where
E: RefUnwindSafe,
ID: RefUnwindSafe,
N: RefUnwindSafe,
impl<ID, N, E> RefUnwindSafe for LinkedListGraph<ID, N, E> where
E: RefUnwindSafe,
ID: RefUnwindSafe,
N: RefUnwindSafe,
impl<ID, N, E> Send for LinkedListGraph<ID, N, E> where
E: Send,
ID: Send,
N: Send,
impl<ID, N, E> Send for LinkedListGraph<ID, N, E> where
E: Send,
ID: Send,
N: Send,
impl<ID, N, E> Sync for LinkedListGraph<ID, N, E> where
E: Sync,
ID: Sync,
N: Sync,
impl<ID, N, E> Sync for LinkedListGraph<ID, N, E> where
E: Sync,
ID: Sync,
N: Sync,
impl<ID, N, E> Unpin for LinkedListGraph<ID, N, E> where
E: Unpin,
ID: Unpin,
N: Unpin,
impl<ID, N, E> Unpin for LinkedListGraph<ID, N, E> where
E: Unpin,
ID: Unpin,
N: Unpin,
impl<ID, N, E> UnwindSafe for LinkedListGraph<ID, N, E> where
E: UnwindSafe,
ID: UnwindSafe,
N: UnwindSafe,
impl<ID, N, E> UnwindSafe for LinkedListGraph<ID, N, E> where
E: UnwindSafe,
ID: UnwindSafe,
N: UnwindSafe,
Blanket Implementations
impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,
[src]
impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,
[src]impl<'a, G> Graph<'a> for G where
G: GraphSize<'a> + Undirected<'a>,
[src]
impl<'a, G> Graph<'a> for G where
G: GraphSize<'a> + Undirected<'a>,
[src]impl<'a, T> IndexDigraph<'a> for T where
T: IndexGraph<'a> + Digraph<'a>,
[src]
impl<'a, T> IndexDigraph<'a> for T where
T: IndexGraph<'a> + Digraph<'a>,
[src]