31 #include "../../common/Translator.h"
32 #include "../../common/progress/TaskProgress.h"
33 #include "../../dataaccess/query/Expression.h"
34 #include "../core/AbstractGraphFactory.h"
35 #include "../core/Edge.h"
36 #include "../core/GraphMetadata.h"
37 #include "../core/Vertex.h"
38 #include "../core/VertexProperty.h"
39 #include "../graphs/Graph.h"
40 #include "../iterator/QueryIterator.h"
41 #include "../Config.h"
42 #include "../Exception.h"
73 m_graph->addEdgeProperty(p);
81 m_graph->addVertexProperty(p);
void setMessage(const std::string &message)
Set the task message.
void useTimer(bool flag)
Used to define if task use progress timer information.
virtual Property * clone() const =0
It returns a clone of the object.
This class can be used to inform the progress of a task.
virtual te::graph::Edge * getNextEdge()
It returns a pointer to the next edge element of a graph.
#define TE_TR(message)
It marks a string in order to get translated.
virtual te::graph::Edge * getFirstEdge()
It returns a pointer to the first edge element of a graph.
It models a property definition.
This is an abstract class that models a query expression.
From the point of view of graph theory, vertices are treated as featureless and indivisible objects...
void setTotalSteps(int value)
Set the task total stepes.
virtual te::graph::GraphMetadata * getMetadata()=0
Function used to access the graph metadata.
Class used to define the edge struct of a graph. Its compose with a identifier, the vertex origin and...
virtual ~QueryGraphBuilder()
Virtual destructor.
This class defines the Query strategy to build a graph having a exist graph as input parameters...
Abstract class used to define the main functions of graph struct. All graph implementations must used...
virtual size_t getEdgeInteratorCount()
It returns the number of elements of this iterator.
void pulse()
Calls setCurrentStep() function using getCurrentStep() + 1.
virtual te::graph::Vertex * getNextVertex()
It returns a pointer to the next vertex element of a graph.
virtual int getEdgePropertySize()=0
Used to verify the number of properties associated to edge elements.
virtual int getVertexPropertySize()=0
Used to verify the number of properties associated to vertex elements.
virtual te::graph::Vertex * getFirstVertex()
It returns a pointer to the first vertex element of a graph.
virtual size_t getVertexInteratorCount()
It returns the number of elements of this iterator.
QueryGraphBuilder()
Default constructor.
This class defines a commun interface to represents a graph iterator class. The main diferency to ano...
static AbstractGraph * make()
It creates and returns an empty graph with default graph type.
This abstract class provides the common functions for graph builder classes. Each builder strategy ha...
bool build(te::graph::AbstractGraph *g, te::da::Expression *eEdge, te::da::Expression *eVertex, const std::map< std::string, std::string > &dsInfo, const std::string &graphType, const std::map< std::string, std::string > &gInfo)
Function used to generated the vertex id based on raster coordenate.
virtual bool isVertexIteratorAfterEnd()
Used to check the iterator position.
virtual bool isEdgeIteratorAfterEnd()
Used to check the iterator position.
void setParent(Property *p)
It associate this property to the informed parent.