Floyd-Warshall最短路径 C++ 代码

Floyd-Warshall最短路径 C++ 代码

class path
{
    int n;
        int p[10][10];
        int a[10][10];
        int c[10][10];
    public:
        void get();
        void pm();
        void ap();
        void disp();
};
void path::get()
{
    int i,j,k;
    clrscr();

    cin>>n;

Enter the adjacency matrix :
";

    {

        {

            cin>>a[i][j];
            p[i][j]=0;
        }
    }

Enter The cost matrix is :
";

    {

        {

            cin>>c[i][j];
        }
    }

    {

        {
                p[i][j]=a[i][j];
        }
    }
}
void path::disp()
{

The output matrix for the given graph is :
";

    {

        {

        }

}
}
void path::pm()
{
    int i,j,k;

    {

        {

            {
                p[i][j]=p[i][j] || p[i][k] && p[k][j];
            }
        }
    }
}
void path::ap()
{
    int i,j,k;

    {

        {
                p[i][j]=c[i][j];
        }
    }

    {

        {

            {

                {
                    p[i][j]=p[i][j];
                }
                else
                {
                p[i][j]=p[i][k]+p[k][j];
                }
            }
        }
    }
}
void main()
{
path p;
p.get();
p.pm();

";
p.disp();
getch();
p.ap();

";
p.disp();
getch();
}

声明: 除非转自他站（如有侵权，请联系处理）外，本文采用 BY-NC-SA 协议进行授权 | 智乐兔
转载请注明：转自《Floyd-Warshall最短路径 C++ 代码》
本文地址：https://www.zhiletu.com/archives-7862.html
关注公众号：