We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent da1cd6a commit 263af25Copy full SHA for 263af25
9 Graphs/dijkstra_adj_list.java
@@ -3,7 +3,7 @@
3
https://github.com/JayakrishnaThota/LC/blob/master/743.%20Network%20Delay%20Time
4
*/
5
6
-//Dijkstras Time Complexity for adjancecy matrix representation: O(V^2 + ElogV) time and O(V+E) space
+//Dijkstras Time Complexity for adjancecy matrix representation: O(E + VlogV) time and O(V+E) space
7
8
package Graphs;
9
import java.util.*;
0 commit comments