Graph Traversal

Breadth-first search youtube video on how the BFS algorithm does the graph traversal https://youtu.be/QRq6p9s8NVg

Try out the Breadth First Search visualisations: Algorithm uses a queue to visit nodes

• https://www.cs.usfca.edu/~galles/visualization/BFS.html

• https://www.hackerearth.com/practice/algorithms/graphs/breadth-first-search/visualize/

• Depth-first search youtube video on how the DFS algorithm does the graph traversal https://youtu.be/iaBEKo5sM7w

Try out the Depth First Search visualisations: Algorithm uses a stack to visit nodes

• https://www.cs.usfca.edu/~galles/visualization/DFS.html

• https://www.hackerearth.com/practice/algorithms/graphs/depth-first-search/visualize/

This short youtube video illustrates the DFS loop detection: https://youtu.be/xHX6a7D2U-M

DFS used for topological sorting.  https://www.cs.usfca.edu/~galles/visualization/TopoSortDFS.html 

Youtube video on graph colouring of nodes where we try to minimise resource allocation. https://youtu.be/RSSfO0lnEp8

Shortest Path Algorithms

Dijkstra's single source shortest path youtube examples

• video clip explains how Dijkstra's works. https://youtu.be/EFg3u_E6eHU

• algorithm trace https://youtu.be/irVgyE0pq6c

• execution of Dijkstra's Algorithm that stores the information in a matrix as the algorithm progresses to the final solution.https://youtu.be/0nVYi3o161A

• execution of Dijkstra's Algorithm on a weighted directed graph. https://youtu.be/8Ls1RqHCOPw

Online Interactive Tutorials for Dijkstra's Algorithm:

• https://algorithms.discrete.ma.tum.de/spp/ shows a step by step execution of Dijkstra's algorithm, mouse click on the Dijkstra's diagram  to see the shortest path interactive

• another visualisation of Dijkstra's running is available here https://www.cs.usfca.edu/~galles/visualization/Dijkstra.html

• Try this online example https://www.101computing.net/dijkstras-shortest-path-algorithm/

• Need more examples? Checkout https://tech.io/playgrounds/1608/shortest-paths-with-dijkstras-algorithm/introduction

Bellman Ford single source shortest path youtube examples

• execution of Bellman Ford on a directed graph using a matrix to record the distances.https://youtu.be/iTW2yFYd1Nc

• Bellman-Ford Single Source Shortest Path Graph Algorithm Trace https://youtu.be/aG-0K2QZGv0 

Online Interactive Tutorials for the Bellman-Ford shortest path algorithm

• https://algorithms.discrete.ma.tum.de/spp/ shows an interactive visualisation of the execution if you click on the Bellman-Ford