Andrew Ekstedt ad6279089f day 10 optimizations
- reduce duplicate queue entries by not appending to the queue if a
  point has a nonzero count. (if there's a count then it must have
  already been queued.)

- use the correct data structure for a double-ended queue so pop(0) has
  less work to do

- factor out the list of summits

of these three changes, only the last one has any noticable effect
on the run time. 🤷
2024-12-10 05:49:48 +00:00
2024-12-02 03:56:40 +00:00
2024-12-02 05:23:17 +00:00
2024-12-03 06:09:30 +00:00
2024-12-04 07:27:10 +00:00
2024-12-05 08:11:46 +00:00
2024-12-06 05:51:15 +00:00
2024-12-07 21:02:18 +00:00
2024-12-08 05:20:33 +00:00
2024-12-09 17:46:27 +00:00
2024-12-10 05:49:48 +00:00
2024-12-04 07:29:50 +00:00
2024-12-04 07:29:11 +00:00
2024-12-02 01:22:03 +00:00
2024-12-02 01:22:03 +00:00
2024-12-02 01:22:03 +00:00
Description
No description provided
227 KiB
Languages
Python 66.9%
C 21.5%
Tcl 5.8%
Shell 5.6%
Makefile 0.2%