GitHub

API reference for Walker.

class Walker[T, N]

What dfs, bfs, topo, nodes, edges and the other traversals return. Every iter(...) starts over: a graph walker looks at the graph as it is then (and checks its start nodes), and an iterator already running keeps the graph it started on.

Functions

__init__

__init__(visit) -> None
ParameterTypeDescription
visitVisit[T, N]
def __init__(self, visit: Visit[T, N]) -> None:
    self._visit = visit

visit

visit[U](f) -> Iterable[U]
ParameterTypeDescription
fCallable[[T, N], U]

Returns Iterable[U]

def visit[U](self, f: Callable[[T, N], U]) -> Iterable[U]:
    return self._visit(f)

indices

indices() -> Iterable[T]

Returns Iterable[T]

def indices(self) -> Iterable[T]:
    return self._visit(_index)

values

values() -> Iterable[N]

Returns Iterable[N]

def values(self) -> Iterable[N]:
    return self._visit(_data)

entries

entries() -> Iterable[tuple[T, N]]

Returns Iterable[tuple[T, N]]

def entries(self) -> Iterable[tuple[T, N]]:
    return self._visit(_pair)