Open shawon-majid opened 3 years ago
BFS and 2D BFS basic: http://www.shafaetsplanet.com/?p=604
Code of BFS on connected graph: https://github.com/shawon-majid/Problem-Solving-Discussion/blob/e6e8d9e6cb3dab4eef07442f4de78b082f099cb5/Uva/Uva%20459.cpp
Code of 2D BFS: https://github.com/shawon-majid/Problem-Solving-Discussion/blob/e6e8d9e6cb3dab4eef07442f4de78b082f099cb5/Uva/Uva%20572.cpp
Dijkstra basic: Graph Algo book Code of Dijkstra with path: https://github.com/shawon-majid/Problem-Solving-Discussion/blob/e6e8d9e6cb3dab4eef07442f4de78b082f099cb5/Codeforces/Codeforces%2020C.cpp
Floyd Warshal basic: Graph Algo book code: https://github.com/shawon-majid/Problem-Solving-Discussion/blob/e6e8d9e6cb3dab4eef07442f4de78b082f099cb5/Uva/uva%201112.cpp
Bellman Ford video: https://www.youtube.com/watch?v=FtN3BYH2Zes Code of negative cycle detection: https://github.com/shawon-majid/Problem-Solving-Discussion/blob/2248a065a28494e838d3a05c14ac1d7e2891ef91/Uva/uva%20558.cpp (this was my implementation of bellman ford algorithm but I think that this is not most efficient one, refer to Mehraj's Code in the graph Contest of problem N to see the better implementation of Bellman ford algorithm by making a structure of edges)
Disjoint Set
Topological Sort
Minimum Spanning Tree
My Graph notes, blogs and articles Mostly from Youtube and Graph Algorithm book by Shafayet Ashraf