|
@@ -153,10 +153,8 @@ class graph:
|
|
|
unvisited = [1] * 5
|
|
|
|
|
|
while(sum(unvisited)):
|
|
|
- print("Big iteration")
|
|
|
# iterate on routers adjacent to curnode
|
|
|
for i in range(0, 5):
|
|
|
- print("little iteration")
|
|
|
# don't check curnode
|
|
|
if (i == curnode):
|
|
|
continue
|
|
@@ -190,6 +188,8 @@ class graph:
|
|
|
# no change, we are disconnected. breka
|
|
|
if (mindexsofar == curnode):
|
|
|
break
|
|
|
+
|
|
|
+ curnode = mindexsofar
|
|
|
|
|
|
|
|
|
|