From 7028cddbe0bf47a87b97a7be90cb2b6acee71627 Mon Sep 17 00:00:00 2001 From: Mohit Kumar Toshniwal Date: Mon, 30 Aug 2021 23:27:15 +0530 Subject: [PATCH] Update primsAlgoJavaEfficient --- primsAlgoJavaEfficient | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/primsAlgoJavaEfficient b/primsAlgoJavaEfficient index 7152907..ab0c86b 100644 --- a/primsAlgoJavaEfficient +++ b/primsAlgoJavaEfficient @@ -39,7 +39,7 @@ class Main key[0] = 0; parent[0] = -1; - pq.add(new Node(key[0], 0)); + pq.add(new Node(0, key[0])); // Run the loop till all the nodes have been visited // because in the brute code we checked for mstSet[node] == false while computing the minimum // but here we simply take the minimal from the priority queue, so a lot of times a node might be taken twice