Dijkstra's Algorithm WITH FULL EXAMPLE (Graphs: Algorithms & Theory)
3In today's lesson we learn about what Dijkstra's algorithm is, and do an example! We take Dan's idea of the blob to come up with our idea, classically derived otherwise by Computer Science pioneer Dijkstra.
Remark: Much of the setup for Dijkstra's Algorithm here relies on Prim's Algorithm in its presentation, you can watch about that here from a previous live show: https://youtu.be/zTNVve9jO0c?t=8663
Time Stamp:
0:00 Reminder, Origin
1:01 Some ideas to try to solve the problem, edge relaxation, changing our blob to be lazy!
12:55 Dijkstra's Algorithm (pseudocode)
19:29 Some discussion about time complexity and more
21:28 Example of using Dijkstra's algorithm
29:28 Closing
Have a beautiful day!
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
PAYPAL: https://paypal.me/pagewizard
Follow also at:
FACEBOOK: https://www.facebook.com/DanielRPage
TWITTER: https://twitter.com/PageWizardGLE
QUORA: https://www.quora.com/profile/Daniel-R-Page
TWITCH: https://www.twitch.tv/pagewizard
#ComputerScience
#Algorithms
#GraphTheory