www.discocube.org's repositories
weaver
Algorithm for solving the Hamiltonian cycle problem deterministically and in linear time on all instances of discocube graphs (tested for graphs with over 8 billion vertices). Discocube graphs are 3-dimensional grid graphs derived from: a polycube of an octahedron | a Hauy construction of an octahedron with cubes as identical building blocks...
dc-web-components
defining web components for the discocube website
easy_dc
A deterministic algorithm to find Hamiltonian cycles in discocube graphs in linear time.
fullstack-web-components
Companion repository to the Fullstack Web Components Book published by Newline.
plot_solution
A Python module using pandas, numpy and plotly to create a 3d line plot from the .csv file output of the weaver algorithm.
walk_the_loop
A simple game to learn about hamiltonian cycles, by doing. Find hamiltonian paths in 5 platonic graphs and a 6th derived from a polycube of an octahedron.
weave_python
Module for solving and plotting the Hamiltonian cycle problem deterministically and in linear time on all instances of discocube graphs
webcomponent-book
Support files and demo code for Web Component book