27 #include "../../common/Translator.h" 
   28 #include "../../common/StringUtils.h" 
   29 #include "../iterator/AbstractIterator.h" 
   30 #include "../Config.h" 
   31 #include "../Exception.h" 
   47     throw Exception(
TR_GRAPH(
"Iterator not defined"));
 
   50   return m_iterator->getFirstVertex();
 
   57     throw Exception(
TR_GRAPH(
"Iterator not defined"));
 
   60   return m_iterator->getNextVertex();
 
   67     throw Exception(
TR_GRAPH(
"Iterator not defined"));
 
   70   return m_iterator->getPreviousVertex();
 
   77     throw Exception(
TR_GRAPH(
"Iterator not defined"));
 
   80   return m_iterator->getFirstEdge();
 
   87     throw Exception(
TR_GRAPH(
"Iterator not defined"));
 
   90   return m_iterator->getNextEdge();
 
   97     throw Exception(
TR_GRAPH(
"Iterator not defined"));
 
  100   return m_iterator->getPreviousEdge();
 
te::graph::Edge * getPreviousEdge()
It returns a pointer to the previous edge element of a graph. 
 
Class used to define the edge struct of a graph. Its compose with a identifier, the vertex origin and...
 
void setIterator(te::graph::AbstractIterator *i)
Used to associate a iterator to graph. 
 
From the point of view of graph theory, vertices are treated as featureless and indivisible objects...
 
#define TR_GRAPH(message)
It marks a string in order to get translated. This is a special mark used in the Graph module of Terr...
 
virtual te::graph::Vertex * getNextVertex()
It returns a pointer to the next vertex element of a graph. 
 
virtual te::graph::Vertex * getPreviousVertex()
It returns a pointer to the previous vertex element of a graph. 
 
virtual ~AbstractGraph()
Virtual destructor. 
 
te::graph::Edge * getNextEdge()
It returns a pointer to the next edge element of a graph. 
 
This class defines a commun interface to represents a graph iterator class. The main diferency to ano...
 
te::graph::Edge * getFirstEdge()
It returns a pointer to the first edge element of a graph. 
 
AbstractGraph()
Default constructor. 
 
te::graph::AbstractIterator * getIterator()
Used to get a iterator associated to graph. 
 
Abstract class used to define the main functions of graph struct. All graph implementations must used...
 
virtual te::graph::Vertex * getFirstVertex()
It returns a pointer to the first vertex element of a graph.