Eroare de compilare: user.cpp: In function ‘void djikstra(int)’: user.cpp:38:23: error: ‘std::vector<std::pair<int, int> >::iterator’ has no member named ‘second’ if(d[x]+i.second < d[i.first]) // compar cu costul dinainte ^ user.cpp:38:36: error: ‘std::vector<std::pair<int, int> >::iterator’ has no member named ‘first’ if(d[x]+i.second < d[i.first]) // compar cu costul dinainte ^ user.cpp:40:21: error: ‘std::vector<std::pair<int, int> >::iterator’ has no member named ‘first’ d[i.first]=d[x]+i.second; //inlocuiesc ^ user.cpp:40:35: error: ‘std::vector<std::pair<int, int> >::iterator’ has no member named ‘second’ d[i.first]=d[x]+i.second; //inlocuiesc ^ user.cpp:41:30: error: ‘std::vector<std::pair<int, int> >::iterator’ has no member named ‘first’ q.push({-d[i.first],i.first});//adaug in multime si retin anteriorul ^ user.cpp:41:39: error: ‘std::vector<std::pair<int, int> >::iterator’ has no member named ‘first’ q.push({-d[i.first],i.first});//adaug in multime si retin anteriorul ^ user.cpp:41:45: error: no matching function for call to ‘std::priority_queue<std::pair<int, int> >::push(<brace-enclosed initializer list>)’ q.push({-d[i.first],i.first});//adaug in multime si retin anteriorul ^ user.cpp:41:45: note: candidates are: In file included from /usr/include/c++/4.8/queue:64:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:85, from user.cpp:1: /usr/include/c++/4.8/bits/stl_queue.h:496:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<int, int>; _Sequence = std::vector<std::pair<int, int> >; _Compare = std::less<std::pair<int, int> >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<int, int>] push(const value_type& __x) ^ /usr/include/c++/4.8/bits/stl_queue.h:496:7: note: no known conversion for argument 1 from ‘<brace-enclosed initializer list>’ to ‘const value_type& {aka const std::pair<int, int>&}’ /usr/include/c++/4.8/bits/stl_queue.h:504:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = std::pair<int, int>; _Sequence = std::vector<std::pair<int, int> >; _Compare = std::less<std::pair<int, int> >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<int, int>] push(value_type&& __x) ^ /usr/include/c++/4.8/bits/stl_queue.h:504:7: note: no known conversion for argument 1 from ‘<brace-enclosed initializer list>’ to ‘std::priority_queue<std::pair<int, int> >::value_type&& {aka std::pair<int, int>&&}’