Shortest Path

May 18, 2023

The \(\textbf{shortest-path distance } \delta(s, v)\) from a source vertex \(s\) to \(v\) as the minimum number of edges in any path from vertex \(s\) to a vertex \(v\). In case of no path the distance between the two vertices is set as \(\delta(s, v) = \infty\).