Rename data and prepare for course 2 assignment 2

src/main.rs

@@ -16,48 +16,54 @@ use crate::util::read_to_vector;
 
 #[allow(dead_code)]
 fn c1a2() {
-    let vec = read_to_vector("data/course_1_assignment_2.txt").unwrap();
+    let vec = read_to_vector("data/c1a2.txt").unwrap();
     let (_sorted, inversions) = merge_sort_inversions(vec);
-    println!("course 1 assignment 2: {:?}", inversions);
+    println!("c1a2={:?}", inversions);
 }
 
 #[allow(dead_code)]
 fn c1a3() {
-    let mut vec = read_to_vector("data/course_1_assignment_3.txt").unwrap();
+    let mut vec = read_to_vector("data/c1a3.txt").unwrap();
     let mut comp_acc: usize = 0;
     quick_sort(&mut vec, &mut comp_acc);
-    println!("course 1 assignment 3: {:?}", comp_acc);
+    println!("c1a3={:?}", comp_acc);
     // 1: 162085, 2: 164123, 3: 138382
 }
 
 #[allow(dead_code)]
 fn c1a4() {
-    let g = read_to_graph("data/course_1_assignment_4.txt").unwrap();
-    let mut smalles_min_cut = u32::MAX;
+    let g = read_to_graph("data/c1a4.txt").unwrap();
+    let mut smallest_min_cut = u32::MAX;
     let iterations = g.nodes.len().pow(1);
     for _ in 0..iterations {
         let new_min_cut = min_cut(g.clone());
-        if new_min_cut < smalles_min_cut {
-            smalles_min_cut = new_min_cut;
+        if new_min_cut < smallest_min_cut {
+            smallest_min_cut = new_min_cut;
         }
     }
     // 17
-    println!("course 1 assignment 4: {:?}", smalles_min_cut);
+    println!("c1a4={:?}", smallest_min_cut);
 }
 
 #[allow(dead_code)]
 fn c2a1() {
     // I have not checked in the graph file, because it has 70MB. This is a tiny test example.
-    let g = read_to_directed_graph("data/course_2_assignment_1_test.txt").unwrap();
+    let g = read_to_directed_graph("data/c2a1_test.txt").unwrap();
     let sizes = ssc(g.0, g.1);
     let max_size = min(sizes.len(), 5);
     println!("{:?}", &sizes[0..max_size]);
     // [434821, 968, 459, 313, 211]
 }
 
+#[allow(dead_code)]
+fn c2a2() {
+	println!("here we go again!");
+}
+
 fn main() {
     // c1a2();
     // c1a3();
     // c1a4();
-    c2a1();
+    // c2a1();
+    c2a2();
 }