Wolfram Demonstrations Project

12,000+ Open Interactive Demonstrations
Powered by Notebook Technology »

Hamiltonian Path on a Polyhedral Net

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

Find the shortest path from the orange point to the light blue point along the thick black edges of the net of a polyhedron. You can jump from one point on the net to another that belongs to the same vertex of the polyhedron. If a shortest path exists, it is a Hamiltonian path.

Contributed by: Izidor Hafner (August 2022)
Open content licensed under CC BY-NC-SA

Snapshots

Details

Embed Code

Take advantage of the Wolfram Notebook Emebedder for the recommended user experience.

Related Demonstrations More by Author
Browse all topics
Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send