COIN-OR::LEMON - Graph Library

Changeset 880:9d0bfd35b97c in lemon-0.x for src/work/deba


Ignore:
Timestamp:
09/17/04 17:51:50 (18 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.
Location:
src/work/deba
Files:
2 edited

Legend:

Unmodified
Added
Removed
  • src/work/deba/dijkstra.h

    r698 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 ReadMap "readable map",
    2222  ///so it is easy to change it to any kind of length.
    2323  ///
     
    3333  ///may involve in relatively time consuming process to compute the edge
    3434  ///length if it is necessary. The default map type is
    35   ///\ref GraphSkeleton::EdgeMap "Graph::EdgeMap<int>"
     35  ///\ref Graph::EdgeMap "Graph::EdgeMap<int>"
    3636  ///\param Heap The heap type used by the %Dijkstra
    3737  ///algorithm. The default
  • src/work/deba/list_graph.h

    r703 r880  
    2828  ///
    2929  ///It conforms to the graph interface documented under
    30   ///the description of \ref GraphSkeleton.
    31   ///\sa \ref GraphSkeleton.
     30  ///the description of \ref Graph.
     31  ///\sa \ref Graph.
    3232  class ListGraph {
    3333
     
    383383  ///feature by
    384384  ///storing shared values for the edge pairs. The usual
    385   ///\ref GraphSkeleton::EdgeMap "EdgeMap"
     385  ///\ref Graph::EdgeMap "EdgeMap"
    386386  ///can be used
    387387  ///as well.
Note: See TracChangeset for help on using the changeset viewer.