passed scc 5 text tests

src/graph/directed_graph.rs

@@ -86,9 +86,9 @@ impl DirectedGraph {
         head_index: VertexIndex,
     ) -> Result<(), GraphError> {
         // Check for self-loop
-        if tail_index == head_index {
-            return Err(GraphError::SelfLoop);
-        }
+        // if tail_index == head_index {
+        //     return Err(GraphError::SelfLoop);
+        // }
 
         // Ensure tail and head are valid indices in the graph
         if tail_index >= self.vertices.len() || head_index >= self.vertices.len() {

src/graph/txt/scc_test1.txt

@@ -8,4 +8,4 @@
 8 5
 8 6
 9 7
-9 3
+9 3

src/graph/txt/scc_test2.txt

@@ -11,4 +11,4 @@
 7 6
 7 8
 8 5
-8 7
+8 7

src/graph/txt/scc_test3.txt

@@ -7,4 +7,3 @@
 8 6
 6 7
 7 8
-

src/graph/txt/scc_test4.txt

@@ -0,0 +1,11 @@
+1 2
+2 3
+3 1
+3 4
+5 4
+6 4
+8 6
+6 7
+7 8
+4 3
+4 6

src/graph/txt/scc_test5.txt

@@ -17,4 +17,4 @@
 10 9
 10 11
 11 12
-12 10
+12 10

src/main.rs

@@ -2,15 +2,15 @@ use std::collections::HashMap;
 
 use algorithms_illuminated::graph::DirectedGraph;
 fn main() {
-    let graph = DirectedGraph::build_from_file("src/graph/txt/scc_example_8_16.txt", true).unwrap();
+    let graph = DirectedGraph::build_from_file("src/graph/txt/scc_test5.txt", true).unwrap();
     graph.print_graph();
     let scc = graph.kosaraju();
-    // let counts = count_and_sort_top_five(scc);
+    let counts = count_and_sort_top_five(scc);
 
-    println!("{:?}", scc);
+    println!("{:?}", counts);
 }
 
-fn _count_and_sort_top_five(vec: Vec<usize>) -> Vec<(usize, usize)> {
+fn count_and_sort_top_five(vec: Vec<usize>) -> Vec<(usize, usize)> {
     let mut counts = HashMap::new();
 
     // Count occurrences