COIN-OR::LEMON - Graph Library

Changeset 57:18404ec968ca in lemon-tutorial for algorithms.dox


Ignore:
Timestamp:
03/01/10 02:28:44 (9 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Various small fixes

File:
1 edited

Legend:

Unmodified
Added
Removed
  • algorithms.dox

    r50 r57  
    2323\todo This page is under construction.
    2424
     25\todo The following contents are mainly ported from the LEMON 0.x tutorial,
     26thus they have to be thoroughly revised and reworked.
     27
     28\warning Currently, this section may contain old or faulty contents.
     29
    2530In addition to the graph structures, the most important parts of LEMON are
    2631the various algorithms related to graph theory and combinatorial optimization.
    27 The library probvides quite flexible and efficient implementations
     32The library provides quite flexible and efficient implementations
    2833for well-known fundamental algorithms, such as breadth-first
    2934search (BFS), depth-first search (DFS), Dijkstra algorithm, Kruskal algorithm
     
    3843[SEC]sec_graph_search[SEC] Graph Search
    3944
    40 \todo The following contents are ported from the LEMON 0.x tutorial,
    41 thus they have to thouroughly revised, reorganized and reworked.
    42 
    4345See \ref Bfs, \ref Dfs and \ref graph_properties.
    4446
     
    5153The class has two template parameters: \b GR and \b TR.<br>
    5254GR is the digraph the algorithm runs on. It has \ref lemon::ListDigraph "ListDigraph" as default type.
    53 TR is a Traits class commonly used to easy the parametrization of templates. In most cases you
     55TR is a Traits class commonly used to easy the parameterization of templates. In most cases you
    5456wont need to modify the default type \ref lemon::BfsDefaultTraits "BfsDefaultTraits<GR>".
    5557
Note: See TracChangeset for help on using the changeset viewer.