COIN-OR::LEMON - Graph Library

Changeset 57:18404ec968ca in lemon-tutorial


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

Various small fixes

Files:
8 edited

Legend:

Unmodified
Added
Removed
  • adaptors.dox

    r45 r57  
    2626If some nodes or arcs have to be hidden (maybe temporarily) or the reverse 
    2727oriented graph has to be used, then this is the case. 
    28 However, actually modifing physical storage of the graph or 
     28However, actually modifying physical storage of the graph or 
    2929making a copy of the graph structure along with the required maps 
    3030could be rather expensive (in time or in memory usage) compared to the 
     
    6262well tested standard components. 
    6363 
    64 For solving the problem introduced above, we could use the follwing code. 
     64For solving the problem introduced above, we could use the following code. 
    6565 
    6666\code 
  • 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 
  • getting_started.dox

    r32 r57  
    5050\endverbatim 
    5151 
    52 As a result you will get the exacutable \c hello_lemon in the current 
     52As a result you will get the executable \c hello_lemon in the current 
    5353directory, which you can run by the following command. 
    5454 
  • intro.dox

    r32 r57  
    3737for example in telecommunication, computer networks, logistics, scheduling, 
    3838and other areas. 
    39 A very natural way of modelling these networks is by means of a graph. 
     39A very natural way of modeling these networks is by means of a graph. 
    4040Generally, if you want to write any program that works with graphs, 
    4141then you might find it useful and convenient to use LEMON. 
  • lp.dox

    r55 r57  
    195195\endcode 
    196196 
    197 The documnetation of the MIP solver interface can be found in the 
     197The documentation of the MIP solver interface can be found in the 
    198198reference manual at the class \ref MipSolver. The common parts of the 
    199 LP and MIP interfaces are docmented in their common ancestor class 
     199LP and MIP interfaces are documented in their common ancestor class 
    200200\ref LpBase. 
    201201 
  • maps.dox

    r49 r57  
    2424 
    2525\todo The following contents are ported from the LEMON 0.x tutorial, 
    26 thus they have to thouroughly revised, reorganized and reworked. 
     26thus they have to be thoroughly revised and reworked. 
     27 
     28\warning Currently, this section may contain old or faulty contents. 
    2729 
    2830The LEMON maps are not only just storage classes, but also 
  • tools.dox

    r46 r57  
    4444configurable graph displaying tool (using EPS output format). 
    4545Originally, it was developed to evaluate the flexibility and scalability 
    46 of LEMON's approach to implement named parameters. Later it 
    47 has been evolved into a versatile tool featuring above 35 named 
     46of LEMON's approach to implement \ref named-param "named parameters". 
     47Later it has been evolved into a versatile tool featuring above 35 named 
    4848parameters. The following code demonstrates its typical use. 
    4949 
     
    6868\image html graph_to_eps.png 
    6969 
     70For more examples, see \ref graph_to_eps_demo.cc in the demo directory 
     71of the LEMON source. 
     72 
    7073 
    7174[SEC]sec_time_count[SEC] Time Measuring and Counting 
  • undir_graphs.dox

    r50 r57  
    5656Each edge has an inherent orientation, thus it can be defined whether 
    5757an arc is forward or backward oriented in an undirected graph with respect 
    58 to this default oriantation of the represented edge. 
     58to this default orientation of the represented edge. 
    5959The direction of an arc can be obtained and set using the functions 
    6060\ref concepts::Graph::direction() "direction()" and 
     
    130130 
    131131 
    132 [SEC]sec_undir_graph_algs[SEC] Undirected Graph Algorihtms 
     132[SEC]sec_undir_graph_algs[SEC] Undirected Graph Algorithms 
    133133 
    134134\todo This subsection is under construction. 
Note: See TracChangeset for help on using the changeset viewer.