Module DataFlow2::PathGraph

Provides the query predicates needed to include a graph in a path-problem query.

Import path

import semmle.code.java.dataflow.TaintTracking

edges	Holds if `(a,b)` is an edge in the graph of data flow path explanations.
nodes	Holds if `n` is a node in the graph of data flow path explanations.
subpaths	Holds if `(arg, par, ret, out)` forms a subpath-tuple, that is, flow through a subpath between `par` and `ret` with the connecting edges `arg -> par` and `ret -> out` is summarized as the edge `arg -> out`.