Nektar++
Graph.h
Go to the documentation of this file.
1 ////////////////////////////////////////////////////////////////////////////////
2 //
3 // File: Graph.h
4 //
5 // For more information, please see: http://www.nektar.info/
6 //
7 // The MIT License
8 //
9 // Copyright (c) 2006 Division of Applied Mathematics, Brown University (USA),
10 // Department of Aeronautics, Imperial College London (UK), and Scientific
11 // Computing and Imaging Institute, University of Utah (USA).
12 //
13 // Permission is hereby granted, free of charge, to any person obtaining a
14 // copy of this software and associated documentation files (the "Software"),
15 // to deal in the Software without restriction, including without limitation
16 // the rights to use, copy, modify, merge, publish, distribute, sublicense,
17 // and/or sell copies of the Software, and to permit persons to whom the
18 // Software is furnished to do so, subject to the following conditions:
19 //
20 // The above copyright notice and this permission notice shall be included
21 // in all copies or substantial portions of the Software.
22 //
23 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
24 // OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
25 // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
26 // THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
27 // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
28 // FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
29 // DEALINGS IN THE SOFTWARE.
30 //
31 // Description:
32 //
33 //
34 ////////////////////////////////////////////////////////////////////////////////
35 #ifndef GRAPH_H
36 #define GRAPH_H
37 
38 #include <list>
41 
42 namespace Nektar
43 {
44  namespace LibUtilities
45  {
47  {
48  public:
49 
51  {
52  m_id = m_nextid++;
53  }
54  // virtual int ReadFromFile(FILE * fp) = 0;
55  // virtual int WriteToFile(FILE * fp) = 0;
56 
58  {
59  m_id = id;
60  }
61 
62  inline int getid()
63  {
64  return m_id;
65  }
66 
67  inline void setid(const GraphVertexID id)
68  {
69  m_id = id;
70  }
71 
73 
75  const GraphVertexObject &y);
77  const GraphVertexObject &y);
78 
79  protected:
80  GraphVertexID m_id; //vertex object identifier
81 
82  private:
84  };
85 
86  // ------------------------------------------------------------------------
87 
89  {
90  public:
91 
92  protected:
93  int m_gvoid1;
94  int m_gvoid2; //two graph vertex object identifiers which are being connected
95  };
96 
97  // --------------------------------------------------------------------------
98 
99  class Graph
100  {
101 
102  public:
104  LIB_UTILITIES_EXPORT ~Graph();
105 
106  protected:
108  std::list<GraphVertexObject*> m_vertset;
109  std::list<GraphEdgeObject*> m_edgeset;
110 
111  };
112 
113  } //end of namespace
114 } //end of namespace
115 #endif // GRAPH_H
116 
void setid(const GraphVertexID id)
Definition: Graph.h:67
friend bool operator!=(const GraphVertexObject &x, const GraphVertexObject &y)
Definition: Graph.cpp:62
#define LIB_UTILITIES_EXPORT
friend bool operator==(const GraphVertexObject &x, const GraphVertexObject &y)
Definition: Graph.cpp:57
static GraphVertexID m_nextid
Definition: Graph.h:83
std::list< GraphEdgeObject * > m_edgeset
Definition: Graph.h:109
GraphVertexObject(const GraphVertexID id)
Definition: Graph.h:57
std::list< GraphVertexObject * > m_vertset
Definition: Graph.h:108