Changeset 1172:37338ae42a2b in lemon-0.x for doc/groups.dox

Timestamp:

02/23/05 23:00:05 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1578

Message:

graphwrapper dox. everybody is asked to read doxygen.log

File:

• doc/groups.dox (modified) (2 diffs)

doc/groups.dox

@@ -10 +10 @@
 \brief Graph structures implemented in LEMON.
 
-LEMON provides several data structures to meet the diverging requirements
-of the possible users.
-In order to save on running time or on memory usage, some structures may
-fail to provide
-some graph features like edge or node deletion.
+The implementation of combinatorial algorithms heavily relies on 
+efficient graph implementations. LEMON offers data structures which are 
+planned to be easily used in an experimental phase of implementation studies, 
+and thereafter the program code can be made efficient by small modifications. 
 
-LEMON also offers special graphs that cannot be used alone but only
-in conjunction with other graph representation. The examples for this are
-\ref lemon::EdgeSet "EdgeSet", \ref lemon::NodeSet "NodeSet"
-and the large variety of \ref gwrappers "graph wrappers".
+The most efficient implementation of diverse applications require the usage of different physical graph implementations. These differences appear in the size of 
+graph we require to handle, memory or time usage limitations or in 
+the set of operations through which the graph can be accessed. 
+LEMON provides several physical graph structures to meet the 
+diverging requirements of the possible users. 
+In order to save on running time or on memory usage, some structures may 
+fail to provide some graph features like edge or node deletion.
+
+Alteration of standard containers need a very limited number of 
+operations, these together satisfy the everyday requirements. 
+In the case of graph strutures, different operations are needed which do 
+not alter the physical graph, but gives an other view. If some nodes or 
+edges have to be hidden or the reverse oriented graph have to be used, then 
+this is the case. It also may happen that in a flow implemenation 
+the residual graph can be accessed by an other algorithm, or a node-set 
+is to be shrunk for an other algorithm. 
+LEMON also provides a variety of graphs for these requirements called 
+\ref gwrappers "graph wrappers". Wrappers cannot be used alone but only 
+in conjunction with other graph representation. 
 
 You are free to use the graph structure that fit your requirements
 the best, most graph algorithms and auxiliary data structures can be used
-with any graph structures.
+with any graph structures. 
 */
 
@@ -51 +65 @@
 This group describes the tools that makes it easier to make graph maps that
 dynamically update with the graph changes.
-*/
-
-/**
-@defgroup gwrappers Wrapper Classes for Graphs
-\brief This group contains several wrapper classes for graphs
-@ingroup graphs
 */