Introduces Union-Find data structure and Prim's algorithm for minimum spanning trees in graphs, exploring cuts and historical origins.
Explores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.
Covers the concept of weighted graphs and the Greedy algorithm for finding a minimal spanning tree.
Covers the implementation of singly linked lists in Java, focusing on concepts such as nodes, size management, adding, removing, and getting elements.
Covers the implementation of combiners in parallel programming in Scala, including efficient combine methods and set data structures.
