#include <Vertex.h>
Public Member Functions | |
Vertex (VertexLabel l, SamplePos *sposs, SampleValue **svalues, EmbValue t) | |
~Vertex (void) | |
SamplePos | getSamplePos (unsigned short i) const |
SampleValue * | getSampleValue (unsigned short i) const |
UWORD32 | getDegree (void) const |
Edge * | getShortestEdge (void) const |
void | updateShortestEdge (void) |
void | markDeleted (void) |
void | unmarkDeleted (void) |
VertexLabel | getLabel (void) const |
void | setLabel (VertexLabel l) |
void | setSampleOccurenceIt (unsigned short i, std::list< SampleOccurence >::iterator it) |
EmbValue | getEmbeddedValue (void) const |
EmbValue | getTargetValue (unsigned short i) const |
void | print (unsigned short spc=0) const |
void | printEdges (void) const |
Private Attributes | |
VertexLabel | Label |
the vertex label of this vertex | |
SamplePos * | SamplePositions |
the sample positions of the samples described by this vertex in the CvrStgFile | |
SampleValue ** | SampleValues |
the sample values at the SamplePositions | |
EmbValue * | TargetValues |
the target values for the sample values (exactly one of them has to be reached (and the other left unchanged) to embed this vertex) | |
std::list< SampleOccurence >::iterator * | SampleOccurenceIts |
point to entries in std::lists of sample occurences in the graph | |
Edge * | ShortestEdge |
the shortest edge of this vertex (as calculated by updateShortestEdge) | |
bool | valid |
true iff this vertex is not deleted | |
unsigned short | SelfDegree |
the number of loop edges (loop edges are not valid edges) |
NOTE: Vertex relies on the Globals object pointed to by the Globs pointer. This means that it must be set correctly before using any method of a Vertex object.
|
construct a new vertex object
|
|
|
|
get the degree of this vertex |
|
|
|
|
|
get the i-th sample position
|
|
get the i-th sample value
|
|
get the shortest edge of this vertex |
|
|
|
if this vertex is valid, mark it as deleted |
|
|
|
|
|
|
|
|
|
if this vertex is marked as deleted, undo this |
|
find shortest edge of this vertex and save result to ShortestEdge |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|