Struct BasicDirectedGraph

pub struct BasicDirectedGraph<K, V>
where
    K: Key,
    V: Value,
{ /* private fields */ }

A basic implementation of a directed graph. It doesn’t allow multiple edges but allow loops.

Implementations

impl<K, V> BasicDirectedGraph<K, V>

where K: Key, V: Value,

pub fn new() -> Self

Create a new directed graph. Complexity: O(1)

Trait Implementations

impl<K, V> Algorithms<K, V> for BasicDirectedGraph<K, V>

where K: Key, V: Value,

fn bfs(&self) -> Option<Self>

Execute a Broad Search First the return the discovered graph. There is no order in which the edges are treated.

fn bfs_with_starting_vertex( &self, starting_vertex: &Vertex<K, V>, ) -> Option<Self>

Execute a Broad Search First with a starting vertex the return the discovered graph. There is no order in which the edges are treated.

fn dfs(&self) -> Option<Self>

Execute a Deep Search First the return the discovered graph. There is no order in which the edges are treated.

fn dfs_with_starting_vertex( &self, starting_vertex: &Vertex<K, V>, ) -> Option<Self>

Execute a Deep Search First with a starting vertex the return the discovered graph. There is no order in which the edges are treated.

impl<K, V> AnyGraph<K, V> for BasicDirectedGraph<K, V>

where K: Key, V: Value,

fn vertices(&self) -> Vec<Vertex<K, V>>

Get the vertices of the graph. Complexity: O(1*).

fn edges(&self) -> Vec<Edge<K>>

Get the edges of the graph. Complexity: O(1*).

fn add_vertex(&self, vertex: Vertex<K, V>) -> Option<Self>

Add a new vertex then return the graph. Complexity: O(1*).

fn remove_vertex( &self, vertex: &Vertex<K, V>, ) -> Option<(Self, Vertex<K, V>, Vec<Edge<K>>)>

Remove a vertex then return the new graph, the deleted vertex and its edges. Complexity: O(E).

fn remove_all_vertices(&self) -> Option<(Self, Vec<Vertex<K, V>>, Vec<Edge<K>>)>

Remove all vertices then return the new graph, the deleted vertices and all the edges. Complexity: O(1*).

fn remove_vertex_where_key( &self, key: K, ) -> Option<(Self, Vertex<K, V>, Vec<Edge<K>>)>

Remove a vertex by its key then return the new graph, the deleted vertex and its edges. Complexity: O(E).

fn add_edge(&self, edge: Edge<K>) -> Option<Self>

Add a new edge then return the new graph. Complexity: O(1*).

fn add_edge_between_keys(&self, key_from: K, key_to: K) -> Option<Self>

Add a new edge between 2 keys then return the new graph. Complexity: O(1*).

fn remove_edge(&self, edge: &Edge<K>) -> Option<(Self, Edge<K>)>

Remove an existing edge then return the new graph and the deleted edge. Complexity: O(1*).

fn remove_edge_where_keys( &self, key_from: K, key_to: K, ) -> Option<(Self, Edge<K>)>

Remove an existing edge by their keys, then return the new graph and the deleted edge. Complexity: O(1*).

fn remove_all_edges(&self) -> Option<(Self, Vec<Edge<K>>)>

Remove all the edges then return the new graph and all the deleted edges. Complexity: O(1*).

fn remove_all_edges_where_vertex( &self, vertex: &Vertex<K, V>, ) -> Option<(Self, Vec<Edge<K>>)>

Remove all existing edges from or to a given vertex, then return the new graph and the deleted edges. Complexity: O(E).

fn remove_all_edges_where_key( &self, key_from: K, ) -> Option<(Self, Vec<Edge<K>>)>

Remove all existing edges from or to a given key, then return the new graph and the deleted edges. Complexity: O(E).

fn remove_all_edges_from_vertex( &self, vertex: &Vertex<K, V>, ) -> Option<(Self, Vec<Edge<K>>)>

Remove all existing edges from a given vertex, then return the new graph and the deleted edges. Complexity: O(E).

fn remove_all_edges_from_key(&self, key_from: K) -> Option<(Self, Vec<Edge<K>>)>

Remove all existing edges from a given key, then return the new graph and the deleted edges. Complexity: O(E).

impl<K, V> Clone for BasicDirectedGraph<K, V>

where K: Key + Clone, V: Value + Clone,

fn clone(&self) -> BasicDirectedGraph<K, V>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<K, V> Kinship<K, V> for BasicDirectedGraph<K, V>

where K: Key, V: Value,

fn successors(&self) -> HashMap<Vertex<K, V>, Vec<Edge<K>>, RandomState>

Get the successors of each vertex. Complexity: O(V + E).

fn predecessors(&self) -> HashMap<Vertex<K, V>, Vec<Edge<K>>, RandomState>

Get the predecessors of each vertex. Complexity: O(V + E).

fn successors_as_key_and_edges(&self) -> HashMap<K, Vec<Edge<K>>>

Get the successors of each vertex where the key is a Key.

fn predecessors_as_key_and_edges(&self) -> HashMap<K, Vec<Edge<K>>>

Get the predecessors of each vertex where the key is a Key.

fn key_vertex_map(&self) -> HashMap<K, Vertex<K, V>>

Get the map of key and vertex.

impl<K, V> PartialEq for BasicDirectedGraph<K, V>

where K: Key + PartialEq, V: Value + PartialEq,

fn eq(&self, other: &BasicDirectedGraph<K, V>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K, V> StructuralPartialEq for BasicDirectedGraph<K, V>

where K: Key, V: Value,