Method __init__

pattern/graph/__init__.py:870–872

(self, predecessors, *args, **kwargs)

                    p[u][v] = p[w][v]
    class pdict(dict):
        def __init__(self, predecessors, *args, **kwargs):
            dict.__init__(self, *args, **kwargs)
            self.predecessors = predecessors
    return pdict(p, ((u, dict((v, w) for v,w in d[u].iteritems() if w < 1e30)) for u in d))

def predecessor_path(tree, u, v):