transport
Computation of Optimal Transport Plans and Wasserstein Distances
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.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.15-4 |
2026-04-09 windows/windows R-4.5 | transport_0.15-4.zip |
1.0 MiB |