GitHub - Jeffrin2005/Graph-Theory-: Graph Problems

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 135 Commits
(BFS) Restore the Array From Adjacent Pairs.cpp		(BFS) Restore the Array From Adjacent Pairs.cpp
(DFS) Restore the Array From Adjacent Pairs.cpp		(DFS) Restore the Array From Adjacent Pairs.cpp
(Dijkstra's)Network Delay Time(BFS).cpp		(Dijkstra's)Network Delay Time(BFS).cpp
(FLOYD-WARSHAL) Find the City With the Smallest Number of Neighbors at a Threshold Distance.cpp		(FLOYD-WARSHAL) Find the City With the Smallest Number of Neighbors at a Threshold Distance.cpp
(Floyd-Warshall)Count the Number of Houses at a Certain Distance I.cpp		(Floyd-Warshall)Count the Number of Houses at a Certain Distance I.cpp
. Minimum Height Trees(BFS).cpp		. Minimum Height Trees(BFS).cpp
01 Matrix.cpp		01 Matrix.cpp
All Ancestors of a Node in a Directed Acyclic Graph(BFS).cpp		All Ancestors of a Node in a Directed Acyclic Graph(BFS).cpp
All Ancestors of a Node in a Directed Acyclic Graph(DFS).cpp		All Ancestors of a Node in a Directed Acyclic Graph(DFS).cpp
All Paths From Source to Target(BFS).cpp		All Paths From Source to Target(BFS).cpp
All Paths From Source to Target(DFS).cpp		All Paths From Source to Target(DFS).cpp
BFS.cpp		BFS.cpp
Cheapest Flights Within K Stops(BFS).cpp		Cheapest Flights Within K Stops(BFS).cpp
Count Unreachable Pairs of Nodes in an Undirected Graph(BFS).cpp		Count Unreachable Pairs of Nodes in an Undirected Graph(BFS).cpp
Count Unreachable Pairs of Nodes in an Undirected Graph(DFS).cpp		Count Unreachable Pairs of Nodes in an Undirected Graph(DFS).cpp
Count the Number of Complete Components(BFS).cpp		Count the Number of Complete Components(BFS).cpp
Count the Number of Complete Components(DFS).cpp		Count the Number of Complete Components(DFS).cpp
Course Schedule II.cpp		Course Schedule II.cpp
Course Schedule.cpp		Course Schedule.cpp
DFS of Graph.cpp		DFS of Graph.cpp
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
Detonate the Maximum Bombs(BFS).cpp		Detonate the Maximum Bombs(BFS).cpp
Detonate the Maximum Bombs(DFS).cpp		Detonate the Maximum Bombs(DFS).cpp
Detonate the Maximum Bombs(RECURSION).cpp		Detonate the Maximum Bombs(RECURSION).cpp
Dijkstra's Algorithm Find the City With the Smallest Number of Neighbors at a Threshold Distance.cpp		Dijkstra's Algorithm Find the City With the Smallest Number of Neighbors at a Threshold Distance.cpp
Dijkstra's algorithm.cpp		Dijkstra's algorithm.cpp
Distance of nearest cell having 1.cpp		Distance of nearest cell having 1.cpp
Evaluate Division(BFS).cpp		Evaluate Division(BFS).cpp
Evaluate Division(DFS).cpp		Evaluate Division(DFS).cpp
Find All Possible Recipes from Given Supplies(BFS).cpp		Find All Possible Recipes from Given Supplies(BFS).cpp
Find All Possible Recipes from Given Supplies(DFS).cpp		Find All Possible Recipes from Given Supplies(DFS).cpp
Find Center of Star Graph.cpp		Find Center of Star Graph.cpp
Find Champion II(BFS).cpp		Find Champion II(BFS).cpp
Find Champion II(DFS).cpp		Find Champion II(DFS).cpp
Find Closest Node to Given Two Nodes(BFS).cpp		Find Closest Node to Given Two Nodes(BFS).cpp
Find Closest Node to Given Two Nodes(DFS).cpp		Find Closest Node to Given Two Nodes(DFS).cpp
Find Eventual Safe States(BFS).cpp		Find Eventual Safe States(BFS).cpp
Find Eventual Safe States(DFS).cpp		Find Eventual Safe States(DFS).cpp
Find if Path Exists in Graph.cpp		Find if Path Exists in Graph.cpp
Find the Town Judge.cpp		Find the Town Judge.cpp
Find the number of islands.cpp		Find the number of islands.cpp
FindCenteroftarGraph.cpp		FindCenteroftarGraph.cpp
Flood Fill.cpp		Flood Fill.cpp
Flower Planting With No Adjacent(BFS).cpp		Flower Planting With No Adjacent(BFS).cpp
Flower Planting With No Adjacent(DFS).cpp		Flower Planting With No Adjacent(DFS).cpp
Floyd-Warshall algorithm.cpp		Floyd-Warshall algorithm.cpp
Is Graph Bipartite?.cpp		Is Graph Bipartite?.cpp
Keys and Rooms(BFS).cpp		Keys and Rooms(BFS).cpp
Keys and Rooms(DFS).cpp		Keys and Rooms(DFS).cpp
KeysandRooms(BFS).cpp		KeysandRooms(BFS).cpp
Loud and Rich(BFS).cpp		Loud and Rich(BFS).cpp
Loud and Rich(DFS).cpp		Loud and Rich(DFS).cpp
Maximal Network Rank(BFS).cpp		Maximal Network Rank(BFS).cpp
Maximal Network Rank(DFS).cpp		Maximal Network Rank(DFS).cpp
Minimum Fuel Cost to Report to the Capital(BFS).cpp		Minimum Fuel Cost to Report to the Capital(BFS).cpp
Minimum Fuel Cost to Report to the Capital(DFS).cpp		Minimum Fuel Cost to Report to the Capital(DFS).cpp
Minimum Number of Vertices to Reach All Nodes.cpp		Minimum Number of Vertices to Reach All Nodes.cpp
Minimum Score of a Path Between Two Cities(BFS).cpp		Minimum Score of a Path Between Two Cities(BFS).cpp
Minimum Score of a Path Between Two Cities(DFS).cpp		Minimum Score of a Path Between Two Cities(DFS).cpp
Most Stones Removed with Same Row or Column(BFS).cpp		Most Stones Removed with Same Row or Column(BFS).cpp
Most Stones Removed with Same Row or Column(DFS).cpp		Most Stones Removed with Same Row or Column(DFS).cpp
Network Delay Time(DFS).cpp		Network Delay Time(DFS).cpp
Node With Highest Edge Score.cpp		Node With Highest Edge Score.cpp
Number of Enclaves.cpp		Number of Enclaves.cpp
Number of Islands.cpp		Number of Islands.cpp
Number of Operations to Make Network Connected(BFS).cpp		Number of Operations to Make Network Connected(BFS).cpp
Number of Operations to Make Network Connected(DFS).cpp		Number of Operations to Make Network Connected(DFS).cpp
Number of Provinces(BFS).cpp		Number of Provinces(BFS).cpp
Number of Provinces(DFS).cpp		Number of Provinces(DFS).cpp
Path with Maximum Probability(BFS).cpp		Path with Maximum Probability(BFS).cpp
Path with Maximum Probability(DFS).cpp		Path with Maximum Probability(DFS).cpp
Possible Bipartition(BFS).cpp		Possible Bipartition(BFS).cpp
Possible Bipartition(DFS).cpp		Possible Bipartition(DFS).cpp
Prerequisite Tasks.cpp		Prerequisite Tasks.cpp
Rat in a Maze Problem - I.cpp		Rat in a Maze Problem - I.cpp
Reachable Nodes With Restrictions(BFS).cpp		Reachable Nodes With Restrictions(BFS).cpp
Reachable Nodes With Restrictions(DFS).cpp		Reachable Nodes With Restrictions(DFS).cpp
Redundant Connection(BFS).cpp		Redundant Connection(BFS).cpp
Redundant Connection(DFS).cpp		Redundant Connection(DFS).cpp
Reorder Routes to Make All Paths Lead to the City Zero(BFS).cpp		Reorder Routes to Make All Paths Lead to the City Zero(BFS).cpp
Reorder Routes to Make All Paths Lead to the City Zero(DFS).cpp		Reorder Routes to Make All Paths Lead to the City Zero(DFS).cpp
Rotting Oranges.cpp		Rotting Oranges.cpp
Shortest Path with Alternating Colors(BFS).cpp		Shortest Path with Alternating Colors(BFS).cpp
Surrounded Regions.(DFS)cpp		Surrounded Regions.(DFS)cpp
Topological sort(BFS).cpp		Topological sort(BFS).cpp
Topological sort(DFS).cpp		Topological sort(DFS).cpp
Validate Binary Tree Nodes(BFS).cpp		Validate Binary Tree Nodes(BFS).cpp
Validate Binary Tree Nodes(DFS).cpp		Validate Binary Tree Nodes(DFS).cpp
Word Ladder.cpp		Word Ladder.cpp
print adjacency list.cpp		print adjacency list.cpp
total no of graphs.cpp		total no of graphs.cpp