#include<iostream>
#include<fstream>
#include<string>
using namespace std;
/**
 *作者：Dmego
 *時(shí)間：2016-12-12
 */
#define MAX 1000000 //表示極大值∞
#define max 10
bool S[max]; //記錄從源點(diǎn)V0到終點(diǎn)Vi是否已經(jīng)確定為最短路徑，確定了記true，否則記false
int Path[max]; //記錄從源點(diǎn)V0到終點(diǎn)Vi的當(dāng)前最短路徑上終點(diǎn)Vi的直接前驅(qū)頂點(diǎn)序號(hào)，若V0到Vi之間有邊前驅(qū)為V0否則為-1 
int D[max]; //記錄源點(diǎn)到終點(diǎn)之間最短路徑的長(zhǎng)度，存在記V0到Vi的邊的權(quán)值，否則記為MAX 
typedef struct
{
 string vexs[max]; //頂點(diǎn)表
 int arcs[max][max]; //鄰接矩陣 
 int vexnum, arcnum; //圖當(dāng)前點(diǎn)數(shù)和邊數(shù)

}AMGraph;
//利用迪杰斯特拉算法求最短路徑
void ShortestPath_DIJ(AMGraph &G, int v0)
{//使用迪杰斯特拉算法求有向網(wǎng)G中的V0 定點(diǎn)到其余頂點(diǎn)的最短路徑
 int n = G.vexnum;//頂點(diǎn)數(shù)
 for (int v = 0; v < n; v++)//n個(gè)頂點(diǎn)依次初始化
 {
 S[v] = false;//S初始化為空集
 D[v] = G.arcs[v0][v];//將v0到各個(gè)終點(diǎn)的最短路徑長(zhǎng)度初始化為邊上的權(quán)值
 if (D[v] < MAX)
  Path[v] = v0;//如果v0和v之間有邊，則將v的前驅(qū)初始化為v0
 else
  Path[v] = -1;//如果v0和v之間無(wú)邊，則將v的前驅(qū)初始化為-1
 }
 S[v0] = true; //將v0加入s
 D[v0] = 0;//源點(diǎn)到源點(diǎn)的權(quán)值為0
 //---------初始化結(jié)束，開始主循環(huán)，每次求得v0到某個(gè)頂點(diǎn)的最短路徑，將v加到S數(shù)組
 for (int i = 1; i < n; i++)//依次對(duì)其余n-1個(gè)頂點(diǎn)進(jìn)行計(jì)算
 {
 int min = MAX;
 int v = v0;
 for (int w = 0; w < n; w++)
 {
  if (!S[w] && D[w] < min)
  {//選擇一條當(dāng)前最短路徑，終點(diǎn)為v
  v = w;
  min = D[w];
  }
  S[v] = true;//將v加到s集合中
  for (int w = 0; w < n; w++)
  {//更新從v0出發(fā)到集合V-S上所有頂點(diǎn)的最短路徑長(zhǎng)度
  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的前驅(qū)為v
  }
  }
 }
 }
}
//背景函數(shù)
void backGround()
{
 cout << "|*****************************************************************|" << endl;
 cout << " |------------------------鐵大旅游景點(diǎn)圖-----------------|" << endl;
 cout << "|*****************************************************************|" << endl;
 cout << "|  ⑦      單位：米 |" << endl;
 cout << "|  九教       |" << endl;
 cout << "|  ◎     ⑧  |" << endl;
 cout << "|  ↗↖     九棟  |" << endl;
 cout << "| ③ 200╱ ╲     ◎  |" << endl;
 cout << "| 西 ↙ ╲ 150    ↗ ↖  |" << endl;
 cout << "| 操 ◎  ╲ ①  160 ╱ ╲ 200 |" << endl;
 cout << "| 場(chǎng) ↖150  ╲ 信息  ⑥ ╱  ╲ |" << endl;
 cout << "| ④ ↘ 140 ↘ 學(xué)院 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 << "|----------------------------鐵大導(dǎo)游小程序-----------------------|" << endl;
 cout << " |*********************************************************|" << endl;
 cout << " |--------------------1-景點(diǎn)信息查詢--------------|" << endl;
 cout << " |--------------------2-最短路徑查詢--------------|" << endl;
 cout << " |--------------------3-顯示景點(diǎn)視圖--------------|" << endl;
 cout << " |-------------------4-退出導(dǎo)游程序------ --------|" << endl;
 cout << "|*****************************************************************|" << endl;
 cout << ">>>請(qǐng)選擇：";
}
//景點(diǎn)信息查詢二級(jí)菜單
void jmenu()
{
 cout << "|*****************************************************************|" << endl;
 cout << " |-------------------------景點(diǎn)信息查詢------------------------|" << endl;
 cout << " |***********************************************************|" << endl;
 cout << " |----------------------1-信息學(xué)院介紹-------------------| " << endl;
 cout << " |----------------------2-綜合餐廳介紹-------------------| " << endl;
 cout << " |----------------------3-西操場(chǎng)介紹---------------------| " << 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 << ">>>請(qǐng)要查詢的景點(diǎn)編號(hào)：";
}
//最短路徑查詢二級(jí)菜單
void pmenu()
{
 cout << "|*****************************************************************|" << endl;
 cout << " |-------------------------最短路徑查詢------------------------|" << endl;
 cout << " |***********************************************************|" << endl;
 cout << " |---------------------1-信息學(xué)院-------------------| " << endl;
 cout << " | --------------------2-綜合餐廳-------------------| " << endl;
 cout << " |---------------------3-西操場(chǎng)---------------------| " << 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 << ">>>請(qǐng)依次輸入起點(diǎn)編號(hào)和終點(diǎn)編號(hào)：";
}
void main()
{
 //初始化操作
 AMGraph amg = { { "信息學(xué)院","綜合餐廳","西操場(chǎng)","體育館","春暉樓",
   "基教", "九教", "九棟", "沁園", "翠園" },
 //-1代表兩邊不相連，權(quán)值無(wú)限大
 //鄰接矩陣 /* 信 綜 西 體 春 基 教 棟 沁 翠*/ 
   {{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;
　　　　　　　//景點(diǎn)信息從文件中讀取
  ifstream outfile("schooltravel.txt", ios :: out | ios :: binary);
  if (!outfile)
  {
  cerr << "讀取景點(diǎn)介紹文件失??！" << endl;
  abort();
  }
  string str[max];
  int i = 0;
  while (getline(outfile, str[i++]));
  cout << "|-----------------------景點(diǎn)介紹-------------------| " << 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);
 }
 }
}