Changeset 599dafa in Primary

Timestamp:
Nov 21, 2019 1:00:48 AM (4 years ago)
Author:
Jonathan Neufeld <support@…>
Branches:
bugfix/twilight-forest-freezes, feature/aac-radio-playback, feature/entity-update-scheduling, improved-boat, master
Children:
a5073e7
Parents:
27558dd
git-author:
Jonathan Neufeld <support@…> (11/20/19 22:02:44)
git-committer:
Jonathan Neufeld <support@…> (11/21/19 01:00:48)
Message:

Refactor collapsible trees algorithm, instead of breadth-first search use depth-first search with greatly increased search limits including an additional search limit dimension for the total search size. By limiting according to search size we do not unreasonably limit searching very large (but very thin) trees while still imposing a deadlock cap. Hanging-fruit spread algorithm still uses breadth-first search with low search limits as these are low-priority items.

(No files)

Note: See TracChangeset for help on using the changeset viewer.