Rename function parameters of method edgeExists.

Author: simphotonics

lib/src/graph/directed_graph.dart

@@ -72,9 +72,9 @@ class DirectedGraph<T extends Object> extends DirectedGraphBase<T> {
   Set<T> edges(T vertex) => _edges[vertex] ?? <T>{};
 
   @override
-  bool edgeExists(T vertexOut, T vertexIn) {
-    if (_edges.containsKey(vertexOut) &&
-        _edges[vertexOut]!.contains(vertexIn)) {
+  bool edgeExists(T vertex, T connectedVertex) {
+    if (_edges.containsKey(vertex) &&
+        _edges[vertex]!.contains(connectedVertex)) {
       return true;
     }
     return false;

lib/src/graph/directed_graph_base.dart

@@ -133,10 +133,10 @@ abstract class DirectedGraphBase<T extends Object> extends Iterable<T> {
   Set<T> edges(T vertex);
 
   /// Returns `true` if there is an edge pointing from
-  /// [source] to [target]. Returns `False` otherwise.
-  bool edgeExists(T source, T target);
+  /// [vertex] to [connectedVertex]. Returns `false` otherwise.
+  bool edgeExists(T vertex, T connectedVertex);
 
-  /// Returns `true` if `vertex` is a graph vertex.
+  /// Returns `true` if [vertex] is a graph vertex.
   /// Returns `false` otherwise.
   bool vertexExists(T vertex);
 

lib/src/graph/weighted_directed_graph.dart

@@ -127,9 +127,9 @@ class WeightedDirectedGraph<T extends Object, W extends Comparable>
   }
 
   @override
-  bool edgeExists(T vertexOut, T vertexIn) {
-    if (_edges.containsKey(vertexOut) &&
-        _edges[vertexOut]!.containsKey(vertexIn)) {
+  bool edgeExists(T vertex, T connectedVertex) {
+    if (_edges.containsKey(vertex) &&
+        _edges[vertex]!.containsKey(connectedVertex)) {
       return true;
     }
     return false;