diff options
| author | Thomas Lively <tlively@google.com> | 2024-08-29 15:07:35 -0700 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2024-08-29 15:07:35 -0700 |
| commit | b63aeadb09a4450f55041dfb3fb7260807e91dfc (patch) | |
| tree | 9fc437ddf4dfe13bcecff5785bacdd3cc764f568 /test/gtest/json.cpp | |
| parent | aa7569809f37ae3fea83385b0acb2513b4a2f6ce (diff) | |
| download | binaryen-b63aeadb09a4450f55041dfb3fb7260807e91dfc.tar.gz binaryen-b63aeadb09a4450f55041dfb3fb7260807e91dfc.tar.bz2 binaryen-b63aeadb09a4450f55041dfb3fb7260807e91dfc.zip | |
Add a utility for finding minimal topological sorts (#6884)
Reuse the code implementing Kahn's topological sort algorithm with a new
configuration that uses a min-heap to always choose the best available
element.
Also add wrapper utilities that can find topological sorts of graphs
with arbitrary element types, not just indices.
Diffstat (limited to 'test/gtest/json.cpp')
0 files changed, 0 insertions, 0 deletions