29 #include "../../common/STLUtils.h"
30 #include "../core/GraphCache.h"
31 #include "../core/GraphData.h"
32 #include "../core/GraphDataManager.h"
33 #include "../core/Edge.h"
34 #include "../core/Vertex.h"
57 std::vector<te::graph::Vertex*> vec;
63 std::vector<int> edges;
68 for(
size_t i = 0; i < edges.size(); ++i)
78 vNeighbor = getVertex(e->
getIdTo());
87 vec.push_back(vNeighbor);
161 if(m_graphCache->checkCacheByVertexId(e->
getIdFrom()))
168 if(m_graphCache->checkCacheByVertexId(e->
getIdTo()))
232 std::vector<te::graph::Edge*> vec;
258 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...
virtual std::vector< te::graph::Edge * > getInEdges(int vId)
It returns all edges that came in a vertex.
This class define the main functions necessary to save and load the graph data and metadata informati...
virtual bool isSourceVertex(int id, bool &flag)
This function indicates if a desired element is a source vertex.
From the point of view of graph theory, vertices are treated as featureless and indivisible objects...
int getIdFrom()
It returns the vertex origin identification.
This is a implementation of a Bidirectional Graph. By convention a bidirectional graph provides acces...
int getIdTo()
It returns the vertex destiny identification.
virtual void add(Edge *e)
Add a new edge element to a graph.
This is the main graph implementation, that uses a cache policy anda graph loader to get all elements...
BidirectionalGraph()
constructor.
virtual bool isIsolateVertex(int id, bool &flag)
This function indicates if a desired element is a isolated vertex.
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...
virtual void removeEdge(int id)
This function removes the edge element from graph, also was removed in data source.
std::set< int > & getPredecessors()
Returns the Predecessors vector.
virtual bool isSinkVertex(int id, bool &flag)
This function indicates if a desired element is a sink vertex.
int getId()
It returns the edge identification.
This class is used to set the main functions of a cache policy.
~BidirectionalGraph()
Virtual destructor.
virtual void removeEdge(int id)
This function removes the edge element from graph, also was removed in data source.
virtual void add(Vertex *v)
Add a new vertex element to a graph.
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...
std::set< int > & getSuccessors()
Returns the Successors vector.