Changeset 785:a9b0863c2265 in lemon0.x for src/hugo/dijkstra.h
 Timestamp:
 09/02/04 17:13:21 (16 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@1078
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/hugo/dijkstra.h
r780 r785 88 88 Node source; 89 89 90 ///Initialize maps90 ///Initializes the maps. 91 91 92 92 ///\todo Error if \c G or are \c NULL. What about \c length? … … 133 133 ///Sets the graph the algorithm will run on. 134 134 ///\return <tt> (*this) </tt> 135 ///\bug What about maps? 136 ///\todo It may be unnecessary 135 137 Dijkstra &setGraph(const Graph &_G) 136 138 { … … 274 276 275 277 ///For a node \c v it returns the 'previous edge' of the shortest path tree, 276 ///i.e. it returns the last edge froma shortest path from the root to \c278 ///i.e. it returns the last edge of a shortest path from the root to \c 277 279 ///v. It is \ref INVALID 278 280 ///if \c v is unreachable from the root or if \c v=s. The … … 323 325 }; 324 326 325 326 // **********************************************************************327 // IMPLEMENTATIONS328 // **********************************************************************329 330 327 /// @} 331 328
Note: See TracChangeset
for help on using the changeset viewer.