COIN-OR::LEMON - Graph Library

Changeset 1043:52a2201a88e9 in lemon-0.x


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

Several changes in doc

Files:
6 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*/
  • doc/groups.dox

    r1030 r1043  
    2424the best, most graph algorithms and auxiliary data structures can be used
    2525with any graph structures.
     26*/
     27
     28/**
     29@defgroup maps Maps
     30@ingroup datas
     31\brief Some special purpose map to make life easier.
     32
     33LEMON provides several special maps that e.g. combine
     34new maps from existing ones.
    2635*/
    2736
  • doc/maps.dox

    r987 r1043  
    33
    44
    5 \page maps Maps
     5\page maps-page Maps
    66
    77Maps play central role in LEMON. As their name suggests, they map a
  • src/lemon/concept/graph_component.h

    r1030 r1043  
    667667
    668668    /// This class describes the common interface of the graph maps
    669     /// (NodeMap, EdgeMap), that is \ref maps "maps" which can be used to
     669    /// (NodeMap, EdgeMap), that is \ref maps-pages "maps" which can be used to
    670670    /// associate data to graph descriptors (nodes or edges).
    671671    template <typename Graph, typename Item, typename _Value>
  • src/test/graph_test.cc

    r1022 r1043  
    1919
    2020int main() {
    21   ///\file
    2221  { // checking graph components
    2322    checkConcept<BaseGraphComponent, BaseGraphComponent >();
  • src/work/alpar/dijkstra.h

    r987 r1043  
    229229    ///\ref named-templ-param "Named parameter" for setting PredMap type
    230230
    231     ///\relates Dijkstra
    232     ///\ingroup flowalgs
    233231    ///\ref named-templ-param "Named parameter" for setting PredMap type
     232    ///
    234233    template <class T>
    235234    class SetPredMap : public Dijkstra< Graph,
     
    251250    ///\ref named-templ-param "Named parameter" for setting PredNodeMap type
    252251
    253     ///\ingroup flowalgs
    254252    ///\ref named-templ-param "Named parameter" for setting PredNodeMap type
     253    ///
    255254    template <class T>
    256255    class SetPredNodeMap : public Dijkstra< Graph,
     
    272271    ///\ref named-templ-param "Named parameter" for setting DistMap type
    273272
    274     ///\ingroup flowalgs
    275273    ///\ref named-templ-param "Named parameter" for setting DistMap type
     274    ///
    276275    template <class T>
    277276    class SetDistMap : public Dijkstra< Graph,
Note: See TracChangeset for help on using the changeset viewer.