Hamiltonian Path

A Hamiltonian path is a path in an undirected or directed graph that visits each vertex exactly once. In this grasshopper example file you can use the GraphTheory Simulations from the LEAFVEIN Plug-in to create a Hamiltonian Path with Platonic Solids.

Download this definition 
https://parametrichouse.com/hamiltonian-path