Graph

In computer science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from the field of graph theory within mathematics.

Name		Name	Last commit message	Last commit date
1)BFS_Traversal		1)BFS_Traversal
2)DFS_Traversal		2)DFS_Traversal
2.1)Number_of_Provinces		2.1)Number_of_Provinces
2.2)Number of Islands		2.2)Number of Islands
2.3)Flood_Fill		2.3)Flood_Fill
2.4)Rotten_Oranges		2.4)Rotten_Oranges
2.5)Find if Path Exists in Graph		2.5)Find if Path Exists in Graph
2.6)Keys and Rooms		2.6)Keys and Rooms
2.7)Minimum Time to Collect All Apples in a Tree		2.7)Minimum Time to Collect All Apples in a Tree
2.8)Cheapest Flights Within K Stops		2.8)Cheapest Flights Within K Stops
2.9)Minimum Fuel Cost to Report to the Capital		2.9)Minimum Fuel Cost to Report to the Capital
3)DetectCycle_Undirected_Graph		3)DetectCycle_Undirected_Graph
3.1)DetectCycle_Directed_Graph		3.1)DetectCycle_Directed_Graph
3.2)Number of Operations to Make Network Connected		3.2)Number of Operations to Make Network Connected
3.3)Count Unreachable Pairs of Nodes in an Undirected Graph		3.3)Count Unreachable Pairs of Nodes in an Undirected Graph
3.4)Longest Cycle in a Graph		3.4)Longest Cycle in a Graph
3.5)Number of Closed Islands		3.5)Number of Closed Islands
3.6)Largest Color Value in a Directed Graph		3.6)Largest Color Value in a Directed Graph
3.7)Similar String Groups		3.7)Similar String Groups
3.8)Remove Max Number of Edges to Keep Graph Fully Traversable		3.8)Remove Max Number of Edges to Keep Graph Fully Traversable
5)Bipartite_Graph		5)Bipartite_Graph
6)Topological_Sort		6)Topological_Sort
7)Kahns_Algo_Topo_BFS		7)Kahns_Algo_Topo_BFS
8)ShortestPath_UndirectedGraph		8)ShortestPath_UndirectedGraph
8.1)Dijkstras_Algo_SP_Undirected		8.1)Dijkstras_Algo_SP_Undirected
8.2)ShortestPath_DAG.cpp		8.2)ShortestPath_DAG.cpp
8.3)Minimum Score of a Path Between Two Cities		8.3)Minimum Score of a Path Between Two Cities
8.4)Reorder Routes to Make All Paths Lead to the City Zero		8.4)Reorder Routes to Make All Paths Lead to the City Zero
9)MST_Prim's_Algorithm		9)MST_Prim's_Algorithm
9.1)Kruskals_MST.cpp		9.1)Kruskals_MST.cpp
Articulation_Pts.cpp		Articulation_Pts.cpp
Bellman_Ford_Algorithm		Bellman_Ford_Algorithm
Detect_Bridges.cpp		Detect_Bridges.cpp
Disjoint_Set		Disjoint_Set
Kosaraju's_Algo(SCC)		Kosaraju's_Algo(SCC)
README.md		README.md

Navigation Menu

Repository navigation

About

Repository files navigation

Graph

About

Releases

Packages

Contributors

Languages

Latest commit

History

Folders and files

Repository files navigation

Graph

About

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages