COIN-OR::LEMON - Graph Library

Changeset 2260:4274224f8a7d in lemon-0.x for lemon/dijkstra.h


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)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/dijkstra.h

    r2230 r2260  
    4949
    5050    ///The type of the map that stores the edge lengths.
    51     ///It must meet the \ref concept::ReadMap "ReadMap" concept.
     51    ///It must meet the \ref concepts::ReadMap "ReadMap" concept.
    5252    typedef LM LengthMap;
    5353    //The type of the length of the edges.
     
    8787    ///The type of the map that stores the last
    8888    ///edges of the shortest paths.
    89     ///It must meet the \ref concept::WriteMap "WriteMap" concept.
     89    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.
    9090    ///
    9191    typedef typename Graph::template NodeMap<typename GR::Edge> PredMap;
     
    103103 
    104104    ///The type of the map that stores whether a nodes is processed.
    105     ///It must meet the \ref concept::WriteMap "WriteMap" concept.
     105    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.
    106106    ///By default it is a NullMap.
    107107    ///\todo If it is set to a real map,
     
    125125 
    126126    ///The type of the map that stores the dists of the nodes.
    127     ///It must meet the \ref concept::WriteMap "WriteMap" concept.
     127    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.
    128128    ///
    129129    typedef typename Graph::template NodeMap<typename LM::Value> DistMap;
     
    143143  ///This class provides an efficient implementation of %Dijkstra algorithm.
    144144  ///The edge lengths are passed to the algorithm using a
    145   ///\ref concept::ReadMap "ReadMap",
     145  ///\ref concepts::ReadMap "ReadMap",
    146146  ///so it is easy to change it to any kind of length.
    147147  ///
    148148  ///The type of the length is determined by the
    149   ///\ref concept::ReadMap::Value "Value" of the length map.
     149  ///\ref concepts::ReadMap::Value "Value" of the length map.
    150150  ///
    151151  ///It is also possible to change the underlying priority heap.
     
    158158  ///relatively time consuming process to compute the edge length if
    159159  ///it is necessary. The default map type is \ref
    160   ///concept::Graph::EdgeMap "Graph::EdgeMap<int>".  The value
     160  ///concepts::Graph::EdgeMap "Graph::EdgeMap<int>".  The value
    161161  ///of LM is not used directly by Dijkstra, it is only passed to \ref
    162162  ///DijkstraDefaultTraits.  \param TR Traits class to set
     
    820820
    821821    ///The type of the map that stores the edge lengths.
    822     ///It must meet the \ref concept::ReadMap "ReadMap" concept.
     822    ///It must meet the \ref concepts::ReadMap "ReadMap" concept.
    823823    typedef LM LengthMap;
    824824    //The type of the length of the edges.
     
    862862    ///The type of the map that stores the last
    863863    ///edges of the shortest paths.
    864     ///It must meet the \ref concept::WriteMap "WriteMap" concept.
     864    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.
    865865    ///
    866866    typedef NullMap <typename GR::Node,typename GR::Edge> PredMap;
     
    881881 
    882882    ///The type of the map that stores whether a nodes is processed.
    883     ///It must meet the \ref concept::WriteMap "WriteMap" concept.
     883    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.
    884884    ///By default it is a NullMap.
    885885    ///\todo If it is set to a real map,
     
    903903 
    904904    ///The type of the map that stores the dists of the nodes.
    905     ///It must meet the \ref concept::WriteMap "WriteMap" concept.
     905    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.
    906906    ///
    907907    typedef NullMap<typename Graph::Node,typename LM::Value> DistMap;
Note: See TracChangeset for help on using the changeset viewer.