Treffer: ОПРЕДЕЛЯНЕ НА СЛОЖНОСТ НА ИТЕРАЦИОНЕН АЛГОРИТЪМ ЗА ДЕКОМПОЗИЦИЯ ГРАФИ

This paper presents a methodology for determining the complexity assessment of an iterative graph decomposition algorithm. For this purpose, defined rules were used, which were applied to the procedural steps of the algorithm. By applying BIG-O notation, to the assessment, the type of time complexity is also obtained. The methodology for determining the complexity assessment is applied to graphs of different sizes. Based on this, the maximum number of operations for the algorithm was calculated. Based on the obtained results, conclusions about the iteration algorithm are drawn. Based on this, the maximum number of operations for the algorithm was calculated. Based on the obtained results, conclusions about the iteration algorithm are drawn