Cod sursa(job #2456504)
Utilizator | Data | 14 septembrie 2019 15:08:30 | |
---|---|---|---|
Problema | Algoritmul lui Dijkstra | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector <int> v_locatie[50005];
vector <int> v_cost[50005];
int main()
{
int n,m,i,j,a,b,c;
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>a>>b>>c;
v_locatie[a].push_back(b);
v_cost[a].push_back(c);
v_locatie[b].push_back(a);
v_cost[b].push_back(c);
}
return 0;
}