gt-graph-path 0.1.7

discribe a path on a graph
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102

use gt_graph::{Graph, Node};
use std::fmt::{Debug, Error, Formatter};
use std::ops::{Deref, DerefMut};

#[derive(Clone)]
pub struct GraphPath<'a> {
    graph: &'a dyn Graph,
    path: Vec<Node>,
}

impl<'a> PartialEq for GraphPath<'a> {
    fn eq(&self, other: &Self) -> bool {
        self.path == other.path
    }
}

impl<'a> GraphPath<'a> {
    #[inline(always)]
    pub fn new(graph: &'a dyn Graph) -> Self {
        Self {
            graph,
            path: Vec::new(),
        }
    }

    #[inline(always)]
    pub fn new_with_initial_size(graph: &'a dyn Graph, size: usize) -> Self {
        Self {
            graph,
            path: Vec::with_capacity(size),
        }
    }

    pub fn from_vec(graph: &'a dyn Graph, src: Vec<Node>) -> Self {
        Self { graph, path: src }
    }

    #[inline(always)]
    pub fn push_validate(&mut self, n: Node) -> Result<(), String> {
        if self.path.last().is_none()
            || (1..=self.graph.dimension())
                .any(|n| self.graph.phi(n, *self.path.last().unwrap()) == n)
        {
            self.path.push(n);
            Ok(())
        } else {
            Err("Invalid Path".into())
        }
    }

    pub fn is_valid(&self) -> bool {
        (0..self.path.len() - 1).all(|i| {
            (1..=self.graph.dimension())
                .any(|n| self.graph.phi(n, self.path[i]) == self.path[i + 1])
        })
    }
}

impl<'a> Deref for GraphPath<'a> {
    type Target = Vec<Node>;

    fn deref(&self) -> &Self::Target {
        &self.path
    }
}

impl<'a> DerefMut for GraphPath<'a> {
    fn deref_mut(&mut self) -> &mut Self::Target {
        &mut self.path
    }
}

impl<'a> Debug for GraphPath<'a> {
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error> {
        let mut s = String::new();
        if !self.path.is_empty() {
            s.push_str(&format!(
                "{:0dim$b}",
                self.path[0],
                dim = self.graph.dimension() as usize
            ));
            for p in self.path.iter().skip(1) {
                s.push_str(&format!(
                    " -> {:0dim$b}",
                    p,
                    dim = self.graph.dimension() as usize
                ));
            }
        }
        write!(f, "NodePath {{ {} }}", s)
    }
}

pub trait PathsExt {
    fn contains_node(&self, n: &Node) -> bool;
}

impl<'a> PathsExt for Vec<GraphPath<'a>> {
    fn contains_node(&self, n: &Node) -> bool {
        self.iter().any(|path| path.contains(n))
    }
}