?? 路由算法源代碼.txt
字號:
/*Routine.c TC2.0 WinXp*/
#include <stdio.h>
#include <stdlib.h>
#include <alloc.h>
#define ROUTNUM 7
typedef struct
{
int dis;
int from;
}RoutNode;
RoutNode data[ROUTNUM][ROUTNUM];/*路由表*/
void InitData(FILE* pfile);/*從數據文件讀取數據,初始化路由表*/
void OutputRoutData();/*輸出所有的路由表*/
void Communication(int recv, int send);/*send點向recv點發送自己的路由表*/
void Exchange();/*所有節點進行一次數據交換,更新路由表*/
void main()
{
int start,end;
int i;
FILE *pfile;
pfile = fopen("data.txt", "r");
if (pfile == NULL)
{
printf("data file failed to open, press any key to quit.\n");
getch();
return;
}
else
InitData(pfile);
fclose(pfile);
printf("\nInitial State:\n");
OutputRoutData();
for (i=0; i<ROUTNUM; i++)
{
Exchange();
}
printf("\nState Exchanged:\n");
OutputRoutData();
printf("input the start node(%d-%d) : ", 0, ROUTNUM-1);
scanf("%d", &start);
printf("input the end node(%d-%d) : ", 0, ROUTNUM-1);
scanf("%d", &end);
if (start==end || start<0 || start>6 || end<0 || end>6)
{
printf("\nwrong input, press any key to quit.\n");
getch();
return;
}
else
{
int cur = start;
int total = 0;
if (data[start][end].dis < 0)
{
printf("No routine find!\n");
getch();
return;
}
printf("%c->", cur+65);
while (data[cur][end].from >= 0)
{
total += data[cur][data[cur][end].from].dis;
printf("%c->",data[cur][end].from+65);
cur = data[cur][end].from;
}
total += data[cur][end].dis;
printf("%c\ntotal distance=%d", end+65, total);
getch();
return;
}
}
void InitData(FILE* pfile)
{
char num[10];
int i=0;
char c;
int m,n;
fseek(pfile, 0, 0);
for (m=0; !feof(pfile)&&m<7; m++)
{
for (n=0; !feof(pfile)&&n<7; n++)
{
while (!feof(pfile))
{
c = fgetc(pfile);
if (c==',')/*讀完一個數字*/
{
num[i] = '\0';
data[m][n].dis = atoi(num);
data[m][n].from = -1;
i = 0;
break;
}
else if ((c>='0' && c<='9') || c=='-')/*如果讀到數字或符號*/
{
num[i++] = c;
}
}
}
}
}
void OutputRoutData()
{
int i,j;
printf(" ");
for(i=0; i<ROUTNUM; i++)
{
printf("< %d >", i);
}
printf("\n");
for (i=0; i<ROUTNUM; i++)
{
printf("%d ", i);
for (j=0; j<ROUTNUM; j++)
{
if (data[i][j].dis < 0)/*如果無路徑*/
printf("- ");
else
printf("%-5d", data[i][j].dis);
if (data[i][j].from < 0)/*如果未經過其它節點*/
printf("- ");
else
printf("%c ", data[i][j].from+65);
}
printf("\n");
}
}
void Communication(int recv, int send)
{
int i;
for (i=0; i<ROUTNUM; i++)
{
if (data[send][i].dis > 0)/*如果send節點到i號節點有路線*/
{
if (data[recv][i].dis < 0)/*如果recv到i號節點無路徑*/
{
data[recv][i].dis = data[send][i].dis + data[recv][send].dis;
data[recv][i].from = send;
}
else if (data[recv][i].dis > data[send][i].dis + data[recv][send].dis)/*如果現有路徑比新路徑遠*/
{
data[recv][i].dis = data[send][i].dis + data[recv][send].dis;
data[recv][i].from = send;
}
}
}
}
void Exchange()
{
int i,j;
for (i=0; i<ROUTNUM; i++)
{
for (j=0; j<ROUTNUM; j++)
{
if (data[i][j].dis > 0)/*如果兩個節點之間有路徑*/
{
Communication(j,i);/*將i號節點的路由表發送給j號節點*/
}
}
}
}
/*data.txt*/
0, 2,-1,-1, 8,-1, 5,
2, 0,-1, 5,-1,-1,-1,
-1,-1, 0,-1,-1, 9,-1,
-1, 5,-1, 0,-1,-1,-1,
8,-1,-1,-1, 0,-1, 7,
-1,-1, 9,-1,-1, 0, 3,
5,-1,-1,-1, 7, 3, 0,
?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -