Single-Source Shortest Path Problem and Dijkstra's Algorithm
Today we study how to find a shortest path from one vertex to any other vertex in a connected weighted undirected graph! To do this we are going to need some things to build up to Dijkstra's Algorithm! We will prove Dijkstra's algorithm is correct, and see what else we can explore related to the topic.
Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
Patreon Supporters (Supporter Access!):
Eric R
-----------------------------------------------------------
Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content:
PATREON: https://www.patreon.com/PageWizard
SUBSCRIBESTAR: https://www.subscribestar.com/drpage
Follow also at:
FACEBOOK: https://www.facebook.com/DanielRPage
TWITTER: https://twitter.com/PageWizardGLE
QUORA: https://www.quora.com/profile/Daniel-...
TWITCH: https://www.twitch.tv/pagewizard
#ComputerScience
#Algorithm
#Graphs