6.4.29 Graph theory

Problem: A weighted graph is defined by a matrix of arc lengths. Plot the graph. Find: a) the spanning tree of minimum weight; b) the shortest distance from vertex \( v_{4} \) to the remaining vertices of the graph, using Dijkstra's algorithm.