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

Timestamp:

10/31/06 16:57:53 (17 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:

• doc/getting_started.dox (modified) (4 diffs)

doc/getting_started.dox

@@ -2 +2 @@
 \page getting_started Getting Started
 
-At the beginning we hardly suggest that you open your favorite text editor
-and enter the code simultaneously as you read it. Compiling the demos is also
-a good exercise.
+At the beginning we strongly suggest that you open your favorite text
+editor and enter the code simultaneously as you read it. Compiling the
+demos is also a good exercise.
 
-As the first example we show you a lemon style "Hello World" program. Now we
-explain almost every line, but later we will skip the basics and focus on new
-things.
+As the first example we show you a lemon style "Hello World"
+program. Now we explain almost every line, but later we will skip the
+basics and focus on new things.
 
 \section hello_world Hello World in LEMON
@@ -29 +29 @@
 \until Edge
 
-For this demo we need to declare a ListGraph and a special NodeMap to store the
-characters associated to the graph's nodes.
+For this demo we need to declare a ListGraph and a special NodeMap to
+store the characters associated to the graph's nodes.  
 \skip main
 \until char_map
@@ -38 +38 @@
 \until addNode
 
-When a new node or edge to the graph the assigned maps are automatically resized.
-So graphs can be build dynamically. The usage of a map is very natural.
+When a new node or edge is added to the graph the assigned maps are automatically resized.
+So graphs can be built dynamically. The usage of a map is very natural.
 \skip char_map
 \until char_map
 
-Notice that no reference or additional assignment needed to work with nodes.
+Notice that no reference or additional assignment is needed to work with nodes.
 They won't become illegal or won't lead to throwing any exceptions.
-You can declare and handle node like every other basic type such as \c int.
+You can declare and handle a node like every other basic type such as \c int.
 \skip Store
 \until char_map
@@ -51 +51 @@
 As one expects adding an Edge is similar. You need to define the \b source node
 and the \b destination node. The nodes must belong to the graph of course. The
-Edge has the direction from the source to the destination. In some case you don't
+Edge has the direction from the source to the destination. In some cases you don't
 want the edges to be directed - then you use an undirected graph. For example
 lemon::ListUGraph.