digraph-rs 0.1.0

a handful of algorithms for digraphs
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51

use crate::analyzer::dijkstra::DijkstraPath;
use crate::DiGraph;
use graphviz_rust::dot_structures::Node;
use std::hash::Hash;

pub mod astar;
pub mod dijkstra;
pub mod dom;
pub mod fs;
pub mod min_weight;
pub mod visit;

enum SearchRes {
    Next,
    Find,
    Stop,
    Skip,
}

#[derive(Debug)]
pub struct GraphAnalyzer<'a, NodeId, NL, EL>
where
    NodeId: Eq + Hash,
{
    pub(crate) graph: &'a DiGraph<NodeId, NL, EL>,
}

impl<'a, NodeId, NL, EL> GraphAnalyzer<'a, NodeId, NL, EL>
where
    NodeId: Eq + Hash,
    NL: PartialEq,
{
    pub fn node_by_id(&self, id: &NodeId) -> Option<&NL> {
        self.graph.nodes.get(id)
    }
    pub fn first_node_by_payload(&self, payload: &NL) -> Option<&NL> {
        self.graph.nodes.values().find(|v| *v == payload)
    }
    pub fn node(&self, id: &NodeId, payload: &NL) -> Option<&NL> {
        self.graph.nodes.get(id).filter(|v| *v == payload)
    }
}

impl<'a, NodeId, NL, EL> GraphAnalyzer<'a, NodeId, NL, EL>
where
    NodeId: Eq + Hash,
{
    pub fn edge(&self, from: &NodeId, to: &NodeId) -> Option<&EL> {
        self.graph.edges.get(from).and_then(|tos| tos.get(to))
    }
}