COIN-OR::LEMON - Graph Library

Changeset 880:9d0bfd35b97c in lemon-0.x for src/hugo/dijkstra.h


Ignore:
Timestamp:
09/17/04 17:51:50 (16 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1188
Message:
  • Name changing: XYZGraphSkeleton -> XYZGraph
  • Fix some bad \ref's in the doc.
File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/hugo/dijkstra.h

    r802 r880  
    1919  ///This class provides an efficient implementation of %Dijkstra algorithm.
    2020  ///The edge lengths are passed to the algorithm using a
    21   ///\ref ReadMapSkeleton "readable map",
     21  ///\ref skeleton::ReadMap "ReadMap",
    2222  ///so it is easy to change it to any kind of length.
    2323  ///
    24   ///The type of the length is determined by the \c ValueType of the length map.
     24  ///The type of the length is determined by the
     25  ///\ref skeleton::ReadMap::ValueType "ValueType" of the length map.
    2526  ///
    2627  ///It is also possible to change the underlying priority heap.
     
    3334  ///may involve in relatively time consuming process to compute the edge
    3435  ///length if it is necessary. The default map type is
    35   ///\ref GraphSkeleton::EdgeMap "Graph::EdgeMap<int>"
     36  ///\ref skeleton::StaticGraph::EdgeMap "Graph::EdgeMap<int>"
    3637  ///\param Heap The heap type used by the %Dijkstra
    3738  ///algorithm. The default
Note: See TracChangeset for help on using the changeset viewer.