Changeset 320:190ecba15b33 in lemon-0.x for src

Timestamp:

04/14/04 13:48:46 (21 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

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

Message:

constructor az elejere

File:

• src/include/skeletons/graph.h (modified) (4 diffs)

src/include/skeletons/graph.h

@@ -32 +32 @@
   {
   public:
-    
+    /// Defalult constructor.
+    GraphSkeleton() {}
+    ///Copy consructor.
+    GraphSkeleton(const GraphSkeleton &G) {}
+
     /// The base type of the node iterators.
 
@@ -220 +224 @@
     ///\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.
@@ -231 +235 @@
     ///\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 {};
@@ -261 +265 @@
     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.