GraphBuilder.kt:144-146: Current algorithm of finding...

[0pdd]

The puzzle 34-d5eab858 from #34 has to be resolved:

deog/src/main/kotlin/org/objectionary/deog/graph/GraphBuilder.kt

Lines 144 to 146 in 46c3534

	* @todo #34:90m/DEV Current algorithm of finding graph heads is very inefficient and requires refactoring.
	* To reimplement `setHeads()`, `findHeadsExcessively()` and `thinOutHeads()` functions.
	* To reimplement all functions from `ClosedCycleProcessor.kt`.

The puzzle was created by @c71n93 on 17-Oct-23.

Estimate: 90 minutes, role: DEV.

If you have any technical questions, don't ask me, submit new tickets instead. The task will be "done" when the problem is fixed and the text of the puzzle is removed from the source code. Here is more about PDD and about me.

[0pdd]

@c71n93 please pay attention to this new issue.