|
Directories |
| directory | DGraph |
Files |
| file | DomTree.cpp [code] |
| | Declaration for standard CFGStandard.
|
| file | DomTree.hpp [code] |
| | Declaration for DomTree.
|
| file | Exception.hpp [code] |
| file | GenOutputTool.hpp [code] |
| | Includes macros that analysis classes use to communicate with genOutputTool.
|
| file | Graph.cpp [code] |
| | Definition for Graph class.
|
| file | Graph.hpp [code] |
| | Declarations for Graph class.
|
| file | grtest.cpp [code] |
| | Test driver for directed graph class.
|
| file | Iterator.hpp [code] |
| | Declaration for Iterator class.
|
| file | ListIterator.hpp [code] |
| | Templated implementation of an OpenAnalysis iterator interface for a list of objects.
|
| file | NestedSCR.cpp [code] |
| | This file contains code to determine the Tarjan intervals (nested strongly connected regions) of a flow graph. Tarjan's original algorithm is described in the following article: Tarjan, R.E. "Testing flow graph reducibility" J. of Computer & System Sciences 9, 355-365, 1974.
|
| file | NestedSCR.hpp [code] |
| | This file contains code to determine the Tarjan intervals (nested strongly connected regions) of a flow graph. Tarjan's original algorithm is described in the following article: Tarjan, R.E. "Testing flow graph reducibility" J. of Computer & System Sciences 9, 355-365, 1974.
|
| file | OA_ptr.hpp [code] |
| file | OutputBuilder.cpp [code] |
| | The OutputBuilder utility functions.
|
| file | OutputBuilder.hpp [code] |
| | The OutputBuilder abstract interface.
|
| file | OutputBuilderDOT.cpp [code] |
| | Definitions for OutputBuilder for DOT output.
|
| file | OutputBuilderDOT.hpp [code] |
| | An OutputBuilder for DOT output.
|
| file | OutputBuilderText.cpp [code] |
| | Definitions for OutputBuilder for text output.
|
| file | OutputBuilderText.hpp [code] |
| | An OutputBuilder for text output.
|
| file | RIFG.cpp [code] |
| | Representation Independent Flowgraph Interface. This is a wrapper that allows access to an OA DGraph through dense id numbers ranging from 0 to n. It is useful to interface with algorithms that worked by creating a work or result array of size n. It might more appropriately be a mixin to an OA DGraph.
|
| file | RIFG.hpp [code] |
| | Representation Independent Flowgraph Interface. This is a wrapper that allows access to an OA DGraph through dense id numbers ranging from 1 to n. It is useful to interface with algorithms that worked by creating a work or result array of size n. It might more appropriately be a mixin to an OA DGraph.
|
| file | SCC.cpp [code] |
| | Tarjan's algorithm to determine strongly connected components of a directed graph. This was the first algorithm that solved the problem in linear time.
|
| file | SCC.hpp [code] |
| | Tarjan's algorithm to determine strongly connected components of a directed graph. This was the first algorithm that solved the problem in linear time.
|
| file | SetIterator.hpp [code] |
| | Templated implementation of an OpenAnalysis iterator interface for a set of objects.
|
| file | Test_Iterators.cpp [code] |
| file | Tree.cpp [code] |
| | Declaration of Tree class.
|
| file | Tree.hpp [code] |
| | Declaration for Tree class.
|
| file | trtest.cpp [code] |
| file | UnionFindUniverse.cpp [code] |
| | Definition for UnionFind.
|
| file | UnionFindUniverse.hpp [code] |
| | Declarations for UnionFind.
|
| file | Util.hpp [code] |
| | OA utilities.
|
