From 014880411ad740298529d00f4116add39037b7f9 Mon Sep 17 00:00:00 2001
From: rexim <reximkut@gmail.com>
Date: Mon, 19 Feb 2018 17:36:00 +0700
Subject: [PATCH] (#119) Clarify what is needed for `indirectly-related-pairs`

---
 src/main/resources/org/jpeek/metrics/LCC.xsl | 11 +++++++----
 1 file changed, 7 insertions(+), 4 deletions(-)

diff --git a/src/main/resources/org/jpeek/metrics/LCC.xsl b/src/main/resources/org/jpeek/metrics/LCC.xsl
index 43a65456..785980f4 100644
--- a/src/main/resources/org/jpeek/metrics/LCC.xsl
+++ b/src/main/resources/org/jpeek/metrics/LCC.xsl
@@ -58,10 +58,13 @@ SOFTWARE.
       </xsl:for-each>
     </xsl:variable>
     <!--
-    @todo #9:30min `indirectly-related-pairs` are pairs of methods, which are through other directly connected methods.
-     https://pdfs.semanticscholar.org/672e/de6e3e600eafd84036a0b983b88e481ac626.pdf
-     Right now it is stubbed because information about method-method communication is yet to be provided in skeleton.xml
-     (issue #106).
+    @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 simpliest 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.
     -->
     <!--<xsl:variable name="indirectly-related-pairs">
     </xsl:variable>