Function edges

pattern/graph/__init__.py:743–749

Returns an iterator of Edge objects for the given list of nodes. It yields None where two successive nodes are not connected.

(path)

    return _root and sorted(p, key=len) or p

def edges(path):
    """ Returns an iterator of Edge objects for the given list of nodes.
        It yields None where two successive nodes are not connected.
    """
    # For example, the distance (i.e., edge weight sum) of a path:
    # sum(e.weight for e in edges(path))
    return len(path) > 1 and (n.links.edge(path[i+1]) for i,n in enumerate(path[:-1])) or iter(())
    
#--- GRAPH THEORY ----------------------------------------------------------------------------------