[Lemon-commits] [lemon_svn] mqrelly: r3045 - in hugo/trunk: demo doc

[Lemon SVN]

Author: mqrelly
Date: Tue Oct 31 10:32:44 2006
New Revision: 3045

Modified:
   hugo/trunk/demo/kruskal_demo.cc
   hugo/trunk/doc/algorithms.dox
   hugo/trunk/doc/tutorial.dox

Log:
tutorial update
algorithms, and graph visualisation


Modified: hugo/trunk/demo/kruskal_demo.cc
==============================================================================
--- hugo/trunk/demo/kruskal_demo.cc	(original)
+++ hugo/trunk/demo/kruskal_demo.cc	Tue Oct 31 10:32:44 2006
@@ -106,13 +106,12 @@
 
   int k=0;
   std::cout << "The edges of the tree:" ;
-  for(EdgeIt i(g); i!=INVALID; ++i){
-
+  for(EdgeIt i(g); i!=INVALID; ++i)
     if (tree_map[i]) { 
       std::cout << g.id(i) <<";";
       ++k;
     }
-  }
+
   std::cout << std::endl;
   std::cout << "The size of the tree is: "<< k << std::endl;
 

Modified: hugo/trunk/doc/algorithms.dox
==============================================================================
--- hugo/trunk/doc/algorithms.dox	(original)
+++ hugo/trunk/doc/algorithms.dox	Tue Oct 31 10:32:44 2006
@@ -94,11 +94,15 @@
 \dontinclude topological_ordering.cc
 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.
 \skip ListGraph
@@ -126,5 +130,7 @@
 \until endl
 
 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".
 */
 }

Modified: hugo/trunk/doc/tutorial.dox
==============================================================================
--- hugo/trunk/doc/tutorial.dox	(original)
+++ hugo/trunk/doc/tutorial.dox	Tue Oct 31 10:32:44 2006
@@ -23,8 +23,8 @@
   <LI>\ref algorithms
   <UL>
     <LI>\ref algo_bfs_dfs
-    <LI>Dijkstra
-    <LI>Kruskal
+    <LI>\ref algo_dijkstra
+    <LI>\ref algo_kruskal
   </UL>
   <LI>\ref maps2
   <UL>
@@ -32,7 +32,7 @@
     <LI>Map Adaptors
     <LI>Special Purpose Maps
   </UL>
-  <LI>Show a graph
+  <LI>\ref show_a_graph
   <LI>Miscellaneous Tool
   <UL>
     <LI>LP solver