1.1 --- a/src/work/alpar/emptygraph.h Thu Mar 11 23:31:13 2004 +0000
1.2 +++ b/src/work/alpar/emptygraph.h Fri Mar 12 09:19:54 2004 +0000
1.3 @@ -1,4 +1,6 @@
1.4 -// -*-mode: c++; -*-
1.5 +// -*- c++ -*-
1.6 +#ifndef EMPTYGRAPH_H
1.7 +#define EMPTYGRAPH_H
1.8
1.9 #include <invalid.h>
1.10
1.11 @@ -34,7 +36,7 @@
1.12 /// to an undefined value.
1.13 Node() {} //FIXME
1.14 /// Initialize the iterator to be invalid
1.15 - Node(Invalid) {};
1.16 + Node(Invalid) {}
1.17 //Node(const Node &) {}
1.18 bool operator==(Node n) const { return true; } //FIXME
1.19 bool operator!=(Node n) const { return true; } //FIXME
1.20 @@ -47,7 +49,7 @@
1.21 /// to an undefined value.
1.22 NodeIt() {} //FIXME
1.23 /// Initialize the iterator to be invalid
1.24 - NodeIt(Invalid) {};
1.25 + NodeIt(Invalid) {}
1.26 /// Sets the iterator to the first node of \c G.
1.27 NodeIt(const EmptyGraph &G) {}
1.28 NodeIt(const NodeIt &) {} //FIXME
1.29 @@ -61,7 +63,7 @@
1.30 /// to an undefined value.
1.31 Edge() {} //FIXME
1.32 /// Initialize the iterator to be invalid
1.33 - Edge(Invalid) {};
1.34 + Edge(Invalid) {}
1.35 //Edge(const Edge &) {}
1.36 bool operator==(Edge n) const { return true; } //FIXME
1.37 bool operator!=(Edge n) const { return true; } //FIXME
1.38 @@ -75,7 +77,7 @@
1.39 /// to an undefined value.
1.40 OutEdgeIt() {}
1.41 /// Initialize the iterator to be invalid
1.42 - OutEdgeIt(Invalid) {};
1.43 + OutEdgeIt(Invalid) {}
1.44 /// This constructor sets the iterator to first outgoing edge.
1.45
1.46 /// This constructor set the iterator to the first outgoing edge of
1.47 @@ -91,7 +93,7 @@
1.48 /// to an undefined value.
1.49 InEdgeIt() {}
1.50 /// Initialize the iterator to be invalid
1.51 - InEdgeIt(Invalid) {};
1.52 + InEdgeIt(Invalid) {}
1.53 InEdgeIt(const EmptyGraph &, Node) {}
1.54 };
1.55 // class SymEdgeIt : public Edge {};
1.56 @@ -101,7 +103,7 @@
1.57 /// to an undefined value.
1.58 EdgeIt() {}
1.59 /// Initialize the iterator to be invalid
1.60 - EdgeIt(Invalid) {};
1.61 + EdgeIt(Invalid) {}
1.62 EdgeIt(const EmptyGraph &) {}
1.63 };
1.64
1.65 @@ -149,14 +151,14 @@
1.66 // Node bNode(SymEdgeIt) const {}
1.67
1.68 /// Checks if a node iterator is valid
1.69 - bool valid(const Node) const { return true;};
1.70 + bool valid(const Node) const { return true;}
1.71 /// Checks if an edge iterator is valid
1.72 - bool valid(const Edge) const { return true;};
1.73 + bool valid(const Edge) const { return true;}
1.74
1.75 ///Gives back the \e id of a node.
1.76 - int id(const Node) const { return 0;};
1.77 + int id(const Node) const { return 0;}
1.78 ///Gives back the \e id of an edge.
1.79 - int id(const Edge) const { return 0;};
1.80 + int id(const Edge) const { return 0;}
1.81
1.82 //void setInvalid(Node &) const {};
1.83 //void setInvalid(Edge &) const {};
1.84 @@ -172,8 +174,8 @@
1.85 int nodeNum() { return 0;}
1.86 int edgeNum() { return 0;}
1.87
1.88 - EmptyGraph() {};
1.89 - EmptyGraph(const EmptyGraph &G) {};
1.90 + EmptyGraph() {}
1.91 + EmptyGraph(const EmptyGraph &G) {}
1.92
1.93
1.94
1.95 @@ -217,7 +219,7 @@
1.96
1.97 // @}
1.98
1.99 -};
1.100 +} //namespace hugo
1.101
1.102
1.103
1.104 @@ -236,3 +238,5 @@
1.105 // NodeClass getClass(Node n) {}
1.106
1.107 // }
1.108 +
1.109 +#endif // EMPTYGRAPH_H