21 #ifndef SH_EDGEITERATOR_H 22 #define SH_EDGEITERATOR_H 117 void print (
unsigned short spc = 0)
const ;
158 #endif // ndef SH_EDGEITERATOR_H ITERATIONMODE
Definition: EdgeIterator.h:53
Definition: EdgeIterator.h:54
~EdgeIterator(void)
Definition: EdgeIterator.cc:52
Edge CurrentEdge
the current edge (is returned by operator*)
Definition: EdgeIterator.h:121
a graph constructed from a cover file and a message to be embedded
Definition: Graph.h:51
const Edge * operator*(void) const
Definition: EdgeIterator.h:79
EdgeIterator(void)
Definition: EdgeIterator.cc:28
void findNextEdge(void)
Definition: EdgeIterator.cc:127
static UWORD32 MaxNumEdges
the maximum number of edges the EdgeIterator should iterate through
Definition: EdgeIterator.h:130
unsigned long * SVALIndices
contains (for every sample value) an index to the current opposite neighbour
Definition: EdgeIterator.h:127
the value of a sample in a CvrStgFile
Definition: SampleValue.h:61
void reset(Vertex *v, ITERATIONMODE m=SAMPLEOCCURENCE)
Definition: EdgeIterator.cc:121
Definition: EdgeIterator.h:55
bool isFinished(void) const
Definition: EdgeIterator.h:101
void print(unsigned short spc=0) const
UWORD32 VertexLabel
Definition: common.h:68
static void setMaxNumEdges(UWORD32 mne)
Definition: EdgeIterator.h:114
VertexLabel getPartnerVertexLabel(void) const
Definition: EdgeIterator.h:108
unsigned long UWORD32
Definition: common.h:45
ITERATIONMODE Mode
mode of iteration
Definition: EdgeIterator.h:124
allows an iteration trough all edges of a vertex
Definition: EdgeIterator.h:51
bool isDestSampleValueOK(const SampleValue *sv)
bool Finished
is true iff there are no more edges for this source vertex
Definition: EdgeIterator.h:136
void operator++(void)
Definition: EdgeIterator.cc:57
static UWORD32 getMaxNumEdges(void)
Definition: EdgeIterator.h:111
UWORD32 EdgeIndex
the index/number of the edge that is currently returned by operator*
Definition: EdgeIterator.h:133
std::list< SampleOccurence >::const_iterator SampleOccurenceIt
Definition: EdgeIterator.h:142
a vertex in a graph
Definition: Vertex.h:43