Borderou de evaluare (job #3185550)
Utilizator | Data | 19 decembrie 2023 15:49:39 | |
---|---|---|---|
Problema | Cablaj | Status | done |
Runda | Arhiva de probleme | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp: In member function 'std::vector<int> Graph::dfs(int)':
main.cpp:176:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
176 | for (int i = 0; i < adj[currentNode].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::bfs(int)':
main.cpp:301:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
301 | for (int i = 0; i < adj[currentNode].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::bellmanFord(int)':
main.cpp:369:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
369 | for (int j = 0; j < edges.size(); j++)
| ~~^~~~~~~~~~~~~~
main.cpp:374:32: error: 'INT_MAX' was not declared in this scope
374 | if (dist[node1] != INT_MAX && dist[node2] > dist[node1] + weight)
| ^~~~~~~
main.cpp:10:1: note: 'INT_MAX' is defined in header '<climits>'; did you forget to '#include <climits>'?
9 | #include <cmath>
+++ |+#include <climits>
10 |
main.cpp:382:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
382 | for (int i = 0; i < edges.size(); i++)
| ~~^~~~~~~~~~~~~~
main.cpp:387:28: error: 'INT_MAX' was not declared in this scope
387 | if (dist[node1] != INT_MAX && dist[node2] > dist[node1] + weight)
| ^~~~~~~
main.cpp:387:28: note: 'INT_MAX' is defined in header '<climits>'; did you forget to '#include <climits>'?
main.cpp: In member function 'bool Graph::isBipartite()':
main.cpp:419:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
419 | for (int i = 0; i < adj[currentNode].size(); ++i)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::topologicalSort()':
main.cpp:450:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
450 | for (int j = 0; j < adj[i].size(); ++j)
| ~~^~~~~~~~~~~~~~~
main.cpp:473:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
473 | for (int i = 0; i < adj[currentNode].size(); ++i)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !