dfs2(+Nodes:list, +Tested:list, +OlonIn:list, -OlonOut:list, +OrdIn:list, -OrdOut:list, +PosIn:list, -PosOut:list) is det[private]
Test each node in case the graph isn't connected. For a visited node, dfs3/11 will return quickly as no paths will be expanded.
Arguments:
Nodes- Nodes in the call graph.
Tested- List of visited nodes with negation, so that we only visit each node at most once for each negation option: no negation, odd negation and even negation. Elements are of the form v(X, N), where X is the node and N is 0 = no negations, 1 = odd negs or 2 = even > 0 negs.
OlonIn- Input list of paths containing OLONs.
OlonOut- Output list of paths containing OLONs.
OrdIn- Input list of ordinary paths.
OrdOut- Output list of ordinary paths.
PosIn- Input list of paths with cycles and no negations.
PosOut- Output list of paths with cycles and no negations.