void main(void){
    cout << "** Dijkstra **" << endl;
     
    double Chemins[Nb][Nb] = {0, 8, INFINI, 9, 4, INFINI, 0, 1, INFINI, INFINI, INFINI, 2, 0, 3, INFINI, INFINI, INFINI, 2, 0, 7, INFINI, INFINI, 1, INFINI, 0};
    
    int VilleD = 4 - 1;
    int VilleA = 2 - 1;

    cout << "Vec" << endl;
    double Vec[Nb] = {INFINI, INFINI, INFINI, INFINI, INFINI};
    Vec[VilleD] = 0;
    int Nb_Changements = 0;
    do{
        affVec(Vec,Nb_Changements);
         Nb_Changements = calcVec(Vec,Chemins);
    } while (Nb_Changements>0);
    
    cout << "CheminMin" << endl;
    double CheminMin[Nb] = {INFINI, INFINI, INFINI, INFINI, INFINI};
     int LongueurCheminMin = calcCheminMin(VilleD, VilleA, CheminMin, Vec, Chemins);
    for (int i=0; i<LongueurCheminMin; i++){
            cout << CheminMin[LongueurCheminMin-i-1]+1 << " ";
     }
    cout << endl;
    cout <<    "Longueur chemin minimal: " << LongueurCheminMin << endl;
    cout << "Cout chemin minimal: " << Vec[VilleA] << endl;

    system ("pause");
    return;
}