Explores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.
Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Distinguishes between subgraphs and induced subgraphs in graph theory, illustrating the construction of minimal spanning trees.
Covers the fundamentals of graph theory, including vertices, edges, degrees, walks, connected graphs, cycles, and trees, with a focus on the number of edges in a tree.
Covers topics like DFS output, edge classification, acyclic graphs, correctness, time analysis, SCCs, and the Topological Sort algorithm.
