ProvableHQ/leo
1
1
Fork 0
mirror of https://github.com/ProvableHQ/leo.git synced 2024-09-17 16:58:21 +03:00
Code Issues Packages Projects Releases Wiki Activity

Add test

Browse Source
This commit is contained in:
d0cd 2022-11-14 22:11:35 -08:00
parent 940d357c5e
commit dd33eb024d
1 changed files with 29 additions and 22 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

51
compiler/passes/src/common/graph/mod.rs
View File

@ -143,6 +143,14 @@ mod test {
impl Node for u32 {}
fn check_post_order<N: Node>(graph: &DiGraph<N>, expected: &[N]) {
let result = graph.post_order();
assert!(result.is_ok());
let order: Vec<N> = result.unwrap().into_iter().collect();
assert_eq!(order, expected);
}
#[test]
fn test_post_order() {
let mut graph = DiGraph::<u32>::new(IndexSet::new());
@ -153,21 +161,29 @@ mod test {
graph.add_edge(3, 4);
graph.add_edge(4, 5);
// At this point, the graph looks like:
// 1
// / \
// 2 3
// \ /
// 4
// |
// 5
check_post_order(&graph, &[5, 4, 2, 3, 1]);
let result = graph.post_order();
assert!(result.is_ok());
let mut graph = DiGraph::<u32>::new(IndexSet::new());
let order: Vec<u32> = result.unwrap().into_iter().collect();
let expected = Vec::from([5u32, 4, 2, 3, 1]);
assert_eq!(order, expected);
// F -> B
graph.add_edge(6, 2);
// B -> A
graph.add_edge(2, 1);
// B -> D
graph.add_edge(2, 4);
// D -> C
graph.add_edge(4, 3);
// D -> E
graph.add_edge(4, 5);
// F -> G
graph.add_edge(6, 7);
// G -> I
graph.add_edge(7, 9);
// I -> H
graph.add_edge(9, 8);
// A, C, E, D, B, H, I, G, F.
check_post_order(&graph, &[1, 3, 5, 4, 2, 8, 9, 7, 6]);
}
#[test]
@ -179,15 +195,6 @@ mod test {
graph.add_edge(2, 4);
graph.add_edge(4, 1);
// At this point, the graph looks like:
// 1
// |
// 2
// / \
// 3 4
// |
// 1
let result = graph.post_order();
assert!(result.is_err());