//?Route.cpp?:?定義控制臺(tái)應(yīng)用程序的入口點(diǎn)。
//

#include?“stdafx.h“
#include?“string.h“
#include?
#include?
#include?
using?namespace?std;
#define?VerNum?9
#define?EdgeNum?21
typedef?struct?VNode{
	char?id[10];
	int?index;
	int?tag;
}VNode;
typedef?struct?linkNode{
	char?id[10];
	struct?linkNode?*pre;
	struct?linkNode?*next;
}linkNode;
typedef?struct?EdgeNode{
	char?start[10];
	char?end[10];
	linkNode?*first;
}EdgeNode;
VNode?*node;
int?edge[VerNum][VerNum]?=?{
	{011-11-1-1-1-1}
	{10-1-1-11-1-1-1}
	{1101-11-1-1-1}
	{-1-1101-11-1-1}
	{1-1-110-111-1}
	{-111-1-101-11}
	{-1-1-1111011}
	{-1-1-1-11-1-101}
	{-1-1-1-1-11110}
};
EdgeNode?Edge[EdgeNum];
typedef?struct?Node{
	int?index;
	int?tag;
}Node;
typedef?struct?Stack{
	Node?node[VerNum];
	int?top;
}Stack;
int?tagTransfer[4];
char?preStr[100];
char?endStr[100];
char?preStation[10];
void?creatGraph（）;
void?push（Stack?&sNode?node）;
void?pop（Stack?&s）;
Node?getTop（Stack?s）;
bool?stackEmpty（Stack?s）;
void?findRoute（Stack?stackint?a1int?a2）;
int?getIndex（char?temp[]）;
void?outputStation（char?str1[]char?str2[]）;
int?_tmain（int?argc?_TCHAR*?argv[]）
{
	creatGraph（）;
	Stack?stack;
	stack.top?=?0;
	char?source[20];
	char?destination[20];
	int?a1?a2;
	printf（“輸入起始和終止站點(diǎn)：“）;
	while?（scanf（“%s?%s“?source?destination）!=EOF）{
		a1?=?-1;
		a2?=?-1;
		for?（int?i?=?0;?i?			if?（strcmp（node[i].id?source）?==?0）{
				a1?=?node[i].index;
			}
			if?（strcmp（node[i].id?destination）?==?0）{
				a2?=?node[i].index;
			}
		}
		tagTransfer[0]?=?-1;
		tagTransfer[1]?=?-1;
		tagTransfer[2]?=?-1;
		tagTransfer[3]?=?-1;
		if?（a1?==?-1）{
			for?（int?i?=?0;?i?				linkNode?*phead?=?Edge[i].first;
				while?（phead?!=?NULL）{
					if?（0?==?strcmp（phead->id?source））{
						for?（int?j?=?0;?j?							if?（0?==?strcmp（Edge[i].start?node[j].id））{
								tagTransfer[0]?=?node[j].index;
							}
							if?（0?==?strcmp（Edge[i].end?node[j].id））{
								tagTransfer[1]?=?node[j].index;
							}
						}
						break;
					}
					phead?=?phead->next;
				}
			}
		}
		if?（a2?==?-1）{
			for?（int?i?=?0;?i?				linkNode?*phead?=?Edge[i].first;
				while?（phead?!=?NULL）{
					if?（0?==?strcmp（phead->id?destination））{
						for?（int?j?=?0;?j?							if?（0?==?strcmp（Edge[i].start?node[j].id））{
								tagTransfer[2]?=?node[j].index;
							}
							if?（0?==?strcmp（Edge[i].end?node[j].id））{
								tagTransfer[3]?=?node[j].index;
							}
						}
						break;
					}
					phead?=?phead->next;
				}
			}
		}
		if?（a1?!=?-1?&&?a2?!=?-1）{
			findRoute（stack?a1?a2）;
		}
		if?（tagTransfer[0]?==?tagTransfer[2]?&&?tagTransfer[1]?==?tagTransfer[3]）{
			int?b1?=?getIndex（source）;
			int?b2?=?getIndex（destination）;
			int?tagK?=?0;
			for?（int?i?=?0;?i?