📄️ reachability
This function checks if it is possible to travel from a source vertex to a destination vertex
📄️ counting_components
This function checks for the number of components in an UNDIRECTED graph.
📄️ topological_sort
Performs a topological sort on the directed graph. Based on Kahn's Algorithm
📄️ dfs_toposort
Performs a topological sort on the directed graph. This is a DFS implementation
📄️ count_strong_connected_components
Finds the number of strongly connected components (SCC) in a directed graph
📄️ spanning_tree_prim
Finds the minimum/maximum spanning tree of an UNDIRECTED graph using Prim's Algorithm. This algorithm is more useful when dealing with dense graphs.
📄️ spanning_tree_kruskal
Finds the minimum/maximum spanning tree of an UNDIRECTED graph using Kruskal's Algorithm. This algorithm is more useful when dealing with sparse graphs.
📄️ sssp_tree
Finds the single source shortest path of a tree.
📄️ sssp_unweighted
Finds the single source shortest path of an unweighted graph.
📄️ sssp_dag
Finds the single source shortest path of a Directed Acyclic Graph (DAG).
📄️ sssp_bellman_ford
Find the single source shortest path of any weighted graph using the bellman ford algorithm.
📄️ sssp_dijkstra
Find the single source shortest path of any graph with no negative weight edge.
📄️ floyd_warshall
Find the all pairs shortest path by using Floud Warshall algorithm