1

Graph and Types

2

Graph Representation | C++

3

Graph Representation | Java

4

Connected Components | Logic Explanation

5

BFS

6

DFS

1

Number of provinces (leetcode)

2

Connected Components Problem in Matrix

3

Rotten Oranges

4

Flood fill

5

Cycle Detection in undirected Graph (bfs)

6

Cycle Detection in undirected Graph (dfs)

7

0/1 Matrix (Bfs Problem)

8

Surrounded Regions (dfs)

9

Number of Enclaves [flood fill implementation - multisource]

10

Word ladder - 1

11

Word ladder - 2

12

Number of Distinct Islands [dfs multisource]

13

Bipartite Graph (DFS)

14

Cycle Detection in Directed Graph (DFS)

1

Topo Sort

2

Kahn's Algorithm

3

Cycle Detection in Directed Graph (BFS)

4

Course Schedule - I

5

Course Schedule - II

6

Find eventual safe states

7

Alien dictionary

1

Shortest Path in UG with unit weights

2

Shortest Path in DAG

3

Djisktra's Algorithm

4

Why priority Queue is used in Djisktra's Algorithm

5

Shortest path in a binary maze

6

Path with minimum effort

7

Cheapest flights within k stops

8

Network Delay time

9

Number of ways to arrive at destination

10

Minimum steps to reach end from start by performing multiplication and mod operations with array elements

11

Bellman Ford Algorithm

12

Floyd Warshal Algorithm

13

Find the city with the smallest number of neighbors in a threshold distance

1

Minimum Spanning Tree

2

Prim's Algorithm

3

Disjoint Set [Union by Rank]

4

Disjoint Set [Union by Size]

5

Kruskal's Algorithm

6

Number of operations to make network connected

7

Most stones removed with same rows or columns

8

Accounts merge

9

Number of island II

10

Making a Large Island

11

Swim in rising water

1

Bridges in Graph

2

Articulation Point

3

Kosaraju's Algorithm