图论-最短路径
gubojun
我是君
展开
-
杭电ACM HDU 1142 A Walk Through the Forest
A Walk Through the Forest Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4249 Accepted Submission(s): 1543 Problem Description Ji原创 2013-06-09 01:57:10 · 1093 阅读 · 0 评论 -
北大ACM POJ 1125 Stockbroker Grapevine
Stockbroker Grapevine Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 23004 Accepted: 12568 Description Stockbrokers are known to overreact to rumours. You h原创 2013-06-08 00:25:15 · 708 阅读 · 0 评论 -
杭电ACM HDU 3790 最短路径问题
最短路径问题 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7754 Accepted Submission(s): 2314 Problem Description 给你n个点,m条无向边,每条边都有长度d和原创 2013-06-09 00:35:25 · 3830 阅读 · 0 评论 -
杭电ACM HDU 1869 六度分离
六度分离 Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2472 Accepted Submission(s): 972 Problem Description 1967年,美国著名的社会学家斯坦利·米尔格兰姆原创 2013-07-04 16:01:00 · 1544 阅读 · 0 评论 -
Dijkstra 单源最短路径
java实现Dijkstra算法 源代码 图的结构Java实现 Dijkstra public class Dijkstra { private static final int INF = Integer.MAX_VALUE; /** * 初始化距离矩阵 * * @param graph 图 * @return 距离矩阵 ...原创 2018-03-07 15:06:19 · 241 阅读 · 0 评论 -
Floyd(多源最短路径)
java实现Floyd算法 源代码 图的结构java实现 Floyd public class Floyd { private static int INF = Integer.MAX_VALUE; public static void floyd(GraphMatrix graph) { int vertexNum = graph.getVertex...原创 2018-03-07 15:09:43 · 429 阅读 · 0 评论