69 #include <solution/graph/graph/ArrayVertexIter.h> 81 std::vector<Vertex *> theVertices;
85 int getArraySize(
void)
const;
95 virtual int addEdge(
int vertexTag,
int otherVertexTag);
103 virtual void Print(std::ostream &s)
const;
104 friend std::ostream &operator<<(std::ostream &s,
const ArrayGraph &M);
int getNumVertex(void) const
Returns the number of vertices del grafo.
Definition: ArrayGraph.cpp:236
Iterator over the vertices of the graph.
Definition: VertexIter.h:75
virtual VertexIter & getVertices(void)
Returns an iterator to the vertices of the graph.
Definition: ArrayGraph.cpp:228
Vertex of a graph.
Definition: Vertex.h:73
virtual Vertex * getVertexPtr(int vertexTag)
A method which returns a pointer to the vertex whose tag is given by vertexTag. The method first look...
Definition: ArrayGraph.cpp:160
int getNumEdge(void) const
Returns the número de aristas del grafo.
Definition: ArrayGraph.cpp:240
ArrayVertexIter is an iter for returning the vertices of an object of class ArrayGraph. ArrayVertexIter must be written for each subclass of ArrayGraph: wherin the vertices are stored differently to that in ArrayGraph.
Definition: ArrayVertexIter.h:77
Array de grafos.
Definition: ArrayGraph.h:76
virtual bool addVertex(const Vertex &vertexPtr)
Method to add a vertex to the graph. If the adjacency list of the vertex is not empty the graph will ...
Definition: ArrayGraph.cpp:96
The Graph class provides the abstraction of a graph, a collection of vertices and edges...
Definition: Graph.h:84
virtual int addEdge(int vertexTag, int otherVertexTag)
Adds an edge to the graph. Previously we check that its vertices are already defined in the graph...
Definition: ArrayGraph.cpp:208
================================================================================
Definition: ContinuaReprComponent.h:34