COIN-OR::LEMON - Graph Library

Changeset 1043:52a2201a88e9 in lemon-0.x for doc/graphs.dox


Ignore:
Timestamp:
01/03/05 17:23:47 (19 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1437
Message:

Several changes in doc

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/graphs.dox

    r986 r1043  
    4949change the number of nodes once it is constructed. It is extremely memory
    5050efficient: it uses constant amount of memory independently from the number of
    51 the nodes of the graph. Of course, the size of the \ref maps "NodeMap"'s and
    52 \ref maps "EdgeMap"'s will depend on the number of nodes.
     51the nodes of the graph. Of course, the size of the \ref maps-page "NodeMap"'s and
     52\ref maps-page "EdgeMap"'s will depend on the number of nodes.
    5353
    5454\li \ref lemon::NodeSet "NodeSet" implements a graph with no edges. This class
     
    6363The graph structures itself can not store data attached
    6464to the edges and nodes. However they all provide
    65 \ref maps "map classes"
     65\ref maps-page "map classes"
    6666to dynamically attach data the to graph components.
    6767
     
    191191
    192192Here we used the maps provided by the ListGraph class, but you can also write
    193 your own maps. You can read more about using maps \ref maps "here".
     193your own maps. You can read more about using maps \ref maps-page "here".
    194194
    195195*/
Note: See TracChangeset for help on using the changeset viewer.