Struct graphic::DirectedGraph

pub struct DirectedGraph<A> { /* fields omitted */ }

A directed graph

Methods

impl<A> DirectedGraph<A>

fn new() -> DirectedGraph<A>

Constructs a new empty directed graph

fn vertex(&self, id: VertexId) -> Option<&Vertex<A>>

Retrieves the vertex at the given id

fn vertex_mut(&mut self, id: VertexId) -> Option<&mut Vertex<A>>

Retrieves the vertex at the given id

fn vertex_value(&self, id: VertexId) -> Option<&A>

Retrieves a vertex value

fn vertex_value_mut(&mut self, id: VertexId) -> Option<&mut A>

Retrieves a vertex value

fn add_vertex(&mut self, value: A) -> VertexId

Retrieves the vertex value from the graph

fn connect(&mut self, from: VertexId, to: VertexId, weight: i64) -> Result

Connects two vertices

fn breadth_first_iter(&self, from: VertexId) -> BFDirectedGraphIter<A>

Iterate over vertices in breadth-first order

fn depth_first_iter(&self, from: VertexId) -> DFDirectedGraphIter<A>

fn is_empty(&self) -> bool

fn is_cyclic(&self) -> bool

Checks if the graph is cyclic

fn out_degree(&self, vertex_id: VertexId) -> Option<usize>

The out-degree of a vertex

fn in_degree(&self, vertex_id: VertexId) -> Option<usize>

The in-degree of a vertex

fn topologically_ordered_iter(&self) -> Option<TopologicalIter<A>>

Returns an iterator over topologically-ordered vertices if the graph is acyclic

fn longest_distance_from(&self, source: VertexId) -> Option<(VertexId, i64)>

Returns a vertex with the weight of the path to it

Trait Implementations

impl<A: Display> Display for DirectedGraph<A>

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.