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

Ignore:
Timestamp:
03/01/10 02:28:44 (9 years ago)
Branch:
default
Phase:
public
Message:

Various small fixes

File:
1 edited

Unmodified
Removed
• ## algorithms.dox

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