COIN-OR::LEMON - Graph Library

Changeset 921:818510fa3d99 in lemon-0.x for doc/maps.dox


Ignore:
Timestamp:
09/29/04 17:30:04 (16 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1232
Message:

hugo -> lemon

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/maps.dox

    r697 r921  
    55\page maps Maps
    66
    7 Maps play central role in HUGOlib. As their name suggests, they map a
     7Maps play central role in LEMON. As their name suggests, they map a
    88certain range of \e keys to certain \e values. Each map has two
    99<tt>typedef</tt>'s to determine the types of keys and values, like this:
     
    2222where it is stored.
    2323
    24 Each graph structure in HUGOlib provides two standard map templates called
     24Each graph structure in LEMON provides two standard map templates called
    2525\c EdgeMap and \c NodeMap. Both are reference maps and you can easily
    2626assign data to the nodes and to the edges of the graph. For example if you
     
    7070The readable maps are very frequently used as the input of the
    7171algorithms.  For this purpose the most straightforward way is the use of the
    72 default maps provided by Hugo's graph structures.
     72default maps provided by LEMON's graph structures.
    7373Very often however, it is more
    7474convenient and/or more efficient to write your own readable map.
Note: See TracChangeset for help on using the changeset viewer.