On Sun, Jun 02, 2002 at 09:09:57AM -0400, Fran?ois Pinard wrote: >years ago. If I remember well, Knuth's algorithm plays by moving line >cuts and optimising a global function through dynamic programming, giving >more points, say, when punctuation coincides with end of lines, ... If that's the same algorithm that's used by TeX, see http://www.amk.ca/python/code/tex_wrap.html . --amk
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4