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

Authors

  • Stepan Vynnychuk National Academy of Sciences of Ukraine Pukhov Institute for Modelling in Energy Engineering,

DOI:

https://doi.org/10.20535/2411-1031.2012.1.2.54120

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.

Author Biography

Stepan Vynnychuk, National Academy of Sciences of Ukraine Pukhov Institute for Modelling in Energy Engineering,

Doctor of technical sciences,
senior researcher,
deputy director for scientific work

References

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

Published

2012-12-30

How to Cite

Vynnychuk, S. (2012). Analysis steps of the time complexity of Kruskal algorithm with sorted scales with work time O(E + VLogV) for its C- implementation. Information Technology and Security, 1(2), 10–13. https://doi.org/10.20535/2411-1031.2012.1.2.54120

Issue

Section

ARTICLES