Changeset 831:b6ae3446098a in lemon-0.x for src/hugo/skeletons

Timestamp:

09/12/04 23:46:26 (20 years ago)

Author:

Hegyi Péter

Branch:

default

Phase:

public

Convert:

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

Message:

The first version of new path test program. The old became old_path_test.

File:

• src/hugo/skeletons/path.h (modified) (13 diffs)

src/hugo/skeletons/path.h

@@ -1 @@
-#define SKELETON
 // -*- c++ -*- //
 
@@ -6 +5 @@
 ///\brief Classes for representing paths in graphs.
 
-#ifndef HUGO_PATH_H
-#define HUGO_PATH_H
+#ifndef HUGO_SKELETON_PATH_H
+#define HUGO_SKELETON_PATH_H
 
 #include <hugo/invalid.h>
@@ -15 +14 @@
     /// \addtogroup skeletons
     /// @{
-    
-    
+
+
     //! \brief A skeletom structure for representing directed paths in a graph.
     //!
     //! A skeleton structure for representing directed paths in a graph.
     //! \param GR The graph type in which the path is.
-    //! 
+    //!
     //! In a sense, the path can be treated as a graph, for is has \c NodeIt
     //! and \c EdgeIt with the same usage. These types converts to the \c Node
@@ -28 +27 @@
     class Path {
     public:
-      
+
       /// Type of the underlying graph.
       typedef /*typename*/ GR Graph;
       /// Edge type of the underlying graph.
-      typedef typename Graph::Edge GraphEdge; 
+      typedef typename Graph::Edge GraphEdge;
       /// Node type of the underlying graph.
      typedef typename Graph::Node GraphNode;
       class NodeIt;
       class EdgeIt;
-      
+
       /// \param _G The graph in which the path is.
       ///
       Path(const Graph &_G) {}
-      
+
       /// Length of the path.
       size_t length() const {return 0;}
       /// Returns whether the path is empty.
-      bool empty() const {}
-      
+      bool empty() const { return true;}
+
       /// Resets the path to an empty path.
       void clear() {}
@@ -72 +71 @@
       /// Returns node iterator pointing to the head node of the
       /// given edge iterator.
-      NodeIt head(const EdgeIt& e) const {}
+      NodeIt head(const EdgeIt& e) const {return INVALID;}
 
       /// \brief The tail of an edge.
@@ -78 +77 @@
       /// Returns node iterator pointing to the tail node of the
       /// given edge iterator.
-      NodeIt tail(const EdgeIt& e) const {}
+      NodeIt tail(const EdgeIt& e) const {return INVALID;}
 
 
@@ -85 +84 @@
       /**
        * \brief Iterator class to iterate on the edges of the paths
-       * 
+       *
        * \ingroup skeletons
        * This class is used to iterate on the edges of the paths
        *
        * Of course it converts to Graph::Edge
-       * 
+       *
        */
       class EdgeIt {
@@ -104 +103 @@
 
         /// Next edge
-        EdgeIt& operator++() {}
+        EdgeIt& operator++() {return *this;}
 
         /// Comparison operator
@@ -118 +117 @@
       /**
        * \brief Iterator class to iterate on the nodes of the paths
-       * 
+       *
        * \ingroup skeletons
        * This class is used to iterate on the nodes of the paths
        *
        * Of course it converts to Graph::Node.
-       * 
+       *
        */
       class NodeIt {
@@ -137 +136 @@
         operator const GraphNode& () const {}
         /// Next node
-        NodeIt& operator++() {}
-
-        /// Comparison operator
-        bool operator==(const NodeIt& e) const {}
-        /// Comparison operator
-        bool operator!=(const NodeIt& e) const {}
+        NodeIt& operator++() {return *this;}
+
+        /// Comparison operator
+        bool operator==(const NodeIt& e) const {return true;}
+        /// Comparison operator
+        bool operator!=(const NodeIt& e) const {return true;}
 //      /// Comparison operator
 //      /// \todo It is not clear what is the "natural" ordering.
@@ -149 +148 @@
       };
 
-      friend class Builder;    
+      friend class Builder;
 
       /**
        * \brief Class to build paths
-       * 
+       *
        * \ingroup skeletons
        * This class is used to fill a path with edges.
@@ -175 +174 @@
 
         /// Sets the starting node of the path.
-      
+
         /// Sets the starting node of the path. Edge added to the path
         /// afterwards have to be incident to this node.
@@ -218 +217 @@
   ///@}
   }
-  
+
 } // namespace hugo
 
-#endif // HUGO_PATH_H
+#endif // HUGO_SKELETON_PATH_H