← Oracle questions
CodingEasy

Shortest path using Dijkstra's algorithm

Filed under Oracle · Also reported at ION, Pindexx

Given a weighted graph and a source node, find the shortest path from the source to all other nodes using Dijkstra's algorithm.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Oracle questions

Collected from public candidate posts and coding forums. Updated Nov 2026.