Changeset 959:c80ef5912903 in lemon-0.x for src/work

Timestamp:

11/04/04 21:24:59 (20 years ago)

Author:

Mihaly Barasz

Branch:

default

Phase:

public

Convert:

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

Message:

skeleton(s) -> concept renaming

Location:

src/work

Files:

• Doxyfile (modified) (1 diff)
• alpar/dijkstra.h (modified) (2 diffs)
• alpar/list_graph_demo.cc (modified) (1 diff)
• marci/bfs_mm_test.cc (modified) (2 diffs)
• peter/path/path.h (modified) (1 diff)
• peter/path/path_skeleton.h (modified) (5 diffs)
• peter/path/path_test.cc (modified) (1 diff)

src/work/Doxyfile

@@ -397 +397 @@
                          ../../doc/groups.dox \
                          ../lemon \
-                         ../lemon/skeletons \
+                         ../lemon/concept \
                          ../test/test_tools.h \
                          klao/path.h \

src/work/alpar/dijkstra.h

@@ -101 +101 @@
   ///This class provides an efficient implementation of %Dijkstra algorithm.
   ///The edge lengths are passed to the algorithm using a
-  ///\ref skeleton::ReadMap "ReadMap",
+  ///\ref concept::ReadMap "ReadMap",
   ///so it is easy to change it to any kind of length.
   ///
   ///The type of the length is determined by the
-  ///\ref skeleton::ReadMap::ValueType "ValueType" of the length map.
+  ///\ref concept::ReadMap::ValueType "ValueType" of the length map.
   ///
   ///It is also possible to change the underlying priority heap.
@@ -118 +118 @@
   ///may involve in relatively time consuming process to compute the edge
   ///length if it is necessary. The default map type is
-  ///\ref skeleton::StaticGraph::EdgeMap "Graph::EdgeMap<int>".
+  ///\ref concept::StaticGraph::EdgeMap "Graph::EdgeMap<int>".
   ///The value of LM is not used directly by Dijkstra, it
   ///is only passed to \ref DijkstraDefaultTraits.

src/work/alpar/list_graph_demo.cc

@@ -1 +1 @@
 #include<list_graph.h>
-#include<skeletons/graph.h>
+#include<concept/graph.h>
 
 #include <iostream>

src/work/marci/bfs_mm_test.cc

@@ -18 +18 @@
 #include <lemon/smart_graph.h>
 #include <bfs_mm.h>
-#include <lemon/skeletons/graph.h>
+#include <lemon/concept/graph.h>
 
 using namespace lemon;
@@ -27 +27 @@
 void check_Bfs_Compile() 
 {
-  typedef skeleton::StaticGraph Graph;
+  typedef concept::StaticGraph Graph;
 
   typedef Graph::Edge Edge;

src/work/peter/path/path.h

@@ -13 +13 @@
 algorithm to store its result in any kind of path structure.
 
-\sa lemon::skeleton::Path
+\sa lemon::concept::Path
 
 */

src/work/peter/path/path_skeleton.h

@@ -2 +2 @@
 // -*- c++ -*- //
 
-///\ingroup skeletons
+///\ingroup concept
 ///\file
 ///\brief Classes for representing paths in graphs.
@@ -12 +12 @@
 
 namespace lemon {
-  namespace skeleton {
-    /// \addtogroup skeletons
+  namespace concept {
+    /// \addtogroup concept
     /// @{
     
     
-    //! \brief A skeletom structure for representing directed paths in a graph.
+    //! \brief A skeleton structure for representing directed paths in a graph.
     //!
     //! A skeleton structure for representing directed paths in a graph.
@@ -86 +86 @@
        * \brief Iterator class to iterate on the edges of the paths
        * 
-       * \ingroup skeletons
+       * \ingroup concept
        * This class is used to iterate on the edges of the paths
        *
@@ -119 +119 @@
        * \brief Iterator class to iterate on the nodes of the paths
        * 
-       * \ingroup skeletons
+       * \ingroup concept
        * This class is used to iterate on the nodes of the paths
        *
@@ -154 +154 @@
        * \brief Class to build paths
        * 
-       * \ingroup skeletons
+       * \ingroup concept
        * This class is used to fill a path with edges.
        *

src/work/peter/path/path_test.cc

@@ -7 +7 @@
 using namespace std;
 using namespace lemon;
-using namespace skeleton;
+using namespace concept;
 
 bool passed = true;