konigsbergr-package: Find Paths Through Bridges On A Map
In dSHARP-CMU/konigsbergr: Find Paths Through Bridges On A Map
Description
Author(s)
See Also
Description
A playful attempt to recreate Euler's "Bridges of
Königsberg" problem, finding a path that crosses all the bridges in a
city while trying to cross each bridge only once.
Author(s)
Maintainer: Matthew Lincoln mlincoln@andrew.cmu.edu (0000-0002-4387-3384)
See Also
Useful links:
dSHARP-CMU/konigsbergr documentation built on Sept. 11, 2019, 3:55 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Author(s) See Also
Description
A playful attempt to recreate Euler's "Bridges of Königsberg" problem, finding a path that crosses all the bridges in a city while trying to cross each bridge only once.
Author(s)
Maintainer: Matthew Lincoln mlincoln@andrew.cmu.edu (0000-0002-4387-3384)
See Also
Useful links:
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.