| analyzePath(std::vector< VertexID > &pth) (defined in visitorTraversal2) | visitorTraversal2 | |
| analyzePath(std::vector< Vertex > &pth)=0 (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | pure virtual |
| checkednodes (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| constructPathAnalyzer(newGraph *g, bool unbounded=false, Vertex end=0, Vertex begin=0, bool ns=true) | SgGraphTraversal< newGraph > | |
| defaultSynthesizedAttribute(InheritedAttributeType) (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | protected |
| done (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| downed (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| Edge typedef (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| edgeintmap (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| evaluateInheritedAttribute(SgGraphNode *n, std::vector< InheritedAttributeType > inheritedValues)=0 (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | protectedpure virtual |
| evaluateSynthesizedAttribute(SgGraphNode *n, InheritedAttributeType in, SynthesizedAttributesList l)=0 (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | protectedpure virtual |
| firstPrepGraph(newGraph *&g) | SgGraphTraversal< newGraph > | |
| getInEdges(int &node, newGraph *&g) | SgGraphTraversal< newGraph > | |
| getOutEdges(int &node, newGraph *&g) | SgGraphTraversal< newGraph > | |
| getSource(int &n, newGraph *&g) | SgGraphTraversal< newGraph > | |
| getTarget(int &n, newGraph *&g) | SgGraphTraversal< newGraph > | |
| ifstatements (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| iLoops (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| intedgemap (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| intvertmap (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| loopNum (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| loopNumMap (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| looppaths (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| loopSet (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| lstN (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| lstordmap (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| nullEdgesOrdered (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| nullEdgesPaths (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| nullInherit (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| nullloops (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| nullnode (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| nullNum (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| numnodes (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| operator=(SgGraphTraversal &) (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| operator=(const SgGraphTraversal &) (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| pathAnalyze(std::vector< SgGraphNode * > &pth, bool loop=false, std::set< std::vector< SgGraphNode * > > &incloops=NULL)=0 (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | protectedpure virtual |
| pathnum (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| paths (defined in visitorTraversal2) | visitorTraversal2 | |
| pathValMap (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| primenode (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| SgGraphTraversal() (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| SgGraphTraversal(SgGraphTraversal &) (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| SgGraphTraversal() (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| SgGraphTraversal(const SgGraphTraversal &) (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| solvedLoops (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| subpathmap (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| SynthesizedAttributesList typedef (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| tltnodes (defined in visitorTraversal2) | visitorTraversal2 | |
| traverse(SgGraphNode *basenode, SgIncidenceDirectedGraph *g, InheritedAttributeType inheritedValue, InheritedAttributeType nullInherit, SgGraphNode *endnode, bool insep=false, bool pcHk=false) | SgGraphTraversal< newGraph > | |
| turns (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| Vertex typedef (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| vertintmap (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | |
| ~SgGraphTraversal() (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | virtual |
| ~SgGraphTraversal() (defined in SgGraphTraversal< newGraph >) | SgGraphTraversal< newGraph > | virtual |
