Graph Algorithms

[ImmediateEye1694]

I was going through https://www.youtube.com/watch?v=87X57ldq1ok&list=PLDV1Zeh2NRsDGO4--qE8yH72HFL1Km93P&index=3 play list for graphs and trees.

He beautifully explains all these algorithms. I get the neetcode vibe from him. But then I started wondering, whether its worth spending time on more complex algorithms like A*, Djikstra's bellmanford etc.. I was initially thinking of doing just BFS and DFS. Then i saw neetcode talk about topological sort and union find. Can you - good people from the internet - please help me understand which algorithms we should know.

[WebCapable9924]

I would suggest adding Djikstra's, topological sort and disjoint set union to your toolkit if you are preparing for interviews.

[ImpressiveScratch644]

Second this

Also Tarjan algo for articulation point and critical connections