Steins algo

src/graph/connectivity.rs

@@ -195,7 +195,7 @@ impl<'a> ConnectivityUndirectedGraph<'a> {
                     }
                     self.is_articulation_point[u] = true;
                 }
-            } else if data.visited[v] < data.visited[u] &&  e != parent{
+            } else if data.visited[v] < data.visited[u] && e != parent {
                 data.lower(u, data.visited[v]);
                 data.e_stack.push(e);
             } else if v == u {
@@ -297,13 +297,11 @@ mod test {
             .filter(|&u| cg.is_cut_vertex(u))
             .collect::<Vec<_>>();
 
-        for idx in 0..graph.num_e(){
-
-            if cg.is_cut_edge(idx){
-                println!(" edge {} is a cut edge",idx)
-            }
-            else{
-                println!(" edge {} is not a cut edge",idx)
+        for idx in 0..graph.num_e() {
+            if cg.is_cut_edge(idx) {
+                println!(" edge {} is a cut edge", idx)
+            } else {
+                println!(" edge {} is not a cut edge", idx)
             }
         }
         assert_eq!(bridges, vec![0]);
@@ -323,7 +321,7 @@ mod test {
         graph.add_edge(1, 6);
 
         let cg = ConnectivityUndirectedGraph::new(&graph);
-       
+
         let articulation_points = (0..graph.num_v())
             .filter(|&u| cg.is_cut_vertex(u))
             .collect::<Vec<_>>();

src/graph/flow.rs

@@ -177,7 +177,12 @@ impl FlowGraph {
     }
 
     // Pushes flow along an augmenting path of minimum cost.
-    fn min_cost_flow_augment(&self, t: usize, par: &[Option<usize>], flow: &mut [i64]) -> (i64, i64) {
+    fn min_cost_flow_augment(
+        &self,
+        t: usize,
+        par: &[Option<usize>],
+        flow: &mut [i64],
+    ) -> (i64, i64) {
         let (mut dc, mut df) = (0, Self::INF);
         let mut u = t;
         while let Some(e) = par[u] {

src/graph/graph.rs

@@ -107,7 +107,7 @@ impl UndirectedGraph {
 
     /// Adds a weighted edge from u to v.
     pub fn add_weighted_edge(&mut self, u: usize, v: usize, w: i64) {
-        let undirected_edge = HashSet::from([u,v]);
+        let undirected_edge = HashSet::from([u, v]);
         self.edges.push(undirected_edge);
         self.edge_weights.push(w);
         self.adj_lists[u].push((self.edges.len() - 1, v));

src/graph/util.rs

@@ -27,7 +27,6 @@ impl DirectedGraph {
 
     // Single-source shortest paths on a directed graph with non-negative weights
     pub fn dijkstra(&self, u: usize) -> Vec<u64> {
-
         let mut dist = vec![u64::max_value(); self.edge_weights.len()];
         let mut heap = std::collections::BinaryHeap::new();
 
@@ -73,7 +72,7 @@ impl UndirectedGraph {
             .into_iter()
             .filter(|&e| {
                 let edge_vec = Vec::from_iter(&self.edges[e]);
-                components.merge(*edge_vec[0],*edge_vec[1])
+                components.merge(*edge_vec[0], *edge_vec[1])
             })
             .collect()
     }