# HG changeset patch
# User marci
# Date 1081943326 0
# Node ID 190ecba15b33b5a1f24b8d90769b3833cc039922
# Parent  98e15ff8dc3bdc6e925b0b81873ce20e9e665de3
constructor az elejere

diff -r 98e15ff8dc3b -r 190ecba15b33 src/include/skeletons/graph.h
--- a/src/include/skeletons/graph.h	Wed Apr 14 11:42:38 2004 +0000
+++ b/src/include/skeletons/graph.h	Wed Apr 14 11:48:46 2004 +0000
@@ -31,7 +31,11 @@
   class GraphSkeleton
   {
   public:
-    
+    /// Defalult constructor.
+    GraphSkeleton() {}
+    ///Copy consructor.
+    GraphSkeleton(const GraphSkeleton &G) {}
+
     /// The base type of the node iterators.
 
     /// This is the base type of each node iterators,
@@ -219,23 +223,23 @@
 
     ///\todo Maybe, it would be better if iterator converted to
     ///bool directly, as Jacint prefers.
-    bool valid(const Node) const { return true;}
+    bool valid(const Node&) const { return true;}
     /// Checks if an edge iterator is valid
 
     ///\todo Maybe, it would be better if iterator converted to
     ///bool directly, as Jacint prefers.
-    bool valid(const Edge) const { return true;}
+    bool valid(const Edge&) const { return true;}
 
     ///Gives back the \e id of a node.
 
     ///\warning Not all graph structures provide this feature.
     ///
-    int id(const Node) const { return 0;}
+    int id(const Node&) const { return 0;}
     ///Gives back the \e id of an edge.
 
     ///\warning Not all graph structures provide this feature.
     ///
-    int id(const Edge) const { return 0;}
+    int id(const Edge&) const { return 0;}
 
     //void setInvalid(Node &) const {};
     //void setInvalid(Edge &) const {};
@@ -260,13 +264,6 @@
 
     int nodeNum() const { return 0;}
     int edgeNum() const { return 0;}
- 
-    /// Defalult constructor.
-    GraphSkeleton() {}
-    ///Copy consructor.
-    GraphSkeleton(const GraphSkeleton &G) {}
-  
- 
 
     ///Read/write/reference map of the nodes to type \c T.