Fix incorrect identifiers.

lib/src/functions.dart

 // Copyright (c) 2016, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 import 'utils.dart';
 
 // TODO(nweiz): When sdk#26488 is fixed, use overloads to ensure that if [key]
 // or [value] isn't passed, `K2`/`V2` defaults to `K1`/`V1`, respectively.
 /// Creates a new map from [map] with new keys and values. 
 ///
@@ skipping 57 matching lines @@
 
   var/*=S*/ minValue;
   var/*=T*/ minOrderBy;
   for (var element in values) {
     var elementOrderBy = orderBy(element);
     if (minOrderBy == null || compare(elementOrderBy, minOrderBy) < 0) {
       minValue = element;
       minOrderBy = elementOrderBy;
     }
   }
-  return min;
+  return minValue;
 }
 
 /// Returns the element of [values] for which [orderBy] returns the maximum
 /// value.
 ///
 /// The values returned by [orderBy] are compared using the [compare] function.
 /// If [compare] is omitted, values must implement [Comparable<T>] and they are
 /// compared using their [Comparable.compareTo].
 /*=S*/ maxBy/*<S, T>*/(Iterable/*<S>*/ values, /*=T*/ orderBy(/*=S*/ element),
     {int compare(/*=T*/ value1, /*=T*/ value2)}) {
   compare ??= defaultCompare/*<T>*/();
 
   var/*=S*/ maxValue;
   var/*=T*/ maxOrderBy;
   for (var element in values) {
     var elementOrderBy = orderBy(element);
     if (maxOrderBy == null || compare(elementOrderBy, maxOrderBy) > 0) {
       maxValue = element;
       maxOrderBy = elementOrderBy;
     }
   }
-  return max;
+  return maxValue;
 }
 
 /// Returns the [transitive closure][] of [graph].
 ///
 /// [transitive closure]: https://en.wikipedia.org/wiki/Transitive_closure
 ///
 /// This interprets [graph] as a directed graph with a vertex for each key and
 /// edges from each key to the values associated with that key.
 ///
 /// Assumes that every vertex in the graph has a key to represent it, even if
@@ skipping 19 matching lines @@
         if (result[vertex2].contains(vertex1) &&
             result[vertex1].contains(vertex3)) {
           result[vertex2].add(vertex3);
         }
       }
     }
   }
 
   return result;
 }