COIN-OR::LEMON - Graph Library

Changeset 959:c80ef5912903 in lemon-0.x for src/lemon/dijkstra.h


Ignore:
Timestamp:
11/04/04 21:24:59 (16 years ago)
Author:
Mihaly Barasz
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1342
Message:

skeleton(s) -> concept renaming

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/lemon/dijkstra.h

    r921 r959  
    3434  ///This class provides an efficient implementation of %Dijkstra algorithm.
    3535  ///The edge lengths are passed to the algorithm using a
    36   ///\ref skeleton::ReadMap "ReadMap",
     36  ///\ref concept::ReadMap "ReadMap",
    3737  ///so it is easy to change it to any kind of length.
    3838  ///
    3939  ///The type of the length is determined by the
    40   ///\ref skeleton::ReadMap::ValueType "ValueType" of the length map.
     40  ///\ref concept::ReadMap::ValueType "ValueType" of the length map.
    4141  ///
    4242  ///It is also possible to change the underlying priority heap.
     
    4949  ///may involve in relatively time consuming process to compute the edge
    5050  ///length if it is necessary. The default map type is
    51   ///\ref skeleton::StaticGraph::EdgeMap "Graph::EdgeMap<int>"
     51  ///\ref concept::StaticGraph::EdgeMap "Graph::EdgeMap<int>"
    5252  ///\param Heap The heap type used by the %Dijkstra
    5353  ///algorithm. The default
Note: See TracChangeset for help on using the changeset viewer.