Struct rs_graph::vecgraph::VecGraph

pub struct VecGraph<ID = u32> { /* fields omitted */ }

A vector based graph data structure.

Implementations

impl<ID> VecGraph<ID> where
    ID: PrimInt + Unsigned, 

pub fn new() -> VecGraph<ID>

Trait Implementations

impl<ID> Buildable for VecGraph<ID> where
    ID: PrimInt + Unsigned, 

type Builder = VecGraphBuilder<ID>

fn new_builder() -> Self::Builder

Create a new builder for this graph type.

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

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

impl<ID> Default for VecGraph<ID> where
    ID: PrimInt + Unsigned, 

fn default() -> Self

Returns the “default value” for a type.

impl<'de, ID> Deserialize<'de> for VecGraph<ID> where
    ID: Deserialize<'de>, 

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

Deserialize this value from the given Serde deserializer.

impl<'a, ID> Directed<'a> for VecGraph<ID> where
    ID: 'a + PrimInt + Unsigned, 

type OutIt = NeighIt<'a, ID>

Type of a graph iterator over edges leaving a node.

type InIt = NeighIt<'a, ID>

Type of a graph iterator over edges entering a node.

type IncidentIt = NeighIt<'a, 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

Return the source node of an edge.

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

Return the sink node of an edge.

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

Return a graph iterator over the edges leaving a node.

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

Return a graph iterator over the edges leaving a node.

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

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

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

Return an iterator over the edges leaving a node.

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

Return access to the outgoing arcs via an Adjacencies trait.

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

Return an iterator over the edges leaving a node.

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

Return access to the incoming arcs via an Adjacencies trait.

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

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

impl<'a, ID> GraphIterator<VecGraph<ID>> for NodeIt<ID> where
    ID: 'a + PrimInt + Unsigned, 

type Item = Node<ID>

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

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

fn count(self, _g: &VecGraph<ID>) -> usize

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

impl<'a, ID> GraphIterator<VecGraph<ID>> for EdgeIt<ID> where
    ID: 'a + PrimInt + Unsigned, 

type Item = Edge<ID>

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

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

fn count(self, _g: &VecGraph<ID>) -> usize

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

impl<'a, ID> GraphIterator<VecGraph<ID>> for NeighIt<'a, ID> where
    ID: 'a + PrimInt + Unsigned, 

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

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

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

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

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

impl<'a, ID> GraphSize<'a> for VecGraph<ID> where
    ID: 'a + PrimInt + Unsigned, 

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

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 nodes(&'a self) -> NodeIterator<'a, Self> where
    Self: Sized, 

Return an iterator over all nodes.

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

Return an iterator over all edges.

impl<'a, ID> GraphType<'a> for VecGraph<ID> where
    ID: 'a + PrimInt + Unsigned, 

type Node = Node<ID>

Type of a node.

type Edge = Edge<ID>

Type of an edge.

impl<'a, ID> IndexGraph<'a> for VecGraph<ID> where
    ID: 'a + PrimInt + Unsigned, 

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> Serialize for VecGraph<ID> where
    ID: Serialize, 

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

Serialize this value into the given Serde serializer.

impl<'a, ID> Undirected<'a> for VecGraph<ID> where
    ID: 'a + PrimInt + Unsigned, 

type NeighIt = NeighIt<'a, ID>

Type of a graph iterator over all incident edges.

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

Return the nodes connected by an edge.

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

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

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

Return an iterator over the edges adjacent to some node.

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

Return access to the neighbors via an Adjacencies trait.