GraphEdgeIterC<class NodeT,class EdgeT>

User Documentation

RAVL, Recognition And Vision Library

Ravl - Core - Graphs - GraphEdgeIterC<class NodeT,class EdgeT>

GraphEdgeIterC<class NodeT,class EdgeT>

Edge iterator.

include	"Ravl/GraphEdge.hh"
Created:	10/12/1996
User Level:	Normal
Library:	RavlCore
Example:	exGraph.cc
In Scope:	RavlN

Comments:
Iterates through the edges in a graph.

Parent Classes:

GraphEdgeBaseC

Typedefs:

Methods:

GraphEdgeIterC(GraphC<NodeT,EdgeT> & AGraph): Constructor.
GraphEdgeIterC(): Default Constructor.
GraphEdgeIterC(const GraphEdgeIterC<NodeT,EdgeT> & Another): Copy constructor.
~GraphEdgeIterC(): Destructor.
const GraphEdgeIterC<NodeT,EdgeT> & operator =(const GraphEdgeIterC<NodeT,EdgeT> & Oth): Assigment.
bool operator ==(const GraphEdgeIterC<NodeT,EdgeT> & Oth) const: Comparison.
EdgeT & Data(void): Access data.
const EdgeT & Data(void) const: Access data.
GraphNodeIterC<NodeT,EdgeT> Node1(void): Get a node from an undirected graph
GraphNodeIterC<NodeT,EdgeT> Node2(void): Get a node from an undirected graph
NodeT & Node1Data(void): Get data from node 1.
NodeT & Node2Data(void): Get data from node 2.
NodeT & SourceData(void): Data from source node.
NodeT & TargetData(void): Data from target node.
GraphNodeIterC<NodeT,EdgeT> Source(void): Get source node iter.
GraphNodeIterC<NodeT,EdgeT> Target(void): Get target node iter.
GraphNodeHC<NodeT,EdgeT> SourceH(void): Get source node handle.
GraphNodeHC<NodeT,EdgeT> TargetH(void): Get target node handle.
void Invalidate(): Invalidate handle, IsValid() will return false after this call until the handle is assigmed to another edge.
void Del(): Unlinks edge from the graph and deletes it. The iterator will point to the previous edge in the graph edge list.
bool IsEdgeValid() const
bool IsIterValid() const

#include "Ravl/GraphBase.hh"

bool operator ==(const GraphEdgeBaseC & 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. --------------------------------------
GraphNodeBaseC Source(): Returns the source node of this directed edge.
GraphNodeBaseC Target(): Returns the target node of this directed edge.
GraphNodeBaseC Node1(): Returns the first node of this undirected edge.
GraphNodeBaseC Node2(): Returns the second node of this undirected edge.
GraphAdjIterBaseC SourceAdj(): Returns the adjacency of the source node of this directed edge.
GraphAdjIterBaseC TargetAdj(): Returns the adjacency of the target node of this directed edge.
GraphAdjIterBaseC Node1Adj(): Returns the adjacency of the first node of this undirected edge.
GraphAdjIterBaseC Node2Adj(): Returns the adjacency of 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.
UIntT ID() const: Access edge id.

#include "Ravl/InDLIter.hh"

bool IsValid() const: Is iterator valid ?
true is returned for a valid iterator.
void First(): Goto first element in the list.
void Last(): Goto the last element in the list.
operator bool() const: At a valid node ?
bool IsElm() const: At a valid element in the list ?
AMMA compatibilty function, use operator bool() instread.
bool IsFirst() const: At the first element in the list ?
AMMA compatibilty function.
bool IsLast() const: At the last element in the list ?
AMMA compatibilty function.
void operator ++(): Goto next element in list.
void operator ++(int): Goto next element in list.
void operator --(int): Goto previous element in list.
void Next(): Goto next element in list.
AMMA compatibilty function, use operator++() instread.
void Prev(): Goto previous element in list.
AMMA compatibilty function, use operator--() instread.
void NextCrc(): Goto next element in list, skip the head element.
AMMA compatibilty function.
void PrevCrc(): Goto previous element in list, skip the head element.
AMMA compatibilty function.
GraphEdgeBaseBodyC & operator *(): Access data.
NB. The iterator MUST be valid. check with 'operator bool()'.
const GraphEdgeBaseBodyC & operator *() const: Constant access to data.
NB. The iterator MUST be valid. check with 'operator bool()'.
GraphEdgeBaseBodyC * operator ->(): Access data.
NB. The iterator MUST be valid. check with 'operator bool()'.
const GraphEdgeBaseBodyC * operator ->() const: Constant access to data.
NB. The iterator MUST be valid. check with 'operator bool()'.
GraphEdgeBaseBodyC & Data(): Access data.
NB. The iterator MUST be valid. check with 'operator bool()'.
const GraphEdgeBaseBodyC & Data() const: Constant access to data.
NB. The iterator MUST be valid. check with 'operator bool()'.
GraphEdgeBaseBodyC & Extract(): Extract the current element from the list.
Do not delete it, the user is responsible for ensuring this happens at an approprate time. The iteration is left pointing at the element before the one extracted. The iterator must be valid.
void Del(): Delete the current element from the list.
actuall delete the element where appropriate. The iterator must be valid.
void InsertBef(GraphEdgeBaseBodyC & dat): Insert data before current element.
if at the head of the list (i.e. operator bool() failes.) then add at end.
void InsertAft(GraphEdgeBaseBodyC & dat): Insert data after current element.
if at the head of the list (i.e. operator bool() failes.) then add at begining.
IntrDListC<GraphEdgeBaseBodyC> & List(): Access the list we're iterating.
const IntrDListC<GraphEdgeBaseBodyC> & List() const: Access the list we're iterating.
bool Invalidate(): Point interator at an invalid element.

Maintainer:Charles Galambos, Created: 10/12/1996, Documentation by CxxDoc: Tue Aug 13 09:59:02 2002