steiner-tree
| Crates.io | steiner-tree |
| lib.rs | steiner-tree |
| version | 0.0.5 |
| created_at | 2022-05-04 10:19:02.936691+00 |
| updated_at | 2024-06-04 17:47:33.207707+00 |
| description | Fast construction of rectilinear steiner minimal trees (RSMT) in two dimensions. |
| homepage | |
| repository | https://codeberg.org/libreda/steiner-tree |
| max_upload_size | |
| id | 580318 |
| size | 242,071 |
tok (fsitok)
documentation
README
steiner-tree
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.
Benchmarks
A simple benchmarking infrastructure can be used with cargo bench.
TODOs
[ ] Implement net-breaking algorithms from FLUTE 3.0. [ ] Read/write lookup-tables. Generating lookup-tables of degree larger than 8 is too slow to do on the fly.