Python has_edge Examples

Example #1

File: buildSubMap.py Project: paul356/shanghai_metro

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

Example #2

File: unittests-cycles.py Project: svn2github/python-graph2

def verify_cycle(graph, cycle):
    for i in range(len(cycle)):
        assert graph.has_edge((cycle[i],cycle[(i+1)%len(cycle)]))

Example #3

File: unittests-cycles.py Project: zhengli8341/python-graph

def verify_cycle(graph, cycle):
    for i in range(len(cycle)):
        assert graph.has_edge((cycle[i], cycle[(i + 1) % len(cycle)]))