28 #ifndef __TERRALIB_GRAPH_INTERNAL_BIDIRECTIONALGRAPH_H
29 #define __TERRALIB_GRAPH_INTERNAL_BIDIRECTIONALGRAPH_H
32 #include "../Config.h"
43 class AbstractCachePolicy;
44 class AbstractGraphLoaderStrategy;
88 virtual std::vector<te::graph::Vertex*> getVertexNeighborhood(
int id);
99 virtual bool isIsolateVertex(
int id,
bool& flag);
110 virtual bool isSourceVertex(
int id,
bool& flag);
121 virtual bool isSinkVertex(
int id,
bool& flag);
139 virtual void add(
Edge* e);
148 virtual void removeEdge(
int id);
157 virtual std::vector<te::graph::Edge*> getInEdges(
int vId);
166 virtual std::vector<te::graph::Edge*> getOutEdges(
int vId);
175 #endif // __TERRALIB_GRAPH_INTERNAL_BIDIRECTIONALGRAPH_H
Class used to define the edge struct of a graph. Its compose with a identifier, the vertex origin and...
#define TEGRAPHEXPORT
You can use this macro in order to export/import classes and functions from this module.
This class define the main functions necessary to save and load the graph data and metadata informati...
This is the main graph implementation, that uses a cache policy anda graph loader to get all elements...
This is the main graph implementation, that uses a cache policy anda graph loader to get all elements...
This class is used to set the main functions of a cache policy.
This is a implementation of a Bidirectional Graph. By convention a bidirectional graph provides acces...