求每一对顶点之间的最短距离

/*
    求每一对顶点之间的最短距离
    邻接矩阵
    依次加入各个顶点
*/
#include <iostream>
#include <iomanip>
using namespace std;
#define MAXSIZE 32

string GetStr(string s, string s2)
{
    string str;
    str = s + s2;
    for (int m = 0; m < s.size(); m++)
    {
        for (int n = s.size(); n < str.size(); n++)
        {
            if (str[m] == str[n])
            {
                for (int i = n; i < (int)str.size() - 1; i++)
                {
                    str[i] = str[i + 1];
                    str.resize((int)str.size() - 1);
                }
            }
        }
    }
    return str;
}

class Graph
{
public:
    Graph()
    {
        memset(m_Node, 0, sizeof(m_Node));
        m_VertSize = 0;
        m_EdgeSize = 0;
        memset(m_NodeInfo, 0, sizeof(m_NodeInfo));
    }

    bool Init();

    void FindMinPath();
public:
    int m_Node[MAXSIZE][MAXSIZE];

    int m_VertSize;

    int m_EdgeSize;

    char m_NodeInfo[MAXSIZE];
};


bool Graph::Init()
{
    cin >> m_VertSize;
    for (int i = 1; i <= m_VertSize; i++)
    {
        cin >> m_NodeInfo[i];
    }
    cin >> m_EdgeSize;
    for (int i = 0; i < m_EdgeSize; i++)
    {
        int nHead, nTail,nWeight;
        cin >> nHead >> nTail >> nWeight;
        m_Node[nHead][nTail] = nWeight;
    }
    return true;
}

void Graph::FindMinPath()
{
    string info[MAXSIZE][MAXSIZE];
    int node[MAXSIZE][MAXSIZE];
    for (int i = 1; i <= m_VertSize; i++)
    {
        for (int j = 0; j <= m_VertSize; j++)
        {
            node[i][j] = m_Node[i][j];
            if (node[i][j] != 0)
            {
                info[i][j] = m_NodeInfo[i];
                info[i][j] += m_NodeInfo[j];
            }
        }
    }
    //依次增加各点
    for (int i = 1; i <= m_VertSize; i++)
    {
        for (int j = 1; j <= m_VertSize; j++)
        {
            if (i == j) continue;
            for (int x = 1; x <= m_VertSize; x++)
            {
                if (j == x) continue;
                if (node[j][i ]!= 0 && node[i][x] != 0)
                {
                    if (node[j][x] == 0 || (node[j][x] > node[j][i] + node[i][x]))
                    {
                        node[j][x] = node[j][i] + node[i][x];

                        info[j][x] = GetStr(info[j][i], info[i][x]);
                    }
                }
            }
        }
    }
    //hex dec oct
    //setprecision(10);//显示小数位数 作用永久
    //setfill(' '); //填充字符
    //setw(8);      //域宽
    //setiosflags(ios::left);//左对齐
    for (int i = 1; i <= m_VertSize; i++)
    {
        for (int j = 1; j <= m_VertSize; j++)
        {
            cout << setw(10)<<node[i][j] << " ";
        }
        cout << endl;
    }
    cout << endl;

    for (int i = 1; i <= m_VertSize; i++)
    {
        for (int j = 1; j <= m_VertSize; j++)
        {
            cout << setw(10) << info[i][j].c_str() << " ";
        }
        cout << endl;
    }
    cout << endl;
}

int main()
{
    Graph g;
    if (g.Init())
    {
        g.FindMinPath();
    }
    return 0;
}