Struct orzir_core::graph::Graph

pub struct Graph<K, N, E>
where
    K: Copy + Eq + Hash,
    N: GraphNode<K, E>,
    E: GraphEdge<K>,
{ /* private fields */ }

A graph data structure.

Implementations

impl<K, N, E> Graph<K, N, E>

where K: Copy + Eq + Hash, N: GraphNode<K, E>, E: GraphEdge<K>,

pub fn add_node(&mut self, node: N)

Add a node to the graph.

pub fn add_node_by_key(&mut self, key: K)

pub fn node(&self, key: K) -> Option<&N>

Get a node from the graph.

pub fn node_mut(&mut self, key: K) -> Option<&mut N>

Get a mutable node from the graph.

pub fn add_edge(&mut self, edge: E)

Add an edge to the graph.

pub fn dfs<F>(&self, key: K, f: F)

where F: FnMut(&N),

Iterate over the nodes of the graph with DFS.

pub fn bfs<F>(&self, key: K, f: F)

where F: FnMut(&N),

Iterate over the nodes of the graph with BFS.

impl<K, N, E> Graph<K, N, E>

where K: Copy + Eq + Hash, N: GraphNode<K, E>, E: WeightedEdge<K>,

pub fn dijkstra(&self, from: K) -> HashMap<K, (Vec<K>, E::Weight)>

Dijkstra’s algorithm.

This will produce the shortest path from the start node to the end node, with a vector of nodes in between and the total weight of the path.

Trait Implementations

impl<K, N, E> Default for Graph<K, N, E>

where K: Copy + Eq + Hash, N: GraphNode<K, E>, E: GraphEdge<K>,

fn default() -> Self

Returns the “default value” for a type.