Borderou de evaluare (job #2501587)
Utilizator | Data | 29 noiembrie 2019 22:32:13 | |
---|---|---|---|
Problema | Algoritmul Bellman-Ford | Status | done |
Runda | Arhiva educationala | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp: In function 'int main()':
main.cpp:70:45: error: too few arguments to function 'std::vector<int> shortest_path(const std::vector<std::vector<std::pair<int, int> > >&, int)'
std::vector<int> distances = shortest_path();
^
main.cpp:8:18: note: declared here
std::vector<int> shortest_path(const std::vector<std::vector<edge>>& graph, const int source)
^~~~~~~~~~~~~
main.cpp:75:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 3; i < distances.size(); i++)
~~^~~~~~~~~~~~~~~~~~
main.cpp:50:33: warning: unused variable 'source' [-Wunused-variable]
unsigned int nVertices, nArcs, source = 1;
^~~~~~
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !