#include<iostream>
#include<fstream>
#include<string>
using namespace std;
/***作者：Dmego*时间：2016-12-12*/
#define MAX 1000000  //表示极大值∞
#define max 10
bool S[max];   //记录从源点V0到终点Vi是否已经确定为最短路径，确定了记true，否则记false
int Path[max]; //记录从源点V0到终点Vi的当前最短路径上终点Vi的直接前驱顶点序号，若V0到Vi之间有边前驱为V0否则为-1
int D[max];  //记录源点到终点之间最短路径的长度，存在记V0到Vi的边的权值，否则记为MAX
typedef struct
{string vexs[max];       //顶点表int arcs[max][max];      //邻接矩阵        int vexnum, arcnum;    //图当前点数和边数

}AMGraph;
//利用迪杰斯特拉算法求最短路径
void ShortestPath_DIJ(AMGraph &G, int v0)
{//使用迪杰斯特拉算法求有向网G中的V0 定点到其余顶点的最短路径int n = G.vexnum;//顶点数for (int v = 0; v < n; v++)//n个顶点依次初始化
    {S[v] = false;//S初始化为空集D[v] = G.arcs[v0][v];//将v0到各个终点的最短路径长度初始化为边上的权值if (D[v] < MAX)Path[v] = v0;//如果v0和v之间有边，则将v的前驱初始化为v0elsePath[v] = -1;//如果v0和v之间无边，则将v的前驱初始化为-1
    }S[v0] = true; //将v0加入sD[v0] = 0;//源点到源点的权值为0//---------初始化结束，开始主循环，每次求得v0到某个顶点的最短路径，将v加到S数组for (int i = 1; i < n; i++)//依次对其余n-1个顶点进行计算
    {int    min = MAX;int v = v0;for (int w = 0; w < n; w++){if (!S[w] && D[w] < min){//选择一条当前最短路径，终点为vv = w;min = D[w];}S[v] = true;//将v加到s集合中for (int w = 0; w < n; w++){//更新从v0出发到集合V-S上所有顶点的最短路径长度if (!S[w] && (D[v] + G.arcs[v][w] < D[w])){D[w] = D[v] + G.arcs[v][w];//更新D[w]Path[w] = v;//更改w的前驱为v
                }}}}
}
//背景函数
void backGround()
{
    cout << "|*****************************************************************|" << endl;cout << "    |------------------------铁大旅游景点图-----------------|"     << endl;cout << "|*****************************************************************|" << endl;cout << "|           ⑦                                          单位：米  |" << endl;cout << "|           九教                                                  |" << endl;cout << "|            ◎                                      ⑧           |" << endl;cout << "|           ↗↖                                    九栋          |" << endl;cout << "|  ③  200╱    ╲                                   ◎           |" << endl;cout << "|  西   ↙        ╲ 150                            ↗ ↖         |" << endl;cout << "|  操 ◎            ╲       ①               160 ╱     ╲ 200   |" << endl;cout << "|  场  ↖150          ╲    信息          ⑥    ╱         ╲     |" << endl;cout << "|    ④  ↘    140      ↘  学院  200    基教 ↙     230     ↘   |" << endl;cout << "|   体育馆 ◎-------------→◎←--------------→◎←--------------→◎ |" << endl;cout << "|            ↖         ↗ ↖              ↗ ↖             ↗② |" << endl;cout << "|          100 ╲     ╱     ╲ 125      ╱     ╲ 150     ╱  综 |" << endl;cout << "|                ↘ ↙ 100     ╲      ╱135      ╲     ╱145 餐 |" << endl;cout << "|                  ◎            ↘  ↙             ↘ ↙        |" << endl;cout << "|             ⑨ 沁园              ◎                 ◎         |" << endl;cout << "|                             ⑩ 翠园          ⑤  春晖楼         |" << endl;cout << "|                                                               |" << endl;cout << "|*****************************************************************|" << endl;

}
//主菜单
void menu()
{cout << "|*****************************************************************|" << endl;cout << "|----------------------------铁大导游小程序-----------------------|" << endl;cout << "    |*********************************************************|" << endl;cout << "        |--------------------1-景点信息查询--------------|" << endl;cout << "        |--------------------2-最短路径查询--------------|" << endl;cout << "        |--------------------3-显示景点视图--------------|" << endl;cout << "        |-------------------4-退出导游程序------ --------|" << endl;cout << "|*****************************************************************|" << endl;cout << ">>>请选择：";
}
//景点信息查询二级菜单
void jmenu()
{cout << "|*****************************************************************|" << endl;cout << "    |-------------------------景点信息查询------------------------|" << endl;cout << "    |***********************************************************|" << endl;cout << "      |----------------------1-信息学院介绍-------------------| " << endl;cout << "      |----------------------2-综合餐厅介绍-------------------| " << endl;cout << "      |----------------------3-西操场介绍---------------------| " << endl;cout << "      |----------------------4-体育馆介绍---------------------| " << endl;cout << "      |----------------------5-春晖楼介绍---------------------| " << endl;cout << "      |----------------------6-基教介绍-----------------------| " << endl;cout << "      |----------------------7-九教介绍-----------------------| " << endl;cout << "      |----------------------8-九栋介绍-----------------------| " << endl;cout << "      |----------------------9-沁园介绍-----------------------| " << endl;cout << "      |---------------------10-翠园介绍-----------------------| " << endl;cout << "|*****************************************************************|" << endl;cout << ">>>请要查询的景点编号：";
}//最短路径查询二级菜单
void pmenu()
{cout << "|*****************************************************************|" << endl;cout << "    |-------------------------最短路径查询------------------------|" << endl;cout << "    |***********************************************************|" << endl;cout << "        |---------------------1-信息学院-------------------| " << endl;cout << "        | --------------------2-综合餐厅-------------------| " << endl;cout << "        |---------------------3-西操场---------------------| " << endl;cout << "        |---------------------4-体育馆---------------------| " << endl;cout << "        |---------------------5-春晖楼---------------------| " << endl;cout << "        |---------------------6-基教-----------------------| " << endl;cout << "        |---------------------7-九教-----------------------| " << endl;cout << "        |---------------------8-九栋-----------------------| " << endl;cout << "        |---------------------9-沁园-----------------------| " << endl;cout << "        |--------------------10-翠园-----------------------| " << endl;cout << "|*****************************************************************|" << endl;cout << ">>>请依次输入起点编号和终点编号：";
}
void main()
{//初始化操作AMGraph amg = { { "信息学院","综合餐厅","西操场","体育馆","春晖楼","基教",    "九教",    "九栋",   "沁园", "翠园" },//-1代表两边不相连，权值无限大//邻接矩阵   /* 信  综  西  体  春  基  教  栋  沁  翠*/    {{MAX,MAX,MAX,140,MAX,200,150,MAX,100,125 },{MAX,MAX,MAX,MAX,145,230,MAX,100,MAX,MAX },{MAX,MAX,MAX,150,MAX,MAX,200,MAX,MAX,MAX },{140,MAX,150,MAX,MAX,MAX,MAX,MAX,100,MAX },{MAX,145,MAX,MAX,MAX,150,MAX,MAX,MAX,MAX },{200,230,MAX,MAX,150,MAX,MAX,160,MAX,135 },{150,MAX,200,MAX,MAX,MAX,MAX,MAX,MAX,MAX },{MAX,200,MAX,MAX,MAX,160,MAX,MAX,MAX,MAX },{100,MAX,MAX,100,MAX,MAX,MAX,MAX,MAX,MAX },{125,MAX,MAX,MAX,MAX,135,MAX,MAX,MAX,MAX }},10,14};int f, ff;int start, end;while (true){cout << endl;menu();cin >> f;if (f == 1){jmenu();cin >> ff;　　　　　　　//景点信息从文件中读取ifstream outfile("schooltravel.txt", ios :: out | ios :: binary);if (!outfile){cerr << "读取景点介绍文件失败！" << endl;exit(1);}string str[max];int i = 0;while (getline(outfile, str[i++]));cout << "|-----------------------景点介绍-------------------| " << endl;if (ff == 1)cout << str[0] << endl;else if (ff == 2)cout << str[1] << endl;else if (ff == 3)cout << str[2] << endl;else if(ff == 4)cout << str[3] << endl;else if (ff == 5)cout << str[4] << endl;else if (ff == 6)cout << str[5] << endl;else if (ff == 7)cout << str[6] << endl;else if (ff == 8)cout << str[7] << endl;else if (ff == 9)cout << str[8] << endl;else if (ff == 10)cout << str[9] << endl;cout << "|-------------------------------------------------|" << endl;}else if (f == 2){pmenu();cin >> start >> end;ShortestPath_DIJ(amg, start - 1);int temp = end-1;int temp1, temp2;int flag[max], m = 0;cout << "从" << amg.vexs[start - 1] << "到" << amg.vexs[end - 1] << "最短路径为：" ;while (temp!= -1){flag[m++] = temp;temp1 = temp ;temp2 = Path[temp1];temp = temp2;}for (int i = m-1; i >= 0; i--){cout <<amg.vexs[flag[i]] << "->";}cout << endl;cout << "最短路径值为：" << D[end - 1] <<"米"<< endl;}else if (f == 3){backGround();}else if (f == 4){cout << ">>>退出成功！" << endl;exit(0);}}
}