CodingModerate
Implement Dijkstra's Algorithm on Adjacency List
Filed under Sigmoid
The question
Given an undirected weighted graph with distinct and positive weights, represent it using an adjacency list and implement Dijkstra's algorithm to find the shortest distance between a source and destination.
No write-up yet. Related questions below have one.
Related Sigmoid questions
Collected from public candidate posts and coding forums. Updated Nov 2026.