摘要：
迪杰斯特拉算法（Dijkstra）： Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。 主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。 1 #include <iostream> 2 using namespace std; 3 co 阅读全文
摘要：
Invitation Cards Problem Description In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware 阅读全文
摘要：
Arbitrage Problem Description Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one 阅读全文
摘要：
MPI Maelstrom Problem Description BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory 阅读全文
摘要：
Currency Exchange Problem Description Several currency exchange points are working in our city. Let us suppose that each point specializes in two part 阅读全文