0_0_30411342_13888.cpp: In function 'int main()':
0_0_30411342_13888.cpp:40:49: error: no matching function for call to 'std::priority_queue<node>::push(<brace-enclosed initializer list>)'
path.push({edges[i].v, edges[i].w, 0, -1, -1});
^
0_0_30411342_13888.cpp:40:49: note: candidates are:
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/queue:64:0,
from 0_0_30411342_13888.cpp:11:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:499:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = node; _Sequence = std::vector<node, std::allocator<node> >; _Compare = std::less<node>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = node]
push(const value_type& __x)
^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:499:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const node&}'
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:507:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = node; _Sequence = std::vector<node, std::allocator<node> >; _Compare = std::less<node>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = node]
push(value_type&& __x)
^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:507:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<node>::value_type&& {aka node&&}'
0_0_30411342_13888.cpp:64:93: error: no matching function for call to 'std::priority_queue<node>::push(<brace-enclosed initializer list>)'
path.push({edges[*it].v, t.w + edges[*it].w, t.w, 0, it2 == link[t.v].end() ? -1 : *it2});
^
0_0_30411342_13888.cpp:64:93: note: candidates are:
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/queue:64:0,
from 0_0_30411342_13888.cpp:11:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:499:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = node; _Sequence = std::vector<node, std::allocator<node> >; _Compare = std::less<node>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = node]
push(const value_type& __x)
^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:499:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const node&}'
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:507:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = node; _Sequence = std::vector<node, std::allocator<node> >; _Compare = std::less<node>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = node]
push(value_type&& __x)
^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:507:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<node>::value_type&& {aka node&&}'
0_0_30411342_13888.cpp:71:73: error: no matching function for call to 'std::priority_queue<node>::push(<brace-enclosed initializer list>)'
path.push({edges[r[t.id + 1]].v, nw, t.last, t.id + 1, r[t.id + 1]});
^
0_0_30411342_13888.cpp:71:73: note: candidates are:
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/queue:64:0,
from 0_0_30411342_13888.cpp:11:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:499:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = node; _Sequence = std::vector<node, std::allocator<node> >; _Compare = std::less<node>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = node]
push(const value_type& __x)
^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:499:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const node&}'
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:507:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = node; _Sequence = std::vector<node, std::allocator<node> >; _Compare = std::less<node>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = node]
push(value_type&& __x)
^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:507:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<node>::value_type&& {aka node&&}'
|
