!1261 基于SPFA算法实现有向图结构

* 修改注释
* 修改注释
* 修改异常信息
* 修改负环检查的判断条件 当原图为非联通图 以及当前开始节点可触达节点小于总节点数 或者环路路段较短时 所需要循环执行的次数
* Merge branch 'v6-dev' of https://gitee.com/hrnd/hutool into v6-dev
* 更新单元测试
* 添加入队SLF优化
* 有向图 基于SPFA 算法实现
* 修改测试用例
* 修改测试用例
* Merge branch 'v6-dev' of https://gitee.com/hrnd/hutool into v6-dev
* 实现有向图，提供最短路径方法

hutool-core/src/test/java/org/dromara/hutool/core/map/DirectedWeightGraphTest.java

@@ -0,0 +1,55 @@
+package org.dromara.hutool.core.map;
+
+import org.dromara.hutool.core.map.multi.DirectedWeightGraph;
+import org.junit.jupiter.api.Test;
+
+import java.util.List;
+import java.util.Map;
+
+/**
+ * @author newshiJ
+ * @date 2024/8/14 17:07
+ */
+public class DirectedWeightGraphTest {
+
+	@Test
+	public void test1(){
+		DirectedWeightGraph<String> graph = new DirectedWeightGraph<>();
+		graph.putEdge("A", "B", 14);
+		graph.putEdge("A", "C", 8);
+		graph.putEdge("A", "D", 12);
+
+//		graph.putEdge("B", "A", -14);
+		graph.putEdge("B", "E", 4);
+
+		graph.putEdge("C", "B", 3);
+		graph.putEdge("C", "D", 5);
+		graph.putEdge("C", "E", 5);
+		graph.putEdge("C", "F", 6);
+
+		graph.putEdge("D", "F", 7);
+
+//		graph.putEdge("E", "B", -14);
+		graph.putEdge("E", "G", 4);
+
+		graph.putEdge("G", "B", -9);
+
+		graph.putEdge("F", "G", 2);
+
+		graph.putEdge("X", "Y", 2);
+
+		graph.removePoint("X");
+
+		System.out.println(graph);
+		Map<String, DirectedWeightGraph.Path<String>> map = null;
+		try {
+			map = graph.bestPathMap("A");
+			map.forEach((k,v) -> {
+				System.out.println(v);
+			});
+		} catch (DirectedWeightGraph.NegativeRingException e) {
+			e.printStackTrace();
+		}
+
+	}
+}