Analysis steps of the time complexity of Kruskal algorithm with sorted scales with work time O(E + VLogV) for its C- implementation

Stepan Vynnychuk

Abstract


Proposed C-implementation of Kruskal's algorithm with running time O (E + VlogV) in the case of sorted weights of the edges with a detailed analysis of the time complexity of its steps.


References


Кормен Т. Алгоритмы: построение и анализ / [Кормен Т., Лейзерсон Ч., Риверст Р., Штайн К.]. – [2-е изд.]. – М. : Издательский дом “Вильямс”, 2011. – 1296 с.




ISSN 2411-1031 (Print), ISSN 2518-1033 (Online)