29 #include "../../common/STLUtils.h"
30 #include "../core/Edge.h"
31 #include "../core/GraphCache.h"
32 #include "../core/GraphData.h"
33 #include "../core/GraphDataManager.h"
34 #include "../core/GraphMetadata.h"
35 #include "../core/Vertex.h"
36 #include "../graphs/Graph.h"
60 std::vector<te::graph::Vertex*> vec;
78 vec.push_back(vNeighbor);
112 if(!m_metadata->m_memoryGraph)
114 m_graphData = m_graphCache->checkCacheByVertexId(e->
getIdFrom());
164 std::vector<te::graph::Edge*> vec;
virtual void removeEdge(int id)
This function removes the edge element from graph, also was removed in data source.
DirectedGraph()
constructor.
virtual void removeEdge(int id)
This function removes the edge element from graph, also was removed in data source.
int getId()
It returns the edge identification.
From the point of view of graph theory, vertices are treated as featureless and indivisible objects...
virtual std::vector< te::graph::Vertex * > getVertexNeighborhood(int id)
The neighborhood of a vertex v is an induced subgraph of the graph, formed by all vertices adjacent t...
virtual bool isSinkVertex(int id, bool &flag)
This function indicates if a desired element is a sink vertex.
Class used to define the edge struct of a graph. Its compose with a identifier, the vertex origin and...
This class is used to set the main functions of a cache policy.
This class define the main functions necessary to save and load the graph data and metadata informati...
std::set< int > & getSuccessors()
Returns the Successors vector.
virtual void add(Vertex *v)
Add a new vertex element to a graph.
int getIdFrom()
It returns the vertex origin identification.
virtual void add(Edge *e)
Add a new edge element to a graph.
virtual std::vector< te::graph::Edge * > getOutEdges(int vId)
It returns all edges that came out a vertex.
This is the main graph implementation, that uses a cache policy anda graph loader to get all elements...
~DirectedGraph()
Virtual destructor.
int getIdTo()
It returns the vertex destiny identification.
This is a implementation of a Directed Graph. By convention a directed graph provides access to out-e...