Skip to content

Graph

Directory actions

More options

Directory actions

More options

Latest commit

 

History

History

Graph

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
BFS_DFS
BFS_DFS
 
 
Bellman-Ford Based Problems
Bellman-Ford Based Problems
 
 
Dijkstra'a Based Problems
Dijkstra'a Based Problems
 
 
Disjoint Set
Disjoint Set
 
 
Easy
Easy
 
 
Euler
Euler
 
 
Floyd Warshall
Floyd Warshall
 
 
Multi-Source BFS
Multi-Source BFS
 
 
Topological Sorting
Topological Sorting
 
 
All Ancestors of a Node in a Directed Acyclic Graph.cpp
All Ancestors of a Node in a Directed Acyclic Graph.cpp
 
 
All Paths From Source to Target.cpp
All Paths From Source to Target.cpp
 
 
All Paths from Source Lead to Destination.cpp
All Paths from Source Lead to Destination.cpp
 
 
BFS_Traversal.cpp
BFS_Traversal.cpp
 
 
Bipartite Graph.cpp
Bipartite Graph.cpp
 
 
Bus Routes.cpp
Bus Routes.cpp
 
 
Cheapest Flights Within K Stops.cpp
Cheapest Flights Within K Stops.cpp
 
 
Check If Two Nodes Are On Same Path In A Graph
Check If Two Nodes Are On Same Path In A Graph
 
 
Clone Graph.cpp
Clone Graph.cpp
 
 
Critical Connections in a Network
Critical Connections in a Network
 
 
Cycle Detection (Color Technique)
Cycle Detection (Color Technique)
 
 
DFS Traversal (Iterative & Recursive)
DFS Traversal (Iterative & Recursive)
 
 
Detect cycle in a directed graph (BFS).cpp
Detect cycle in a directed graph (BFS).cpp
 
 
Detect cycle in a directed graph (DFS).cpp
Detect cycle in a directed graph (DFS).cpp
 
 
Detect cycle in an undirected graph (BFS).cpp
Detect cycle in an undirected graph (BFS).cpp
 
 
Detect cycle in an undirected graph (DFS).cpp
Detect cycle in an undirected graph (DFS).cpp
 
 
Detect cycle in an undirected graph (Disjoint Set)
Detect cycle in an undirected graph (Disjoint Set)
 
 
Detect cycle in an undirected graph (Disjoint Set: Union by rank and path compression)
Detect cycle in an undirected graph (Disjoint Set: Union by rank and path compression)
 
 
Dijkstra’s Algorithm(Priority Queue).cpp
Dijkstra’s Algorithm(Priority Queue).cpp
 
 
Dijkstra’s Algorithm(set).cpp
Dijkstra’s Algorithm(set).cpp
 
 
Divide Nodes Into the Maximum Number of Groups.cpp
Divide Nodes Into the Maximum Number of Groups.cpp
 
 
Evaluate Division.cpp
Evaluate Division.cpp
 
 
Find Champion II.cpp
Find Champion II.cpp
 
 
Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree.cpp
Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree.cpp
 
 
Find Eventual Safe States.cpp
Find Eventual Safe States.cpp
 
 
Find Mother Vertex in Directed Graph
Find Mother Vertex in Directed Graph
 
 
Find the Celebrity
Find the Celebrity
 
 
Find whether path exist (BFS)
Find whether path exist (BFS)
 
 
Find whether path exist (DFS)
Find whether path exist (DFS)
 
 
Island Perimeter.cpp
Island Perimeter.cpp
 
 
Jump Game IV.cpp
Jump Game IV.cpp
 
 
Jumping Numbers (BFS)
Jumping Numbers (BFS)
 
 
Jumping Numbers (sorted order:Using set)
Jumping Numbers (sorted order:Using set)
 
 
Keys and Rooms.cpp
Keys and Rooms.cpp
 
 
Largest_Component_Size_by_Common_Factor.cpp
Largest_Component_Size_by_Common_Factor.cpp
 
 
Longest Path With Different Adjacent Characters.cpp
Longest Path With Different Adjacent Characters.cpp
 
 
Maximal Network Rank.cpp
Maximal Network Rank.cpp
 
 
Maximize the Number of Target Nodes After Connecting Trees II.cpp
Maximize the Number of Target Nodes After Connecting Trees II.cpp
 
 
Maximum Employees to Be Invited to a Meeting.cpp
Maximum Employees to Be Invited to a Meeting.cpp
 
 
Maximum Total Importance of Roads.cpp
Maximum Total Importance of Roads.cpp
 
 
Min Cost to Connect All Points.cpp
Min Cost to Connect All Points.cpp
 
 
Minimum Knight Moves
Minimum Knight Moves
 
 
Minimum Number of Vertices to Reach All Nodes.cpp
Minimum Number of Vertices to Reach All Nodes.cpp
 
 
Minimum Operations to Equalize Binary String.cpp
Minimum Operations to Equalize Binary String.cpp
 
 
Minimum Score After Removals on a Tree.cpp
Minimum Score After Removals on a Tree.cpp
 
 
Minimum Spanning Tree (Adjacency List , priority_queue)
Minimum Spanning Tree (Adjacency List , priority_queue)
 
 
Minimum Spanning Tree (Adjacency List)
Minimum Spanning Tree (Adjacency List)
 
 
Minimum Spanning Tree (Kruskal's Algorithm).cpp
Minimum Spanning Tree (Kruskal's Algorithm).cpp
 
 
Minimum Spanning Tree (Prim's).cpp
Minimum Spanning Tree (Prim's).cpp
 
 
Minimum Time to Collect All Apples in a Tree.cpp
Minimum Time to Collect All Apples in a Tree.cpp
 
 
Number of Connected Components in an Undirected Graph
Number of Connected Components in an Undirected Graph
 
 
Number of Distinct Islands
Number of Distinct Islands
 
 
Number of Islands.cpp
Number of Islands.cpp
 
 
Number of Nodes in the Sub-Tree With the Same Label.cpp
Number of Nodes in the Sub-Tree With the Same Label.cpp
 
 
Open the Lock.cpp
Open the Lock.cpp
 
 
Path With Minimum Effort
Path With Minimum Effort
 
 
Possible Bipartition.cpp
Possible Bipartition.cpp
 
 
README.md
README.md
 
 
Reconstruct Itinerary.cpp
Reconstruct Itinerary.cpp
 
 
Redundant Connection.cpp
Redundant Connection.cpp
 
 
Shortest Path Visiting All Nodes.cpp
Shortest Path Visiting All Nodes.cpp
 
 
Shortest Path in Weighted undirected graph.cpp
Shortest Path in Weighted undirected graph.cpp
 
 
Strongly Connected Components (Kosaraju's Algo).cpp
Strongly Connected Components (Kosaraju's Algo).cpp
 
 
Sum of Distances in Tree.cpp
Sum of Distances in Tree.cpp
 
 
Swim in Rising Water.cpp
Swim in Rising Water.cpp
 
 
The Maze II.cpp
The Maze II.cpp
 
 
The Maze.cpp
The Maze.cpp
 
 
Throne Inheritance
Throne Inheritance
 
 
Vertex Cover.cpp
Vertex Cover.cpp
 
 
Word Ladder II.cpp
Word Ladder II.cpp
 
 
Word_Ladder.cpp
Word_Ladder.cpp
 
 

README.md

Fork me on GitHub

Another good source for all Graph Algorithms at one spot : Graaaaaphs 🔭

Graph : 🚩

🔽Click to 🔍 and 😵 the sub-topics (Example : BFS, DFS) 📁BFS_DFS
📁Disjoint Set
📁Topological Sorting
📁Dijkstra's Algorithm Problems
📁Bellman-Ford Algorithm Problems
📁Floyd Warshall

Questions

Problem Name
BFS Traversal
DFS Traversal (Iterative & Recursive)
All Paths From Source to Target (Leetcode-797)
Detect cycle in a directed graph (BFS)
Detect cycle in a directed graph (DFS)
Cycle Detection (Color Technique)
Check If Two Nodes Are On Same Path In A Graph (DFS)
Detect cycle in an undirected graph (DFS)
Detect cycle in an undirected graph (BFS)
Detect cycle in an undirected graph (Disjoint Set)
Detect cycle in an undirected graph (Disjoint Set: Union by rank and path compression)
Number of Islands (Leetcode-200)
Number of Distinct Islands : Leetcode-694
Clone Graph (DFS, BFS) (Leetcode-133)
Strongly Connected Components (Kosaraju's Algo)
Find Mother Vertex in Directed Graph
Rotting Oranges (Leetcode - 994)
Minimum Spanning Tree (Prim's)
Largest Component Size by Common Factor (3 approaches) (Leetcode-952)
Find whether path exist (DFS)
Find whether path exist (BFS)
Word Ladder (Leetcode-127)
Word Ladder II (Leetcode-126)
Open the Lock (Leetcode-752)
Min Cost to Connect All Points (Leetcode-1584)
Find the Celebrity (Leetcode-277)
Minimum Spanning Tree (Kruskal's Algorithm)
Minimum Spanning Tree (Prim's Algorithm (Adjacency List))
Minimum Spanning Tree (Prim's Algorithm (Adjacency Matrix))
Evaluate Division (Leetcode : 399)
Throne Inheritance (Leetcode : 1600)
Jump Game IV (Leetcode : 1345)
Is Graph Bipartite? (3 approaches) (Leetcode : 785)
Keys and Rooms (Leetcode : 841)
Critical Connections in a Network (Leetcode : 1192)
Number of Connected Components in an Undirected Graph (Leetcode : 323)
Minimum Knight Moves (Leetcode : 1197)
The Maze (DFS & BFS) (Leetcode : 490)
The Maze II (DFS & BFS) (Leetcode : 505)
Island Perimeter (3 approaches) (Leetcode : 463)
Swim in Rising Water (2 approaches) (Leetcode : 778)
All Paths from Source Lead to Destination (PREMIMUM) (Leetcode : 1059)
Redundant Connection (3 approaches) (Leetcode : 684)
Possible Bipartition (Leetcode : 886)
Sum of Distances in Tree (Leetcode : 834)
Minimum Time to Collect All Apples in a Tree (Leetcode : 1443)
Number of Nodes in the Sub-Tree With the Same Label (Leetcode : 1519)
Longest Path With Different Adjacent Characters (Leetcode : 2246)
Cheapest Flights Within K Stops (Leetcode : 787)
Dijkstra’s Algorithm(Priority Queue)
Dijkstra’s Algorithm(set)
Minimum Number of Vertices to Reach All Nodes (Leetcode : 1557)
Find Eventual Safe States (Leetcode : 802)
Maximal Network Rank (Leetcode : 1615)
Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree (Leetcode : 1489)
Reconstruct Itinerary (Leetcode : 332)
Shortest Path Visiting All Nodes (Leetcode : 847)
Bus Routes (Leetcode : 815)
Vertex Cover (GfG)
Maximum Total Importance of Roads (Leetcode-2285)
All Ancestors of a Node in a Directed Acyclic Graph (Leetcode-2192)
Find Champion II (Leetcode - 2924)
Maximum Employees to Be Invited to a Meeting (Leetcode - 2127)
Divide Nodes Into the Maximum Number of Groups (Leetcode - 2493)
Minimum Score After Removals on a Tree (Leetcode - 2322)
Minimum Operations to Equalize Binary String (Leetcode - 3666)