COIN-OR::LEMON - Graph Library

Changeset 873:f3a30fda2e49 in lemon-0.x for doc/graphs.dox


Ignore:
Timestamp:
09/16/04 21:23:41 (15 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1175
Message:
File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/graphs.dox

    r808 r873  
    99
    1010
    11 Each graph should meet the \ref ConstGraph concept. This concept does
     11Each graph should meet the
     12\ref hugo::skeleton::StaticGraphSkeleton "StaticGraph" concept.
     13This concept does not
    1214makes it possible to change the graph (i.e. it is not possible to add
    1315or delete edges or nodes). Most of the graph algorithms will run on
    1416these graphs.
    1517
    16 The graphs meeting the \ref ExtendableGraph concept allow node and
     18The graphs meeting the
     19\ref hugo::skeleton::ExtendableGraphSkeleton "ExtendableGraph"
     20concept allow node and
    1721edge addition. You can also "clear" (i.e. erase all edges and nodes)
    1822such a graph.
    1923
    20 In case of graphs meeting the full feature \ref ErasableGraph concept
     24In case of graphs meeting the full feature
     25\ref hugo::skeleton::ErasableGraphSkeleton "ErasableGraph"
     26concept
    2127you can also erase individual edges and node in arbitrary order.
    2228
    2329The implemented graph structures are the following.
    2430\li \ref hugo::ListGraph "ListGraph" is the most versatile graph class. It meets
    25 the ErasableGraph concept and it also have some convenience features.
     31the hugo::skeleton::ErasableGraphSkeleton "ErasableGraph" concept
     32and it also have some convenience features.
    2633\li \ref hugo::SmartGraph "SmartGraph" is a more memory
    2734efficient version of \ref hugo::ListGraph "ListGraph". The
    28 price of it is that it only meets the \ref ExtendableGraph concept,
     35price of it is that it only meets the
     36\ref hugo::skeleton::ExtendableGraphSkeleton "ExtendableGraph" concept,
    2937so you cannot delete individual edges or nodes.
    3038\li \ref hugo::SymListGraph "SymListGraph" and
     
    4755can be used as a base class of \ref hugo::EdgeSet "EdgeSet".
    4856\li \ref hugo::EdgeSet "EdgeSet" can be used to create a new graph on
    49 the edge set of another graph. The base graph can be an arbitrary graph and it
     57the node set of another graph. The base graph can be an arbitrary graph and it
    5058is possible to attach several \ref hugo::EdgeSet "EdgeSet"'s to a base graph.
    5159
     
    5361\todo Some cross-refs are wrong.
    5462
    55 \bug This file must be updated accordig to the new stile iterators.
     63\bug This file must be updated accordig to the new style iterators.
    5664
    5765The graph structures itself can not store data attached
     
    5967\ref maps "map classes"
    6068to dynamically attach data the to graph components.
    61 
    62 
    63 
    6469
    6570The following program demonstrates the basic features of HugoLib's graph
     
    191196\endcode
    192197
    193 In generic graph optimization programming graphs are not containers rather
     198As we mentioned above, graphs are not containers rather
    194199incidence structures which are iterable in many ways. HugoLib introduces
    195200concepts that allow us to attach containers to graphs. These containers are
Note: See TracChangeset for help on using the changeset viewer.