Borderou de evaluare (job #2822044)
Utilizator | Data | 23 decembrie 2021 15:08:03 | |
---|---|---|---|
Problema | Ciclu Eulerian | Status | done |
Runda | Arhiva educationala | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp: In member function 'void Graph::dfs(int, bool*)':
main.cpp:213:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
213 | for (int i = 0; i < adj[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::outputAdj()':
main.cpp:221:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
221 | for (int i = 0; i < adj[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::bfsUtil(int, bool*)':
main.cpp:316:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
316 | for (int i = 0; i < adj[node].size(); i++) //parcurg toti vecinii sai
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::topSort(int*, std::queue<int>)':
main.cpp:422:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
422 | for (int i = 0; i < adj[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'bool Graph::graphExists(std::vector<int>)':
main.cpp:455:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
455 | if (top > degree_seq.size()) // daca valoarea primului element este mare decat numarul de elemente ramase, nu putem construi un astfel de graf
| ~~~~^~~~~~~~~~~~~~~~~~~
main.cpp:458:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
458 | for (int i = 0 ; i < degree_seq.size(); i++) //dupa eliminarea primului element, scadem gradul "nodurilor" ramase
| ~~^~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::dijkstra(int)':
main.cpp:593: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]
593 | for (int i = 0; i < adj_weight[node].size(); i++) //pentru toate nodurile adiacente ale lui node
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'bool Graph::bellmanFord(int, std::vector<int>&)':
main.cpp:633: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]
633 | for (int i = 0; i < adj_weight[node].size(); i++) //pentru toate nodurile adiacente cu node
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'bool Graph::bfsMaxFlow(int, int, std::vector<std::vector<int> >, int*, bool*)':
main.cpp:676:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
676 | for (int i = 0 ; i < adj_capacity[node].size(); i++) //parcurg toate nodurile adiacente cu nodul curent
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'int Graph::EdmondsKarp(int, int)':
main.cpp:705: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]
705 | for (int j = 0; j < adj_capacity[i].size(); j++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::dfsUtil(int, int&, int, int&, bool*)':
main.cpp:784:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
784 | for (int i = 0; i < adj[src].size(); i++)
| ~~^~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::Euler()':
main.cpp:830:49: error: no matching function for call to 'std::vector<std::pair<int, int> >::push_back(std::tuple<int, int>)'
830 | vectorEdges[x].push_back(make_tuple(y,i));
| ^
In file included from /usr/include/c++/10/vector:67,
from main.cpp:10:
/usr/include/c++/10/bits/stl_vector.h:1187:7: note: candidate: 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<int, int>; _Alloc = std::allocator<std::pair<int, int> >; std::vector<_Tp, _Alloc>::value_type = std::pair<int, int>]'
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !