题意:给定一个城市的地铁图,给出起点和终点,然后求其经过的所经过的最小站数以及最小的中转次数,
思路:这题算是图中比较难的一题了,主要是利用深搜+回溯的办法,求其从起点到终点的最小站数及中转站数,要求如果又有条路线相同,则输出中转站数最小的那条路线。用vector二维数组保存图,用line无序map保存相邻两站点所在的地铁路线,用于判断中转的次数,
注意点:
1.每次做完一个实例要记得初始化(minStas = 9999999, minTransfer = 9999999);
2.path不用每次都清理主要是temp保存的最短的路径找到了直接替换;
3.注意两站点边界的情况;
4.注意打印的情况(Take Line#%d from %04d to %04d.),这里题目没有明说
代码:
#include<iostream>
#include<unordered_map>
#include<vector>
using namespace std;
vector<vector<int>> v(10000);//存储图
unordered_map<int,int> line;
vector<int> path, tempath;
int n = 0,k = 0,start = 0,destination = 0,minStas = 0, minTransfer = 0;
int vis[10000] = {0};
int transferStas(vector<int> a) {
int cnt = -1,temroute = 0;
for (int i = 1; i < a.size(); i++) {//根据hash算出两站点之间的线路
if (line[a[i-1] * 10000 + a[i]] != temroute)cnt++;
temroute = line[a[i-1] * 10000 + a[i]];
}
return cnt;
}
void DFS(int node,int stanums) {
//深度搜索,碰到所乘站点数目小于最小的站点数时则需要更新,若有多个相同的最短的站点数,则根据换乘的路线选择换乘数最少的路线
if (node == destination && (stanums < minStas ||(stanums==minStas && transferStas(tempath) < minTransfer))) {
minStas = stanums;
minTransfer = transferStas(tempath);
path = tempath;
}
if (node == destination)return;
for (int i = 0; i < v[node].size(); i++) {
if (vis[v[node][i]] == 0) {
vis[v[node][i]] = 1;
tempath.push_back(v[node][i]);
DFS(v[node][i], stanums + 1);
vis[v[node][i]] = 0;//深度搜索之后进行回溯,只为寻找最短的解决方案
tempath.pop_back();
}
}
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
int num = 0, tem = 0, pre = 0;
scanf("%d%d", &num, &pre);
for (int j = 0; j < num-1; j++) {
scanf("%d",&tem);
v[pre].push_back(tem);
v[tem].push_back(pre);
line[pre * 10000 + tem] = line[tem*10000+pre] = i;//line保存的是两个相邻站点之间的线路为几号线
pre = tem;
}
}
cin >> k;
for (int i = 0; i < k; i++) {
cin >> start >> destination;
tempath.clear();
minStas = 9999999, minTransfer = 9999999;//每次做完了都要初始化
tempath.push_back(start);
vis[start] = 1;
DFS(start, 0);
vis[start] = 0;
printf("%d\n", minStas);
int temline = 0,preStation = start;
for (int j = 1; j < path.size(); j++) {
if (line[path[j-1] * 10000 + path[j]] != temline) {//最后到终点的路程不会打印,故需要最后打印
if (temline != 0) {
printf("Take Line#%d from %04d to %04d.\n", temline, preStation, path[j - 1]);
preStation = path[j - 1];
}
temline = line[path[j - 1] * 10000 + path[j]];
}
}
printf("Take Line#%d from %04d to %04d.\n", temline, preStation, destination);
}
system("pause");
return 0;
}