| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Add a utility for iterating over all topological orders (#6801) | Thomas Lively | 2024-08-05 | 1 | -2/+2 |
| | | | | | | | | | | Use an extension of Kahn's algorithm for finding topological orders that iteratively makes every possible choice at every step to find all the topological orders. The order being constructed and the set of possible choices are managed in-place in the same buffer, so the algorithm takes linear time and space plus amortized constant time per generated order. This will be used in an upcoming type optimization. | ||||
| * | Add a Tarjan's Strongly Connected Component utilty (#6790) | Thomas Lively | 2024-07-30 | 1 | -0/+262 |
| Implement a non-recursive version of Tarjan's Strongly Connected Component algorithm that consumes and produces iterators for maximum flexibility. This will be used in an optimization that transforms the heap type graph to use minimal recursion groups, which correspond to the strongly connected components of the type graph. | |||||
 |
index : forks/binaryen.git | |
| summaryrefslogtreecommitdiff |