commit | 6019ae421b73a402d13bf8680f21eae846a91622 | [log] [tgz] |
---|---|---|
author | Mickael Istria <mistria@redhat.com> | Tue Sep 25 15:45:07 2018 +0200 |
committer | Mickael Istria <mistria@redhat.com> | Tue Sep 25 15:50:50 2018 +0200 |
tree | 91b626e6bbcdf734ba6d686b330fb449e6dd0984 | |
parent | cbe96605db041b75acf0330a70409597ac055d44 [diff] |
Bug 538752 - Improve buildFilteredDigraph algorithm Use a deep traverse of the graph with dynamic recursivity. This leads to much better results in worst case. Change-Id: If127067c00bd5ad0fad0b68319eb91dc166be5ca Signed-off-by: Mickael Istria <mistria@redhat.com>