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

Timestamp:

11/04/04 21:24:59 (19 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/lemon

Files:

• Makefile.am (modified) (1 diff)
• concept/graph.h (added)
• concept/graph_component.h (added)
• concept/maps.h (added)
• concept/path.h (added)
• concept/sym_graph.h (added)
• dijkstra.h (modified) (2 diffs)
• full_graph.h (modified) (1 diff)
• list_graph.h (modified) (1 diff)
• maps.h (modified) (1 diff)
• path.h (modified) (1 diff)
• skeletons/graph.h (deleted)
• skeletons/graph_component.h (deleted)
• skeletons/maps.h (deleted)
• skeletons/path.h (deleted)
• skeletons/sym_graph.h (deleted)
• smart_graph.h (modified) (1 diff)

src/lemon/Makefile.am

@@ -37 +37 @@
 
 noinst_HEADERS =                                                        \
-        skeletons/graph.h                                               \
-        skeletons/graph_component.h                                     \
-        skeletons/sym_graph.h                                           \
-        skeletons/maps.h                                                \
-        skeletons/path.h
+        concept/graph.h                                                 \
+        concept/graph_component.h                                       \
+        concept/sym_graph.h                                             \
+        concept/maps.h                                                  \
+        concept/path.h

src/lemon/dijkstra.h

@@ -34 +34 @@
   ///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.
@@ -49 +49 @@
   ///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>"
   ///\param Heap The heap type used by the %Dijkstra
   ///algorithm. The default

src/lemon/full_graph.h

@@ -195 +195 @@
   ///edges or nodes.
   ///Thus it conforms to
-  ///the \ref skeleton::StaticGraph "StaticGraph" concept
-  ///\sa skeleton::StaticGraph.
+  ///the \ref concept::StaticGraph "StaticGraph" concept
+  ///\sa concept::StaticGraph.
   ///\todo What about loops?
   ///\todo Don't we need SymEdgeMap?

src/lemon/list_graph.h

@@ -318 +318 @@
   ///
   ///It conforms to the
-  ///\ref skeleton::ErasableGraph "ErasableGraph" concept.
-  ///\sa skeleton::ErasableGraph.
+  ///\ref concept::ErasableGraph "ErasableGraph" concept.
+  ///\sa concept::ErasableGraph.
 
   class ListGraph : public ErasableListGraphBase 

src/lemon/maps.h

@@ -21 +21 @@
 ///\brief Miscellaneous property maps
 ///
-///\todo This file has the same name as the concept file in skeletons,
+///\todo This file has the same name as the concept file in concept/,
 /// and this is not easily detectable in docs...
 

src/lemon/path.h

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

src/lemon/smart_graph.h

@@ -230 +230 @@
   ///that <b> it does not support node and edge deletion</b>.
   ///It conforms to 
-  ///the \ref skeleton::ExtendableGraph "ExtendableGraph" concept.
-  ///\sa skeleton::ExtendableGraph.
+  ///the \ref concept::ExtendableGraph "ExtendableGraph" concept.
+  ///\sa concept::ExtendableGraph.
   ///
   ///\todo Some member functions could be \c static.