Start to implement assignment 4

src/main.rs

@@ -2,6 +2,7 @@ mod merge_sort;
 mod quick_sort;
 mod util;
 
+use crate::util::read_to_graph;
 use crate::util::read_to_vector;
 use crate::quick_sort::quick_sort;
 use crate::merge_sort::merge_sort_inversions;
@@ -27,7 +28,8 @@ fn c1a3() {
 }
 
 fn c1a4() {
-	println!("Here we go again!");
+	let g = read_to_graph("data/course_1_assignment_4.txt").unwrap();
+	println!("{:?}", g);
 }
 
 fn main() {

src/min_cut.rs

@@ -0,0 +1,4 @@
+
+
+
+

src/util.rs

@@ -3,6 +3,14 @@ use std::io;
 use std::io::{BufRead, BufReader, Error, ErrorKind};
 use std::vec::Vec;
 
+
+#[derive(Debug)]
+pub struct Graph {
+    nodes: Vec<u32>,
+    edges: Vec<(u32, u32)>,
+}
+
+
 pub fn read_to_vector(path: &str) -> Result<Vec<i64>, io::Error> {
     let file = File::open(path)?;
     let br = BufReader::new(file);
@@ -19,3 +27,15 @@ pub fn read_to_vector(path: &str) -> Result<Vec<i64>, io::Error> {
 }
 
 
+pub fn read_to_graph(path: &str) -> Result<Graph, io::Error> {
+    let mut g = Graph { nodes: vec![], edges: vec![] };
+    let file = File::open(path)?;
+    let br = BufReader::new(file);
+
+    for line in br.lines() {
+        let line = line?;
+        println!("{:?}", line);
+    }
+
+    Ok(g)
+}