1.1 --- a/src/hugo/dijkstra.h Thu Sep 02 11:20:49 2004 +0000
1.2 +++ b/src/hugo/dijkstra.h Thu Sep 02 15:13:21 2004 +0000
1.3 @@ -87,7 +87,7 @@
1.4 //The source node of the last execution.
1.5 Node source;
1.6
1.7 - ///Initialize maps
1.8 + ///Initializes the maps.
1.9
1.10 ///\todo Error if \c G or are \c NULL. What about \c length?
1.11 ///\todo Better memory allocation (instead of new).
1.12 @@ -132,6 +132,8 @@
1.13
1.14 ///Sets the graph the algorithm will run on.
1.15 ///\return <tt> (*this) </tt>
1.16 + ///\bug What about maps?
1.17 + ///\todo It may be unnecessary
1.18 Dijkstra &setGraph(const Graph &_G)
1.19 {
1.20 G = &_G;
1.21 @@ -273,7 +275,7 @@
1.22 ///Returns the 'previous edge' of the shortest path tree.
1.23
1.24 ///For a node \c v it returns the 'previous edge' of the shortest path tree,
1.25 - ///i.e. it returns the last edge from a shortest path from the root to \c
1.26 + ///i.e. it returns the last edge of a shortest path from the root to \c
1.27 ///v. It is \ref INVALID
1.28 ///if \c v is unreachable from the root or if \c v=s. The
1.29 ///shortest path tree used here is equal to the shortest path tree used in
1.30 @@ -322,11 +324,6 @@
1.31
1.32 };
1.33
1.34 -
1.35 - // **********************************************************************
1.36 - // IMPLEMENTATIONS
1.37 - // **********************************************************************
1.38 -
1.39 /// @}
1.40
1.41 } //END OF NAMESPACE HUGO