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
|
use std::cmp::max;
use super::*;
use crate::fx::FxHashMap;
pub struct TestGraph {
num_nodes: usize,
start_node: usize,
successors: FxHashMap<usize, Vec<usize>>,
predecessors: FxHashMap<usize, Vec<usize>>,
}
impl TestGraph {
pub fn new(start_node: usize, edges: &[(usize, usize)]) -> Self {
let mut graph = TestGraph {
num_nodes: start_node + 1,
start_node,
successors: FxHashMap::default(),
predecessors: FxHashMap::default(),
};
for &(source, target) in edges {
graph.num_nodes = max(graph.num_nodes, source + 1);
graph.num_nodes = max(graph.num_nodes, target + 1);
graph.successors.entry(source).or_default().push(target);
graph.predecessors.entry(target).or_default().push(source);
}
for node in 0..graph.num_nodes {
graph.successors.entry(node).or_default();
graph.predecessors.entry(node).or_default();
}
graph
}
}
impl DirectedGraph for TestGraph {
type Node = usize;
fn num_nodes(&self) -> usize {
self.num_nodes
}
}
impl StartNode for TestGraph {
fn start_node(&self) -> usize {
self.start_node
}
}
impl Predecessors for TestGraph {
fn predecessors(&self, node: usize) -> impl Iterator<Item = Self::Node> {
self.predecessors[&node].iter().cloned()
}
}
impl Successors for TestGraph {
fn successors(&self, node: usize) -> impl Iterator<Item = Self::Node> {
self.successors[&node].iter().cloned()
}
}
|
