PUBLIC

BaseGraphC::BaseGraphC(TypeT) BaseGraphC::Type(void) const BaseGraphC::InsNode(void) BaseGraphC::InsEdge(GraphNodeC &,GraphNodeC &) BaseGraphC::Nodes(void) const BaseGraphC::Nodes(void) BaseGraphC::Edges(void) const BaseGraphC::Edges(void) BaseGraphC::~BaseGraphC(void) BaseGraphC::ResetNodeMarkers(void) BaseGraphC::ResetEdgeMarkers(void) BaseGraphC::ResetMarkers(void) BaseGraphC::SetNodeMarkersInOrder(void) BaseGraphC::SetEdgeMarkersInOrder(void) BaseGraphC::SetMarkersInOrder(void) BaseGraphC::PrintNodes(ostream &) const BaseGraphC::PrintEdges(ostream &) const BaseGraphC::Print(ostream &) BaseGraphC::DebugPrint(ostream &) const BaseGraphC::InsNode(GraphNodeRepC::GenClassT) BaseGraphC::InsEdge(GraphNodeC &,GraphNodeC &,GraphEdgeRepC::GenClassT) BaseGraphC::InsNode(GraphNodeRepC &) BaseGraphC::InsEdge(GraphEdgeRepC &)

BaseGraphC
include	"amma/BoGraph.hh"
User Level:	Default
Library:	Mgraph
Example:	exBiHash.cc
Section:	Containers.Graphs
In Scope:	std

Comments:
The class BaseGraphC represents graph which can be directed or undirected. It contains a collection of nodes and a collection of edges between nodes.

private IntrDListC<class LDataC>

enum TypeT { DIRECTED, UNDIRECTED } ;

TypeT gType;

The type of the graph: directed x undirected

BaseGraphC(TypeT type = DIRECTED)

Creates an empty graph, directed or undirected.

TypeT Type() const

Returns the type of the graph, if it is directed or undirected.

GraphNodeC InsNode()

Inserts one node to the graph. Returns the node iterator.

GraphEdgeC InsEdge(GraphNodeC & fromNode,GraphNodeC & toNode)

Inserts one egde to the graph. Returns the edge iterator.

const IntrDListC<GraphNodeRepC> & Nodes() const

Returns the constant list of nodes.

IntrDListC<GraphNodeRepC> & Nodes()

Returns the list of nodes.

const IntrDListC<GraphEdgeRepC> & Edges() const

Returns the constant list of edges.

IntrDListC<GraphEdgeRepC> & Edges()

~BaseGraphC()

Destructor.

void ResetNodeMarkers()

Sets all node markers to be 0.

void ResetEdgeMarkers()

Sets all egde markers to be 0.

void ResetMarkers()

Sets all node and edge markers to be 0.

void SetNodeMarkersInOrder()

Sets all node markers as indexes in the list of nodes. The first node in the list of nodes has index 0.

void SetEdgeMarkersInOrder()

Sets all edge markers as indexes in the list of edges. The first edge in the list of edges has index 0.

void SetMarkersInOrder()

Sets all edge and node markers as indexes in the list of edges and in the list of node respectively. The first edge in the list of edges and the first node in the list of nodes have indexes equal to 0.

void PrintNodes(ostream & s) const

Prints all nodes of this graph into the output stream.

void PrintEdges(ostream & s) const

Prints all edges of this graph into the output stream.

void Print(ostream & s)

Sets marker of edges and nodes to be unique and print the whole structure of this graph.

void DebugPrint(ostream & s) const

Prints markers and addresses of all nodes and edges of this graph.

GraphNodeC InsNode(GraphNodeRepC::GenClassT nodeAttr)

Inserts one node to the graph. Returns the node iterator.

GraphEdgeC InsEdge(GraphNodeC & fromNode,GraphNodeC & toNode,GraphEdgeRepC::GenClassT edgeAttr)

Inserts one edge to the graph. Returns the edge iterator.

GraphNodeC InsNode(GraphNodeRepC & ANode)

Inserts one node to the graph. Returns the node iterator. ANode must be a GraphNodeRepC that's just been created, and not a part of another graph.

GraphEdgeC InsEdge(GraphEdgeRepC & AnEdge)

Inserts one edge to the graph. Returns the edge iterator. AnEdge must be a GraphEdgeRepC that's just been created, and not a part of another graph.