use adjacency dictionary for graph equality

Author: SteadBytes

test/test_regionTrimmer.py

@@ -6,7 +6,6 @@
 
 import contrib.regionTrimmer as region_trimmer
 
-
 class TestRegionTrimmer(unittest.TestCase):
     def test_get_nodes(self):
         coords = [(0, 0), (0, -1), (-1, 0), (-1, -1)]
@@ -46,13 +45,24 @@ def test_get_graph_center_by_bounds(self):
 
     def test_generate_edges(self):
         graph = networkx.Graph()
-        graph.add_nodes_from([(0, 0), (0, -1), (-1, 0), (-1, -1)])
-
+        graph.add_nodes_from(
+            [(0, 0), (0, -1), (-1, 0), (-1, -1)]
+        )
         graph = region_trimmer.generate_edges(graph)
-        expected = [((-1, 0), (-1, -1)),
-                    ((0, -1), (-1, -1)),
-                    ((0, 0), (-1, -1)),
-                    ((0, 0), (-1, 0)),
-                    ((0, 0), (0, -1))]
-
-        self.assertListEqual(sorted(list(graph.edges)), expected)
+        self.assertEqual(
+            graph.adj,
+            {
+                (0, -1): {(0, 0): {}, (-1, -1): {}},
+                (0, 0): {
+                    (0, -1): {},
+                    (-1, 0): {},
+                    (-1, -1): {},
+                },
+                (-1, 0): {(0, 0): {}, (-1, -1): {}},
+                (-1, -1): {
+                    (0, -1): {},
+                    (0, 0): {},
+                    (-1, 0): {},
+                },
+            },
+        )