XC Open source finite element analysis program
ArrayGraph.h
1 //----------------------------------------------------------------------------
2 // XC program; finite element analysis code
3 // for structural analysis and design.
4 //
5 // Copyright (C) Luis Claudio Pérez Tato
6 //
7 // This program derives from OpenSees <http://opensees.berkeley.edu>
8 // developed by the «Pacific earthquake engineering research center».
9 //
10 // Except for the restrictions that may arise from the copyright
11 // of the original program (see copyright_opensees.txt)
12 // XC is free software: you can redistribute it and/or modify
13 // it under the terms of the GNU General Public License as published by
14 // the Free Software Foundation, either version 3 of the License, or
15 // (at your option) any later version.
16 //
17 // This software is distributed in the hope that it will be useful, but
18 // WITHOUT ANY WARRANTY; without even the implied warranty of
19 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 // GNU General Public License for more details.
21 //
22 //
23 // You should have received a copy of the GNU General Public License
24 // along with this program.
25 // If not, see <http://www.gnu.org/licenses/>.
26 //----------------------------------------------------------------------------
27 /* ****************************************************************** **
28 ** OpenSees - Open System for Earthquake Engineering Simulation **
29 ** Pacific Earthquake Engineering Research Center **
30 ** **
31 ** **
32 ** (C) Copyright 1999, The Regents of the University of California **
33 ** All Rights Reserved. **
34 ** **
35 ** Commercial use of this program without express permission of the **
36 ** University of California, Berkeley, is strictly prohibited. See **
37 ** file 'COPYRIGHT' in main directory for information on usage and **
38 ** redistribution, and for a DISCLAIMER OF ALL WARRANTIES. **
39 ** **
40 ** Developed by: **
41 ** Frank McKenna (fmckenna@ce.berkeley.edu) **
42 ** Gregory L. Fenves (fenves@ce.berkeley.edu) **
43 ** Filip C. Filippou (filippou@ce.berkeley.edu) **
44 ** **
45 ** ****************************************************************** */
46 
47 // $Revision: 1.2 $
48 // $Date: 2003/02/14 23:01:22 $
49 // $Source: /usr/local/cvs/OpenSees/SRC/graph/graph/ArrayGraph.h,v $
50 
51 
52 // File: ~/graph/graph/ArrayGraph.h
53 //
54 // Written: fmk
55 // Created: Sun Sept 15 11:47:47: 1996
56 // Revision: A
57 //
58 // Description: This file contains the class definition for ArrayGraph.
59 // The vertices in an ArrayGraph are held in an array. This is more efficient
60 // than holding them in a List data structure, but problems can arise with
61 // large Graphs in getting enough contiguous memory for the array.
62 //
63 // What: "@(#) ArrayGraph.h, revA"
64 
65 #ifndef ArrayGraph_h
66 #define ArrayGraph_h
67 
68 #include "Graph.h"
69 #include <solution/graph/graph/ArrayVertexIter.h>
70 #include <vector>
71 
72 namespace XC {
74 //
76 class ArrayGraph: public Graph
77  {
78  private:
79  int numVertex;
80  int lastEmpty;
81  std::vector<Vertex *> theVertices;
82  ArrayVertexIter myIter;
83  void libera(void);
84  protected:
85  int getArraySize(void) const;
86 
87  friend class ArrayVertexIter;
88  ArrayGraph(const ArrayGraph &);
89  ArrayGraph &operator=(const ArrayGraph &);
90  public:
91  ArrayGraph(int arraySize);
92  virtual ~ArrayGraph(void);
93 
94  virtual bool addVertex(const Vertex &vertexPtr);
95  virtual int addEdge(int vertexTag, int otherVertexTag);
96 
97  virtual Vertex *getVertexPtr(int vertexTag);
98  virtual const Vertex *getVertexPtr(int vertexTag) const;
99  virtual VertexIter &getVertices(void);
100  int getNumVertex(void) const;
101  int getNumEdge(void) const;
102 
103  virtual void Print(std::ostream &s) const;
104  friend std::ostream &operator<<(std::ostream &s, const ArrayGraph &M);
105  };
106 } // end of XC namespace
107 
108 #endif
109 
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