The Cyclic Network is generated by a greedy algorithm that builds up all possible cyclic paths around each node of a given size range (default: [3]), with the sum of the contained edge scores as path score. Next the N x c best score performing cyclic paths are selected for each node and merged into the final network. The number of generated cycles is more complex to determine as the edge cycles might overlap, therefore the number of cycles can be estimated as: