PUBLIC

GraphAdjRepC::GraphAdjRepC(GraphNodeRepC &,GraphEdgeRepC &) GraphAdjRepC::OtherNode(void) const GraphAdjRepC::OtherNode(void) GraphAdjRepC::Edge(void) const GraphAdjRepC::Edge(void) GraphAdjRepC::DebugPrint(ostream &) const GraphAdjRepC::SwapNodes(GraphAdjRepC &) GraphAdjRepC::operatordelete(void *,size_t)

GraphAdjRepC
The class GraphAdjRepC represents a part of triple which is a basic element of graphs.
include	"amma/BoGraph.hh"
User Level:	Default
Library:	Mgraph
Example:	exBiHash.cc
Section:	Containers.Graphs
In Scope:	std

Comments:
One can imagine that every edge has two touch points, so call adjacencies, that connect nodes and edge together. Each node is connected to the edge through one adjacency. Because of effectivity, the representation of adjacency contains only the pair . The access to the nodeA is solved outside of the this class.

public DChainC

GraphNodeRepC * otherNode;

adjacent node

GraphEdgeRepC * me;

the edge joining both nodes

GraphAdjRepC(GraphNodeRepC & node,GraphEdgeRepC & edge)

Initializes the graph link.

const GraphNodeRepC & OtherNode() const

Access to the constant adjacent node.

GraphNodeRepC & OtherNode()

Returns the adjacent node.

const GraphEdgeRepC & Edge() const

Access to the constant edge joining the node possessing the list of adjacent nodes and the adjacent node.

GraphEdgeRepC & Edge()

Returns the edge joining the node possessing the list of adjacent nodes and the adjacent node.

void DebugPrint(ostream & s) const

Print content of addresses contained in this adjacency.

void SwapNodes(GraphAdjRepC & adj)

Swaps the pointers to the nodes.

void operatordelete(void *,size_t)

The function cannot be used.