Non-literal applications of "Shortest Path" algorithm? It's obvious that it's used in stuff like Google Maps, but what are some more metaphorical applications where you're minimizing the path between nodes (which can represent anything)

Th line-breaking algorithm in TeX works by considering a graph with each potential line break in a paragraph as a node and an edge between two nodes if there's an appropriate amount of text (and glue, etc.) between them to fill a line, weighted by an aesthetic "demerit" score for the potential line.
For each paragraph TeX will then compute the path from an implicit break point at the beginning to a break point at the end of the paragraph that incurs a minimal total amount of "demerits".
