Borderou de evaluare (job #2528449)
| Utilizator |  Caramida Iustina-Andreea i.uniod |
Data | 21 ianuarie 2020 21:29:18 |
|---|---|---|---|
| Problema | Algoritmul lui Dijkstra | Status | done |
| Runda | Arhiva educationala | Compilator | cpp-64 | Vezi sursa |
| Scor | 0 | ||
Raport evaluator
Eroare de compilare:
main.cpp: In function 'void Dijkstra(int)':
main.cpp:48:23: error: 'G' was not declared in this scope
for(auto it : G[cnode])
^
main.cpp:50:51: error: no matching function for call to 'std::priority_queue<NodeCost>::push(<brace-enclosed initializer list>)'
pq.push({it.node, cdist + it.cost});
^
In file included from /usr/include/c++/6/queue:64:0,
from main.cpp:3:
/usr/include/c++/6/bits/stl_queue.h:558:7: note: candidate: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = NodeCost; _Sequence = std::vector<NodeCost>; _Compare = std::less<NodeCost>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = NodeCost]
push(const value_type& __x)
^~~~
/usr/include/c++/6/bits/stl_queue.h:558:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const NodeCost&}'
/usr/include/c++/6/bits/stl_queue.h:566:7: note: candidate: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = NodeCost; _Sequence = std::vector<NodeCost>; _Compare = std::less<NodeCost>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = NodeCost]
push(value_type&& __x)
^~~~
/usr/include/c++/6/bits/stl_queue.h:566:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<NodeCost>::value_type&& {aka NodeCost&&}'
main.cpp: In function 'int main()':
main.cpp:61:9: error: 'G' was not declared in this scope
G[a].push_back({b, c});
^
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !
