SubgraphWalker

For better readability: result.entries instead of result.get(0) when working with getEOGPathEdges. Can be used for all subgraphs in subgraphs, e.g. AST entries and exits in a EOG subgraph, EOG entries and exits in a CFG subgraph.

Handles declaration scope monitoring for iterative traversals. If this is not required, use IterativeGraphWalker for less overhead.

Flattens the tree, starting at Node n into a list.

Retrieves a list of AST children of the specified node by iterating all fields that are annotated with the SubGraph annotation and its value "AST".

Function returns two lists in a list. The first list contains all eog nodes with no predecesor in the subgraph with root 'n'. The second list contains eog edges that have no successor in the subgraph with root 'n'. The first List marks the entry and the second marks the exit nodes of the cfg in this subgraph.