Still playing with the Knuth-Plass algorithm visualization.
The algorithm finds the “shortest path” through a graph of potential line breaks. Shortest here doesn’t actually mean the fewest lines, it means the path with the least “demerits”.
Will talk more about this in the next visual article!
add a skeleton here at some point
26 days ago