From 21b91fcde68de9402057c1fb1e7bb6a22bac204d Mon Sep 17 00:00:00 2001
From: Looly <loolly@gmail.com>
Date: Thu, 17 Nov 2022 01:13:59 +0800
Subject: [PATCH] =?UTF-8?q?=E5=87=A0=E4=B8=AA=E5=B0=8F=E4=BC=98=E5=8C=96?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../test/java/cn/hutool/core/map/GraphTest.java  | 16 ++++++++--------
 1 file changed, 8 insertions(+), 8 deletions(-)

diff --git a/hutool-core/src/test/java/cn/hutool/core/map/GraphTest.java b/hutool-core/src/test/java/cn/hutool/core/map/GraphTest.java
index 0ebddb5f8..758d3e5eb 100644
--- a/hutool-core/src/test/java/cn/hutool/core/map/GraphTest.java
+++ b/hutool-core/src/test/java/cn/hutool/core/map/GraphTest.java
@@ -15,7 +15,7 @@ public class GraphTest {
 
 	@Test
 	public void testPutEdge() {
-		Graph<Integer> graph = new Graph<>();
+		final Graph<Integer> graph = new Graph<>();
 		graph.putEdge(0, 1);
 		graph.putEdge(1, 2);
 		graph.putEdge(2, 0);
@@ -30,7 +30,7 @@ public class GraphTest {
 		// 0 -- 1
 		// |    |
 		// 3 -- 2
-		Graph<Integer> graph = new Graph<>();
+		final Graph<Integer> graph = new Graph<>();
 		graph.putEdge(0, 1);
 		graph.putEdge(1, 2);
 		graph.putEdge(2, 3);
@@ -53,7 +53,7 @@ public class GraphTest {
 
 	@Test
 	public void removeEdge() {
-		Graph<Integer> graph = new Graph<>();
+		final Graph<Integer> graph = new Graph<>();
 		graph.putEdge(0, 1);
 		Assert.assertTrue(graph.containsEdge(0, 1));
 
@@ -66,7 +66,7 @@ public class GraphTest {
 		// 0 -- 1
 		// |    |
 		// 3 -- 2
-		Graph<Integer> graph = new Graph<>();
+		final Graph<Integer> graph = new Graph<>();
 		graph.putEdge(0, 1);
 		graph.putEdge(1, 2);
 		graph.putEdge(2, 3);
@@ -87,7 +87,7 @@ public class GraphTest {
 		// 0 -- 1
 		// |    |
 		// 3 -- 2
-		Graph<Integer> graph = new Graph<>();
+		final Graph<Integer> graph = new Graph<>();
 		graph.putEdge(0, 1);
 		graph.putEdge(1, 2);
 		graph.putEdge(2, 3);
@@ -113,7 +113,7 @@ public class GraphTest {
 		// 0 -- 1
 		// |    |
 		// 3 -- 2
-		Graph<Integer> graph = new Graph<>();
+		final Graph<Integer> graph = new Graph<>();
 		graph.putEdge(0, 1);
 		graph.putEdge(1, 2);
 		graph.putEdge(2, 3);
@@ -130,7 +130,7 @@ public class GraphTest {
 		// 0 -- 1
 		// |    |
 		// 3 -- 2
-		Graph<Integer> graph = new Graph<>();
+		final Graph<Integer> graph = new Graph<>();
 		graph.putEdge(0, 1);
 		graph.putEdge(1, 2);
 		graph.putEdge(2, 3);
@@ -148,7 +148,7 @@ public class GraphTest {
 	}
 
 	@SafeVarargs
-	private static <T> Set<T> asSet(T... ts) {
+	private static <T> Set<T> asSet(final T... ts) {
 		return new LinkedHashSet<>(Arrays.asList(ts));
 	}