Reduce library graph complexity

XMLWordPrintableJSON

    • Type: Task
    • Resolution: Won't Fix
    • Priority: Major - P3
    • None
    • Affects Version/s: None
    • Component/s: Build
    • None
    • Fully Compatible
    • None
    • 3
    • None
    • None
    • None
    • None
    • None
    • None
    • None

      Once we have made the library graph acyclic in SERVER-23103, we can use the Dagger tool to find graph reductions via splitting and combining nodes. Ideally, we would reduce the number of non-third party libraries by an order of magnitude.

            Assignee:
            DO NOT USE - Backlog - Platform Team
            Reporter:
            Andrew Morrow (Inactive)
            Votes:
            0 Vote for this issue
            Watchers:
            2 Start watching this issue

              Created:
              Updated:
              Resolved: