#include <iostream>

#include <cstdlib>

#include <vector>

using namespace std;

class Edge {

public:

    int from;

    int to;

    int cost;

};

int main() {

    int graph[][] =   {

                            , , , , ,

                            , , ,, ,

                            , , , , ,

                            , , , , ,

                            , , , , ,

                        };

    Edge edge;

    vector<Edge> E;

    vector<int>  vd(, INT_MAX);

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

        for (int j=; j<; j++) {

            edge.cost = graph[i][j];

            if (edge.cost == ) continue;

            edge.to  = j;

            edge.from= i;

            E.push_back(edge);

        }

    }

    vd[] = ; // start point

    bool update = true;

    while (update) {

        update = false;

        for (int i=; i<E.size(); i++) {

            Edge& e = E[i];

            if (vd[e.from] != INT_MAX && vd[e.to] > vd[e.from] + e.cost) {

                update = true;

                vd[e.to] = vd[e.from] + e.cost;

            }

        }

    }

    for (int i=; i<; i++)

        cout<<i<<":"<<vd[i]<<endl;

    system("pause");

    return ;

}