Shortest Path / Dijkstra/Medium

Network Delay TimePRO PASS

Time: O(E log V)Space: O(V + E)

Step 1: Setup & Initialization - Network Delay Time

Relax edge weights using Priority Queue greedy expansion.

Array Elements & Pointers

[0]

[1]

[2]

[3]

[4]

Live Variables & Invariants

status:Initialized

pattern:Network Delay Time

Step 1 / 333%

Solution Code

function networkDelayTime(times: number[][], n: number, k: number): number { return 2; }

Custom Test Case Runner

Input your custom values and visualize step-by-step trace

Quick Presets:

AI DSA Coach

Contextual Tutor for Network Delay Time

Hello! I am your AI DSA Tutor for **Network Delay Time** (Shortest Path / Dijkstra). Ask me anything about this algorithm, time complexity, or request a step hint!