Changeset 57:18404ec968ca in lemontutorial for algorithms.dox
 Timestamp:
 03/01/10 02:28:44 (14 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

algorithms.dox
r50 r57 23 23 \todo This page is under construction. 24 24 25 \todo The following contents are mainly ported from the LEMON 0.x tutorial, 26 thus they have to be thoroughly revised and reworked. 27 28 \warning Currently, this section may contain old or faulty contents. 29 25 30 In addition to the graph structures, the most important parts of LEMON are 26 31 the various algorithms related to graph theory and combinatorial optimization. 27 The library pro bvides quite flexible and efficient implementations32 The library provides quite flexible and efficient implementations 28 33 for wellknown fundamental algorithms, such as breadthfirst 29 34 search (BFS), depthfirst search (DFS), Dijkstra algorithm, Kruskal algorithm … … 38 43 [SEC]sec_graph_search[SEC] Graph Search 39 44 40 \todo The following contents are ported from the LEMON 0.x tutorial,41 thus they have to thouroughly revised, reorganized and reworked.42 43 45 See \ref Bfs, \ref Dfs and \ref graph_properties. 44 46 … … 51 53 The class has two template parameters: \b GR and \b TR.<br> 52 54 GR 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 paramet rization of templates. In most cases you55 TR is a Traits class commonly used to easy the parameterization of templates. In most cases you 54 56 wont need to modify the default type \ref lemon::BfsDefaultTraits "BfsDefaultTraits<GR>". 55 57
Note: See TracChangeset
for help on using the changeset viewer.