1.1 --- a/lemon/dijkstra.h Sun Nov 15 19:57:02 2009 +0100
1.2 +++ b/lemon/dijkstra.h Wed Nov 18 14:38:02 2009 +0100
1.3 @@ -132,7 +132,7 @@
1.4
1.5 ///The type of the map that indicates which nodes are processed.
1.6 ///It must conform to the \ref concepts::WriteMap "WriteMap" concept.
1.7 - ///By default it is a NullMap.
1.8 + ///By default, it is a NullMap.
1.9 typedef NullMap<typename Digraph::Node,bool> ProcessedMap;
1.10 ///Instantiates a \c ProcessedMap.
1.11
1.12 @@ -426,7 +426,7 @@
1.13 ///automatically created by the algorithm (i.e. the digraph should be
1.14 ///passed to the constructor of the cross reference and the cross
1.15 ///reference should be passed to the constructor of the heap).
1.16 - ///However external heap and cross reference objects could also be
1.17 + ///However, external heap and cross reference objects could also be
1.18 ///passed to the algorithm using the \ref heap() function before
1.19 ///calling \ref run(Node) "run()" or \ref init().
1.20 ///\sa SetHeap
1.21 @@ -447,7 +447,7 @@
1.22 ///
1.23 ///\ref named-templ-param "Named parameter" for setting
1.24 ///\c OperationTraits type.
1.25 - /// For more information see \ref DijkstraDefaultOperationTraits.
1.26 + /// For more information, see \ref DijkstraDefaultOperationTraits.
1.27 template <class T>
1.28 struct SetOperationTraits
1.29 : public Dijkstra<Digraph, LengthMap, SetOperationTraitsTraits<T> > {
1.30 @@ -996,7 +996,7 @@
1.31
1.32 ///The type of the map that indicates which nodes are processed.
1.33 ///It must conform to the \ref concepts::WriteMap "WriteMap" concept.
1.34 - ///By default it is a NullMap.
1.35 + ///By default, it is a NullMap.
1.36 typedef NullMap<typename Digraph::Node,bool> ProcessedMap;
1.37 ///Instantiates a ProcessedMap.
1.38