This document discusses several algorithms and data structures including backtracking, greedy algorithms, dynamic programming, graph theory algorithms like BFS, DFS, minimum spanning trees, strongly connected components, topological sorting, trees, range minimum queries and their applications. It covers fundamental algorithms like Dijkstra's algorithm, Kruskal's algorithm, Prim's algorithm, Kosaraju's algorithm and Tarjan's algorithm.
This document discusses several algorithms and data structures including backtracking, greedy algorithms, dynamic programming, graph theory algorithms like BFS, DFS, minimum spanning trees, strongly connected components, topological sorting, trees, range minimum queries and their applications. It covers fundamental algorithms like Dijkstra's algorithm, Kruskal's algorithm, Prim's algorithm, Kosaraju's algorithm and Tarjan's algorithm.
This document discusses several algorithms and data structures including backtracking, greedy algorithms, dynamic programming, graph theory algorithms like BFS, DFS, minimum spanning trees, strongly connected components, topological sorting, trees, range minimum queries and their applications. It covers fundamental algorithms like Dijkstra's algorithm, Kruskal's algorithm, Prim's algorithm, Kosaraju's algorithm and Tarjan's algorithm.