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	#57891842	Utilizator	Dusa Razvan-Nicolae (razvandusa)
Fișier	dijkstra.cpp	Dimensiune	1.17 KB
Data încărcării	29 Aprilie 2025, 14:04	Scor / rezultat	Eroare de compilare

Evaluare

Mesaj compilare

dijkstra.cpp: In function 'void dijkstra(int, std::vector<std::vector<std::pair<int, int> > >, std::vector<int>&)':
dijkstra.cpp:6:5: error: 'priority_queue' was not declared in this scope
     priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;

     ^
dijkstra.cpp:6:33: error: expected primary-expression before ',' token
     priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;

                                 ^
dijkstra.cpp:6:56: error: expected primary-expression before ',' token
     priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;

                                                        ^
dijkstra.cpp:6:80: error: expected primary-expression before '>' token
     priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;

                                                                                ^
dijkstra.cpp:6:82: error: 'pq' was not declared in this scope
     priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;

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

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

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

                      ^
dijkstra.cpp:16:19: error: expected unqualified-id before '[' token
         for (auto [v, cost] : adj[n]) {

                   ^
dijkstra.cpp:16:19: error: expected ';' before '[' token
dijkstra.cpp:16:20: error: 'v' was not declared in this scope
         for (auto [v, cost] : adj[n]) {

                    ^
dijkstra.cpp:16:23: error: 'cost' was not declared in this scope
         for (auto [v, cost] : adj[n]) {

                       ^
dijkstra.cpp: In lambda function:
dijkstra.cpp:16:29: error: expected '{' before ':' token
         for (auto [v, cost] : adj[n]) {

                             ^
dijkstra.cpp: In function 'void dijkstra(int, std::vector<std::vector<std::pair<int, int> > >, std::vector<int>&)':
dijkstra.cpp:16:29: error: expected ';' before ':' token
dijkstra.cpp:16:29: error: expected primary-expression before ':' token
dijkstra.cpp:16:29: error: expected ')' before ':' token
dijkstra.cpp:16:29: error: expected primary-expression before ':' token
dijkstra.cpp:16:29: error: expected ';' before ':' token
dijkstra.cpp:45:1: error: expected '}' at end of input
 }
 ^
dijkstra.cpp:45:1: error: expected '}' at end of input

Cum funcționează evaluarea?