S4.4- Algoritmo de Kruskal | 40/49 | UPV

Title: S4.4 - Kruskal's Algorithm Automatic Description: This video explains how to use Kruskal's algorithm to find minimum and maximum spanning trees in graphs, using the planning of a high-speed rail network as a practical example. The process is demonstrated with a simple graph of three vertices and then with a more complex one of five vertices, describing step by step how to select the edges to form the minimum-cost spanning tree, avoiding closing cycles and seeking the lowest sum of weights. The procedure begins by arranging the edges in ascending order of weight and adding them to the forming tree, provided they do not create cycles. Once enough edges have been added to connect all vertices (number of vertices minus one), the process stops, having obtained the minimum cumulative cost. To find the maximum-cost spanning tree, a similar approach is followed, but with the edges ordered from highest to lowest weight, also taking care not to form cycles. At the end, it is explained that a future video will cover modeling the problem of railway networks using this algorithm. Author: José Alberto Conejero Casares Course: This video is 40/49 of the MOOC course Applications of Graph Theory to Real Life I | Universitat Politècnica de València UPV.    • MOOC Aplicaciones de la Teoría de Grafos a...   Universitat Politècnica de València UPV: https://www.upv.es More videos at:    / valenciaupv   Access our MOOCs: https://upvx.es #theory #graphs #mathematics #life #real #trees #algorithm #of #kruskal #mathematics