Go to the documentation of this file.
40 struct VertexContentsEqual ;
92 bool check (
bool verbose =
false)
const ;
121 void print (
void)
const ;
123 void print_gml (std::ostream& out)
const ;
124 void printVertex_gml (std::ostream& out,
Vertex* v,
unsigned int recdepth, std::vector<bool>& nodeprinted, std::vector<bool>& edgesprinted,
bool start =
true)
const ;
125 void printPrologue_gml (std::ostream& out)
const ;
126 void printEpilogue_gml (std::ostream& out)
const ;
128 void print_Vertices (
unsigned short spc = 0)
const ;
176 void constructSamples (
const std::vector<SamplePos*> &sposs, std::vector<SampleValue**>& svalues) ;
184 void constructVertices (std::vector<SamplePos*>& sposs, std::vector<SampleValue**>& svalues,
const std::vector<EmbValue>& tvalues) ;
209 #endif // ndef SH_GRAPH_H
a cover-/stego-file
Definition: CvrStgFile.h:46
std::vector< Vertex * > Vertices
contains the vertices in this graph - Vertices[l] is the vertex with label l
Definition: Graph.h:141
Graph(CvrStgFile *cvr, const BitString &emb, Selector &sel)
Definition: Graph.cc:38
a random permutation of a random combination
Definition: Selector.h:36
std::vector< UWORD32 * > NumDeletedSampleOccurences
Definition: Graph.h:159
bool check_SVALists_uniqueness(bool verbose=false) const
Definition: Graph.cc:474
bool check_SVALists_completeness(bool verbose=false) const
Definition: Graph.cc:499
~Graph(void)
Definition: Graph.cc:166
bool check(bool verbose=false) const
Definition: Graph.cc:261
std::vector< UWORD32 * > NumSampleOccurences
Definition: Graph.h:155
std::list< SampleOccurence >::iterator unmarkDeletedSampleOccurence(std::list< SampleOccurence >::iterator it)
Definition: Graph.cc:204
void constructSamples(const std::vector< SamplePos * > &sposs, std::vector< SampleValue ** > &svalues)
Definition: Graph.cc:80
bool check_SVALists_soundness(bool verbose=false) const
Definition: Graph.cc:404
unsigned short SamplesPerVertex
Definition: Graph.h:196
Vertex * getVertex(VertexLabel l) const
Definition: Graph.h:76
bool check_SampleOccurences_size(bool verbose=false) const
Definition: Graph.cc:336
float getAvgVertexDegree(void) const
Definition: Graph.cc:215
bool check_SampleValues(bool verbose=false) const
Definition: Graph.cc:290
void unmarkDeletedAllVertices(void)
Definition: Graph.cc:186
std::vector< SampleValueAdjacencyList * > SVALists
contains the sample value adjacency lists (SVALists[v] contains only sample values with embedded valu...
Definition: Graph.h:147
UWORD32 VertexLabel
Definition: common.h:68
void printVerboseInfo(void)
Definition: Graph.cc:224
CvrStgFile * File
Definition: Graph.h:194
EmbValue EmbValueModulus
Definition: Graph.h:195
bool check_SampleOccurences(bool verbose=false) const
Definition: Graph.cc:327
std::vector< SampleValue * > SampleValues
contains the list of (unique) sample values - SampleValues[l] is the sample value with label l
Definition: Graph.h:144
bool check_SVALists_size(bool verbose=false) const
Definition: Graph.cc:389
a string of bits
Definition: BitString.h:42
void constructEdges(void)
Definition: Graph.cc:122
void constructVertices(std::vector< SamplePos * > &sposs, std::vector< SampleValue ** > &svalues, const std::vector< EmbValue > &tvalues)
Definition: Graph.cc:113
BYTE EmbValue
Definition: common.h:66
std::vector< std::list< SampleOccurence > > SampleOccurences
SampleOccurences[l] contains all occurences of the sample value with label l.
Definition: Graph.h:150
unsigned long getNumVertices(void) const
Definition: Graph.h:68
std::vector< std::list< SampleOccurence > > DeletedSampleOccurences
contains those sample occurences that have been marked as deleted from SampleOccurences
Definition: Graph.h:158
std::list< SampleOccurence >::iterator markDeletedSampleOccurence(std::list< SampleOccurence >::iterator it)
Definition: Graph.cc:193
allows an iteration trough all edges of a vertex
Definition: EdgeIterator.h:51
bool check_SampleOccurences_correctness(bool verbose=false) const
Definition: Graph.cc:348
bool check_Vertices(bool verbose=false) const
Definition: Graph.cc:271
an adjacency list-like data structur for sample values
Definition: SampleValueAdjacencyList.h:33
bool check_SVALists_sorted(bool verbose=false) const
Definition: Graph.cc:439
a graph constructed from a cover file and a message to be embedded
Definition: Graph.h:51
a vertex in a graph
Definition: Vertex.h:43
bool check_SVALists(bool verbose=false) const
Definition: Graph.cc:378
a heuristic algorithm for constructing a matching
Definition: WKSConstructionHeuristic.h:48
bool check_SampleOccurences_completeness(bool verbose=false) const
Definition: Graph.cc:363
Definition: SampleOccurence.h:26