Given a weighted directed graph G organized into n+2 columns numbered from to n+1, with columns and n+1 each consisting of a single node, columns 1...n each consisting of the same number m of nodes (for example, m=26), and with column c fully connected to column c+1 for each c=0..n, find the path of least weight from the source node in column to the sink node in column n+1.