commit 1102680bb563643e63afae66aef8de22434d97e7
author Marcel Hellwig <git@cookiesoft.de> Wed Nov 20 09:49:58 2019 +0100
committer Anton Kochkov <anton.kochkov@gmail.com> Sun Dec 22 21:40:16 2019 +0800
tree 55a530368bf02841220f787a51685c3cb00d5fcc
parent f25eee571ff4320d96300fd4fa698cfee2f2f9b0

refactored tests

`GraphMap::add_node` returns `N` which is in the case of the tests `()`,
so replacing `node` with `()` is perfectly fine

tests/graphmap.rs

diff --git a/tests/graphmap.rs b/tests/graphmap.rs
index 02362ef..c8fbeed 100644
--- a/tests/graphmap.rs
+++ b/tests/graphmap.rs
@@ -304,11 +304,11 @@
 fn neighbors_incoming_includes_self_loops() {
     let mut graph = DiGraphMap::new();
 
-    let node = graph.add_node(());
-    graph.add_edge(node, node, ());
+    graph.add_node(());
+    graph.add_edge((), (), ());
 
-    let mut neighbors = graph.neighbors_directed(node, Incoming);
-    assert_eq!(neighbors.next(), Some(node));
+    let mut neighbors = graph.neighbors_directed((), Incoming);
+    assert_eq!(neighbors.next(), Some(()));
     assert_eq!(neighbors.next(), None);
 }
 
@@ -316,11 +316,11 @@
 fn undirected_neighbors_includes_self_loops() {
     let mut graph = UnGraphMap::new();
 
-    let node = graph.add_node(());
-    graph.add_edge(node, node, ());
+    graph.add_node(());
+    graph.add_edge((), (), ());
 
-    let mut neighbors = graph.neighbors(node);
-    assert_eq!(neighbors.next(), Some(node));
+    let mut neighbors = graph.neighbors(());
+    assert_eq!(neighbors.next(), Some(()));
     assert_eq!(neighbors.next(), None);
 }
 
@@ -328,11 +328,11 @@
 fn self_loops_can_be_removed() {
     let mut graph = DiGraphMap::new();
 
-    let node = graph.add_node(());
-    graph.add_edge(node, node, ());
+    graph.add_node(());
+    graph.add_edge((), (), ());
 
-    graph.remove_edge(node, node);
+    graph.remove_edge((), ());
 
-    assert_eq!(graph.neighbors_directed(node, Outgoing).next(), None);
-    assert_eq!(graph.neighbors_directed(node, Incoming).next(), None);
+    assert_eq!(graph.neighbors_directed((), Outgoing).next(), None);
+    assert_eq!(graph.neighbors_directed((), Incoming).next(), None);
 }

tests/stable_graph.rs

diff --git a/tests/stable_graph.rs b/tests/stable_graph.rs
index 7d05669..8645865 100644
--- a/tests/stable_graph.rs
+++ b/tests/stable_graph.rs
@@ -331,14 +331,14 @@
     gr1.add_edge(a, c, 40);
 
     let gr2 = Graph::from(gr1.clone());
-    let gr3 = StableGraph::from(gr2.clone());
+    let gr3 = StableGraph::from(gr2);
     assert!(nodes_eq!(gr1, gr3));
     assert!(edgew_eq!(gr1, gr3));
     assert!(edges_eq!(gr1, gr3));
 
     gr1.remove_node(b);
 
-    let gr4 = Graph::from(gr1.clone());
+    let gr4 = Graph::from(gr1);
     let gr5 = StableGraph::from(gr4.clone());
 
     let mut ans = StableGraph::new();