Class GraphPathSearch::ReverseNode

The set of all forward nodes that reach end nodes (inclusive).

These nodes are the nodes that exist along the path from start nodes to end nodes.

Note: this is fast to compute because it is essentially a unary predicate.