Changeset 174:44700ed9ffaa in lemon-0.x for src/work/alpar/emptygraph.h

Timestamp:

03/12/04 10:19:54 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@250

Message:

towards on ListGraph?, SmartGraph? compatibility

File:

• src/work/alpar/emptygraph.h (modified) (11 diffs)

src/work/alpar/emptygraph.h

@@ -1 @@
-// -*-mode: c++; -*-
+// -*- c++ -*-
+#ifndef EMPTYGRAPH_H
+#define EMPTYGRAPH_H
 
 #include <invalid.h>
@@ -35 +37 @@
       Node() {}   //FIXME
       /// Initialize the iterator to be invalid
-      Node(Invalid) {};
+      Node(Invalid) {}
       //Node(const Node &) {} 
       bool operator==(Node n) const { return true; } //FIXME
@@ -48 +50 @@
       NodeIt() {} //FIXME
       /// Initialize the iterator to be invalid
-      NodeIt(Invalid) {};
+      NodeIt(Invalid) {}
       /// Sets the iterator to the first node of \c G.
       NodeIt(const EmptyGraph &G) {}
@@ -62 +64 @@
       Edge() {}   //FIXME
       /// Initialize the iterator to be invalid
-      Edge(Invalid) {};
+      Edge(Invalid) {}
       //Edge(const Edge &) {} 
       bool operator==(Edge n) const { return true; } //FIXME
@@ -76 +78 @@
       OutEdgeIt() {}
       /// Initialize the iterator to be invalid
-      OutEdgeIt(Invalid) {};
+      OutEdgeIt(Invalid) {}
       /// This constructor sets the iterator to first outgoing edge.
     
@@ -92 +94 @@
       InEdgeIt() {}
       /// Initialize the iterator to be invalid
-      InEdgeIt(Invalid) {};
+      InEdgeIt(Invalid) {}
       InEdgeIt(const EmptyGraph &, Node) {}    
     };
@@ -102 +104 @@
       EdgeIt() {}
       /// Initialize the iterator to be invalid
-      EdgeIt(Invalid) {};
+      EdgeIt(Invalid) {}
       EdgeIt(const EmptyGraph &) {}
     };
@@ -150 +152 @@
 
     /// Checks if a node iterator is valid
-    bool valid(const Node) const { return true;};
+    bool valid(const Node) const { return true;}
     /// Checks if an edge iterator is valid
-    bool valid(const Edge) const { return true;};
+    bool valid(const Edge) const { return true;}
 
     ///Gives back the \e id of a node.
-    int id(const Node) const { return 0;};
+    int id(const Node) const { return 0;}
     ///Gives back the \e id of an edge.
-    int id(const Edge) const { return 0;};
+    int id(const Edge) const { return 0;}
 
     //void setInvalid(Node &) const {};
@@ -173 +175 @@
     int edgeNum() { return 0;}
 
-    EmptyGraph() {};
-    EmptyGraph(const EmptyGraph &G) {};
+    EmptyGraph() {}
+    EmptyGraph(const EmptyGraph &G) {}
   
   
@@ -218 +220 @@
   // @}
 
-};
+} //namespace hugo
 
 
@@ -237 +239 @@
 
 // }
+
+#endif // EMPTYGRAPH_H