|
|
@@ -11,7 +11,6 @@
|
|
|
2.区分机动车道和人行道。
|
|
|
3.实现导游图的仿真界面。
|
|
|
|
|
|
-注：很惭愧，有关基于邻接矩阵存储的无向图某两点之间的所有路径的相关算法我真的不会，另外由于时间关系选做的我也没做，对不起王阿川老师T_T
|
|
|
**/
|
|
|
|
|
|
#include <iostream>
|
|
|
@@ -61,43 +60,44 @@ void schoolmap()
|
|
|
printf(" | | (3) | | | | | 1 | | 2 | | 3 | | 4 | | |\n");
|
|
|
printf(" | | | | | | *----* *----* *----* *----* | |\n");
|
|
|
printf(" | *----------------* *-----------------* *--------------------------------* |\n");
|
|
|
- printf(" | ----------------------- |\n");
|
|
|
- printf(" | | 间 | 市 | 室 | |\n");
|
|
|
- printf(" | | 空 | 超 | | |\n");
|
|
|
- printf(" | | 创 | 苑 | | |\n");
|
|
|
- printf(" | | 众 | 学 | 浴 | |\n");
|
|
|
- printf(" | ----------------------- |\n");
|
|
|
- printf(" | --------------- |\n");
|
|
|
- printf(" | | | |\n");
|
|
|
- printf(" | | 知 味 园 | |\n");
|
|
|
- printf(" | | | |\n");
|
|
|
- printf(" | --------------- |\n");
|
|
|
- printf(" | *--------* *--------* *-------* |\n");
|
|
|
- printf(" | | | | | | | |\n");
|
|
|
- printf(" | | A | | B | | C | |\n");
|
|
|
- printf(" | | 楼 | | 楼 | | 楼 | |\n");
|
|
|
- printf(" | | 知 | | 知 | | 知 | |\n");
|
|
|
- printf(" | | 致 | | 致 | | 致 | |\n");
|
|
|
- printf(" | | | | | | | |\n");
|
|
|
- printf(" | *--------* *--------* *-------* |\n");
|
|
|
- printf(" |------- *----------* |\n");
|
|
|
- printf(" | 门 | | | |\n");
|
|
|
- printf(" | | | 馆 | |\n");
|
|
|
- printf(" | | | 书 | |\n");
|
|
|
- printf(" | 南 | | 图 | |\n");
|
|
|
- printf(" |------- | | |\n");
|
|
|
- printf(" | *----------* |\n");
|
|
|
- printf(" | *--------* *--------* *-------* |\n");
|
|
|
- printf(" | | | | | | | |\n");
|
|
|
- printf(" | | A | | B | | C | |\n");
|
|
|
- printf(" | | 楼 | | 楼 | | 楼 | |\n");
|
|
|
- printf(" | | 行 | | 行 | | 行 | |\n");
|
|
|
- printf(" | | 敏 | | 敏 | | 敏 | |\n");
|
|
|
- printf(" | | | | | | | |\n");
|
|
|
- printf(" | *--------* *--------* *-------* |\n");
|
|
|
- printf(" *----------------------------------------------------------------------------*\n");
|
|
|
+ printf(" | ----------------------- *----------* |\n");
|
|
|
+ printf(" | | 间 | 市 | 室 | | *------* | |\n");
|
|
|
+ printf(" | | 空 | 超 | | | | B | | |\n");
|
|
|
+ printf(" | | 创 | 苑 | | | | 园 | | |\n");
|
|
|
+ printf(" | | 众 | 学 | 浴 | | | | | |\n");
|
|
|
+ printf(" | | （4）| （5） |（6）| | | 味 | | |\n");
|
|
|
+ printf(" | ----------------------- | | | | |\n");
|
|
|
+ printf(" | *---------* | 知 | | |\n");
|
|
|
+ printf(" | | *-------* | | |\n");
|
|
|
+ printf(" | | | | | |\n");
|
|
|
+ printf(" | | | 知味园A | | |\n");
|
|
|
+ printf(" | *----------------------------------* | | | | |\n");
|
|
|
+ printf(" | | *--------* *--------* *-------* | | *---------------* | |\n");
|
|
|
+ printf(" | | | | | | | | | | （7） | |\n");
|
|
|
+ printf(" | | | A | | B | | C | | *--------------------* |\n");
|
|
|
+ printf(" | | | 楼 | | 楼 | | 楼 | | |\n");
|
|
|
+ printf(" | | | 知 | | 知 | | 知 | | |\n");
|
|
|
+ printf(" | | | 致 | | 致 | | 致 | | |\n");
|
|
|
+ printf(" | | | | | | | | | |\n");
|
|
|
+ printf(" | | *--------* *--------* *-------* | |\n");
|
|
|
+ printf(" |-----* | (8) | *----------* |\n");
|
|
|
+ printf(" | 门 | *-----------------------------------* | | |\n");
|
|
|
+ printf(" | (11)| | 馆 | |\n");
|
|
|
+ printf(" | | | 书 | |\n");
|
|
|
+ printf(" | 南 | | 图 | |\n");
|
|
|
+ printf(" |-----* *-------------------------------------* | (10) | |\n");
|
|
|
+ printf(" | | (9) | *----------* |\n");
|
|
|
+ printf(" | | *--------* *--------* *-------* | |\n");
|
|
|
+ printf(" | | | | | | | | | |\n");
|
|
|
+ printf(" | | | A | | B | | C | | |\n");
|
|
|
+ printf(" | | | 楼 | | 楼 | | 楼 | | |\n");
|
|
|
+ printf(" | | | 行 | | 行 | | 行 | | |\n");
|
|
|
+ printf(" | | | 敏 | | 敏 | | 敏 | | |\n");
|
|
|
+ printf(" | | | | | | | | | |\n");
|
|
|
+ printf(" | | *--------* *--------* *-------* | | 东 门 | |\n");
|
|
|
+ printf(" *------*-------------------------------------*--------*-----------*------------*\n");
|
|
|
+ printf("\n");
|
|
|
}
|
|
|
-
|
|
|
void create(MGraph &g,VertexType site[])
|
|
|
{
|
|
|
int i,j;
|
