dSHARP-CMU/konigsbergr: Find Paths Through Bridges On A Map
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.
Getting started
Browse package contents
Package details |
|
|---|---|
| Maintainer | |
| License | MIT + file LICENSE |
| Version | 0.0.0.9000 |
| URL | https://github.com/cmu-lib/konigsbergr |
| Package repository | View on GitHub |
| Installation |
Install the latest version of this package by entering the following in R:
|
