The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
Computes the maximum matching for unweighted graph and maximum matching for (un)weighted bipartite graph efficiently.
| Version: | 0.1.0 |
| Imports: | igraph |
| Published: | 2017-01-15 |
| Author: | Bowen Deng |
| Maintainer: | Bowen Deng <baolidakai at gmail.com> |
| License: | CC0 |
| NeedsCompilation: | no |
| CRAN checks: | maxmatching results |
| Reference manual: | maxmatching.pdf |
| Package source: | maxmatching_0.1.0.tar.gz |
| Windows binaries: | r-devel: maxmatching_0.1.0.zip, r-release: maxmatching_0.1.0.zip, r-oldrel: maxmatching_0.1.0.zip |
| macOS binaries: | r-release (arm64): maxmatching_0.1.0.tgz, r-oldrel (arm64): maxmatching_0.1.0.tgz, r-release (x86_64): maxmatching_0.1.0.tgz, r-oldrel (x86_64): maxmatching_0.1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=maxmatching to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.