8#define CLUSTER_LENGTH 2
37 if (0 == clusterStart) {
98 struct Scene scene = {0};
105 struct Scene scene = {0};
109 struct Scene scene = {
111 .graph = this->
graph,
struct Binary * Binary_construct(unsigned int root, struct Graph *graph, int *error)
ssssw
void Colors_initialize(struct Colors *this, int *error)
struct Colors * Colors_construct(unsigned int colorType, struct Binary *binary, struct Graph *graph, int *error)
struct Colors * Colors_destruct(struct Colors *this)
void Graph_addEdge(struct Graph *this, unsigned int source, unsigned int target, int *error)
It adds a directed edge from a source vertex to a target vertex.
unsigned int Graph_readLastSource(const struct Graph *this, unsigned int target, int *error)
It reads the last source vertex of a target vertex, if it exists.
void Graph_readCluster(const struct Graph *this, unsigned int predecessor, unsigned int length, unsigned int *vertices, int *error)
unsigned int Graph_addVertex(struct Graph *this, int *error)
It adds a vertex into a graph storage.
void Graph_addCluster(struct Graph *this, unsigned int length, unsigned int *vertices, int *error)
struct Visual * Visual_construct(unsigned int modality, struct Graph *graph, int *error)
struct Scene Visual_addScene(struct Visual *this, int *error)
struct Visual * Visual_destruct(struct Visual *this)