Pagini recente » Cod sursa (job #3205611) | Cod sursa (job #1453639) | Cod sursa (job #2308587) | Cod sursa (job #3246067) | Cod sursa (job #1442835)
#include<iostream>
#include<fstream>
using namespace std;
int matriceaPonderilor[101][101];
/*void descompun_drum(int i,int j)
{
int ok=0,k=1;
while(k<=n&&!ok)
{
if(i!=k&&j!=k)
if(a[i][j]==a[i][k]+a[k][j])
{
descompun_drum(i,k);
descompun_drum(k,j);
ok=1;
}
k++;
}
if(!ok)
{
matriceaPonderilor[i][j]=
}
}*/
int main()
{
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int nrNoduri,i,j,l;
in>>nrNoduri;
for(i=1;i<=nrNoduri;i++)
for(j=1;j<=nrNoduri;j++)
in>>matriceaPonderilor[i][j];
for(l=1;l<=nrNoduri;l++)
for(i=1;i<=nrNoduri;i++)
for(j=1;j<=nrNoduri;j++)
if(matriceaPonderilor[i][l]!=0&&matriceaPonderilor[l][j]!=0)
if(matriceaPonderilor[i][j]>matriceaPonderilor[i][l]+matriceaPonderilor[l][j])
matriceaPonderilor[i][j]=matriceaPonderilor[i][l]+matriceaPonderilor[l][j];
for(i=1;i<=nrNoduri;i++)
{
for(j=1;j<=nrNoduri;j++)
out<<matriceaPonderilor[i][j]<<" ";
out<<"\n";
}
}