Index: doc/coding_style.dox
===================================================================
--- doc/coding_style.dox (revision 463)
+++ doc/coding_style.dox (revision 1023)
@@ -99,8 +99,8 @@
\subsection pri-loc-var Private member variables
-Private member variables should start with underscore
+Private member variables should start with underscore.
\code
-_start_with_underscores
+_start_with_underscore
\endcode
Index: doc/groups.dox
===================================================================
--- doc/groups.dox (revision 999)
+++ doc/groups.dox (revision 1023)
@@ -407,8 +407,8 @@
strongly polynomial \ref klein67primal, \ref goldberg89cyclecanceling.
-In general NetworkSimplex is the most efficient implementation,
-but in special cases other algorithms could be faster.
+In general, \ref NetworkSimplex and \ref CostScaling are the most efficient
+implementations, but the other two algorithms could be faster in special cases.
For example, if the total supply and/or capacities are rather small,
-CapacityScaling is usually the fastest algorithm (without effective scaling).
+\ref CapacityScaling is usually the fastest algorithm (without effective scaling).
*/
@@ -472,5 +472,5 @@
\ref dasdan98minmeancycle.
-In practice, the \ref HowardMmc "Howard" algorithm proved to be by far the
+In practice, the \ref HowardMmc "Howard" algorithm turned out to be by far the
most efficient one, though the best known theoretical bound on its running
time is exponential.
@@ -540,5 +540,5 @@
/**
-@defgroup planar Planarity Embedding and Drawing
+@defgroup planar Planar Embedding and Drawing
@ingroup algs
\brief Algorithms for planarity checking, embedding and drawing