Computes a program dice: only those nodes reachable forward from startIds that are also in the backward slice of endIds.
This effectively selects all paths from the given start nodes that lead to the given end nodes.
For performance, the backward slice is computed first (typically the smaller set), then the graph is
reduced to that set and its edges are inverted in a single pass via Dataflow.reduceAndInvertGraph.
The forward traversal then runs only within that subgraph, avoiding nodes that cannot contribute to the dice.
Computes a program dice: only those nodes reachable forward from
startIdsthat are also in the backward slice ofendIds. This effectively selects all paths from the given start nodes that lead to the given end nodes.For performance, the backward slice is computed first (typically the smaller set), then the graph is reduced to that set and its edges are inverted in a single pass via Dataflow.reduceAndInvertGraph. The forward traversal then runs only within that subgraph, avoiding nodes that cannot contribute to the dice.