목록다익스트라 (1)

Replicated

[Greedy] 다익스트라 최단 경로

// 5972#include #include #include using namespace std;const int INF = 2000000000;int N, M;struct Node{ int Idx; int Weight;};vector > Graph;struct cmp{ bool operator() (Node x, Node y) { return x.Weight > y.Weight; }};vector Dijkstra(int Start){ vector Distance(N + 1, INF); priority_queue, cmp> Heap; Distance[Start] = 0; Heap.push( {Start, 0} ); while ( !Heap..
알고리즘 2024. 11. 3. 21:58
이전 Prev 1 Next 다음