Renamed max_index_value_plus_one() (a function for working with graphs) to

max_index_plus_one() so that it uses the same name as the essentially identical
function for working with sparse vectors.

--HG--
extra : convert_revision : svn%3Afdd8eb12-d10e-0410-9acb-85c331704f74/trunk%404168

dlib/manifold_regularization/graph_creation.h

@@ -415,7 +415,7 @@ namespace dlib
     template <
         typename vector_type 
         >
-    unsigned long max_index_value_plus_one (
+    unsigned long max_index_plus_one (
         const vector_type& pairs
     )
     {

dlib/manifold_regularization/graph_creation_abstract.h

@@ -146,7 +146,7 @@ namespace dlib
     template <
         typename vector_type 
         >
-    unsigned long max_index_value_plus_one (
+    unsigned long max_index_plus_one (
         const vector_type& pairs
     );
     /*!

dlib/manifold_regularization/linear_manifold_regularizer.h

@@ -216,13 +216,13 @@ namespace dlib
             // make sure requires clause is not broken
             DLIB_ASSERT(edges.size() > 0 &&
                         contains_duplicate_pairs(edges) == false &&
-                        max_index_value_plus_one(edges) <= samples.size(),
+                        max_index_plus_one(edges) <= samples.size(),
                 "\t void linear_manifold_regularizer::build()"
                 << "\n\t Invalid inputs were given to this function."
                 << "\n\t edges.size():                    " << edges.size()
                 << "\n\t samples.size():                  " << samples.size()
                 << "\n\t contains_duplicate_pairs(edges): " << contains_duplicate_pairs(edges) 
-                << "\n\t max_index_value_plus_one(edges): " << max_index_value_plus_one(edges) 
+                << "\n\t max_index_plus_one(edges):       " << max_index_plus_one(edges) 
                 );
 
 

dlib/manifold_regularization/linear_manifold_regularizer_abstract.h

@@ -85,7 +85,7 @@ namespace dlib
                   it must in turn contain objects with an interface compatible with dlib::sample_pair
                 - edges.size() > 0
                 - contains_duplicate_pairs(edges) == false
-                - max_index_value_plus_one(edges) <= samples.size()
+                - max_index_plus_one(edges) <= samples.size()
                 - weight_funct(edges[i]) must be a valid expression that evaluates to a
                   floating point number >= 0
             ensures