Start to implement clustering big assignment

src/k_clustering_big.rs

@@ -0,0 +1,19 @@
+pub struct ImpliciteGraph {
+    pub nodes: Vec<Vec<usize>>,
+}
+
+fn distance(a: &Vec<usize>, b: &Vec<usize>) -> u16 {
+    let mut distance = 0;
+
+    for i in 0..a.len() {
+        if a[i] != b[i] {
+            distance += 1;
+        }
+    }
+    distance
+}
+
+pub fn k_clustering_big(g: &ImpliciteGraph) -> usize {
+    println!("distance: {:?}", distance(&g.nodes[0], &g.nodes[1]));
+    g.nodes.len()
+}