COIN-OR::LEMON - Graph Library

Changeset 2111:ea1fa1bc3f6d in lemon-0.x for doc


Ignore:
Timestamp:
06/28/06 17:06:24 (13 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2817
Message:

Removing concepts for extendable and erasable graphs
Renaming StaticGraph? to Graph

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/graphs.dox

    r1638 r2111  
    22
    33\page graphs Graphs
     4
     5\todo Write a new Graphs page. I think it should be contain the Graph,
     6UGraph and BpUGraph concept. It should be describe the iterators and
     7the basic functions and the differences of the implementations.
    48
    59The primary data structures of LEMON are the graph classes. They all
     
    812as  incoming and outgoing edges of a given node.
    913
     14Each graph should meet the \ref lemon::concept::Graph "Graph" concept.
     15This concept does not make it possible to change the graph (i.e. it is
     16not possible to add or delete edges or nodes). Most of the graph
     17algorithms will run on these graphs.
    1018
    11 Each graph should meet the
    12 \ref lemon::concept::StaticGraph "StaticGraph" concept.
    13 This concept does not
    14 make it possible to change the graph (i.e. it is not possible to add
    15 or delete edges or nodes). Most of the graph algorithms will run on
    16 these graphs.
    17 
    18 The graphs meeting the
    19 \ref lemon::concept::ExtendableGraph "ExtendableGraph"
    20 concept allow node and
    21 edge addition. You can also "clear" such a graph (i.e. erase all edges and nodes ).
    2219
    2320In case of graphs meeting the full feature
     
    3734\li \ref lemon::FullGraph "FullGraph"
    3835implements a complete graph. It is a
    39 \ref lemon::concept::StaticGraph "StaticGraph", so you cannot
     36\ref lemon::concept::Graph "Graph", so you cannot
    4037change the number of nodes once it is constructed. It is extremely memory
    4138efficient: it uses constant amount of memory independently from the number of
Note: See TracChangeset for help on using the changeset viewer.