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.
An eulerian path is a path in a graph which visits every edge exactly once. This package provides methods to handle eulerian paths or cycles.
| Version: | 1.0 |
| Depends: | R (≥ 2.15.0), methods |
| Imports: | graph |
| Published: | 2014-02-21 |
| DOI: | 10.32614/CRAN.package.eulerian |
| Author: | Ashis Saha, with contribution from Jaewoo Kang |
| Maintainer: | Ashis Saha <alorchhota at gmail.com> |
| License: | GPL-2 |
| NeedsCompilation: | no |
| CRAN checks: | eulerian results |
| Reference manual: | eulerian.pdf |
| Package source: | eulerian_1.0.tar.gz |
| Windows binaries: | r-devel: eulerian_1.0.zip, r-release: eulerian_1.0.zip, r-oldrel: eulerian_1.0.zip |
| macOS binaries: | r-release (arm64): eulerian_1.0.tgz, r-oldrel (arm64): eulerian_1.0.tgz, r-release (x86_64): eulerian_1.0.tgz, r-oldrel (x86_64): eulerian_1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=eulerian 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.