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

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/alpar

Files:

• dijkstra.h (modified) (2 diffs)
• list_graph_demo.cc (modified) (1 diff)

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>