Class GraphPathSearch::ForwardNode

The set of all nodes reachable from the start nodes (inclusive).

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