diff options
| author | Marten Kenbeek <marten.knbk@gmail.com> | 2015-02-20 05:43:45 +0100 |
|---|---|---|
| committer | Markus Holtermann <info@markusholtermann.eu> | 2015-02-23 12:38:53 +0100 |
| commit | 78d43a5e1064b63db1c486516c4263ef1c4c975c (patch) | |
| tree | e0a798cf166e9daa9fd664b4369252ac7e0cbc95 /tests/admin_scripts | |
| parent | 7fa7dd48c4c785fd34161c6418de5accb1618422 (diff) | |
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.
Diffstat (limited to 'tests/admin_scripts')
0 files changed, 0 insertions, 0 deletions