Changeset 1083:8043b93e5973 in lemon-0.x for doc/maps.dox

Timestamp:

01/16/05 23:29:28 (20 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

Doc improvements

File:

• doc/maps.dox (modified) (9 diffs)

doc/maps.dox

@@ +1 @@
+namespace lemon{
 /*!
-
-
 
 \page maps-page Maps
@@ -14 +13 @@
 \endcode
 
-A map can \e readable (ReadMap, for short), \e writable (WriteMap) or both
-(ReadWrite Map). There also exists a special type of
-ReadWrite map called <em>reference map</em>. In addition that you can
+A map can \e readable (\ref lemon::concept::ReadMap "ReadMap", for short),
+\e writable (\ref lemon::concept::WriteMap "WriteMap") or both
+(\ref lemon::concept::ReadWriteMap "ReadWriteMap").
+There also exists a special type of
+ReadWrite map called \ref lemon::concept::ReferenceMap "reference map".
+In addition that you can
 read and write the values of a key, a reference map
 can also give you a reference to the
@@ -29 +31 @@
   ListGraph G;
 \endcode
-and you want to assign floating point value to each edge, you can do
+and you want to assign a floating point value to each edge, you can do
 it like this.
 \code
   ListGraph::EdgeMap<double> length(G);
 \endcode
+Note that you must give the underlying graph to the constructor.
 
 The value of a readable map can be obtained by <tt>operator[]</tt>.
@@ -42 +45 @@
 (Or anything else
 that converts to \c ListGraph::Edge, like  \c ListGraph::EdgeIt or
-\c ListGraph::OutEdgeIt)
+\c ListGraph::OutEdgeIt etc.)
 
 There are two ways the assign a new value to a key
@@ -61 +64 @@
 The first case is more comfortable and if you store complex structures in your
 map, it might be more efficient. However, there are writable but
-not reference maps, so if you want to write an generic algorithm, you should
-insist on the second method.
+not reference maps, so if you want to write a generic algorithm, you should
+insist on the second way.
 
 \section how-to-write-your-own-map How to Write Your Own Maps
@@ -68 +71 @@
 \subsection read-maps Readable Maps
 
-The readable maps are very frequently used as the input of the
+Readable maps are very frequently used as the input of the
 algorithms.  For this purpose the most straightforward way is the use of the
 default maps provided by LEMON's graph structures.
@@ -101 +104 @@
 
 Here is a bit more complex example.
-It provides a length function which is obtained
+It provides a length function obtained
 from a base length function shifted by a potential difference.
 
 \code
-class MyLengthMap  : public MapBase<Graph::Edge,double>
+class ReducedLengthMap  : public MapBase<Graph::Edge,double>
 {
-  const Graph &G;
+  const Graph &g;
   const Graph::EdgeMap<double> &orig_len;
   const Graph::NodeMap<double> &pot;
@@ -116 +119 @@
   }
   
-  MyLengthMap(const Graph &g, const Graph::EdgeMap &o,const Graph::NodeMap &p)
+  ReducedLengthMap(const Graph &_g,
+                   const Graph::EdgeMap &o,
+                   const Graph::NodeMap &p)
     : G(g), orig_len(o), pot(p) {};
 };
+\endcode
+
+Then, you can call e.g. Dijkstra algoritm on this map like this:
+\code
+  ...
+  ReducedLengthMap rm(g,len,pot);
+  Dijkstra<Graph,ReducedLengthMap> dij(g,rm);
+  dij.run(s);
+  ...
 \endcode
 
@@ -131 +145 @@
 
 */
+}