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.
|License||MIT + file LICENSE|
|Package repository||View on GitHub|
Install the latest version of this package by entering the following in R:
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.