Trait FinGraph

pub trait FinGraph: Graph {
    // Required methods
    fn vertices(&self) -> impl Iterator<Item = Self::V>;
    fn edges(&self) -> impl Iterator<Item = Self::E>;

    // Provided methods
    fn in_edges(&self, v: &Self::V) -> impl Iterator<Item = Self::E> { ... }
    fn out_edges(&self, v: &Self::V) -> impl Iterator<Item = Self::E> { ... }
    fn vertex_count(&self) -> usize { ... }
    fn edge_count(&self) -> usize { ... }
    fn in_degree(&self, v: &Self::V) -> usize { ... }
    fn out_degree(&self, v: &Self::V) -> usize { ... }
    fn degree(&self, v: &Self::V) -> usize { ... }
}

A graph with finitely many vertices and edges.

Required Methods

fn vertices(&self) -> impl Iterator<Item = Self::V>

Iterates over the vertices in the graph.

fn edges(&self) -> impl Iterator<Item = Self::E>

Iterates over the edges in the graph.

Provided Methods

fn in_edges(&self, v: &Self::V) -> impl Iterator<Item = Self::E>

Iterates over the edges incoming to a vertex.

Depending on whether the target map is indexed, this method can be cheap or expensive.

fn out_edges(&self, v: &Self::V) -> impl Iterator<Item = Self::E>

Iterates over the edges outgoing from a vertex.

Depending on whether the source map is indexed, this method can be cheap or expensive.

fn vertex_count(&self) -> usize

Number of vertices in the graph.

fn edge_count(&self) -> usize

Number of edges in the graph.

fn in_degree(&self, v: &Self::V) -> usize

Number of edges incoming to a vertex.

fn out_degree(&self, v: &Self::V) -> usize

Number of edges outgoing from a vertex.

fn degree(&self, v: &Self::V) -> usize

Number of edges incoming to or outgoing from a vertex.

Self-loops are counted twice.

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementors

impl<G: FiniteColumnarGraph> FinGraph for G