Patent ID: 9411706
Filing Date: 2016-08-09
CPC Classification: G06F,G06T,H04L

Claim Text:
1. A computer-implemented method comprising: receiving data representing an aggregated dependency graph, the aggregated dependency graph having nodes representing selected software elements in a project and having links, the links connecting nodes in the aggregated dependency graph, the links representing respective aggregated dependencies between one or more of the selected software elements in the project, wherein each aggregated dependency between a pair of nodes represents that a first software element represented by a first node of the pair, or a descendant of the first software element in a hierarchy graph of software elements in the project, depends, according to a raw dependency graph of software elements in the project, on a second software element represented by a second node of the pair or a descendant of the second software element in the hierarchy graph of software elements in the project; computing a respective weight of each link of the aggregated dependency graph, wherein each respective weight of each link between each pair of nodes is based on a count of raw dependencies that exist in the raw dependency graph from a first software element represented by a first node of the pair or any descendant of the first software element in the hierarchy graph to a second software element represented by a second node of the pair or any descendant of the second software element in the hierarchy graph; determining that a cycle exists in the aggregated dependency graph; determining which of the links in the cycle has a lowest weight; adding a first link in the cycle having the lowest weight to a set of candidate removable links; classifying links in the set of candidate removable links as removable links; and providing a user interface presentation that presents the aggregated dependency graph and which visually distinguishes removable links from other links in the aggregated dependency graph.