OpenAnalysis::DGraph::Node

An node in an undirected graph has a list of neighboring nodes and a list of incident edges.

Synopsis

Declared in <src/midend/programAnalysis/OpenAnalysis/Utils/DGraph.h>

class Node
    : public BaseGraph::Node

Base Classes

Name	Description
BaseGraph::Node

Member Functions

Name	Description
Node [constructor]	Default constructor
~Node [destructor] [virtual]	Destructor
num_incoming
num_outgoing

Private Data Members

Name

incoming_edges

outgoing_edges

Friends

Name	Description
OpenAnalysis::DGraph::SinkNodesIterator	Iterator to enumerate all the sink nodes.
OpenAnalysis::DGraph::SourceNodesIterator	Iterator to enumerate all the source nodes.
OpenAnalysis::DGraph::OutgoingEdgesIterator	Iterator to enumerate all the outgoing edges from a node.
OpenAnalysis::DGraph::IncomingEdgesIterator	Iterator to enumerate all the incoming edges into a node.
OpenAnalysis::DGraph::BFSIterator	The BFSIterator here is just an extension of BaseGraph::DFSIterator to allow proper casting.
OpenAnalysis::DGraph::DFSIterator	The DFSIterator here is just an extension of BaseGraph::DFSIterator to allow proper casting.
OpenAnalysis::DGraph	DGraph is the base class for a general directed graph (DGraph) that is in turn derived from BaseGraph. Algorithms that operate upon abstract directed graphs should, normally, use only this base DGraph class for maximum portability.

Derived Classes

Name	Description
Node

Created with MrDocs