private void Initialization()
{
edgesBetweenNeighbours = new List<double>();
for (int i = 0; i < container.Size; ++i)
edgesBetweenNeighbours.Add(-1);
cyclesCounter = new CyclesCounter(container);
}
// Возвращается распределение чисел циклов. Реализовано.
public override SortedDictionary<int, long> GetCycles(int lowBound, int hightBound)
{
log.Info("Getting cycles.");
cyclesCounter = new CyclesCounter(container);
SortedDictionary<int, long> cyclesCount = new SortedDictionary<int, long>();
long count = 0;
for (int i = lowBound; i <= hightBound; i++)
{
count = cyclesCounter.getCyclesCount(i);
cyclesCount.Add(i, count);
}
return cyclesCount;
}
