[SERVER-52569] libdeps graph command line tool: optimizing node mergers Created: 02/Nov/20 Updated: 17/Oct/23 Resolved: 17/Oct/23 |
|
| Status: | Closed |
| Project: | Core Server |
| Component/s: | None |
| Affects Version/s: | None |
| Fix Version/s: | None |
| Type: | New Feature | Priority: | Major - P3 |
| Reporter: | Daniel Moody | Assignee: | [DO NOT ASSIGN] Backlog - Server Development Platform Team (SDP) (Inactive) |
| Resolution: | Won't Do | Votes: | 0 |
| Labels: | None | ||
| Remaining Estimate: | Not Specified | ||
| Time Spent: | Not Specified | ||
| Original Estimate: | Not Specified | ||
| Issue Links: |
|
||||||||
| Assigned Teams: |
Server Development Platform
|
||||||||
| Participants: | |||||||||
| Description |
|
The libdeps graph command line tool should be able to give a list of all nodes which have indegree of 1 and are possible candidates of merging with the depender to reduce the number of nodes in the graph.
There is vagueness around what other constraints (besides indegree of 1) need to be fulfilled before a merge of two nodes can be done. This ticket should be updated to reflect those other constraints once the vagueness is resolved. |