1.1 --- a/src/include/skeletons/graph.h Wed Apr 14 11:42:38 2004 +0000
1.2 +++ b/src/include/skeletons/graph.h Wed Apr 14 11:48:46 2004 +0000
1.3 @@ -31,7 +31,11 @@
1.4 class GraphSkeleton
1.5 {
1.6 public:
1.7 -
1.8 + /// Defalult constructor.
1.9 + GraphSkeleton() {}
1.10 + ///Copy consructor.
1.11 + GraphSkeleton(const GraphSkeleton &G) {}
1.12 +
1.13 /// The base type of the node iterators.
1.14
1.15 /// This is the base type of each node iterators,
1.16 @@ -219,23 +223,23 @@
1.17
1.18 ///\todo Maybe, it would be better if iterator converted to
1.19 ///bool directly, as Jacint prefers.
1.20 - bool valid(const Node) const { return true;}
1.21 + bool valid(const Node&) const { return true;}
1.22 /// Checks if an edge iterator is valid
1.23
1.24 ///\todo Maybe, it would be better if iterator converted to
1.25 ///bool directly, as Jacint prefers.
1.26 - bool valid(const Edge) const { return true;}
1.27 + bool valid(const Edge&) const { return true;}
1.28
1.29 ///Gives back the \e id of a node.
1.30
1.31 ///\warning Not all graph structures provide this feature.
1.32 ///
1.33 - int id(const Node) const { return 0;}
1.34 + int id(const Node&) const { return 0;}
1.35 ///Gives back the \e id of an edge.
1.36
1.37 ///\warning Not all graph structures provide this feature.
1.38 ///
1.39 - int id(const Edge) const { return 0;}
1.40 + int id(const Edge&) const { return 0;}
1.41
1.42 //void setInvalid(Node &) const {};
1.43 //void setInvalid(Edge &) const {};
1.44 @@ -260,13 +264,6 @@
1.45
1.46 int nodeNum() const { return 0;}
1.47 int edgeNum() const { return 0;}
1.48 -
1.49 - /// Defalult constructor.
1.50 - GraphSkeleton() {}
1.51 - ///Copy consructor.
1.52 - GraphSkeleton(const GraphSkeleton &G) {}
1.53 -
1.54 -
1.55
1.56 ///Read/write/reference map of the nodes to type \c T.
1.57