用图来储存航班信息并进行一些简单操作
C11标准下完整代码如下
直接复制粘贴会产生编译错误是因为不同编译器所用的C标准不同。
这个最短路径算法有很多乱七八糟的错误(编译可以通过),足以应付结点较少的情况。因为这个程序意义不大,我也懒得改了。
想深入了解最短路径输出的私聊我。
#define ERROR -1
#define MAXVEX 40
#define MAXSIZE 8
#define INFINITY 65535
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
typedef int Data;
typedef struct QNode {
Data data;
struct QNode* next;
}QNode, * QueuePtr;
typedef struct LinkQueue {
QueuePtr front, rear;
}LinkQueue;
int InitQueue(LinkQueue& Q)
{
QueuePtr head = (QueuePtr)malloc(sizeof(QNode));
head->next = NULL;
head->data = NULL;
Q.front = Q.rear = head;
return 0;
}
int EnQueue(LinkQueue& Q, int data)
{
QueuePtr p = (QueuePtr)malloc(sizeof(QNode));
p->next = NULL;
p->data = data;
Q.rear->next = p;
Q.rear = p;
return 0;
}
int OutQueue(LinkQueue& Q)
{
Data e;
QueuePtr d;
if (Q.front == Q.rear) {
return ERROR;
}
d = Q.front->next;
e = d->data;
Q.front->next = d->next;
if (Q.rear == d) {
Q.rear = Q.front;
}
free(d);
return e;
}
void GetHead(LinkQueue& Q, Data e)
{
e = Q.front->next->data;
}
void OutputQueue(LinkQueue& Q)
{
QueuePtr p;
p = Q.front->next;
while (p != NULL) {
printf("%d ", p->data);
p = p->next;
}
}
int check_length(LinkQueue& Q)
{
int length = 0;
QueuePtr p;
p = Q.front;
while (p->next != NULL) {
p = p->next;
length++;
}
return length;
}
typedef int EdgeType;
typedef struct VertexType {
char name[9];
VertexType()
{
int i;
for (i = 0; i < 9; i++) {
name[i] = { '\0' };
}
}
}VertexType;
typedef struct MGraph {
VertexType Ariport[MAXVEX];
EdgeType Distance[MAXVEX][MAXVEX];
int Price[MAXVEX][MAXVEX];
int Airport_number, Distance_number;
MGraph()
{
int i, j;
Distance_number = 0;
for (i = 0; i < MAXVEX; i++) {
Distance[i][i] = 0;
for (j = 0; j < MAXVEX; j++) {
Distance[i][j] = INFINITY;
}
}
}
}MGraph;
void CreateMGraph(MGraph& G)
{
int i, j, k;
char temp_name[9];
printf("请输入机场数量: ");
scanf_s("%d", &G.Airport_number);
printf("请输入路径数量:");
scanf_s("%d", &G.Distance_number);
getchar();
for (i = 0; i < G.Airport_number; i++) {
printf("请输入机场名称: ");
gets_s(G.Ariport[i].name);
}
for (k = 0; k < (G.Distance_number / 2); k++) {
printf("输入路径的上下标");
scanf_s("%d,%d", &i, &j);
printf("输入距离:");
scanf_s("%d", &G.Distance[i][j]);
G.Distance[j][i] = G.Distance[i][j];
printf("输入该航线的价格: ");
scanf_s("%d", &G.Price[i][j]);
G.Price[j][i] = G.Price[i][j];
}
}
bool visited[MAXVEX];
void DFS(MGraph G, int i)
{
int j;
visited[i] = true;
puts(G.Ariport[i].name);
for (j = 0; j < G.Distance_number; j++) {
if ((G.Distance[i][j] > 0 && G.Distance[i][j] < INFINITY) && !visited[j]) {
DFS(G, j);
}
}
}
void DFS_T(MGraph G) {
int i, length = 0;
for (i = 0; i < G.Distance_number; i++) {
visited[i] = false;
}
for (i = 0; i < G.Distance_number; i++) {
if (!visited[i]) {
DFS(G, i);
}
}
}
int Path[MAXVEX] = { 0 };
int PathLength[MAXVEX] = { 0 };
void ShorttestPath_Dijkstra(MGraph G, int v0, LinkQueue Q[])
{
int v, j, k, min, sum;
int fin[MAXVEX];
for (v = 0; v < G.Airport_number; v++) {
fin[v] = 0;
PathLength[v] = G.Distance[v0][v];
}
PathLength[v0] = 0;
fin[v0] = 1;
/*开始主循环*/
for (v = 1; v < G.Airport_number; v++) {
min = INFINITY;
for (j = 0; j < G.Airport_number; j++) {
if (fin[j] == 0 && PathLength[j] < min) {
k = j;
min = PathLength[j];
}
}
fin[k] = 1;
for (j = 0; j < G.Airport_number; j++) {
if (fin[j] == 0 && (min + G.Distance[k][j] < PathLength[j])) {
PathLength[j] = min + G.Distance[k][j];
Path[j] = k;
EnQueue(Q[j], Path[j]);
}
}
}
}
int check_length(int data[], int vi)
{
int i = 0, num = 0;
while (data[i] != vi) {
num++;
i++;
}
return num;
}
void Inquire_ShortLength(MGraph G, int v0, int vi, LinkQueue Q[])
{
int i, v;
printf("%s到%s的最短距离是%d\n路径是:%s", G.Ariport[v0].name, G.Ariport[vi].name, PathLength[vi],G.Ariport[v0].name);
do {
v = OutQueue(Q[vi]);
if (v > 0) {
printf("-%s", G.Ariport[v].name);
}
} while (v >= 0);
printf("-%s", G.Ariport[vi].name);
}
void SearchGetablePlace(MGraph G, int place)
{
int i;
int Getable[MAXVEX] ;
for (i = 0; i < G.Airport_number; i++) {
if (G.Distance[place][i] < INFINITY) {
Getable[i] = 1;
}
else {
Getable[i] = 0;
}
}
printf("\n%s可直达的地点有:\n", G.Ariport[place].name);
for (i = 0; i < G.Airport_number; i++) {
if (Getable[i] == 1) {
printf("%s ", G.Ariport[i].name);
printf("价格是%d\n", G.Price[place][i]);
}
}
}
int main()
{
int i,v0,vi;
LinkQueue Q[MAXVEX];
for (i = 0; i < MAXVEX; i++) {
InitQueue(Q[i]);
}
MGraph G;
CreateMGraph(G);
DFS_T(G);
ShorttestPath_Dijkstra(G, 0, Q);
printf("请输入起始地点:成都0,西安1,郑州2,北京3,上海4,广州5\n");
scanf_s("%d", &v0);
SearchGetablePlace(G, v0);
printf("请输入目的地地点:成都0,西安1,郑州2,北京3,上海4,广州5\n");
scanf_s("%d", &vi);
Inquire_ShortLength(G, v0, vi, Q);
}
前半部分是对队列进行定义,因为迪杰斯特拉算法的Path数组只能储存该结点的路径前驱,也就是只能储存前一条路径,无法直接获得从起始点到该路径的所有路径,因此我采用了队列的数据结构,试图通过不断入队的方式将所有路径前驱都储存到队列中,在输出路径的时候再不断出队使完整的最短路径得以输出。
经过简单验证没出问题,可以应付结点数较少的情况。
但是我在其他程序(结点数为12)中发现了错误,队列并不能真正的实现储存所有路径信息的功能,应该采用栈,实现方法这里不解释了。