MIT Algorithms OCW

MIT OCW needs no introduction in terms of quality and does a great job with teaching Algorithms Fundamentals. You will feel at home if you have studied Cormen 

An implementation to go along with each of the tutorial will be like Chai with Pakora on a Rainy Day . There's bit of cultural reference here if you know what I mean. :D




13. Graph Theory (Breadth First Search)

14. Graph Theory(Depth First Search)

Coursera Adjacency Matrix : Great quick recap.

https://www.coursera.org/learn/advanced-data-structures/lecture/0YiQe/core-adjacency-list

GeeksforGeeks DFS and BFS : I found the explanation to be very simple and the Python/C++/Java code is a great for starters.

https://www.geeksforgeeks.org/breadth-first-traversal-for-a-graph/

https://www.geeksforgeeks.org/depth-first-traversal-for-a-graph/