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	#58024167	Utilizator	Dusa Razvan-Nicolae (razvandusa)
Fișier	dijkstra.cpp	Dimensiune	1.75 KB
Data încărcării	08 Mai 2025, 22:39	Scor / rezultat	Eroare de compilare

Evaluare

Mesaj compilare

dijkstra.cpp: In function 'std::vector<int> dijkstra(int, std::vector<std::vector<std::pair<int, int> > >&, int)':
dijkstra.cpp:8:64: error: wrong number of template arguments (0, should be 1)
     priority_queue<pair<int,int>, vector<pair<int,int>>,greater<>> pq;

                                                                ^
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:8:65: error: template argument 3 is invalid
     priority_queue<pair<int,int>, vector<pair<int,int>>,greater<>> pq;

                                                                 ^
dijkstra.cpp:8:70: error: invalid type in declaration before ';' token
     priority_queue<pair<int,int>, vector<pair<int,int>>,greater<>> pq;

                                                                      ^
dijkstra.cpp:10:29: error: 'INT_MAX' was not declared in this scope
     vector<int> dist(V + 1, INT_MAX);

                             ^
dijkstra.cpp:14:8: error: request for member 'push' in 'pq', which is of non-class type 'int'
     pq.push({src, 0});

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

                ^
dijkstra.cpp:23:20: error: request for member 'top' in 'pq', which is of non-class type 'int'
         int u = pq.top().first;

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

            ^
dijkstra.cpp:38:20: error: request for member 'push' in 'pq', which is of non-class type 'int'
                 pq.push({v, dist[v]});

                    ^
dijkstra.cpp: In function 'int main()':
dijkstra.cpp:58:24: error: 'INT_MAX' was not declared in this scope
         if (dist[i] == INT_MAX) {

                        ^
dijkstra.cpp:47:15: warning: unused variable 'm' [-Wunused-variable]
     int n, p, m;

               ^

Cum funcționează evaluarea?