An object-oriented cluster search algorithm

TL;DR: This work describes two object-oriented cluster search algorithms, which can be applied to a network of an arbitrary structure, and estimates the complexity of the algorithm and infer that the number of operations has linear growth with respect to the size of the network.

Abstract: In this work we describe two object-oriented cluster search algorithms, which can be applied to a network of an arbitrary structure. First algorithm calculates all connected clusters, whereas the second one finds a path with the minimal number of connections. We estimate the complexity of the algorithm and infer that the number of operations has linear growth with respect to the size of the network.