Skip to content

OpenAnalysis::BaseGraph::Node

Synopsis

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

class Node;

Member Functions

Name

Description

Node [constructor]

Default constructor

~Node [destructor] [virtual]

Destructor

dump [virtual]

Protected Data Members

Friends

Name

Description

OpenAnalysis::BaseGraph::BFSIterator

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.

OpenAnalysis::BaseGraph::DFSIterator

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.

OpenAnalysis::BaseGraph

BaseGraph is the abstract base class (the "interface") for a general graph. It defines graph properties common to directed and undirected graphs. It leaves out some loose ends in the interface: 1. A node has no notion of incident edges or neighboring nodes because the number of kinds of incident edges or neighboring nodes is dependent upon the graph being directed or undirected. 2. For the same reason, the method delete(node) cannot delete any incident edges. Therefore the directed or undirected graph must override it with a more complete version. Similarly, the method delete(edge) cannot delete the edge from the list(s) of the nodes involved. 3. In an analogous manner, the method add(edge) must be overridden with a more complete version that adds the edge into the records of the nodes involved, if needed.

Derived Classes

Name

Description

Node

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

Created with MrDocs