One post tagged with "Graphs"

Single-source shortest path finds the shortest path from one node to all others in a graph. Dijkstra's algorithm is the classic solution, but it's inherently sequential. For large graphs, you need parallel approaches.