planar-face-discovery
Given a planar, undirected, graph enumerate all of the faces of the graph. Can also be described as finding all of the polygons within the graph, or the minimum cycle basis
Given a planar, undirected, graph enumerate all of the faces of the graph. Can also be described as finding all of the polygons within the graph, or the minimum cycle basis
A function to decompose a permutation into disjoint cycles.
Scripts cyclic runner with interval
Create an animated loop of a list of text for your headings
Create an animated loop of a list of text for your headings
Create an animated loop of a list of text for your headings
Create an animated loop of a list of text for your headings
Graph data structure.
Highly optimized exact solutions to the traveling salesman problem using the Held–Karp algorithm
A wrapper for the Instant System API used by many local transport companies.
A random name generator for all kinds of things
Organize gulp tasks as task cycles. And these cycles should run in parallel. Can also build so-called high order tasks, upon multiple task cycles.
Async versions of various highly composable transducers, reducers and iterators
life cycle hooks for pure DOM elements
merge operator for tempest
never operator for tempest
periodic factory for tempest
proxy operator for tempest
remember operator for tempest
replaceError operator for tempest