discocube Goto Github PK

followers: 7.0 following: 7.0 repos: 9.0 gists: 0.0

Name: www.discocube.org

Type: User

Bio: Deterritorializing objects into new ones.

www.discocube.org's Projects

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_old

An algorithm for solving the Hamiltonian cycle problem deterministically and in linear time on all instances of discocube graphs (tested for over graphs with 1 billion vertices).

weave_python

Module for solving and plotting the Hamiltonian cycle problem deterministically and in linear time on all instances of discocube graphs

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...