[package] name = "unshuffle_lib" version = "0.1.1" authors = ["Dash Peters "] edition = "2018" license = "MIT" description = "Utility to find the minimum number of moves to unshuffle a list of sortable items" readme = "README.md" keywords = ["shuffle", "ordering"] categories = ["algorithms"] repository = "https://github.com/calacademy-research/unshuffle" homepage = "https://github.com/calacademy-research/unshuffle" [lib] name = "unshuffle" [dependencies] ordered-float = "2.0.0" priority-queue = "1.0.0" indicatif = "0.15.0" structopt = "0.3.16" itertools = "0.9.0"