Titlebook: Sequential and Parallel Algorithms and Data Structures; The Basic Toolbox Peter Sanders,Kurt Mehlhorn,Roman Dementiev Textbook 2019 Springe

愚笨

Shortest Paths,nd want to move to a location t, you ask for the quickest path from s to t. The fire department may want to compute the quickest routes from a fire station s to all locations in town – the singlesource all-destinations problem. Sometimes we may even want a complete distance table from everywhere to

轨道

Perennial长期的