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	#57545970	Utilizator	Dragus Andrei (dragusandrei14)
Fișier	dijkstra.cpp	Dimensiune	1.14 KB
Data încărcării	04 Aprilie 2025, 08:43	Scor / rezultat	Eroare de compilare

Evaluare

Mesaj compilare

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

                                                                   ^
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/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 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:29:68: error: template argument 3 is invalid
     priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> heap;

                                                                    ^
dijkstra.cpp:29:75: error: invalid type in declaration before ';' token
     priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> heap;

                                                                           ^
dijkstra.cpp:30:10: error: request for member 'emplace' in 'heap', which is of non-class type 'int'
     heap.emplace(0, p);

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

                  ^
dijkstra.cpp:33:14: error: expected unqualified-id before '[' token
         auto [d, node] = heap.top();

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

              ^
dijkstra.cpp:36:13: error: 'd' was not declared in this scope
         if (d > dist[node]) continue;

             ^
dijkstra.cpp:36:22: error: 'node' was not declared in this scope
         if (d > dist[node]) continue;

                      ^
dijkstra.cpp:38:19: error: expected unqualified-id before '[' token
         for (auto [vecin, c] : graf[node]) {

                   ^
dijkstra.cpp:38:19: error: expected ';' before '[' token
dijkstra.cpp:38:20: error: 'vecin' was not declared in this scope
         for (auto [vecin, c] : graf[node]) {

                    ^
dijkstra.cpp:38:27: error: 'c' was not declared in this scope
         for (auto [vecin, c] : graf[node]) {

                           ^
dijkstra.cpp: In lambda function:
dijkstra.cpp:38:30: error: expected '{' before ':' token
         for (auto [vecin, c] : graf[node]) {

                              ^
dijkstra.cpp: In function 'int main()':
dijkstra.cpp:38:30: error: expected ';' before ':' token
dijkstra.cpp:38:30: error: expected primary-expression before ':' token
dijkstra.cpp:38:30: error: expected ')' before ':' token
dijkstra.cpp:38:30: error: expected primary-expression before ':' token
dijkstra.cpp:38:30: error: expected ';' before ':' token
dijkstra.cpp:53:1: error: expected '}' at end of input
 }
 ^
dijkstra.cpp:53:1: error: expected '}' at end of input

Cum funcționează evaluarea?