def test_wheel_true(self):
v = 10
G = Graph(v, False)
for node in range(v):
G.add_node(node)
hub = 0
for node in range(1, v):
G.add_edge(Edge(hub, node))
G.add_edge(Edge(node, node+1 if node < v-1 else 1))
self.assertTrue(is_wheel(G))
algorithm = WheelGraph(G)
algorithm.run()
self.assertEqual(algorithm.hub, hub)
def test_k4(self): # complete graph K4 = W4
G = self.graph_factory.make_complete(n=4, directed=False)
self.assertTrue(is_wheel(G))
algorithm = WheelGraph(G)
algorithm.run()
self.assertEqual(algorithm.hub, 0)
