#include #define maxN 30 int main(void) { FILE *tf=NULL; int adj_matrix[maxN][maxN] = {0}; int node[maxN] = {0}, label[maxN], prev[maxN]; int num_vert, rows, vert1, vert2, dist, begin; tf = fopen("seosed_Saaremaa.txt","r"); fscanf(tf,"%d %d",&num_vert,&rows); printf("%d %d\n",num_vert,rows); for (int i = 0; i < rows; i++) { fscanf(tf,"%d %d %d",&vert1,&vert2,&dist); adj_matrix[vert1][vert2] = dist; adj_matrix[vert2][vert1] = dist; } fclose(tf); printf("Trükime välja maatriksi ilusal kujul.\n"); for (int i = 0; i <= num_vert; i++) { for (int j = 0; j <= num_vert; j++) { printf("%3d", adj_matrix[i][j]); } printf("\n"); } for (int i = 0; i <= maxN; i++) { label[i] = 9999; prev[i] = -1; } printf("Kust reis algab (arvuna)?"); scanf("%d", &begin); label[begin] = 0; min_dist = 9999; min_vert = 0; for (int i = 0; i <= num_vert; i++) { if (label[i] < min_dist && node[i] == 0) { min_dist = label[i]; min_vert = i; } } return 0; }