The puzzle 119-e522f2bb from #119 has to be resolved:
|
@todo #119:30min `indirectly-related-pairs` are pairs of methods, which are connected through `directly-related-pairs`. |
|
See section 3.1 of https://pdfs.semanticscholar.org/672e/de6e3e600eafd84036a0b983b88e481ac626.pdf |
|
The key sentence is "The indirect connection relation is the **transitive closure** of direct connection relation". |
|
See https://en.wikipedia.org/wiki/Transitive_closure for more info on what is a Transitive Closure. |
|
We need to apply a Transitive Closure Algorithm on a graph of `directly-related-pairs`. |
|
A simplest Transitive Closure algorithms has O(V³) time complexity and involves a mutable V×V table (V is amount of vertices). |
|
See https://www.geeksforgeeks.org/transitive-closure-of-a-graph/ for an example. |
The puzzle was created by Yegor Bugayenko on 07-Sep-25.
Estimate: 30 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.
