COIN-OR::LEMON - Graph Library

Changeset 1168:66400041ef2a in lemon-0.x for doc/graphs.dox


Ignore:
Timestamp:
02/22/05 11:23:32 (15 years ago)
Author:
athos
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1572
Message:

Corrected spelling errors.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/graphs.dox

    r1043 r1168  
    66provide a node list - edge list interface, i.e. they have
    77functionalities to list the nodes and the edges of the graph as well
    8 as in incoming and outgoing edges of a given node.
     8as incoming and outgoing edges of a given node.
    99
    1010
     
    1212\ref lemon::concept::StaticGraph "StaticGraph" concept.
    1313This concept does not
    14 makes it possible to change the graph (i.e. it is not possible to add
     14make it possible to change the graph (i.e. it is not possible to add
    1515or delete edges or nodes). Most of the graph algorithms will run on
    1616these graphs.
     
    1919\ref lemon::concept::ExtendableGraph "ExtendableGraph"
    2020concept allow node and
    21 edge addition. You can also "clear" (i.e. erase all edges and nodes)
    22 such a graph.
     21edge addition. You can also "clear" such a graph (i.e. erase all edges and nodes ).
    2322
    2423In case of graphs meeting the full feature
    2524\ref lemon::concept::ErasableGraph "ErasableGraph"
    2625concept
    27 you can also erase individual edges and node in arbitrary order.
     26you can also erase individual edges and nodes in arbitrary order.
    2827
    2928The implemented graph structures are the following.
    3029\li \ref lemon::ListGraph "ListGraph" is the most versatile graph class. It meets
    3130the \ref lemon::concept::ErasableGraph "ErasableGraph" concept
    32 and it also have some convenience features.
     31and it also has some convenient extra features.
    3332\li \ref lemon::SmartGraph "SmartGraph" is a more memory
    3433efficient version of \ref lemon::ListGraph "ListGraph". The
    35 price of it is that it only meets the
     34price of this is that it only meets the
    3635\ref lemon::concept::ExtendableGraph "ExtendableGraph" concept,
    3736so you cannot delete individual edges or nodes.
     
    4645are shared by the edge pairs.
    4746\li \ref lemon::FullGraph "FullGraph"
    48 implements a full graph. It is a \ref lemon::concept::StaticGraph, so you cannot
     47implements a complete graph. It is a \ref lemon::concept::StaticGraph, so you cannot
    4948change the number of nodes once it is constructed. It is extremely memory
    5049efficient: it uses constant amount of memory independently from the number of
     
    6160\todo Some cross-refs are wrong.
    6261
    63 The graph structures itself can not store data attached
     62The graph structures themselves can not store data attached
    6463to the edges and nodes. However they all provide
    6564\ref maps-page "map classes"
     
    101100\endcode
    102101
    103 After some convenience typedefs we create a graph and add three nodes to it.
    104 Then we add edges to it to form a full graph.
     102After some convenient typedefs we create a graph and add three nodes to it.
     103Then we add edges to it to form a complete graph.
    105104
    106105\code
     
    134133\endcode
    135134
    136 We can also iterate through all edges of the graph very similarly. The target and
    137 source member functions can be used to access the endpoints of an edge.
     135We can also iterate through all edges of the graph very similarly. The
     136\c target and
     137\c source member functions can be used to access the endpoints of an edge.
    138138
    139139\code
     
    186186called maps.
    187187
    188 In the example above we create an EdgeMap which assigns an int value to all
     188In the example above we create an EdgeMap which assigns an integer value to all
    189189edges of the graph. We use the set member function of the map to write values
    190190into the map and the operator[] to retrieve them.
Note: See TracChangeset for help on using the changeset viewer.