Add comment in calc_depclean() about topological sort optimization that

minimizes issues with implicit deps.

svn path=/main/trunk/; revision=13846

diff --git a/pym/_emerge/actions.py b/pym/_emerge/actions.py
index 2d664ca809a58a834dba17d56aba73c36979cb49..f28f0dcaa2c4b4e4017cfafa1e958d1834050c5a 100644 (file)
--- a/pym/_emerge/actions.py
+++ b/pym/_emerge/actions.py
@@ -1142,7 +1142,8 @@ def calc_depclean(settings, trees, ldpath_mtimes,
                        cleanlist = [pkg.cpv for pkg in graph.order]
                else:
                        # Order nodes from lowest to highest overall reference count for
-                       # optimal root node selection.
+                       # optimal root node selection (this can help minimize issues
+                       # with unaccounted implicit dependencies).
                        node_refcounts = {}
                        for node in graph.order:
                                node_refcounts[node] = len(graph.parent_nodes(node))