*▍*minimum spanning tree in pascal

This code resolves the problem of finding a minimum spanning tree in a graph. The file 'edges' describes an undirected graph with integer edge costs. It has the format [number_of_nodes] [number_of_edges] [one_node_of_edge_1] [other_node_of_edge_1] [edge_1_cost] [one_node_of_...

Algorithm Delphi