Tree: ec02b6e97a

master

Branches Tags

${ item.name }

Create tag ${ searchTerm }

Create branch ${ searchTerm }

from 'ec02b6e97a'

${ noResults }

Commit Graph

13 Commits (ec02b6e97a5afe7dc7c37357caaef4e45a90b70a)

Author	SHA1	Message	Date
Jirka Sejkora	c6676c6681	Allow loading the DB without loading the merge bounds. There are so many that it's a waste of memory and time to load those if they are not needed.	3 years ago
Jirka Sejkora	58c35762a2	Add subcity optimization	3 years ago
Jirka Sejkora	083d6a97b9	Add in-memory only databases	3 years ago
Jirka Sejkora	f694e4701a	Allow Cities of any sizes This will be useful for optimizing parts of the map independently.	3 years ago
Jirka Sejkora	ab772f0a31	Increase the top layout count for combination attempts	3 years ago
Jirka Sejkora	affb99472c	Cache lowest bounds for combining pairs	3 years ago
Jirka Sejkora	dacb278ef3	Add a cache; only try combining while merges lower price	3 years ago
Jirka Sejkora	148f59010e	Stop combining if finished, update layouts between x and y	3 years ago
Jirka Sejkora	2b08da0809	Combining forever; adding to DB	3 years ago
Jirka Sejkora	63ed9e7fe0	Horizontal cuts (through transpose)	3 years ago
Jirka Sejkora	dfedf7b3ae	Start combining from best pairs, stop at cheapest valid	3 years ago
Jirka Sejkora	751e0d81ff	Vertical combines	3 years ago
Jirka Sejkora	5b10766ab9	Combination early implementation (vertical line)	3 years ago