FloydWarshall infinite

Question

iam amateur at programming. I am trying to show each steps of this algorithm but i want to present 1000 as INF on each D matrix.

#include <iostream>
#include <limits>
#define INF 1000

using namespace std;

/* my example matrix is
0 3 inf 7
8 0 2 inf
5 inf 0 1
2 inf inf 0

i want to write that each D matrix show 1000 as INF
*/

void FloydWarshall(int **dist, int V){

int i,j,k;

for(k = 0; k < V; k++){
cout<<"D"<<k<<" matrix is: "<<endl;

for(i = 0; i < V; i++){

for(j = 0; j < V; j++){
cout<<dist[i][j]<<" ";
if(dist[i][k] != INF && dist[j][k] != INF && dist[i][j] > (dist[i][k] + dist[k][j]))
dist[i][j] = dist[i][k]+dist[k][j];
}
cout<<" "<<endl;
}
cout<<" "<<endl;
}

for(i = 0; i < V; i++){
for(j = 0; j < V; j++){
cout<<" "<<endl;
cout<<"Shortest path between "<<i<<" and "<<j<<" is : "<<endl;
if(dist[i][j]==INF)
cout<<"INF"<<endl;
else
cout<<dist[i][j]<<endl;
}
}

}

int main(){

int i,j,n;
int **dist;
int *cost;

cout<<"Please, enter the number of vertices: "<<endl;
cin>>n;

dist = new int*[n];

for(i = 0;i < n; i++){
dist[i] = new int[n];
}

cout<<"Please, enter the adjacency matrix: "<<endl;
cout<<"Do not forget "<<INF<<" if there is no connection between two vertices"<<endl;
for(i = 0; i < n; i++){
for(j = 0; j < n; j++){
cin>>dist[i][j];
if (dist[i][j] == 0 && i != j){
dist[i][j] = INF;
}
}
}
cout<<" "<<endl;

FloydWarshall(dist,n);
cout<<" "<<endl;
cout<<" The Distance Matrix is: "<<endl;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
cout<<dist[i][j]<<" ";
}
cout<<"\n";
}
return 0;
}

Answer 1

please link the playground code.

not paste the code in the description.

No one wants tho deal with that.

- save in playground

- copy the url

- paste url in comment

or

- +

- add code