mirrors/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C synced 2024-11-22 13:31:21 +03:00
Code Issues Packages Projects Releases Wiki Activity

Fix output display

Browse Source
This commit is contained in:
arpanjain97 2017-10-13 11:53:03 +05:30
parent 1e9c4a5610
commit 5e8dbc06d0
2 changed files with 12 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
data_structures/graphs/Bellman-Ford.c
View File

@ -48,8 +48,12 @@ int minDistance(int mdist[], int vset[], int V){
//Utility function to print distances //Utility function to print distances
void print(int dist[], int V){ void print(int dist[], int V){
printf("\nVertex Distance\n"); printf("\nVertex Distance\n");
for(int i = 0; i < V; i++) for(int i = 0; i < V; i++){
if(dist[i] != INT_MAX)
printf("%d\t%d\n",i,dist[i]); printf("%d\t%d\n",i,dist[i]);
else
printf("%d\tINF",i);
}
} }
//The main function that finds the shortest path from given source //The main function that finds the shortest path from given source

6
data_structures/graphs/Dijkstra.c
View File

@ -43,8 +43,12 @@ int minDistance(int mdist[], int vset[], int V){
//Utility function to print distances //Utility function to print distances
void print(int dist[], int V){ void print(int dist[], int V){
printf("\nVertex Distance\n"); printf("\nVertex Distance\n");
for(int i = 0; i < V; i++) for(int i = 0; i < V; i++){
if(dist[i] != INT_MAX)
printf("%d\t%d\n",i,dist[i]); printf("%d\t%d\n",i,dist[i]);
else
printf("%d\tINF",i);
}
} }
//The main function that finds the shortest path from given source //The main function that finds the shortest path from given source