Set
There's a total of 1 articles.
Single Source Shortest Path (SSSP) in a graph
graph theory
single source shortest path
weighted graph
unweighted graph
dijkstra
bfs
set
priority queue
Given a weighted graph $G$ with $V$ vertices and $E$ edges where all the weights are non-negative and given a source vertex $s$, the single source shortest path problem consists in finding the distance from $s$ to all the other vertices.
In this article I describe the problem in a weighted and unweighted graph as well as implementations using BFS for unweighted graphs and Dijkstra's algorithm for weighted graphs using an array and a priority queue.
