A Solution
Abstract an Algorithm
Pseudo-Code
Sample Code in Python
Code in Python
.. to produce valid paths
.. import above and draw the paths
.. a screenshot of the turtle walk
6 Nodes. Node1 is the Start Node, and Node 6 is the End Node.
You must get from Start to End.
You must visit each node, but only ONCE.
Is there a Path that can do this? If so, describe it.
Is there more than one way to cross the network?
The sandbox below can be used to run the sample Python code or to play around with your own ideas.
Be careful of certain limitations of online IDEs compared to those downloaded to your devices.