Rezumat problemă

Dijkstra

#588

Se dă un graf orientat ponderat – în care fiecare arc are asociat un cost, număr natural strict pozitiv, și un nod p. Să se determine, folosind algoritmul lui Dijkstra, costul minim al drumului de la p la fiecare nod al grafului.

Fișiere Candale Silviu (silviu) ușoară

Clasa 11 Teoria Grafurilor Grafuri cu costuri Algoritmul lui Dijkstra

Rezolvă

Detalii

Problema	Dijkstra	Operații I/O	dijkstra.in/dijkstra.out
Limita timp	0.1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#58102188	Utilizator	Mark Mark (markinfoexce)
Fișier	dijkstra.cpp	Dimensiune	912 B
Data încărcării	14 Mai 2025, 10:40	Scor / rezultat	Eroare de compilare

Evaluare

Mesaj compilare

dijkstra.cpp: In function 'int main()':
dijkstra.cpp:19:67: error: wrong number of template arguments (0, should be 1)
     priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> q;

                                                                   ^
In file included from /usr/include/c++/4.8/string:48:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/istream:38,
                 from /usr/include/c++/4.8/fstream:38,
                 from dijkstra.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:222:12: error: provided for 'template<class _Tp> struct std::greater'
     struct greater : public binary_function<_Tp, _Tp, bool>
            ^
dijkstra.cpp:19:68: error: template argument 3 is invalid
     priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> q;

                                                                    ^
dijkstra.cpp:19:72: error: invalid type in declaration before ';' token
     priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> q;

                                                                        ^
dijkstra.cpp:20:7: error: request for member 'push' in 'q', which is of non-class type 'int'
     q.push({0, p});

       ^
dijkstra.cpp:22:15: error: request for member 'empty' in 'q', which is of non-class type 'int'
     while (!q.empty()) {

               ^
dijkstra.cpp:23:19: error: request for member 'top' in 'q', which is of non-class type 'int'
         int x = q.top().second, cost = q.top().first;

                   ^
dijkstra.cpp:24:11: error: request for member 'pop' in 'q', which is of non-class type 'int'
         q.pop();

           ^
dijkstra.cpp:25:13: error: 'cost' was not declared in this scope
         if (cost > d[x]) continue;

             ^
dijkstra.cpp:29:19: error: request for member 'push' in 'q', which is of non-class type 'int'
                 q.push({d[e.first], e.first});

                   ^

Cum funcționează evaluarea?