Struct rs_graph::linkedlistgraph::LinkedListGraph

pub struct LinkedListGraph<ID = u32, N = (), E = ()> { /* private fields */ }

The linked list based graph data structure.

Implementations

impl<ID, N, E> LinkedListGraph<ID, N, E>where ID: PrimInt + Unsigned,

pub fn new() -> LinkedListGraph<ID, N, E>

Trait Implementations

impl<ID, N, E> Buildable for LinkedListGraph<ID, N, E>where ID: PrimInt + Unsigned + 'static, N: Default, E: Default,

type Builder = LinkedListGraphBuilder<ID, N, E>

fn new_builder() -> Self::Builder

Create a new builder for this graph type.

fn new_with<F>(f: F) -> Selfwhere F: FnOnce(&mut Self::Builder),

Create a new graph by passing the builder to the callback f.

impl<ID, N, E> Default for LinkedListGraph<ID, N, E>where ID: PrimInt + Unsigned,

fn default() -> Self

Returns the “default value” for a type.

impl<'de, ID, N, E> Deserialize<'de> for LinkedListGraph<ID, N, E>where ID: Deserialize<'de>, N: Deserialize<'de>, E: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<ID, N, E> Directed for LinkedListGraph<ID, N, E>where ID: PrimInt + Unsigned + 'static,

type OutIt<'a> = OutIt<ID> where N: 'a, E: 'a

Type of a graph iterator over edges leaving a node.

type InIt<'a> = NeighIt<ID> where N: 'a, E: 'a

Type of a graph iterator over edges entering a node.

type IncidentIt<'a> = NeighIt<ID> where N: 'a, E: 'a

Type of an iterator over all incident edges.

type DirectedEdge<'a> = <LinkedListGraph<ID, N, E> as GraphType>::Edge<'a> where N: 'a, E: 'a

Type of a directed edge.

fn out_iter(&self, u: Self::Node<'_>) -> Self::OutIt<'_>

Return a graph iterator over the edges leaving a node.

fn in_iter(&self, u: Self::Node<'_>) -> Self::InIt<'_>

Return a graph iterator over the edges leaving a node.

fn incident_iter(&self, u: Self::Node<'_>) -> Self::IncidentIt<'_>

Return an iterator over all directed edges incident with a node.

fn outedges( &self, u: Self::Node<'_> ) -> GraphIter<'_, Self, <Self as Directed>::OutIt<'_>> where Self: Sized,

Return an iterator over the edges leaving a node.

fn outgoing(&self) -> OutEdges<'_, Self>where Self: Sized,

Return access to the outgoing arcs via an Adjacencies trait.

fn inedges( &self, u: Self::Node<'_> ) -> GraphIter<'_, Self, <Self as Directed>::InIt<'_>> where Self: Sized,

Return an iterator over the edges leaving a node.

fn incoming(&self) -> InEdges<'_, Self>where Self: Sized,

Return access to the incoming arcs via an Adjacencies trait.

fn incident_edges( &self, u: Self::Node<'_> ) -> GraphIter<'_, Self, <Self as Directed>::IncidentIt<'_>> where Self: Sized,

Return an iterator over all directed edges incident with a node.

impl<ID, N, E> EdgeAttributes<LinkedListGraph<ID, N, E>, E> for LinkedListGraph<ID, N, E>where ID: PrimInt + Unsigned + 'static,

fn edge(&self, e: <Self as GraphType>::Edge<'_>) -> &E

fn edge_mut(&mut self, e: <Self as GraphType>::Edge<'_>) -> &mut E

impl<ID, N, E> FiniteDigraph for LinkedListGraph<ID, N, E>where ID: PrimInt + Unsigned + 'static,

fn src(&self, e: Self::Edge<'_>) -> Self::Node<'_>

Return the source node of an edge.

fn snk(&self, e: Self::Edge<'_>) -> Self::Node<'_>

Return the sink node of an edge.

impl<ID, N, E> FiniteGraph for LinkedListGraph<ID, N, E>where ID: PrimInt + Unsigned + 'static,

type NodeIt<'a> = NodeIt<ID> where N: 'a, E: 'a

Type of an iterator over all nodes.

type EdgeIt<'a> = EdgeIt<ID> where N: 'a, E: 'a

Type of an iterator over all edges.

fn num_nodes(&self) -> usize

Return the number of nodes in the graph.

fn num_edges(&self) -> usize

Return the number of edges in the graph.

fn nodes_iter(&self) -> Self::NodeIt<'_>

Return a graph iterator over all nodes.

fn edges_iter(&self) -> Self::EdgeIt<'_>

Return a graph iterator over all edges.

fn enodes(&self, e: Self::Edge<'_>) -> (Self::Node<'_>, Self::Node<'_>)

Return the nodes connected by an edge.

fn nodes(&self) -> NodeIterator<'_, Self>where Self: Sized,

Return an iterator over all nodes.

fn edges(&self) -> EdgeIterator<'_, Self>where Self: Sized,

Return an iterator over all edges.

impl<ID, N, E> GraphIterator<LinkedListGraph<ID, N, E>> for EdgeIt<ID>where ID: PrimInt + Unsigned,

type Item = Edge<ID>

fn next(&mut self, _g: &LinkedListGraph<ID, N, E>) -> Option<Self::Item>

fn size_hint(&self, _g: &LinkedListGraph<ID, N, E>) -> (usize, Option<usize>)

fn count(self, _g: &LinkedListGraph<ID, N, E>) -> usize

fn iter(self, g: &G) -> GraphIter<'_, G, Self> where G: Sized,

impl<ID, N, E> GraphIterator<LinkedListGraph<ID, N, E>> for NeighIt<ID>where ID: PrimInt + Unsigned,

type Item = (Edge<ID>, Node<ID>)

fn next(&mut self, g: &LinkedListGraph<ID, N, E>) -> Option<Self::Item>

fn size_hint(&self, _g: &G) -> (usize, Option<usize>)

fn count(self, g: &G) -> usize

fn iter(self, g: &G) -> GraphIter<'_, G, Self> where G: Sized,

impl<ID, N, E> GraphIterator<LinkedListGraph<ID, N, E>> for NodeIt<ID>where ID: PrimInt + Unsigned,

type Item = Node<ID>

fn next(&mut self, _g: &LinkedListGraph<ID, N, E>) -> Option<Self::Item>

fn size_hint(&self, _g: &LinkedListGraph<ID, N, E>) -> (usize, Option<usize>)

fn count(self, _g: &LinkedListGraph<ID, N, E>) -> usize

fn iter(self, g: &G) -> GraphIter<'_, G, Self> where G: Sized,

impl<ID, N, E> GraphIterator<LinkedListGraph<ID, N, E>> for OutIt<ID>where ID: PrimInt + Unsigned,

type Item = (Edge<ID>, Node<ID>)

fn next(&mut self, g: &LinkedListGraph<ID, N, E>) -> Option<Self::Item>

fn size_hint(&self, _g: &G) -> (usize, Option<usize>)

fn count(self, g: &G) -> usize

fn iter(self, g: &G) -> GraphIter<'_, G, Self> where G: Sized,

impl<ID, N, E> GraphType for LinkedListGraph<ID, N, E>where ID: PrimInt + Unsigned,

type Node<'a> = Node<ID>

Type of a node.

type Edge<'a> = Edge<ID>

Type of an edge.

impl<ID, N, E> IndexGraph for LinkedListGraph<ID, N, E>where ID: PrimInt + Unsigned + 'static,

fn node_id(&self, u: Self::Node<'_>) -> usize

Return a unique id associated with a node.

fn id2node(&self, id: usize) -> Self::Node<'_>

Return the node associated with the given id.

fn edge_id(&self, e: Self::Edge<'_>) -> usize

Return a unique id associated with an edge.

fn id2edge(&self, id: usize) -> Self::Edge<'_>

Return the edge associated with the given id.

impl<ID, N, E> NodeAttributes<LinkedListGraph<ID, N, E>, N> for LinkedListGraph<ID, N, E>where ID: PrimInt + Unsigned + 'static,

fn node(&self, u: <Self as GraphType>::Node<'_>) -> &N

fn node_mut(&mut self, u: <Self as GraphType>::Node<'_>) -> &mut N

impl<ID, N, E> Serialize for LinkedListGraph<ID, N, E>where ID: Serialize, N: Serialize, E: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<ID, N, E> Undirected for LinkedListGraph<ID, N, E>where ID: PrimInt + Unsigned + 'static,

type NeighIt<'a> = NeighIt<ID> where N: 'a, E: 'a

Type of a graph iterator over all incident edges.

fn neigh_iter(&self, u: Self::Node<'_>) -> Self::NeighIt<'_>

Return a graph iterator over the edges adjacent to some node.

fn neighs( &self, u: Self::Node<'_> ) -> GraphIter<'_, Self, <Self as Undirected>::NeighIt<'_>> where Self: Sized,

Return an iterator over the edges adjacent to some node.

fn neighbors(&self) -> Neighbors<'_, Self>where Self: Sized,

Return access to the neighbors via an Adjacencies trait.