COIN-OR::LEMON - Graph Library

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


Ignore:
Timestamp:
10/31/06 10:32:44 (13 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:
2 edited

Legend:

Unmodified
Added
Removed
  • doc/algorithms.dox

    r2216 r2281  
    9595First of all we will need an own \ref lemon::Dfs::ProcessedMap "ProcessedMap". The ordering
    9696will be done through it.
    97 \skip SerializingWriteMap
     97\skip MyOrdererMap
    9898\until };
    9999The class meets the \ref lemon::WriteMap "WriteMap" concept. In it's \c set() method the only thing
    100100we need to do is insert the key - that is the node who's processing just finished - into the beginning
    101 of the list.
     101of the list.<br>
     102Although we implemented this needed helper class ourselves it was not necessary.
     103The \ref lemon::FrontInserterBoolMap "FrontInserterBoolMap" class does exactly
     104what we needed. To be correct it's more general - and it's all in \c LEMON. But
     105we wanted to show you, how easy is to add additional functionality.
    102106
    103107First we declare the needed data structures: the graph and a map to store the nodes' label.
     
    127131
    128132The program is to be found in the \ref demo directory: \ref topological_ordering.cc
     133
     134More algorithms are described in the \ref algorithms2 "second part".
    129135*/
    130136}
  • doc/tutorial.dox

    r2216 r2281  
    2424  <UL>
    2525    <LI>\ref algo_bfs_dfs
    26     <LI>Dijkstra
    27     <LI>Kruskal
     26    <LI>\ref algo_dijkstra
     27    <LI>\ref algo_kruskal
    2828  </UL>
    2929  <LI>\ref maps2
     
    3333    <LI>Special Purpose Maps
    3434  </UL>
    35   <LI>Show a graph
     35  <LI>\ref show_a_graph
    3636  <LI>Miscellaneous Tool
    3737  <UL>
Note: See TracChangeset for help on using the changeset viewer.