SimpleDirectedGraphNode

This is a node in the directed graph. All the connectivity information for the graph is captured in this (by way of the successor and predecessor sets).

Synopsis

Declared in <src/midend/programAnalysis/staticInterproceduralSlicing/SimpleDirectedGraph.h>

class SimpleDirectedGraphNode;

Member Functions

Name	Description
~SimpleDirectedGraphNode [destructor] [virtual]	Destructor
addPredecessor	add an edge from n to the current node
addSuccessor	add an edge from the current node to n
getPredecessors	get the nodes which point to the current node
getSuccessors	get the nodes which are pointed to by the current node
hasPredecessor	test whether n is a predecessor of the current node
hasSuccessor	test whether n is a successor of the current node
numPredecessors	return the number of incoming edges
numSuccessors	return the number of outgoing edges
removePredecessor
removeSuccessor
writeOut [virtual]	virtual function to support displaying node information

Private Data Members

Name	Description
_preds	the set of neighbors connected by incoming edges
_succs	the set of neighbors connected by outgoing edges

Derived Classes

Name	Description
ControlNode	This class is a node in the CFG. It can either be an SgNode or it can be a special entry or exit node (since there are some empty blocks in the CFG).
DependenceNode

Description

This is a much simpler graph mechanism than that provided by util/graphs. It places most of the onus of edge bookkeeping on the nodes themselves.

Created with MrDocs