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/Vertex.h"
35 #include "../graphs/Graph.h"
54 std::vector<te::graph::Vertex*> vec;
72 vec.push_back(vNeighbor);
106 m_graphData = m_graphCache->checkCacheByVertexId(e->
getIdFrom());
155 std::vector<te::graph::Edge*> vec;
Class used to define the edge struct of a graph. Its compose with a identifier, the vertex origin and...
This is a implementation of a Directed Graph. By convention a directed graph provides access to out-e...
virtual bool isSinkVertex(int id, bool &flag)
This function indicates if a desired element is a sink vertex.
This class define the main functions necessary to save and load the graph data and metadata informati...
From the point of view of graph theory, vertices are treated as featureless and indivisible objects...
int getIdFrom()
It returns the vertex origin identification.
DirectedGraph()
constructor.
int getIdTo()
It returns the vertex destiny identification.
This is the main graph implementation, that uses a cache policy anda graph loader to get all elements...
virtual void add(Edge *e)
Add a new edge element to a graph.
int getId()
It returns the edge identification.
~DirectedGraph()
Virtual destructor.
This class is used to set the main functions of a cache policy.
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 std::vector< te::graph::Edge * > getOutEdges(int vId)
It returns all edges that came out a vertex.
virtual void removeEdge(int id)
This function removes the edge element from graph, also was removed in data source.
virtual void removeEdge(int id)
This function removes the edge element from graph, also was removed in data source.
std::set< int > & getNeighborhood()
Returns the Neighborhood vector.
virtual void add(Vertex *v)
Add a new vertex element to a graph.
std::set< int > & getSuccessors()
Returns the Successors vector.