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
40#include <list>
41
42namespace Nektar
43{
44namespace LibUtilities
45{
47{
48public:
50 {
51 m_id = m_nextid++;
52 }
53
55 {
56 m_id = id;
57 }
58
59 inline size_t getid()
60 {
61 return m_id;
62 }
63
64 inline void setid(const GraphVertexID id)
65 {
66 m_id = id;
67 }
68
70
72 const GraphVertexObject &y);
74 const GraphVertexObject &y);
75
76protected:
77 GraphVertexID m_id; // vertex object identifier
78
79private:
81};
82
83// ------------------------------------------------------------------------
84
86{
87public:
88protected:
89 size_t m_gvoid1;
90 size_t m_gvoid2; // two graph vertex object identifiers which are being
91 // connected
92};
93
94// --------------------------------------------------------------------------
95
96class Graph
97{
98public:
101
102protected:
104 std::list<GraphVertexObject *> m_vertset;
105 std::list<GraphEdgeObject *> m_edgeset;
106};
107
108} // namespace LibUtilities
109} // namespace Nektar
110#endif // GRAPH_H
#define LIB_UTILITIES_EXPORT
std::list< GraphVertexObject * > m_vertset
Definition: Graph.h:104
std::list< GraphEdgeObject * > m_edgeset
Definition: Graph.h:105
friend bool operator!=(const GraphVertexObject &x, const GraphVertexObject &y)
Definition: Graph.cpp:62
static GraphVertexID m_nextid
Definition: Graph.h:80
friend bool operator==(const GraphVertexObject &x, const GraphVertexObject &y)
Definition: Graph.cpp:57
void setid(const GraphVertexID id)
Definition: Graph.h:64
GraphVertexObject(const GraphVertexID id)
Definition: Graph.h:54
The above copyright notice and this permission notice shall be included.
Definition: CoupledSolver.h:2