Sort k-partite graphs with node order, layer order, and node grouping optimized with a heuristic to (nearly) minimize edge crossings. Useful for improving visualizations with alluvial plots by "untangling" the graphs.
Sort k-partite graphs with node order, layer order, and node grouping optimized with a heuristic to (nearly) minimize edge crossings. Useful for improving visualizations with alluvial plots by "untangling" the graphs.
wompwomp solves the Weighted (permutation) Optimization of Multiple Partitions-Weighted (label) Optimization of Multiple Partitions (WPOMP--WLOMP) problem.


install.packages("wompwomp")
if (!require("remotes", quietly = TRUE))
install.packages("remotes")
remotes::install_github("pachterlab/wompwomp")
See the vignettes for wompwomp in the "vignettes" folder.
The I/O for each of wompwomp's functions is as follows:
The input table can have one of two formats:
Read our preprint on arXiv here. Note that some functionalities and names have been changed since the preprint. To download the version of wompwomp reflected in the preprint, please see the "arxiv_v1" branch of this repository. Reproduce figures from our preprint at https://github.com/pachterlab/ROP_2025.