ON FINDING THE MINIMAL SPANNING TREE

Okhlupina Olga V., Murashko Dmitry S.

The use of graph theory for the purpose of formalization and data research is widely used in various branches of human activity, such as construction, design, aviation, economics. Finding the minimum spanning tree of an arbitrary undirected weighted graph has been a well-known problem for decades. However, the method of solving this problem still does not lose its relevance in connection with the search for the most effective implementation. The existing algorithms of the solution are being improved for the purpose of universality of use and error tolerance. The paper considers the solution of the problem of finding the minimum spanning tree using the Prima algorithm using html css java script. A convenient tool has been obtained for quickly creating a tree grid and calculating the minimum distance between points by building a path map and visually displaying the result to the user. For convenient operation, an interface has been developed that allows you to manipulate the grid of space.

Keywords:weight, vertex, graph, tree, path, edge, spanning tree, connected graph, undirected graph, space grid