Time-Respecting Walks¶
Summary¶
Build a time-respecting DAG over [start, end] for either hyperedges (edge=True) or nodes (edge=False). |
|
Enumerate all time-respecting s-walks between a given source and optionally a target hyperedge. |
|
Compute time-respecting s-walks originating from every hyperedge in the graph. |