Changeset 880:9d0bfd35b97c in lemon0.x for src/work/deba
 Timestamp:
 09/17/04 17:51:50 (19 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@1188
 Location:
 src/work/deba
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

src/work/deba/dijkstra.h
r698 r880 19 19 ///This class provides an efficient implementation of %Dijkstra algorithm. 20 20 ///The edge lengths are passed to the algorithm using a 21 ///\ref ReadMap Skeleton"readable map",21 ///\ref ReadMap "readable map", 22 22 ///so it is easy to change it to any kind of length. 23 23 /// … … 33 33 ///may involve in relatively time consuming process to compute the edge 34 34 ///length if it is necessary. The default map type is 35 ///\ref Graph Skeleton::EdgeMap "Graph::EdgeMap<int>"35 ///\ref Graph::EdgeMap "Graph::EdgeMap<int>" 36 36 ///\param Heap The heap type used by the %Dijkstra 37 37 ///algorithm. The default 
src/work/deba/list_graph.h
r703 r880 28 28 /// 29 29 ///It conforms to the graph interface documented under 30 ///the description of \ref Graph Skeleton.31 ///\sa \ref Graph Skeleton.30 ///the description of \ref Graph. 31 ///\sa \ref Graph. 32 32 class ListGraph { 33 33 … … 383 383 ///feature by 384 384 ///storing shared values for the edge pairs. The usual 385 ///\ref Graph Skeleton::EdgeMap "EdgeMap"385 ///\ref Graph::EdgeMap "EdgeMap" 386 386 ///can be used 387 387 ///as well.
Note: See TracChangeset
for help on using the changeset viewer.