COIN-OR::LEMON - Graph Library

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


Ignore:
Timestamp:
02/23/05 23:00:05 (19 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:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r1151 r1172  
    1010\brief Graph structures implemented in LEMON.
    1111
    12 LEMON provides several data structures to meet the diverging requirements
    13 of the possible users.
    14 In order to save on running time or on memory usage, some structures may
    15 fail to provide
    16 some graph features like edge or node deletion.
     12The implementation of combinatorial algorithms heavily relies on
     13efficient graph implementations. LEMON offers data structures which are
     14planned to be easily used in an experimental phase of implementation studies,
     15and thereafter the program code can be made efficient by small modifications.
    1716
    18 LEMON also offers special graphs that cannot be used alone but only
    19 in conjunction with other graph representation. The examples for this are
    20 \ref lemon::EdgeSet "EdgeSet", \ref lemon::NodeSet "NodeSet"
    21 and the large variety of \ref gwrappers "graph wrappers".
     17The most efficient implementation of diverse applications require the usage of different physical graph implementations. These differences appear in the size of
     18graph we require to handle, memory or time usage limitations or in
     19the set of operations through which the graph can be accessed.
     20LEMON provides several physical graph structures to meet the
     21diverging requirements of the possible users.
     22In order to save on running time or on memory usage, some structures may
     23fail to provide some graph features like edge or node deletion.
     24
     25Alteration of standard containers need a very limited number of
     26operations, these together satisfy the everyday requirements.
     27In the case of graph strutures, different operations are needed which do
     28not alter the physical graph, but gives an other view. If some nodes or
     29edges have to be hidden or the reverse oriented graph have to be used, then
     30this is the case. It also may happen that in a flow implemenation
     31the residual graph can be accessed by an other algorithm, or a node-set
     32is to be shrunk for an other algorithm.
     33LEMON also provides a variety of graphs for these requirements called
     34\ref gwrappers "graph wrappers". Wrappers cannot be used alone but only
     35in conjunction with other graph representation.
    2236
    2337You are free to use the graph structure that fit your requirements
    2438the best, most graph algorithms and auxiliary data structures can be used
    25 with any graph structures.
     39with any graph structures. 
    2640*/
    2741
     
    5165This group describes the tools that makes it easier to make graph maps that
    5266dynamically update with the graph changes.
    53 */
    54 
    55 /**
    56 @defgroup gwrappers Wrapper Classes for Graphs
    57 \brief This group contains several wrapper classes for graphs
    58 @ingroup graphs
    5967*/
    6068
Note: See TracChangeset for help on using the changeset viewer.