Member predicate DataFlow2::Configuration::hasPartialFlow

Holds if there is a partial data flow path from source to node. The approximate distance between node and the closest source is dist and is restricted to be less than or equal to explorationLimit(). This predicate completely disregards sink definitions.

This predicate is intended for dataflow exploration and debugging and may perform poorly if the number of sources is too big and/or the exploration limit is set too high without using barriers.

This predicate is disabled (has no results) by default. Override explorationLimit() with a suitable number to enable this predicate.

To use this in a path-problem query, import the module PartialPathGraph.

predicate hasPartialFlow(PartialPathNode source, PartialPathNode node, int dist)