Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Minimum spanning tree

Related lectures (31)

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

Explores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.

Explores the Traveling Salesman Problem, resolution algorithms, minimum spanning tree, and shortcut optimization.

Covers the Union-Find data structure and Minimum Spanning Trees.

Introduces Union-Find data structure and Prim's algorithm for minimum spanning trees in graphs, exploring cuts and historical origins.

Covers pre-dimensioning and graphical representation of slabs supported by beams and columns.

Discusses level control adjustment and error elimination for precise measurements.

Covers Minimum Spanning Trees, Kruskal's Algorithm, and Shortest Paths in directed graphs.

Distinguishes between subgraphs and induced subgraphs in graph theory, illustrating the construction of minimal spanning trees.

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Discusses the measurement of flexural rigidity in sandwich structures through bending tests and the impact of core material on rigidity.

Explores the Matrix Tree Theorem and its application in calculating spanning trees in graphs.

Covers the concept of weighted graphs and the Greedy algorithm for finding a minimal spanning tree.

Explores the concept of minimizing guardians in graphs through strategic edge selection.

Explores graphs and matrices, including adjacency, degree, and Laplace matrices, Matrix-tree theorem, and spanning trees.

Discusses Union-Find data structures and Minimum Spanning Trees, covering algorithms and their applications in network design and optimization.

Covers the implementation and analysis of disjoint sets data structure and introduces the concept of minimum spanning trees.

Covers minimum spanning trees, disjoint-set data structures, union methods, and Prim's algorithm for finding minimum spanning trees.

Explores maximizing candies in a city, dynamic programming, minimum spanning trees, and stock price prediction strategies.