def test_addCheapestCycle(self):
n = 10
graph = WeightedGraph()
for i in range(n):
graph.addVertex(i)
addCheapestCycle(graph, 1)
self.assertTrue(all(e[2] == 1 for e in graph))
self.dist = dist
def display(self):
print "Shortest Distance :", self.dist[self.dest]
print "Shortest Path:"
print self.src,
for i in self.path:
if i != -1:
print "-->",
print i,
if __name__ == '__main__':
V = 6
wg = WeightedGraph(V)
node = Node(0, 1, 2)
wg.addEdge(node)
node = Node(0, 2, 4)
wg.addEdge(node)
node = Node(1, 2, 1)
wg.addEdge(node)
node = Node(1, 3, 4)
wg.addEdge(node)
node = Node(1, 4, 2)
wg.addEdge(node)
node = Node(2, 4, 3)
wg.addEdge(node)
node = Node(3, 5, 2)
wg.addEdge(node)
node = Node(4, 3, 3)
def setUp(self):
self.g = WeightedGraph()
