COIN-OR::LEMON - Graph Library

Changeset 50:72867897fcba in lemon-tutorial for graphs.dox


Ignore:
Timestamp:
02/22/10 13:00:14 (11 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Minor improvements

File:
1 edited

Legend:

Unmodified
Added
Removed
  • graphs.dox

    r46 r50  
    8282SmartDigraph, especially using \ref concepts::Digraph::OutArcIt
    8383"OutArcIt" iterators, since its arcs are stored in an appropriate order.
    84 However, it only provides \ref StaticDigraph::build() "build()" and
    85 \ref \ref StaticDigraph::clear() "clear()" functions and does not
    86 support any other modification of the digraph.
     84However, you can neither add nor delete arcs or nodes, the graph
     85has to be built at once and other modifications are not supported.
    8786 
    8887\ref FullDigraph is an efficient implementation of a directed full graph.
    89 This structure is also completely static, so you can neither add nor delete
    90 arcs or nodes, moreover, the class needs constant space in memory.
     88This structure is also completely static and it needs constant space
     89in memory.
    9190
    9291
     
    9594The general undirected graph classes, \ref ListGraph and \ref SmartGraph
    9695have similar implementations as their directed variants.
    97 Therefore, \ref SmartDigraph is more efficient, but \ref ListGraph provides
     96Therefore, \ref SmartGraph is more efficient, but \ref ListGraph provides
    9897more functionality.
    99 
    10098In addition to these general structures, LEMON also provides special purpose
    10199undirected graph types for handling \ref FullGraph "full graphs",
    102100\ref GridGraph "grid graphs" and \ref HypercubeGraph "hypercube graphs".
    103 They all static structures, i.e. they do not allow distinct item additions
    104 or deletions, the graph has to be built at once.
    105101
    106102[TRAILER]
Note: See TracChangeset for help on using the changeset viewer.