最短路
文章平均质量分 87
tch_1997
这个作者很懒,什么都没留下…
展开
-
POJ1502MPI Maelstrom 【Dijkstra】
http://poj.org/problem?id=1502 Description BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical c原创 2017-01-23 23:31:05 · 246 阅读 · 0 评论 -
POJ 2240Arbitrage
http://poj.org/problem?id=2240 Description Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency原创 2017-01-23 20:48:31 · 219 阅读 · 0 评论 -
POJ1860 Currency Exchange【bellman-Ford算法】
http://poj.org/problem?id=1860 Description Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs ex原创 2017-01-23 20:45:15 · 296 阅读 · 0 评论 -
POJ 1125Stockbroker Grapevine 【最短路】
http://poj.org/problem?id=1125 POJ - 1125 Stockbroker Grapevine Description Stockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading原创 2017-01-23 20:28:11 · 264 阅读 · 0 评论 -
最短路径∷相关函数:ShortestPath_DIJ函数
#include /* INT_MAX等 */ #include /* EOF(=^Z或F6),NULL */ #define TRUE 1 #define FALSE 0 #define OK 1 #define ERROR 0 typedef int Status; /* Status是函数的类型,其值是函数结果状态代码,如OK等 */ #define MAX_NAME 5 /* 顶点字符串的原创 2017-01-18 16:16:59 · 1888 阅读 · 0 评论