Run callback for each unique maximal path through the graph.
A maximal path is a list of vertices with the following properties:
- The first vertex has no sources
- The last vertex has no targets
- There is an arc between each consecutive pair of vertices
For each unique maximal path the callback is called exactly once.
Run
callbackfor each unique maximal path through the graph.A maximal path is a list of vertices with the following properties: - The first vertex has no sources - The last vertex has no targets - There is an arc between each consecutive pair of vertices
For each unique maximal path the callback is called exactly once.
Example: 0 ---> 1 ---> 2 ---> 3 \ / `-> 4 ---> 5 ---> 6
7 ---> 8
Maximal paths: [ 0, 1, 2, 3 ] [ 0, 4, 5, 6 ] [ 0, 4, 5, 3 ] [ 7, 8 ]