COIN-OR::LEMON - Graph Library

Changeset 2260:4274224f8a7d in lemon-0.x for doc


Ignore:
Timestamp:
10/24/06 19:19:16 (13 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3016
Message:

concept -> concepts (namespace & directory)

Location:
doc
Files:
4 edited

Legend:

Unmodified
Added
Removed
  • doc/graphs.dox

    r2116 r2260  
    1212as  incoming and outgoing edges of a given node.
    1313
    14 Each graph should meet the \ref lemon::concept::Graph "Graph" concept.
     14Each graph should meet the \ref lemon::concepts::Graph "Graph" concept.
    1515This concept does not make it possible to change the graph (i.e. it is
    1616not possible to add or delete edges or nodes). Most of the graph
     
    1919
    2020In case of graphs meeting the full feature
    21 \ref lemon::concept::ErasableGraph "ErasableGraph"
     21\ref lemon::concepts::ErasableGraph "ErasableGraph"
    2222concept
    2323you can also erase individual edges and nodes in arbitrary order.
     
    2525The implemented graph structures are the following.
    2626\li \ref lemon::ListGraph "ListGraph" is the most versatile graph class. It meets
    27 the \ref lemon::concept::ErasableGraph "ErasableGraph" concept
     27the \ref lemon::concepts::ErasableGraph "ErasableGraph" concept
    2828and it also has some convenient extra features.
    2929\li \ref lemon::SmartGraph "SmartGraph" is a more memory
    3030efficient version of \ref lemon::ListGraph "ListGraph". The
    3131price of this is that it only meets the
    32 \ref lemon::concept::ExtendableGraph "ExtendableGraph" concept,
     32\ref lemon::concepts::ExtendableGraph "ExtendableGraph" concept,
    3333so you cannot delete individual edges or nodes.
    3434\li \ref lemon::FullGraph "FullGraph"
    3535implements a complete graph. It is a
    36 \ref lemon::concept::Graph "Graph", so you cannot
     36\ref lemon::concepts::Graph "Graph", so you cannot
    3737change the number of nodes once it is constructed. It is extremely memory
    3838efficient: it uses constant amount of memory independently from the number of
  • doc/groups.dox

    r2233 r2260  
    7777Map adaptors are used to create "implicit" maps from other maps.
    7878
    79 Most of them are \ref lemon::concept::ReadMap "ReadMap"s. They can
     79Most of them are \ref lemon::concepts::ReadMap "ReadMap"s. They can
    8080make arithmetic operations between one or two maps (negation, scaling,
    8181addition, multiplication etc.) or e.g. convert a map to another one
     
    103103algorithm to store its result in any kind of path structure.
    104104
    105 \sa lemon::concept::Path
     105\sa lemon::concepts::Path
    106106
    107107*/
  • doc/maps.dox

    r1788 r2260  
    1414
    1515A map can be
    16 \e readable (\ref lemon::concept::ReadMap "ReadMap", for short),
    17 \e writable (\ref lemon::concept::WriteMap "WriteMap") or both
    18 (\ref lemon::concept::ReadWriteMap "ReadWriteMap").
     16\e readable (\ref lemon::concepts::ReadMap "ReadMap", for short),
     17\e writable (\ref lemon::concepts::WriteMap "WriteMap") or both
     18(\ref lemon::concepts::ReadWriteMap "ReadWriteMap").
    1919There also exists a special type of
    20 ReadWrite map called \ref lemon::concept::ReferenceMap "reference map".
     20ReadWrite map called \ref lemon::concepts::ReferenceMap "reference map".
    2121In addition that you can
    2222read and write the values of a key, a reference map
  • doc/namespaces.dox

    r2157 r2260  
    99  /// The namespace of LEMON concepts and concept checking classes
    1010  ///
    11   namespace concept {}
     11  namespace concepts {}
    1212}
Note: See TracChangeset for help on using the changeset viewer.