mapgraph 0.12.0

A directed graph that can also be used as an arbitrary map.
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

use crate::{aliases::SlotMapGraph, graph::iter::EdgesWalker};
use alloc::{vec, vec::Vec};
#[cfg(feature = "rayon")]
use {crate::aliases::BTreeSlotMapGraph, rayon::iter::ParallelIterator};

#[test]
fn test_insert_refs() {
    let v = vec![1, 2, 3];
    let mut graph = SlotMapGraph::<&i32, ()>::default();

    let refs: Vec<_> = v.iter().map(|r| graph.add_node(r)).collect();
    graph.clear();
    drop(graph);
    drop(refs);
}

#[test]
fn test_remove_edge_complex_cyclic() {
    let mut graph = SlotMapGraph::<i32, ()>::default();

    let root = graph.add_node(1);
    let left = graph.add_node(2);
    let right = graph.add_node(3);

    let first_edge = graph.add_edge((), root, left).unwrap();
    let second_edge = graph.add_edge((), root, root).unwrap();
    let third_edge = graph.add_edge((), root, right).unwrap();

    graph.remove_edge(second_edge);

    graph.validate();
    assert_eq!(graph.find_edge(root, left).unwrap(), Some(first_edge));
    assert_eq!(graph.find_edge(root, right).unwrap(), Some(third_edge));
    assert_eq!(graph.edges_count(), 2);

    assert_eq!(graph.unlink_and_remove_node(root), Some(1));
    assert_eq!(graph.edges_count(), 0);
}

#[test]
fn test_drain_edges() {
    let mut graph = SlotMapGraph::<i32, ()>::default();

    let root = graph.add_node(1);
    let left = graph.add_node(2);
    let right = graph.add_node(3);

    let _first_edge = graph.add_edge((), root, left).unwrap();
    let _second_edge = graph.add_edge((), root, root).unwrap();
    let _third_edge = graph.add_edge((), root, right).unwrap();
    let _fourth_edge = graph.add_edge((), right, left).unwrap();
    let _fifth_edge = graph.add_edge((), left, root).unwrap();

    assert_eq!(graph.drain_outgoing_edges(root).count(), 3);
    assert_eq!(graph.drain_outgoing_edges(left).count(), 1);
    assert_eq!(graph.drain_outgoing_edges(right).count(), 1);
    assert!(graph.node(root).unwrap().next_outgoing_edge.is_none());
    assert!(graph.node(left).unwrap().next_outgoing_edge.is_none());
    assert!(graph.node(right).unwrap().next_outgoing_edge.is_none());

    graph.validate();
}

#[test]
fn test_drain_edges_incomplete() {
    let mut graph = SlotMapGraph::<i32, ()>::default();

    let root = graph.add_node(1);
    let left = graph.add_node(2);
    let right = graph.add_node(3);

    let first_edge = graph.add_edge((), root, left).unwrap();
    let second_edge = graph.add_edge((), root, root).unwrap();
    let third_edge = graph.add_edge((), root, right).unwrap();
    let fourth_edge = graph.add_edge((), right, left).unwrap();
    let fifth_edge = graph.add_edge((), left, root).unwrap();

    let mut iter = graph.drain_outgoing_edges(root);
    let _ = iter.next();
    drop(iter);
    graph.validate();
    assert!(graph.is_valid_edge_index(first_edge));
    assert!(graph.is_valid_edge_index(second_edge));
    assert!(!graph.is_valid_edge_index(third_edge));
    assert!(graph.is_valid_edge_index(fourth_edge));
    assert!(graph.is_valid_edge_index(fifth_edge));
    assert_eq!(
        graph.node(root).unwrap().next_outgoing_edge,
        Some(second_edge)
    );

    let mut iter = graph.drain_outgoing_edges(left);
    let _ = iter.next();
    drop(iter);
    graph.validate();
    assert!(graph.is_valid_edge_index(first_edge));
    assert!(graph.is_valid_edge_index(second_edge));
    assert!(!graph.is_valid_edge_index(third_edge));
    assert!(graph.is_valid_edge_index(fourth_edge));
    assert!(!graph.is_valid_edge_index(fifth_edge));
    assert!(graph.node(left).unwrap().next_outgoing_edge.is_none());

    let mut iter = graph.drain_outgoing_edges(right);
    let _ = iter.next();
    drop(iter);
    graph.validate();
    assert!(graph.is_valid_edge_index(first_edge));
    assert!(graph.is_valid_edge_index(second_edge));
    assert!(!graph.is_valid_edge_index(third_edge));
    assert!(!graph.is_valid_edge_index(fourth_edge));
    assert!(!graph.is_valid_edge_index(fifth_edge));
    assert!(graph.node(right).unwrap().next_outgoing_edge.is_none());
}

#[test]
fn test_split_iter() {
    let mut graph = SlotMapGraph::<i32, ()>::default();

    let (nodes, edges) = graph.as_nodes_mut_and_edges();

    for (_, node) in nodes {
        let mut walker = node.walk_outputs();
        while let Some((_index, _edge)) = walker.walk_edges_next(edges) {}
    }
}

#[test]
#[cfg(feature = "rayon")]
fn test_par_split_iter() {
    let mut graph = BTreeSlotMapGraph::<i32, (), i32>::default();

    let (nodes, edges) = graph.as_nodes_mut_and_edges();

    nodes.par_iter_mut().for_each(|(_index, node)| {
        let mut walker = node.walk_outputs();
        while let Some((_index, _edge)) = walker.walk_edges_next(edges) {}
    });
}