Graph traversal demo using "parameter-space-style" combinatoric programming: https://github.com/spitz-dan-l/param-space/blob/master/graph_traversal.py …
-
Goal is to explore alternative/strange styles of programming/problem solving to tickle the mind
envisions algorithm for computing graph reachability as a map from "vertex-pairs-cross-number-of-compute-steps" to true/false
-
-
Solution is completely invulnerable to cycles, and doesn't even mention/implement cycle detection (though it could)
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.