@@ -0,0 +1,1283 @@
+%22%22%22 Tests the graph implementation %22%22%22%0A%0Afrom exhaustive_search.graph import Graph%0Afrom exhaustive_search.point import Point%0A%0Adef test_empty_list():%0A    %22%22%22 Instantiating a Graph with an empty list should return an empty Graph %22%22%22%0A    assert Graph(%5B%5D).num_edges() == 0, __doc__%0A%0Adef test_list_of_one():%0A    %22%22%22 Instantiating a Graph with a list of 1 should return a Graph with%0A    0 edges %22%22%22%0A    assert Graph(%5BPoint(0, 1)%5D).num_edges() == 0, __doc__%0A%0Adef test_list_of_two():%0A    %22%22%22 Instantiating a Graph with a list of 2 should return a Graph with%0A    1 edge %22%22%22%0A    assert Graph(%5BPoint(0, 1), Point(1, 0)%5D).num_edges() == 1, __doc__%0A%0Adef test_list_of_duplicate_points():%0A    %22%22%22 Instantiating a Graph with duplicate points should ignore the dupes %22%22%22%0A%0A    assert Graph(%5BPoint(0, 1), Point(0, 1), Point(0, 1), Point(1, 0)%5D).num_edges() == 1, __doc__%0A%0Adef test_list_of_three_points():%0A    %22%22%22 Instantiating a Graph with 3 different points should create 3 unique%0A    edges %22%22%22%0A%0A    assert Graph(%5BPoint(0, 0), Point(1, 1), Point(2, 0)%5D).num_edges() == 3, __doc__%0A%0Adef test_list_of_four_points():%0A    %22%22%22 Instantiating a Graph with 4 different points should create 6 unique%0A    edges %22%22%22%0A%0A    assert Graph(%5BPoint(0, 0), Point(1, 1), Point(1, 0), Point(0, 1)%5D).num_edges() == 6, __doc__%0A

Add tests for Graph.num_edges()