def AddNodeAndEdge(graph, nodeLst):
for node in nodeLst:
if not graph.has_node(node):
graph.add_node(node)
i = 0
while i < len(nodeLst)-1:
if not graph.has_edge((nodeLst[i],nodeLst[i+1])):
graph.add_edge((nodeLst[i],nodeLst[i+1]))
i += 1
def verify_cycle(graph, cycle):
for i in range(len(cycle)):
assert graph.has_edge((cycle[i],cycle[(i+1)%len(cycle)]))
def verify_cycle(graph, cycle):
for i in range(len(cycle)):
assert graph.has_edge((cycle[i], cycle[(i + 1) % len(cycle)]))
