ZhouXY108/hutool
1
0
Fork 0
mirror of https://gitee.com/chinabugotech/hutool.git synced 2025-05-09 23:51:34 +08:00
Code Issues Packages Projects Releases Wiki Activity

几个小优化

Browse Source
This commit is contained in:
Looly 2022-11-17 01:13:59 +08:00
parent 7d962754fb
commit 21b91fcde6
1 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
hutool-core/src/test/java/cn/hutool/core/map/GraphTest.java
View File

@ -15,7 +15,7 @@ public class GraphTest {
@Test @Test
public void testPutEdge() { public void testPutEdge() {
Graph<Integer> graph = new Graph<>(); final Graph<Integer> graph = new Graph<>();
graph.putEdge(0, 1); graph.putEdge(0, 1);
graph.putEdge(1, 2); graph.putEdge(1, 2);
graph.putEdge(2, 0); graph.putEdge(2, 0);
@ -30,7 +30,7 @@ public class GraphTest {
// 0 -- 1 // 0 -- 1
// | | // | |
// 3 -- 2 // 3 -- 2
Graph<Integer> graph = new Graph<>(); final Graph<Integer> graph = new Graph<>();
graph.putEdge(0, 1); graph.putEdge(0, 1);
graph.putEdge(1, 2); graph.putEdge(1, 2);
graph.putEdge(2, 3); graph.putEdge(2, 3);
@ -53,7 +53,7 @@ public class GraphTest {
@Test @Test
public void removeEdge() { public void removeEdge() {
Graph<Integer> graph = new Graph<>(); final Graph<Integer> graph = new Graph<>();
graph.putEdge(0, 1); graph.putEdge(0, 1);
Assert.assertTrue(graph.containsEdge(0, 1)); Assert.assertTrue(graph.containsEdge(0, 1));
@ -66,7 +66,7 @@ public class GraphTest {
// 0 -- 1 // 0 -- 1
// | | // | |
// 3 -- 2 // 3 -- 2
Graph<Integer> graph = new Graph<>(); final Graph<Integer> graph = new Graph<>();
graph.putEdge(0, 1); graph.putEdge(0, 1);
graph.putEdge(1, 2); graph.putEdge(1, 2);
graph.putEdge(2, 3); graph.putEdge(2, 3);
@ -87,7 +87,7 @@ public class GraphTest {
// 0 -- 1 // 0 -- 1
// | | // | |
// 3 -- 2 // 3 -- 2
Graph<Integer> graph = new Graph<>(); final Graph<Integer> graph = new Graph<>();
graph.putEdge(0, 1); graph.putEdge(0, 1);
graph.putEdge(1, 2); graph.putEdge(1, 2);
graph.putEdge(2, 3); graph.putEdge(2, 3);
@ -113,7 +113,7 @@ public class GraphTest {
// 0 -- 1 // 0 -- 1
// | | // | |
// 3 -- 2 // 3 -- 2
Graph<Integer> graph = new Graph<>(); final Graph<Integer> graph = new Graph<>();
graph.putEdge(0, 1); graph.putEdge(0, 1);
graph.putEdge(1, 2); graph.putEdge(1, 2);
graph.putEdge(2, 3); graph.putEdge(2, 3);
@ -130,7 +130,7 @@ public class GraphTest {
// 0 -- 1 // 0 -- 1
// | | // | |
// 3 -- 2 // 3 -- 2
Graph<Integer> graph = new Graph<>(); final Graph<Integer> graph = new Graph<>();
graph.putEdge(0, 1); graph.putEdge(0, 1);
graph.putEdge(1, 2); graph.putEdge(1, 2);
graph.putEdge(2, 3); graph.putEdge(2, 3);
@ -148,7 +148,7 @@ public class GraphTest {
} }
@SafeVarargs @SafeVarargs
private static <T> Set<T> asSet(T... ts) { private static <T> Set<T> asSet(final T... ts) {
return new LinkedHashSet<>(Arrays.asList(ts)); return new LinkedHashSet<>(Arrays.asList(ts));
} }