libgexf  0.1.3
undirectedgraph.h
Go to the documentation of this file.
1 
7 /*
8 # Copyright (c) <2009> <Sebastien Heymann>
9 #
10 # Permission is hereby granted, free of charge, to any person obtaining a copy
11 # of this software and associated documentation files (the "Software"), to deal
12 # in the Software without restriction, including without limitation the rights
13 # to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
14 # copies of the Software, and to permit persons to whom the Software is
15 # furnished to do so, subject to the following conditions:
16 #
17 # The above copyright notice and this permission notice shall be included in
18 # all copies or substantial portions of the Software.
19 #
20 # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
21 # IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
22 # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
23 # AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
24 # LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
25 # OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
26 # THE SOFTWARE.
27 */
28 
29 #ifndef _UNDIRECTEDGRAPH_H
30 #define _UNDIRECTEDGRAPH_H
31 
32 #include "graph.h"
33 
34 namespace libgexf {
35 
39 class UndirectedGraph: public Graph {
40 public:
42 
46  UndirectedGraph(const UndirectedGraph& orig);
47 
48  virtual ~UndirectedGraph();
49 
53  //void mergeSimilarEdges();
54 private:
55  UndirectedGraph& operator=(const UndirectedGraph& orig);
56 };
57 
58 }
59 
60 #endif /* _UNDIRECTEDGRAPH_H */
61 
Definition: abstractiter.h:32
Interpretation of the topology structure as a undirected graph.
Definition: undirectedgraph.h:39
Topology structure of the graph.
Definition: graph.h:49