Changeset 242:b255f25ad394 in lemon0.x for src/work/alpar/dijkstra/dijkstra.h
 Timestamp:
 03/24/04 14:06:06 (19 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@341
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/work/alpar/dijkstra/dijkstra.h
r229 r242 1 1 // * C++ * 2 2 3 /* 3 4 *template <Graph, T, Heap=FibHeap, LengthMap=Graph::EdgeMap<T> > … … 26 27 #ifndef HUGO_DIJKSTRA_H 27 28 #define HUGO_DIJKSTRA_H 29 30 ///\file 31 ///\brief Dijkstra algorithm. 28 32 29 33 #include <fib_heap.h> … … 44 48 ///The type of the length is determined by the \c ValueType of the length map. 45 49 /// 46 ///It is also pos ible to change the underlying priority heap.50 ///It is also possible to change the underlying priority heap. 47 51 /// 48 52 ///\param Graph The graph type the algorithm runs on. 49 ///\param LengthMap This readonly EdgeMap determines the 53 ///\param LengthMap This readonly 54 ///EdgeMap 55 ///determines the 50 56 ///lengths of the edges. It is read once for each edge, so the map 51 57 ///may involve in relatively time consuming process to compute the edge 52 ///length if it is necessary. 58 ///length if it is necessary. The default map type is 59 ///\ref GraphSkeleton::EdgeMap "Graph::EdgeMap<int>" 53 60 ///\param Heap The heap type used by the %Dijkstra 54 61 ///algorithm. The default 55 62 ///is using \ref BinHeap "binary heap". 63 64 #ifdef DOXYGEN 65 template <typename Graph, 66 typename LengthMap, 67 typename Heap> 68 #else 56 69 template <typename Graph, 57 70 typename LengthMap=typename Graph::EdgeMap<int>, … … 59 72 typename LengthMap::ValueType, 60 73 typename Graph::NodeMap<int> > > 74 #endif 61 75 class Dijkstra{ 62 76 public: … … 136 150 // bool reached(Node v) { return reach[v]; } 137 151 138 ///Chec hs if a node is reachable from the source.152 ///Checks if a node is reachable from the source. 139 153 140 154 ///Returns \c true if \c v is reachable from the source.
Note: See TracChangeset
for help on using the changeset viewer.