OpenAnalysis::Iterator
The Iterator abstract base class defines the basic properties of an iterator.
Synopsis
Declared in <src/midend/programAnalysis/OpenAnalysis/Utils/Iterator.h>
class Iterator;
Member Functions
Name |
Description |
|
Default constructor |
|
Destructor |
|
Increment operators |
|
Conversion to |
Derived Classes
Name |
Description |
The BFSiterator calls the virtual function create_BFS_links the first time it is called, or if the graph has been changed since the last call. |
|
The bi‐directional node iterator iterates over all the nodes in the graph in no particular order ‐‐ except that the Forward direction is guaranteed to be opposite of the Reverse direction. |
|
The DFSiterator calls the virtual function create_DFS_links the first time it is called, or if the graph has been changed since the last call. |
|
The edge iterator iterates over all the edges in the graph in no particular order. |
|
Iterator to enumerate all the incoming edges into a node. |
|
The node iterator iterates over all the nodes in the graph in no particular order. |
|
Iterator to enumerate all the outgoing edges from a node. |
|
Iterator to enumerate all the sink nodes. |
|
Iterator to enumerate all the source nodes. |
Created with MrDocs