О вычислительной эффективности одного алгоритма для нахождения остовного леса графа с минимальным (максимальным) весом

Abstract

In work effective realization of «greedy» algorithm for finding minimum (maximum) spanning woods (trees) of an undirected weighed graph is considered. Is given the rating of the expected computing time of algorithm is 0 (M), where M — number of edges in a graph. Is shown, that the offered algorithm is better than a Prim’s algorithm for graphs with number of edges less, than N2/6, where N — number of vertices in a graph. The experimental research of algorithm on the graphs, containing from 499500 up to 71994000 edges, has shown its high computing efficiency and his can be recommended for the decision of practical problems on rarefied graphs or networks of the big dimension.