Minor: ran cargo fmt.

petgraph · Apr 11, 2024 · 3738b8b · 3738b8b
1 parent c14f7e0
commit 3738b8b
Show file tree

Hide file tree

Showing 3 changed files with 9 additions and 5 deletions.
diff --git a/src/algo/isomorphism.rs b/src/algo/isomorphism.rs
@@ -766,7 +766,8 @@ mod matching {
 
             // We hardcode n! values into an array that accounts for architectures
             // with smaller usizes to get our upper bound.
-            let upper_bounds: Vec<Option<usize>> = [1u64,
+            let upper_bounds: Vec<Option<usize>> = [
+                1u64,
                 1,
                 2,
                 6,
@@ -786,7 +787,8 @@ mod matching {
                 355687428096000,
                 6402373705728000,
                 121645100408832000,
-                2432902008176640000]
+                2432902008176640000,
+            ]
             .iter()
             .map(|n| usize::try_from(*n).ok())
             .collect();

diff --git a/src/graph_impl/mod.rs b/src/graph_impl/mod.rs
@@ -1733,8 +1733,10 @@ where
     type Item = EdgeReference<'a, E, Ix>;
 
     fn next(&mut self) -> Option<EdgeReference<'a, E, Ix>> {
-      let target_node = self.target_node;
-      self.edges.by_ref().find(|&edge| edge.node[1] == target_node)
+        let target_node = self.target_node;
+        self.edges
+            .by_ref()
+            .find(|&edge| edge.node[1] == target_node)
     }
     fn size_hint(&self) -> (usize, Option<usize>) {
         let (_, upper) = self.edges.size_hint();

diff --git a/src/iter_format.rs b/src/iter_format.rs
@@ -6,7 +6,7 @@ use std::fmt;
 /// Format the iterator like a map
 pub struct DebugMap<F>(pub F);
 
-impl< F, I, K, V> fmt::Debug for DebugMap<F>
+impl<F, I, K, V> fmt::Debug for DebugMap<F>
 where
     F: Fn() -> I,
     I: IntoIterator<Item = (K, V)>,