* 变量重命名

bes2008 · Apr 25, 2021 · 5132ad9 · 5132ad9
1 parent cee14c6
commit 5132ad9
Show file tree

Hide file tree

Showing 4 changed files with 23 additions and 23 deletions.
diff --git a/...va/src/main/java/com/jn/langx/util/collection/graph/traverser/AbstractGraphTraverser.java b/...va/src/main/java/com/jn/langx/util/collection/graph/traverser/AbstractGraphTraverser.java
@@ -7,14 +7,14 @@
 public abstract class AbstractGraphTraverser<T> implements GraphTraverser<T> {
     @Override
     public void traverse(Graph<T> graph, String vertexName, VertexConsumer<T> consumer) {
-        Vertex<T> v = graph.getVertex(vertexName);
-        if (v == null) {
+        Vertex<T> vertex = graph.getVertex(vertexName);
+        if (vertex == null) {
             throw new IllegalArgumentException("the vertex (" + vertexName + ") is not exists");
         }
 
         Map<String, VisitStatus> visitStatusMap = Graphs.newVisitStatusMap();
-        traverse(visitStatusMap, graph, v, null, consumer);
+        traverse(visitStatusMap, graph, vertex, null, consumer);
     }
 
-    protected abstract void traverse(Map<String, VisitStatus> visitStatusMap, Graph<T> graph, Vertex<T> v, Edge<T> edge, VertexConsumer<T> consumer);
+    protected abstract void traverse(Map<String, VisitStatus> visitStatusMap, Graph<T> graph, Vertex<T> vertex, Edge<T> edge, VertexConsumer<T> consumer);
 }
diff --git a/...rc/main/java/com/jn/langx/util/collection/graph/traverser/BreadthFirstGraphTraverser.java b/...rc/main/java/com/jn/langx/util/collection/graph/traverser/BreadthFirstGraphTraverser.java
@@ -13,18 +13,18 @@
 public class BreadthFirstGraphTraverser<T> extends AbstractGraphTraverser<T> {
 
     @Override
-    protected void traverse(Map<String, VisitStatus> visitStatusMap, Graph<T> graph, Vertex<T> v, Edge<T> edge, VertexConsumer<T> consumer) {
+    protected void traverse(Map<String, VisitStatus> visitStatusMap, Graph<T> graph, Vertex<T> vertex, Edge<T> edge, VertexConsumer<T> consumer) {
         LinkedList<Vertex<T>> q = new LinkedList<Vertex<T>>();
 
-        q.add(v);
+        q.add(vertex);
         if (consumer != null) {
-            consumer.accept(graph, v, null);
+            consumer.accept(graph, vertex, null);
         }
-        Graphs.finishVisit(visitStatusMap, v.getName());
+        Graphs.finishVisit(visitStatusMap, vertex.getName());
         while (!q.isEmpty()) {
-            v = q.removeFirst();
-            for (int i = 0; i < v.getOutgoingEdgeCount(); i++) {
-                Edge<T> e = v.getOutgoingEdge(i);
+            vertex = q.removeFirst();
+            for (int i = 0; i < vertex.getOutgoingEdgeCount(); i++) {
+                Edge<T> e = vertex.getOutgoingEdge(i);
                 Vertex<T> to = e.getTo();
                 if (Graphs.isNotVisited(visitStatusMap, to.getName())) {
                     q.add(to);

diff --git a/...a/src/main/java/com/jn/langx/util/collection/graph/traverser/DeepFirstGraphTraverser.java b/...a/src/main/java/com/jn/langx/util/collection/graph/traverser/DeepFirstGraphTraverser.java
@@ -11,13 +11,13 @@
  */
 public class DeepFirstGraphTraverser<T> extends AbstractGraphTraverser<T> {
 
-    protected void traverse(Map<String, VisitStatus> visitStatusMap, Graph<T> graph, Vertex<T> v, Edge<T> edge, VertexConsumer<T> consumer) {
+    protected void traverse(Map<String, VisitStatus> visitStatusMap, Graph<T> graph, Vertex<T> vertex, Edge<T> edge, VertexConsumer<T> consumer) {
         if (consumer != null) {
-            consumer.accept(graph, v, edge);
+            consumer.accept(graph, vertex, edge);
         }
-        Graphs.finishVisit(visitStatusMap, v.getName());
-        for (int i = 0; i < v.getOutgoingEdgeCount(); i++) {
-            Edge<T> e = v.getOutgoingEdge(i);
+        Graphs.finishVisit(visitStatusMap, vertex.getName());
+        for (int i = 0; i < vertex.getOutgoingEdgeCount(); i++) {
+            Edge<T> e = vertex.getOutgoingEdge(i);
             if (Graphs.isNotVisited(visitStatusMap, e.getTo().getName())) {
                 traverse(visitStatusMap, graph, e.getTo(), e, consumer);
             }

diff --git a/...x-java/src/main/java/com/jn/langx/util/collection/graph/traverser/TreeGraphTraverser.java b/...x-java/src/main/java/com/jn/langx/util/collection/graph/traverser/TreeGraphTraverser.java
@@ -13,18 +13,18 @@
  */
 public class TreeGraphTraverser<T> extends AbstractGraphTraverser<T> {
 
-    protected void traverse(Map<String, VisitStatus> visitStatusMap, Graph<T> graph, Vertex<T> v, Edge<T> edge, VertexConsumer<T> consumer) {
+    protected void traverse(Map<String, VisitStatus> visitStatusMap, Graph<T> graph, Vertex<T> vertex, Edge<T> edge, VertexConsumer<T> consumer) {
         if (consumer != null) {
-            consumer.accept(graph, v, edge);
+            consumer.accept(graph, vertex, edge);
         }
-        Graphs.finishVisit(visitStatusMap, v.getName());
-        for (int i = 0; i < v.getOutgoingEdgeCount(); i++) {
-            Edge<T> e = v.getOutgoingEdge(i);
+        Graphs.finishVisit(visitStatusMap, vertex.getName());
+        for (int i = 0; i < vertex.getOutgoingEdgeCount(); i++) {
+            Edge<T> e = vertex.getOutgoingEdge(i);
             if (Graphs.isNotVisited(visitStatusMap, e.getTo().getName())) {
                 if (consumer != null) {
-                    consumer.accept(graph, v, e);
+                    consumer.accept(graph, vertex, e);
                 }
-                Graphs.finishVisit(visitStatusMap, v.getName());
+                Graphs.finishVisit(visitStatusMap, vertex.getName());
                 traverse(visitStatusMap, graph, e.getTo(), e, consumer);
             }
         }