Warshall's algorithm to find the path matrix

warshalls.cpp

#include<iostream>
using namespace std;

int main()
{
    int ar[4][4]={{0,1,0,1},{1,0,1,1},{0,0,0,1},{1,0,1,0}};


    for(int k=0;k<4;k++)
    {

        for(int i=0;i<4;i++)
        {

            for(int j=0;j<4;j++)
            {
                ar[i][j]=(ar[i][j]||(ar[i][k]&&ar[k][j]));
            }
        }
        cout<<"P"<<k<<" is"<<endl;
        for(int i=0;i<4;i++)
        {
            for(int j=0;j<4;j++)
            {
                cout<<ar[i][j]<<" ";
            }
            cout<<endl;
        }
        cout<<endl;

    }

    cout<<"P3 is the path matrix"<<endl;

}