On 14/01/2017 00:40, Mandy Chung wrote:
:
What about this:

* The key for each entry in the returned map is a module M that has
* no outgoing edges to any of the candidate modules to be hashed
* i.e. M is a leaf node in a connected subgraph containing M and
* other candidate modules from the module graph filtering
* the outgoing edges from M to non-candidate modules.


This works for me, the updated changes looks good.

-Alan

Reply via email to