Changeset 2281:55b15666560f in lemon-0.x for doc

Timestamp:

10/31/06 10:32:44 (17 years ago)

Author:

mqrelly

Branch:

default

Phase:

public

Convert:

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

Message:

tutorial update
algorithms, and graph visualisation

Location:

doc

Files:

• algorithms.dox (modified) (2 diffs)
• tutorial.dox (modified) (2 diffs)

doc/algorithms.dox

@@ -95 +95 @@
 First of all we will need an own \ref lemon::Dfs::ProcessedMap "ProcessedMap". The ordering
 will be done through it.
-\skip SerializingWriteMap
+\skip MyOrdererMap
 \until };
 The class meets the \ref lemon::WriteMap "WriteMap" concept. In it's \c set() method the only thing
 we need to do is insert the key - that is the node who's processing just finished - into the beginning
-of the list.
+of the list.<br>
+Although we implemented this needed helper class ourselves it was not necessary.
+The \ref lemon::FrontInserterBoolMap "FrontInserterBoolMap" class does exactly
+what we needed. To be correct it's more general - and it's all in \c LEMON. But
+we wanted to show you, how easy is to add additional functionality.
 
 First we declare the needed data structures: the graph and a map to store the nodes' label.
@@ -127 +131 @@
 
 The program is to be found in the \ref demo directory: \ref topological_ordering.cc
+
+More algorithms are described in the \ref algorithms2 "second part".
 */
 }

doc/tutorial.dox

@@ -24 +24 @@
   <UL>
     <LI>\ref algo_bfs_dfs
-    <LI>Dijkstra
-    <LI>Kruskal
+    <LI>\ref algo_dijkstra
+    <LI>\ref algo_kruskal
   </UL>
   <LI>\ref maps2
@@ -33 +33 @@
     <LI>Special Purpose Maps
   </UL>
-  <LI>Show a graph
+  <LI>\ref show_a_graph
   <LI>Miscellaneous Tool
   <UL>