Solve optimal transport problems. Compute Wasserstein distances (a.k.a. Kantorovitch, Fortet--Mourier, Mallows, Earth Mover's, or minimal L_p distances), return the corresponding transference plans, and display them graphically. Objects that can be compared include grey-scale images, (weighted) point patterns, and mass vectors.
https://anaconda.org/r_test/r-transport/badges/version.svg
https://anaconda.org/r_test/r-transport/badges/latest_release_date.svg
https://anaconda.org/r_test/r-transport/badges/latest_release_relative_date.svg
https://anaconda.org/r_test/r-transport/badges/platforms.svg
https://anaconda.org/r_test/r-transport/badges/license.svg
https://anaconda.org/r_test/r-transport/badges/downloads.svg