Cod sursa(job #3322135)
| Utilizator | Data | 12 noiembrie 2025 20:47:08 | |
|---|---|---|---|
| Problema | Algoritmul Bellman-Ford | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <climits>
#include <vector>
struct nod
{
int from, to, cost;
};
std::vector<nod>muchii;
void belman_ford()
{
}
int main()
{
freopen("bellmanford.in", "r", stdin);
freopen("bellmanford.out", "w", stdout);
int n, m;
std::cin >> n >> m;
for(int j = 1; j <= m; j++)
{
int x, y, cst;
std::cin >> x >> y >> cst;
graph.push_back({x , y ,cst});
}
std::vector<int>dist(n + 1, 2e9);
for(int i = 1; i <= n - 1; i++){
for(auto N : graph)
{
}
}
}
/*
*/
