Glossary: Algorithms Beyond the Basics in Go
Stale entry
Also written: stale entries
An old heap entry with a slower time than `dist` now holds. Dijkstra's algorithm skips it when popped.
Glossary: Algorithms Beyond the Basics in Go
Also written: stale entries
An old heap entry with a slower time than `dist` now holds. Dijkstra's algorithm skips it when popped.