graph-base 0.1.14

A Rust library for graph data structures and algorithms
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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202

use std::{collections::HashMap, fmt::Display};
use crate::interfaces::graph::SingleId;
use crate::interfaces::edge::Hyperedge;

use super::{edge::DirectedHyperedge, vertex::Vertex};

pub trait IdVector {
    fn id(&self) -> Vec<usize>;
}

pub trait Hypergraph<'a> {
    type Node: Vertex;
    type Edge: Hyperedge;
    fn new() -> Self;
    fn nodes(&'a self) -> impl Iterator<Item = &'a Self::Node>;
    fn hyperedges(&'a self) -> impl Iterator<Item = &'a Self::Edge>;
    fn get_hyperedges_vector(&'a self) -> impl Iterator<Item = Vec<&'a Self::Node>> {
        let id_map: HashMap<_, _> = HashMap::from_iter(self.nodes().map(|node| (node.id(), node)));
        self.hyperedges().map(move |edge| edge.id().iter().map(|id| id_map.get(id).unwrap()).cloned().collect::<Vec<_>>()).collect::<Vec<_>>().into_iter()
    }
    fn get_hyperedges_vector_with_edge(&'a self) -> impl Iterator<Item = (&'a Self::Edge, Vec<&'a Self::Node>)> {
        let id_map: HashMap<_, _> = HashMap::from_iter(self.nodes().map(|node| (node.id(), node)));
        self.hyperedges().map(move |edge| (edge, edge.id().iter().map(|id| id_map.get(id).unwrap()).cloned().collect::<Vec<_>>())).collect::<Vec<_>>().into_iter()
    }

    fn get_node_by_id(&'a self, id: usize) -> Option<&'a Self::Node>;

    fn add_node(&mut self, node: Self::Node);
    fn add_hyperedge(&mut self, edge: Self::Edge);
}


pub struct AdjacencyList<'a, T: Hypergraph<'a>>(HashMap<&'a T::Node, Vec<&'a T::Node>>);

impl<'a, T> Display for AdjacencyList<'a, T> 
where 
    T: Hypergraph<'a> {    
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        let mut s = String::new();
        for (node, adj) in self.0.iter() {
            
            let s1 = format!("{}", node);
            let mut s2 = String::new();
            for node in adj {
                s2.push_str(format!("{}, ", node).as_str());
            }

            s.push_str(format!("Node {} -> {{{}}}\n", s1, s2).as_str());
        }
        write!(f, "{}", s)
    }
}

pub trait DirectedHypergraph<'a>: Hypergraph<'a> + Sized 
where 
    Self::Edge: DirectedHyperedge {}

pub trait Neighbor<'a>: Hypergraph<'a> + Sized {
    fn get_neighbors(&'a self) -> AdjacencyList<'a, Self> {
        let mut adj = HashMap::new();
        for node in self.nodes() {
            adj.insert(node, Vec::new());
        }
        for edge in self.hyperedges() {
            let nodes = edge.id();
            for i in 0..nodes.len() {
                for j in (i + 1)..nodes.len() {
                    let node1 = self.nodes().find(|node| node.id() == nodes[i]).unwrap();
                    let node2 = self.nodes().find(|node| node.id() == nodes[j]).unwrap();
                    adj.get_mut(node1).unwrap().push(node2);
                    adj.get_mut(node2).unwrap().push(node1);
                }
            }
        }
        AdjacencyList(adj)
    }

    fn neighbors(&'a self, adj: &AdjacencyList<'a, Self>, node: &Self::Node) -> impl Iterator<Item = &'a Self::Node> {
        adj.0.get(node).unwrap().iter().cloned()
    }
}

pub trait Precursor<'a>: DirectedHypergraph<'a>
where
    Self::Edge: DirectedHyperedge, {
    fn get_precursor(&'a self) -> AdjacencyList<'a, Self> {
        let mut adj = HashMap::new();
        for node in self.nodes() {
            adj.insert(node, Vec::new());
        }
        for edge in self.hyperedges() {
            let nodes = edge.id();
            for i in 0..nodes.len() {
                for j in (i + 1)..nodes.len() {
                    let node1 = self.nodes().find(|node| node.id() == nodes[i]).unwrap();
                    let node2 = self.nodes().find(|node| node.id() == nodes[j]).unwrap();
                    adj.get_mut(node2).unwrap().push(node1);
                }
            }
        }
        AdjacencyList(adj)
    }
}

pub trait Successor<'a>: DirectedHypergraph<'a>
where
    Self::Edge: DirectedHyperedge, {
    fn get_postcursor(&'a self) -> AdjacencyList<'a, Self> {
        let mut adj = HashMap::new();
        for node in self.nodes() {
            adj.insert(node, Vec::new());
        }
        for edge in self.hyperedges() {
            let nodes = edge.id();
            for i in 0..nodes.len() {
                for j in (i + 1)..nodes.len() {
                    let node1 = self.nodes().find(|node| node.id() == nodes[i]).unwrap();
                    let node2 = self.nodes().find(|node| node.id() == nodes[j]).unwrap();
                    adj.get_mut(node1).unwrap().push(node2);
                }
            }
        }
        AdjacencyList(adj)
    }
}

pub struct HyperedgeList<'a, T: Hypergraph<'a>>(HashMap<&'a T::Node, Vec<&'a T::Edge>>);

impl<'a, T> Display for HyperedgeList<'a, T> 
where 
    T: Hypergraph<'a> {    
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        let mut s = String::new();
        for (node, edges) in self.0.iter() {
            
            let s1 = format!("{}", node);
            let mut s2 = String::new();
            for edge in edges {
                // s2.push_str(format!("{}, ", edge).as_str());
            }

            s.push_str(format!("Node {} -> {{{}}}\n", s1, s2).as_str());
        }
        write!(f, "{}", s)
    }
}

pub trait ContainedHyperedge<'a>: Hypergraph<'a> + Sized {
    fn get_hyperedges_list(&'a self) -> HyperedgeList<'a, Self> {
        let mut adj = HashMap::new();
        for node in self.nodes() {
            adj.insert(node, Vec::new());
        }
        for edge in self.hyperedges() {
            let nodes = edge.id();
            for i in 0..nodes.len() {
                let node = self.nodes().find(|node| node.id() == nodes[i]).unwrap();
                adj.get_mut(node).unwrap().push(edge);
            }
        }
        HyperedgeList(adj)
    }

    fn contained_hyperedges(&'a self, adj: &HyperedgeList<'a, Self>, node: &Self::Node) -> impl Iterator<Item = &'a Self::Edge> {
        adj.0.get(node).unwrap().iter().cloned()
    }
}
pub trait ContainedDirectedHyperedge<'a>: DirectedHypergraph<'a> + Sized
where 
    Self::Edge: DirectedHyperedge {
    fn contained_hyperedges(&'a self, adj: &HyperedgeList<'a, Self>, node: &Self::Node) -> impl Iterator<Item = &'a Self::Edge> {
        adj.0.get(node).unwrap().iter().cloned()
    }

    fn get_hyperedges_src(&'a self) -> HyperedgeList<'a, Self> {
        let mut adj = HashMap::new();
        for node in self.nodes() {
            adj.insert(node, Vec::new());
        }
        for edge in self.hyperedges() {
            for id in edge.src() {
                let node = self.nodes().find(|node| node.id() == id).unwrap();
                adj.get_mut(node).unwrap().push(edge);
            }
        }
        HyperedgeList(adj)
    }
    fn get_hyperedges_dst(&'a self) -> HyperedgeList<'a, Self> {
        let mut adj = HashMap::new();
        for node in self.nodes() {
            adj.insert(node, Vec::new());
        }
        for edge in self.hyperedges() {
            for id in edge.dst() {
                let node = self.nodes().find(|node| node.id() == id).unwrap();
                adj.get_mut(node).unwrap().push(edge);
            }    
        }
        HyperedgeList(adj)
    }
    
}