master > master: code-rust - unit tests für gph + tarjan

code/rust/tests/test_graphs/test_graph.rs

@@ -0,0 +1,73 @@
+// ----------------------------------------------------------------
+// IMPORTS
+// ----------------------------------------------------------------
+
+use rstest::fixture;
+use rstest::rstest;
+
+use ads2::core::utils;
+use ads2::graphs::graph;
+
+// ----------------------------------------------------------------
+// Fixtures
+// ----------------------------------------------------------------
+
+#[fixture]
+fn fixture_graph() -> graph::Graph<i32> {
+    return graph::Graph::new(
+        vec![1,2,3,4,5,6,7,8],
+        vec![(1,2), (1, 3), (2,3), (3,4), (4, 5), (5, 6), (6, 2), (6, 7), (6, 8)]
+    );
+}
+
+// ----------------------------------------------------------------
+// Test Graph
+// ----------------------------------------------------------------
+
+#[test]
+fn test_graph_create_noerror() {
+    let result = std::panic::catch_unwind(|| {
+        let gph = graph::Graph::new(
+            vec![5, 7, 8],
+            vec![(5,7), (7, 8)]
+        );
+        assert_eq!(gph.len(), 3);
+    });
+    assert!(result.is_ok());
+    let result = std::panic::catch_unwind(|| {
+        let gph = graph::Graph::new(
+            vec!["5", "7", "8", "10"],
+            vec![("5", "7"), ("7", "8")]
+        );
+        assert_eq!(gph.len(), 4);
+    });
+    assert!(result.is_ok());
+    let result = std::panic::catch_unwind(|| {
+        let gph = graph::Graph::<f64>::new(Vec::new(), Vec::new());
+        assert_eq!(gph.len(), 0);
+    });
+    assert!(result.is_ok());
+}
+
+#[rstest]
+fn test_graph_subgraph(fixture_graph: graph::Graph<i32>) {
+    let sub_gph = fixture_graph.subgraph(vec![2,4,5,6,8]);
+    assert_eq!(utils::vec_to_set(&sub_gph.edges), utils::vec_to_set(&vec![(6,2), (4,5), (5,6), (6,8)]));
+}
+
+#[rstest]
+fn test_graph_successors_and_predecessors(fixture_graph: graph::Graph<i32>) {
+    let u = 1;
+    assert_eq!(utils::vec_to_set(&fixture_graph.successors(&u)), utils::vec_to_set(&vec![2, 3]));
+    let u = 8;
+    assert_eq!(utils::vec_to_set(&fixture_graph.successors(&u)).len(), 0);
+    let u = 6;
+    assert_eq!(utils::vec_to_set(&fixture_graph.successors(&u)), utils::vec_to_set(&vec![2, 7, 8]));
+
+    let u = 1;
+    assert_eq!(utils::vec_to_set(&fixture_graph.predecessors(&u)).len(), 0);
+    let u = 8;
+    assert_eq!(utils::vec_to_set(&fixture_graph.predecessors(&u)), utils::vec_to_set(&vec![6]));
+    let u = 6;
+    assert_eq!(utils::vec_to_set(&fixture_graph.predecessors(&u)), utils::vec_to_set(&vec![5]));
+}

code/rust/tests/test_graphs/test_tarjan.rs

@@ -0,0 +1,80 @@
+// ----------------------------------------------------------------
+// IMPORTS
+// ----------------------------------------------------------------
+
+use rstest::fixture;
+use rstest::rstest;
+use std::fmt::Display;
+use std::hash::Hash;
+
+use ads2::core::utils;
+use ads2::graphs::graph;
+use ads2::graphs::tarjan;
+
+// ----------------------------------------------------------------
+// Fixtures
+// ----------------------------------------------------------------
+
+#[fixture]
+fn fixture_graph1() -> graph::Graph<i32> {
+    return graph::Graph::<i32>::new(
+        vec![1,2,3,4],
+        vec![(1,2), (2,4), (4,2)]
+    );
+}
+
+#[fixture]
+fn fixture_graph2() -> graph::Graph<i32> {
+    return graph::Graph::<i32>::new(
+        vec![1,2,3,4,5,6,7],
+        vec![(1,2), (1,3), (2,3), (3,4), (4,5), (5,2), (5,6), (5,7), (6,7)]
+    );
+}
+
+// ----------------------------------------------------------------
+// Test Graph
+// ----------------------------------------------------------------
+
+#[rstest]
+#[case(fixture_graph1(), vec![vec![1], vec![3], vec![2,4]])]
+#[case(fixture_graph2(), vec![vec![1], vec![6], vec![7], vec![2,3,4,5]])]
+fn test_tarjan<T>(#[case] gph: graph::Graph<T>, #[case] expected: Vec<Vec<T>>)
+    where T: Eq + Hash + Clone + Display
+{
+    assert_components_eq(
+        &tarjan::tarjan_algorithm(&gph),
+        &expected
+    )
+}
+
+// ----------------------------------------------------------------
+// AUXILIARY METHODS
+// ----------------------------------------------------------------
+
+fn check_components_eq<T>(components1: &Vec<Vec<T>>, components2: &Vec<Vec<T>>) -> bool
+    where T: Eq + Hash + Clone
+{
+    if components1.len() != components2.len() {
+        return false
+    }
+
+    for component1 in components1 {
+        let mut found = false;
+        for component2 in components2 {
+            if utils::vec_to_set(component1) == utils::vec_to_set(component2) {
+                found = true;
+                break;
+            }
+        }
+        if !found {
+            return false;
+        }
+    }
+    return true;
+}
+
+fn assert_components_eq<T>(components1: &Vec<Vec<T>>, components2: &Vec<Vec<T>>)
+    where T: Eq + Hash + Clone
+{
+    assert!(check_components_eq(components1, components2));
+}