Skip to content

Files

Latest commit

354fd0c · Oct 8, 2021

History

History
This branch is 26 commits ahead of, 31 commits behind gghati/Standard-Algorithms:master.

Graphs Algos

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
Oct 8, 2021
Oct 4, 2021
Oct 4, 2021
Oct 24, 2020
Oct 8, 2021
Oct 10, 2020
Oct 10, 2020
Oct 10, 2020
Oct 10, 2020
Oct 10, 2020
Oct 10, 2020
Oct 10, 2020
Oct 10, 2020
Oct 24, 2020

Graphs Representations:

  • Adjacency Matrix / Grid
  • Adjacency List / list

Graphs Algorithms

1) Searching Graphs

  • DFS -> Connected Components, Coloring components ✔️
  • BFS ✔️

2) Shortest Path Problem

  • BFS ✔️
  • Dijkstra's
  • Bellman-ford

3) Negative Cycle

  • Bellman-Ford
  • Floyd-Warshall ✔️

4) Stronly Connected components

  • Tarjan's Algo
  • Kosaraju's Algo

5) Traveling Salesman Problem

  • Held-Karp
  • Branch and bound
  • and many approxiation algorithms

6) Bridges ✔️

  • DFS No of Components ✔️

7) Articulation points

8) Minimum Spanning Tree

  • Krushal's
  • Prim's

9) Maximum Flow Networks

  • Ford-Fulkersor
  • Edmond-karp
  • Dinic's Algorithms

10) Kahn's Topological Sorting ✔️