Index: lemon/bellman_ford.h
===================================================================
--- lemon/bellman_ford.h (revision 2408)
+++ lemon/bellman_ford.h (revision 2476)
@@ -433,5 +433,5 @@
/// easily with \ref path() or \ref predEdge() functions. If you
/// need the shortest path and not just the distance you should store
- /// after each iteration the \ref predEdgeMap() map and manually build
+ /// after each iteration the \ref predMap() map and manually build
/// the path.
///
@@ -546,5 +546,5 @@
/// easily with \ref path() or \ref predEdge() functions. If you
/// need the shortest path and not just the distance you should store
- /// after each iteration the \ref predEdgeMap() map and manually build
+ /// after each iteration the \ref predMap() map and manually build
/// the path.
///
@@ -952,5 +952,5 @@
///
/// Runs BellmanFord algorithm from the given node.
- /// \param source is the given source.
+ /// \param src is the given source.
void run(Node src) {
Base::_source = src;
@@ -1017,5 +1017,5 @@
///
/// Sets the source node, from which the BellmanFord algorithm runs.
- /// \param source is the source node.
+ /// \param src is the source node.
BellmanFordWizard<_Traits>& source(Node src) {
Base::_source = src;
Index: lemon/bfs.h
===================================================================
--- lemon/bfs.h (revision 2443)
+++ lemon/bfs.h (revision 2476)
@@ -594,7 +594,6 @@
///
///This method runs the %BFS algorithm from the root node(s)
- ///in order to
- ///compute the
- ///shortest path to \c dest. The algorithm computes
+ ///in order to compute the shortest path to \c dest.
+ ///The algorithm computes
///- The shortest path to \c dest.
///- The distance of \c dest from the root(s).
@@ -616,5 +615,5 @@
/// nm[v] true.
///
- ///\return The reached node \c v with nm[v]<\tt> true or
+ ///\return The reached node \c v with nm[v] true or
///\c INVALID if no such node was found.
template
@@ -1518,5 +1517,5 @@
/// nm[v] true.
///
- ///\return The reached node \c v with nm[v]<\tt> true or
+ ///\return The reached node \c v with nm[v] true or
///\c INVALID if no such node was found.
template
Index: lemon/dfs.h
===================================================================
--- lemon/dfs.h (revision 2443)
+++ lemon/dfs.h (revision 2476)
@@ -565,7 +565,7 @@
///
///\param em must be a bool (or convertible) edge map. The algorithm
- ///will stop when it reaches an edge \c e with em[e]<\tt> true.
- ///
- ///\return The reached edge \c e with em[e]<\tt> true or
+ ///will stop when it reaches an edge \c e with em[e] true.
+ ///
+ ///\return The reached edge \c e with em[e] true or
///\c INVALID if no such edge was found.
///
@@ -1459,7 +1459,7 @@
///
/// \param em must be a bool (or convertible) edge map. The algorithm
- /// will stop when it reaches an edge \c e with em[e]<\tt> true.
- ///
- ///\return The reached edge \c e with em[e]<\tt> true or
+ /// will stop when it reaches an edge \c e with em[e] true.
+ ///
+ ///\return The reached edge \c e with em[e] true or
///\c INVALID if no such edge was found.
///
Index: lemon/dijkstra.h
===================================================================
--- lemon/dijkstra.h (revision 2443)
+++ lemon/dijkstra.h (revision 2476)
@@ -666,5 +666,5 @@
///will stop when it reaches a node \c v with nm[v] true.
///
- ///\return The reached node \c v with nm[v]<\tt> true or
+ ///\return The reached node \c v with nm[v] true or
///\c INVALID if no such node was found.
template
Index: lemon/error.h
===================================================================
--- lemon/error.h (revision 2410)
+++ lemon/error.h (revision 2476)
@@ -635,5 +635,5 @@
/// behaviour will be activated. The \c msg should be either a const
/// char* message or an exception. When the \c msg is an exception the
-/// \ref "Exception::what" what() function is called to retrieve and
+/// \ref lemon::Exception::what() "what()" function is called to retrieve and
/// display the error message.
///
Index: lemon/graph_utils.h
===================================================================
--- lemon/graph_utils.h (revision 2474)
+++ lemon/graph_utils.h (revision 2476)
@@ -373,5 +373,5 @@
///
///\sa EdgeLookUp
- ///\se AllEdgeLookUp
+ ///\sa AllEdgeLookUp
///\sa ConEdgeIt
template
Index: lemon/lemon_reader.h
===================================================================
--- lemon/lemon_reader.h (revision 2467)
+++ lemon/lemon_reader.h (revision 2476)
@@ -1129,5 +1129,5 @@
/// It gives back true when the header line starts with \c \@edgeset,
/// and the header line's name and the edgeset's name are the same.
- /// The sections with @uedgeset head line could be read with this
+ /// The sections with \@uedgeset head line could be read with this
/// section reader too.
virtual bool header(const std::string& line) {
@@ -1438,5 +1438,5 @@
/// It gives back true when the header line starts with \c \@uedgeset,
/// and the header line's name and the edgeset's name are the same.
- /// The sections with @edgeset head line could be read with this
+ /// The sections with \@edgeset head line could be read with this
/// section reader too.
virtual bool header(const std::string& line) {