Pagini recente » Cod sursa (job #2078634) | Cod sursa (job #1166621) | Cod sursa (job #393619) | Cod sursa (job #2295489) | Cod sursa (job #2896074)
#include <fstream>
#include <vector>
#include <queue>
struct str{
int x, y;
str( int xnew, int ynew ) {
x = xnew;
y = ynew;
}
};
struct strcmp{
bool operator()(str x, str y) {
return x.y > y.y;
}
};
std::vector < std::vector < str > > g;
std::vector < int > d;
std::priority_queue < str, std::vector < str >, strcmp > h;
int main( ) {
std::ifstream fin("dijkstra.in");
int n, m;
fin >> n >> m;
g.resize(n);
for ( int i = 0; i < m; ++ i ) {
int x, y, z;
fin >> x >> y >> z;
g[x-1].push_back(str(y-1, z));
g[y-1].push_back(str(x-1, z));
}
fin.close();
d.resize(n, -1);
d[0] = 0;
h.push(str(0, 0));
while ( h.empty() == 0 ) {
int x = h.top().x;
int y = h.top().y;
h.pop();
if ( d[x] == y ) {
for ( int i = 0; i < int(g[x].size()); ++ i ) {
int xn = g[x][i].x;
int yn = g[x][i].y;
if ( d[xn] == -1 || d[xn] > d[x]+yn ) {
d[xn] = d[x]+yn;
h.push(str(xn, d[xn]));
}
}
}
}
std::ofstream fout("dijkstra.out");
for ( int i = 1; i < n; ++ i ) {
fout << d[i] << " ";
}
fout << "\n";
fout.close();
return 0;
}