Fast lookup-table based computation of rectilinear Steiner minimal trees (RSMT).
This crate implements the 'FLUTE' algoritm and includes generating the lookup-tables as well as creating trees based on the lookup tables. Lookup-tables for up to 9 pins can be generated withing 16 seconds.
For higher pin count, a net-breaking heuristic is already implemented but yet inferior to the FLUTE 3.0 algorithm.
[ ] Implement net-breaking algorithms from FLUTE 3.0.