#24366: Improve migration dependency graph speed
-------------------------------------+-------------------------------------
Reporter: MarkusH | Owner: knbk
Type: | Status: closed
Cleanup/optimization |
Component: Migrations | Version: master
Severity: Normal | Resolution: fixed
Keywords: | Triage Stage: Ready for
| checkin
Has patch: 1 | Needs documentation: 0
Needs tests: 0 | Patch needs improvement: 0
Easy pickings: 0 | UI/UX: 0
-------------------------------------+-------------------------------------
Comment (by Markus Holtermann <info@…>):
In [changeset:"980dfca7174a3e00a214ad554bb9199529139796"]:
{{{
#!CommitTicketReference repository=""
revision="980dfca7174a3e00a214ad554bb9199529139796"
[1.8.x] Fixed #24366 -- Optimized traversal of large migration dependency
graphs.
Switched from an adjancency list and uncached, iterative depth-first
search to a Node-based design with direct parent/child links and a
cached, recursive depth-first search. With this change, calculating
a migration plan for a large graph takes several seconds instead of
several hours.
Marked test `migrations.test_graph.GraphTests.test_dfs` as an expected
failure due to reaching the maximum recursion depth.
Backport of 78d43a5e1064b63db1c486516c4263ef1c4c975c from master
}}}
--
Ticket URL: <https://code.djangoproject.com/ticket/24366#comment:13>
Django <https://code.djangoproject.com/>
The Web framework for perfectionists with deadlines.
--
You received this message because you are subscribed to the Google Groups
"Django updates" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
To view this discussion on the web visit
https://groups.google.com/d/msgid/django-updates/065.889b4dd944ade4b5563fde138f48609d%40djangoproject.com.
For more options, visit https://groups.google.com/d/optout.
