Dashboard
AI Resume Builder
Mock Interview
Tailored Practice
Competitive Interviews
Coding Prep
Aptitude Prep
GMAT Prep
javascript
Given a weighted graph and a starting vertex, find the shortest path to all other vertices using Dijkstra's algorithm. Return the shortest distances and paths.