COIN-OR::LEMON - Graph Library

Changeset 2288:ef8af928c54e in lemon-0.x for doc/getting_started.dox


Ignore:
Timestamp:
10/31/06 16:57:53 (13 years ago)
Author:
athos
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3053
Message:

Corrected some typos and grammatical errors.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/getting_started.dox

    r2195 r2288  
    22\page getting_started Getting Started
    33
    4 At the beginning we hardly suggest that you open your favorite text editor
    5 and enter the code simultaneously as you read it. Compiling the demos is also
    6 a good exercise.
     4At the beginning we strongly suggest that you open your favorite text
     5editor and enter the code simultaneously as you read it. Compiling the
     6demos is also a good exercise.
    77
    8 As the first example we show you a lemon style "Hello World" program. Now we
    9 explain almost every line, but later we will skip the basics and focus on new
    10 things.
     8As the first example we show you a lemon style "Hello World"
     9program. Now we explain almost every line, but later we will skip the
     10basics and focus on new things.
    1111
    1212\section hello_world Hello World in LEMON
     
    2929\until Edge
    3030
    31 For this demo we need to declare a ListGraph and a special NodeMap to store the
    32 characters associated to the graph's nodes.
     31For this demo we need to declare a ListGraph and a special NodeMap to
     32store the characters associated to the graph's nodes. 
    3333\skip main
    3434\until char_map
     
    3838\until addNode
    3939
    40 When a new node or edge to the graph the assigned maps are automatically resized.
    41 So graphs can be build dynamically. The usage of a map is very natural.
     40When a new node or edge is added to the graph the assigned maps are automatically resized.
     41So graphs can be built dynamically. The usage of a map is very natural.
    4242\skip char_map
    4343\until char_map
    4444
    45 Notice that no reference or additional assignment needed to work with nodes.
     45Notice that no reference or additional assignment is needed to work with nodes.
    4646They won't become illegal or won't lead to throwing any exceptions.
    47 You can declare and handle node like every other basic type such as \c int.
     47You can declare and handle a node like every other basic type such as \c int.
    4848\skip Store
    4949\until char_map
     
    5151As one expects adding an Edge is similar. You need to define the \b source node
    5252and the \b destination node. The nodes must belong to the graph of course. The
    53 Edge has the direction from the source to the destination. In some case you don't
     53Edge has the direction from the source to the destination. In some cases you don't
    5454want the edges to be directed - then you use an undirected graph. For example
    5555lemon::ListUGraph.
Note: See TracChangeset for help on using the changeset viewer.