Васянин, В.А.
(Екологічна безпека та природокористування, 2009)
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 ...