PUBLIC

GraphEdgeC::GraphEdgeC(BaseGraphC &) GraphEdgeC::GraphEdgeC(const GraphEdgeC &) GraphEdgeC::operator==(const GraphEdgeC &) const GraphEdgeC::Hash(void) const GraphEdgeC::Source(void) GraphEdgeC::Target(void) GraphEdgeC::Node1(void) GraphEdgeC::Node2(void) GraphEdgeC::SourceAdj(void) GraphEdgeC::TargetAdj(void) GraphEdgeC::Node1Adj(void) GraphEdgeC::Node2Adj(void) GraphEdgeC::TargetRep(void) GraphEdgeC::SourceRep(void) GraphEdgeC::Node1Rep(void) GraphEdgeC::Node2Rep(void) GraphEdgeC::Del(void) GraphEdgeC::Redirect(void) GraphEdgeC::GraphEdgeC(void) GraphEdgeC::LateItemSet(BaseGraphC &) GraphEdgeC::LateItemSet(const GraphEdgeC &) GraphEdgeC::GraphEdgeC(GraphEdgeRepC &,IntrDListC &) GraphEdgeC::Graph(void) IntrDLIterC::Copy(void) const IntrDLIterC::operator=(const IntrDLIterC &) IntrDLIterC::DLIter(void) const IntrDLIterC::LateItemSet(IntrDListC &) IntrDLIterC::LateItemSet(const IntrDLIterC &) BaseIntrDLIterC::Data(void) const BaseIntrDLIterC::Data(void) BaseIntrDLIterC::First(void) BaseIntrDLIterC::Last(void) BaseIntrDLIterC::Next(void) BaseIntrDLIterC::Prev(void) BaseIntrDLIterC::NextCrc(void) BaseIntrDLIterC::PrevCrc(void) BaseIntrDLIterC::Nth(LongIntT) BaseIntrDLIterC::RelNth(LongIntT) BaseIntrDLIterC::LinkBef(DataC *) BaseIntrDLIterC::LinkAft(DataC *) BaseIntrDLIterC::MoveBef(BaseIntrDLIterC &) BaseIntrDLIterC::MoveAft(BaseIntrDLIterC &) BaseIntrDLIterC::MoveBef(IntrDListC &) BaseIntrDLIterC::MoveAft(IntrDListC &) BaseIntrDLIterC::UnlinkMoveNext(void) BaseIntrDLIterC::Unlink(void) BaseIntrDLIterC::LateItemSet(IntrDListC &) BaseIntrDLIterC::LateItemSet(const BaseIntrDLIterC &) BaseIntrDLIterC::Copy(void) const BaseIntrDLIterC::operator=(const BaseIntrDLIterC &) BaseIntrDLIterC::DLIter(void) const BaseIntrConstDLIterC::Data(void) const BaseIntrConstDLIterC::List(void) const BaseIntrConstDLIterC::operator==(const BaseIntrConstDLIterC &) const BaseIntrConstDLIterC::operator!=(const BaseIntrConstDLIterC &) const BaseIntrConstDLIterC::IsFirst(void) const BaseIntrConstDLIterC::IsLast(void) const BaseIntrConstDLIterC::IsElm(void) const BaseIntrConstDLIterC::First(void) BaseIntrConstDLIterC::Last(void) BaseIntrConstDLIterC::Next(void) BaseIntrConstDLIterC::Prev(void) BaseIntrConstDLIterC::NextCrc(void) BaseIntrConstDLIterC::PrevCrc(void) BaseIntrConstDLIterC::Nth(LongIntT) BaseIntrConstDLIterC::RelNth(LongIntT) BaseIntrConstDLIterC::Index(void) const BaseIntrConstDLIterC::LateItemSet(IntrDListC &) BaseIntrConstDLIterC::LateItemSet(const BaseIntrConstDLIterC &) BaseIntrConstDLIterC::IsValid(void) const BaseIntrConstDLIterC::Set(IntrDListC &,DataC *) BaseIntrConstDLIterC::operator=(const BaseIntrConstDLIterC &) BaseIntrConstDLIterC::DLIter(void) const BaseIntrConstDLIterC::LinkBef(DataC *) BaseIntrConstDLIterC::LinkAft(DataC *) BaseIntrConstDLIterC::MoveBef(BaseIntrConstDLIterC &) BaseIntrConstDLIterC::MoveAft(BaseIntrConstDLIterC &) BaseIntrConstDLIterC::MoveBef(IntrDListC &) BaseIntrConstDLIterC::MoveAft(IntrDListC &) BaseIntrConstDLIterC::UnlinkMoveNext(void) BaseIntrConstDLIterC::Unlink(void) BaseIntrConstDLIterC::operator<<(ostream &,const BaseIntrConstDLIterC &)

GraphEdgeC
The class GraphEdgeC is the iterator of the list of graph edges.
include	"amma/BoGraph.hh"
User Level:	Default
Library:	Mgraph
Example:	exBiHash.cc
Section:	Containers.Graphs
In Scope:	std

Comments:
Futhermore, the class provides access to the graph elements which are in the neighbourhood of the edge.

public IntrDLIterC<class DataC>

GraphEdgeIterC
SurfaceEdgeC

GraphEdgeC(BaseGraphC & graph)

Creates the edge iterator of the 'graph'. The iterator will point to the first edge in the edge list of the graph.

GraphEdgeC(const GraphEdgeC & edge)

Copy constructor.

BooleanT operator==(const GraphEdgeC & Oth) const

True when both iterators are pointing at the same edge.

UIntT Hash(void) const

Returns a hash value for the current edge. Access to the neighboring graph lists. --------------------------------------

GraphNodeC Source()

Returns the source node of this directed edge.

GraphNodeC Target()

Returns the target node of this directed edge.

GraphNodeC Node1()

Returns the first node of this undirected edge.

GraphNodeC Node2()

Returns the second node of this undirected edge.

GraphAdjC SourceAdj()

Returns the adjacency of the source node of this directed edge.

GraphAdjC TargetAdj()

Returns the adjacency of the target node of this directed edge.

GraphAdjC Node1Adj()

Returns the adjacency of the first node of this undirected edge.

GraphAdjC Node2Adj()

Returns the adjacency of the second node of this undirected edge. Direct access to the graph elements. ------------------------------------

GraphNodeRepC & TargetRep()

Returns the target node of this directed edge.

GraphNodeRepC & SourceRep()

Returns the source node of this directed edge.

GraphNodeRepC & Node1Rep()

Returns the first node of this undirected edge.

GraphNodeRepC & Node2Rep()

Returns the second node of this undirected edge. Changing of the edge list. --------------------------

void Del()

Unlinks edge from the graph and deletes it. The iterator will point to the previous edge in the graph edge list.

void Redirect()

Changes the orientation of the edge. In other words it means swapping of the meaning of Node1(), Source() with Node2(), Target(). If the graph is undirected the order of edges is held. If the graph is directed the order of edges of both nodes is changed. Array item constructors. ------------------------ ATTENTION! The following member functions can be used only for initialization of arrays. This constructor is provided because of trouble with an array of objects. The present ANSI C++ does not enable to pass any constructor of array elements different from a defaut constructor. The extension of GNU g++ compiler is not supported by other compiler. The constructor should be used only for such purposes. If this limitation of C++ is removed, the constructor will be obsolete.

GraphEdgeC()

The default constructor used by constructors of arrays. It constructs the unvalid object which must be initialized by the member function LateItemSet().

void LateItemSet(BaseGraphC & graph)

Sets the unvalid graph edge iterator. The iterator will point to the first edge in the edge list of the 'graph'.

void LateItemSet(const GraphEdgeC & edge)

Sets the unvalid edge iterator to be the copy of the iterator 'edge'.

GraphEdgeC(GraphEdgeRepC & edge,IntrDListC<GraphEdgeRepC> & list)

Creates the iterator pointing to the edge which belongs to the 'list'.

BaseGraphC & Graph()

Returns the graph.

IntrDLIterC<GraphEdgeRepC> Copy() const

Copy constructor.

const IntrDLIterC<GraphEdgeRepC> & operator=(const IntrDLIterC<GraphEdgeRepC> & it)

Assingment. This iterator will point to the same list element as the iterator 'it'. Access to the object items. ---------------------------

const IntrDLIterC<GraphEdgeRepC> & DLIter() const

Self-identification. The function returns this object. Array item constructors. ------------------------ ATTENTION! The following member functions can be used only for initialization of arrays. This constructor is provided because of trouble with an array of objects. The present ANSI C++ does not enable to pass any constructor of array elements different from a defaut constructor. The extension of GNU g++ compiler is not supported by other compiler. The constructor should be used only for such purposes. If this limitation of C++ is removed, the constructor will be obsolete.

void LateItemSet(IntrDListC<GraphEdgeRepC> & list)

Sets the unvalid list iterator. The iterator will point to the first item of the 'list', if there is any, otherwise to the head of the list.

void LateItemSet(const IntrDLIterC<GraphEdgeRepC> & iter)

Sets the unvalid list iterator to be the copy of the iterator 'iter'.

const GraphEdgeRepC & Data() const

Access to the constant object contained in the list element.

GraphEdgeRepC & Data()

Access to the object contained in the list element. BE CAREFUL. You must not change the links of created chains. Positioning the iterator. -------------------------

BaseIntrDLIterC<GraphEdgeRepC> & First()

Sets the iterator to point to the first element of the list.

BaseIntrDLIterC<GraphEdgeRepC> & Last()

Sets the iterator to point to the last element of the list.

BaseIntrDLIterC<GraphEdgeRepC> & Next()

Moves the iterator to the successor of the element.

BaseIntrDLIterC<GraphEdgeRepC> & Prev()

Moves the iterator to the predecessor of the element.

BaseIntrDLIterC<GraphEdgeRepC> & NextCrc()

Moves the iterator to the successor of the element. If the result element is not a proper element of the list the iterator is moved to the first element.

BaseIntrDLIterC<GraphEdgeRepC> & PrevCrc()

Moves the iterator to the predecessor of the element. If the result element is not a proper element of the list the iterator is moved to the last element.

BaseIntrDLIterC<GraphEdgeRepC> & Nth(LongIntT n)

Sets to the n-th element of the list. The index 'n' can be negative. The first element of the list has the index 0, the last element has the index -1. It does not skip the head of the list.

BaseIntrDLIterC<GraphEdgeRepC> & RelNth(LongIntT n)

Moves to the n-th element from the current element. The index 'n' can be positive, zero, or negative. Particularly, the n = 0 means no move, n = 1 means the move to the next element, and n = -1 means the move to the previous element. Link / Unlink / Delete. -----------------------

const BaseIntrDLIterC<GraphEdgeRepC> & LinkBef(GraphEdgeRepC * data)

Inserts the new element containing 'data' before the element pointed to by this iterator. This iterator is returned.

const BaseIntrDLIterC<GraphEdgeRepC> & LinkAft(GraphEdgeRepC * data)

Inserts the new element containing 'data' after the element pointed to by this iterator. This iterator is returned.

const BaseIntrDLIterC<GraphEdgeRepC> & MoveBef(BaseIntrDLIterC<GraphEdgeRepC> & iter)

The element pointed to by 'iter' is moved before the element pointed to by this iterator. This iterator will point to the same element as before. The iterator 'iter' will point to the previous element in the original list.

const BaseIntrDLIterC<GraphEdgeRepC> & MoveAft(BaseIntrDLIterC<GraphEdgeRepC> & iter)

The element pointed to by 'iter' is moved after the element pointed to by this iterator. This iterator will point to the same element as before. The iterator 'iter' will point to the previous element in the original list.

const BaseIntrDLIterC<GraphEdgeRepC> & MoveBef(IntrDListC<GraphEdgeRepC> & list)

All elements of the 'list' are moved before the element pointed to by this iterator. The 'list' will be empty after this operation.

const BaseIntrDLIterC<GraphEdgeRepC> & MoveAft(IntrDListC<GraphEdgeRepC> & list)

All elements of the 'list' are moved before the element pointed to by this iterator. The 'list' will be empty after this operation.

GraphEdgeRepC * UnlinkMoveNext()

Unlinks the element pointed to by this iterator and moves iterator to the next element.

GraphEdgeRepC * Unlink()

Unlinks the element pointed to by this iterator and moves iterator to the previous element. Array item constructors. ------------------------ ATTENTION! The following member functions can be used only for initialization of arrays. This constructor is provided because of trouble with an array of objects. The present ANSI C++ does not enable to pass any constructor of array elements different from a defaut constructor. The extension of GNU g++ compiler is not supported by other compiler. The constructor should be used only for such purposes. If this limitation of C++ is removed, the constructor will be obsolete.

void LateItemSet(IntrDListC<GraphEdgeRepC> & list)

Sets the unvalid list iterator. The iterator will point to the first item of the 'list', if there is any, otherwise to the head of the list.

void LateItemSet(const BaseIntrDLIterC<GraphEdgeRepC> & iter)

Sets the unvalid list iterator to be the copy of the iterator 'iter'.

BaseIntrDLIterC<GraphEdgeRepC> Copy() const

Copy constructor.

const BaseIntrDLIterC<GraphEdgeRepC> & operator=(const BaseIntrDLIterC<GraphEdgeRepC> & it)

Assingment. This iterator will point to the same list element as the iterator 'it'.

const BaseIntrDLIterC<GraphEdgeRepC> & DLIter() const

Self-identification. The function returns this object.

const GraphEdgeRepC & Data() const

Access to the constant object contained in the list element.

const IntrDListC<GraphEdgeRepC> & List() const

Returns the list whose element is pointed to by this iterator. ------------ Predicates -------------------------------------

BooleanT operator==(const BaseIntrConstDLIterC<GraphEdgeRepC> & it) const

Returns TRUE if both iterators point to the same list element.

BooleanT operator!=(const BaseIntrConstDLIterC<GraphEdgeRepC> & it) const

Returns TRUE if this iterators points to a different list element than the iterator 'it'.

BooleanT IsFirst() const

Returns TRUE if the pointed element is the first in a list.

BooleanT IsLast() const

Returns TRUE if the pointed element is the last one in a list.

BooleanT IsElm() const

Returns TRUE if the pointed an proper element (not a head) of a list. ----------- Positioning the iterator -----------------------------

BaseIntrConstDLIterC<GraphEdgeRepC> & First()

Sets the iterator to point to the first element of the list.

BaseIntrConstDLIterC<GraphEdgeRepC> & Last()

Sets the iterator to point to the last element of the list.

BaseIntrConstDLIterC<GraphEdgeRepC> & Next()

Moves the iterator to the successor of the element.

BaseIntrConstDLIterC<GraphEdgeRepC> & Prev()

Moves the iterator to the predecessor of the element.

BaseIntrConstDLIterC<GraphEdgeRepC> & NextCrc()

Moves the iterator to the successor of the element. If the result element is not a proper element of the list the iterator is moved to the first element.

BaseIntrConstDLIterC<GraphEdgeRepC> & PrevCrc()

Moves the iterator to the predecessor of the element. If the result element is not a proper element of the list the iterator is moved to the last element.

BaseIntrConstDLIterC<GraphEdgeRepC> & Nth(LongIntT n)

Sets to the n-th element of the list. The index 'n' can be negative. The first element of the list has the index 0, the last element has the index -1. It does not skip the head of the list.

BaseIntrConstDLIterC<GraphEdgeRepC> & RelNth(LongIntT n)

Moves to the n-th element from the current element. The index 'n' can be positive, zero, or negative. Particularly, the n = 0 means no move, n = 1 means the move to the next element, and n = -1 means the move to the previous element.

LongIntT Index() const

Returns the offset of an element from the first element. Particularly, it returns 0 if the iterator points to the first element, it returns -1 if element is the head of the list, and it returns -2 if the element is not contained in the list. The function does not check counter overflow. Array item constructors. ------------------------ ATTENTION! The following member functions can be used only for initialization of arrays. This constructor is provided because of trouble with an array of objects. The present ANSI C++ does not enable to pass any constructor of array elements different from a defaut constructor. The extension of GNU g++ compiler is not supported by other compiler. The constructor should be used only for such purposes. If this limitation of C++ is removed, the constructor will be obsolete.

void LateItemSet(IntrDListC<GraphEdgeRepC> & list)

Sets the unvalid list iterator. The iterator will point to the first item of the 'list', if there is any, otherwise to the head of the list.

void LateItemSet(const BaseIntrConstDLIterC<GraphEdgeRepC> & iter)

Sets the unvalid list iterator to be the copy of the iterator 'iter'.

BooleanT IsValid() const

Returns TRUE if the iterator was not constructed by the default constructor.

void Set(IntrDListC<GraphEdgeRepC> & list,GraphEdgeRepC * data)

Sets the iterator to point to the element 'data' that belongs to the 'list'.

const BaseIntrConstDLIterC<GraphEdgeRepC> & operator=(const BaseIntrConstDLIterC<GraphEdgeRepC> & it)

Assingment. This iterator will point to the same list element as the iterator 'it'.

const BaseIntrConstDLIterC<GraphEdgeRepC> & DLIter() const

Self-identification. The function returns this object.

const BaseIntrConstDLIterC<GraphEdgeRepC> & LinkBef(GraphEdgeRepC * data)

Inserts the new element containing 'data' before the element pointed to by this iterator. This iterator is returned.

const BaseIntrConstDLIterC<GraphEdgeRepC> & LinkAft(GraphEdgeRepC * data)

Inserts the new element containing 'data' after the element pointed to by this iterator. This iterator is returned.

const BaseIntrConstDLIterC<GraphEdgeRepC> & MoveBef(BaseIntrConstDLIterC<GraphEdgeRepC> & iter)

The element pointed to by 'iter' is moved before the element pointed to by this iterator. This iterator will point to the same element as before, the iterator 'iter' will point to the previous element in the original list.

const BaseIntrConstDLIterC<GraphEdgeRepC> & MoveAft(BaseIntrConstDLIterC<GraphEdgeRepC> & iter)

The element pointed to by 'iter' is moved after the element pointed to by this iterator. This iterator will point to the same element as before, the iterator 'iter' will point to the previous element in the original list.

const BaseIntrConstDLIterC<GraphEdgeRepC> & MoveBef(IntrDListC<GraphEdgeRepC> & list)

All elements of the 'list' are moved before the element pointed to by this iterator. The 'list' will be empty after this operation.

const BaseIntrConstDLIterC<GraphEdgeRepC> & MoveAft(IntrDListC<GraphEdgeRepC> & list)

All elements of the 'list' are moved before the element pointed to by this iterator. The 'list' will be empty after this operation.

GraphEdgeRepC * UnlinkMoveNext()

Unlink the element pointed to by this iterator and moves iterator to the next element.

GraphEdgeRepC * Unlink()

Unlink the element pointed to by this iterator and moves iterator to the previous element.

ostream & operator<<(ostream & s,const BaseIntrConstDLIterC<GraphEdgeRepC> & elm)