commit 75af24ced5713d74494d3abd06540eb1a233854a
author Mathieu Besançon <mathieu.besancon@gmail.com> Sun Jan 19 17:27:57 2020 +0100
committer Anton Kochkov <xvilka@gmail.com> Mon Mar 02 13:30:44 2020 +0800
tree 5c76689f93ff16f7ef71c1d1d2723d65c278a1ba
parent c4e2bdec948cc3ba62d9a1834a4160c859116e29

run cargo fmt

src/algo/mod.rs

diff --git a/src/algo/mod.rs b/src/algo/mod.rs
index e072d79..c9c5a46 100644
--- a/src/algo/mod.rs
+++ b/src/algo/mod.rs
@@ -797,9 +797,10 @@
 ///
 /// Always treats the input graph as if undirected.
 pub fn is_bipartite_undirected<G, N, VM>(g: G, start: N) -> bool
-    where G: GraphRef + Visitable<NodeId=N, Map=VM> + IntoNeighbors<NodeId=N>,
-          N: Copy + PartialEq + std::fmt::Debug,
-          VM: VisitMap<N>
+where
+    G: GraphRef + Visitable<NodeId = N, Map = VM> + IntoNeighbors<NodeId = N>,
+    N: Copy + PartialEq + std::fmt::Debug,
+    VM: VisitMap<N>,
 {
     let mut red = g.visit_map();
     red.visit(start);
@@ -826,9 +827,15 @@
                 //hasn't been visited yet
 
                 match (is_red, is_blue) {
-                    (true, false) => { blue.visit(neighbour); },
-                    (false, true) => { red.visit(neighbour); },
-                    (_, _) => { panic!("Invariant doesn't hold"); }
+                    (true, false) => {
+                        blue.visit(neighbour);
+                    }
+                    (false, true) => {
+                        red.visit(neighbour);
+                    }
+                    (_, _) => {
+                        panic!("Invariant doesn't hold");
+                    }
                 }
 
                 stack.push_back(neighbour);

tests/graph.rs

diff --git a/tests/graph.rs b/tests/graph.rs
index a33977a..6a1522a 100644
--- a/tests/graph.rs
+++ b/tests/graph.rs
@@ -9,8 +9,8 @@
 use petgraph as pg;
 
 use petgraph::algo::{
-    dominators, has_path_connecting, is_cyclic_undirected, is_isomorphic_matching, is_bipartite_undirected,
-    min_spanning_tree,
+    dominators, has_path_connecting, is_bipartite_undirected, is_cyclic_undirected,
+    is_isomorphic_matching, min_spanning_tree,
 };
 
 use petgraph::graph::node_index as n;