Changeset 28:42b0128ae0a7 in lemon-tutorial

Timestamp:

02/15/10 00:36:27 (15 years ago)

Author:

Peter Kovacs <kpeter@…>

Branch:

default

Phase:

public

Message:

Add a page about undirected graphs and special graph types

Files:

• basics.dox (modified) (2 diffs)
• graphs.dox (added)
• toc.txt (modified) (2 diffs)

basics.dox

@@ -33 +33 @@
 
 This section tells you how to work with a directed graph (\e digraph,
-for short) in LEMON.
-The library provides various digraph structures for both general and special
-purposes. Here we use \c ListDigraph, the most versatile digraph type.
+for short) in LEMON. Here we use \ref ListDigraph, the most versatile
+digraph structure. (The library also provides other digraph types,
+see \ref sec_graph_structures "later".)
 
 The nodes and the arcs of a graph are identified by two data types called
@@ -63 +63 @@
 
 \note Using ListDigraph, you can also remove nodes or arcs with the
-\ref ListDigraph::erase() "erase()" function.
+\ref ListDigraph::erase() "erase()" function. Moreover, this class provides
+several other operations, see its \ref ListDigraph "documentation" for more
+information.
 However, not all graph structures support the addition and deletion
-of graph items.
+of graph items (see \ref sec_graph_concepts).
 
 Two important member functions of the directed graphs are

toc.txt

@@ -5 +5 @@
 * sec_basics
 ** sec_digraphs
-*** sec_digraph_it
-*** sec_digraph_maps
+** sec_digraph_it
+** sec_digraph_maps
 *_sec_algorithms
 **_sec_alg_graph_search
@@ -12 +12 @@
 **_sec_alg_spanning_tree
 **_sec_alg_max_flow
-*_sec_undir_graphs
+* sec_graph_structures
+** sec_graph_concepts
+** sec_digraph_types
+** sec_undir_graphs
+** sec_special_graphs
+*_sec_graph_adaptors
 *_sec_tools
 **_sec_lgf