数据结构实验：求两点之间最大噪声值最小值

#include "Assistance.h" // 辅助软件包 #include "ShortestPathFloyd.h" // 弗洛伊德算法 int main(void) { try // 用try封装可能出现异常的代码 { int infity = DEFAULT_INFINITY; char vexs[] = { 'A', 'B', 'C', 'D', 'E', 'F', 'G'}; /*int m[6][6] = { {infity, 12, 3, infity, 9, 10}, { 12, infity, infity, 2, 6, infity}, { 3, infity, infity, 2, infity, 6}, {infity, 2, 2, infity, 4, 7}, { 9, 6, infity, 4, infity, 4}, { 10, infity, 6, 7, 4, infity} };*/ int n, m, k, g[101][101]; ifstream f; f.open("input.in"); if (f.is_open()) { f >> n >> m >> k; if (n == 0 && m == 0 && k == 0) return 0; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) g[i][j] = infity; for (int i = 0; i < m; i++) { int a, b, c; f >> a >> b >> c; g[a-1][b-1] = g[b-1][a-1] = c; } } AdjListDirNetwork<char, int> net(vexs, n); for (int u = 0; u < n; u++) for (int v = n - 1; v >= 0; v--) if (g[u][v] != infity) net.InsertArc(u, v, g[u][v]); cout << "原网:" << endl; net.Display(); // 显示网net cout << endl; system("PAUSE"); // 调用库函数system() int** dist; // 分配存储空间 dist = new int* [net.GetVexNum()]; for (int i = 0; i < net.GetVexNum(); i++) { dist[i] = new int[net.GetVexNum()]; } int a1, b1; ShortestPathFloyd(net, dist); // 用Floyd算法求最短路径 for (int i = 0; i < k; i++) { f >> a1 >> b1; DisplayPathAndDist(net, dist, a1, b1);// 显示最大噪声值 cout << endl; } cout << endl << endl; // 释放存储空间 for (int j = 0; j < net.GetVexNum(); j++) { delete[]dist[j]; } delete[]dist; } catch (Error err) // 捕捉并处理异常 { err.Show(); // 显示异常信息 } system("PAUSE"); // 调用库函数system() return 0; // 返回值0, 返回操作系统 }