Table of Contents Shortest path algorithms .... in general .. for circuit design Bucket queues Shortest path algorithms by HadlockGrid graphs Strings Spouge’s computational volumes This note summarizes some papers I was reading while investigating the history of A* for pairwise alignment, and related to that the first usage of a bucket queue. Schrijver (2012) provides a nice overview of general shortest path methods.
