{"package": "graph-state-machine", "summary": "A simple library to build easily interpretable computational constructs similar to a Turing machine over a graph, where states are combinations of a graph's (typed) nodes; an example use would be a t\u2026", "pypi_url": "https://pypi.org/project/graph-state-machine", "piwheels_url": "https://www.piwheels.org/project/graph-state-machine", "releases": {"3.2": {"released": "2023-12-02 00:44:19", "prerelease": false, "yanked": false, "skip_reason": "repeated failure", "files": {}}, "2.1": {"released": "2022-05-01 16:13:58", "prerelease": false, "yanked": false, "skip_reason": "repeated failure", "files": {}}, "2.0.1": {"released": "2021-09-23 13:03:51", "prerelease": false, "yanked": false, "skip_reason": "repeated failure", "files": {}}, "1.0": {"released": "2021-07-28 18:28:01", "prerelease": false, "yanked": false, "skip_reason": "repeated failure", "files": {}}, "0.4.1": {"released": "2021-02-08 18:06:40", "prerelease": false, "yanked": false, "skip_reason": "", "files": {"Graph_State_Machine-0.4.1-py3-none-any.whl": {"file_url": "https://archive1.piwheels.org/simple/graph-state-machine/Graph_State_Machine-0.4.1-py3-none-any.whl", "filehash": "032444f9d2f5ece237cc5fd1ad4a097f14d8a30fb7e745723922d1e5eb1c7cf7", "filesize": 18268, "builder_abi": "cp35m", "file_abi_tag": "none", "platform": "any", "requires_python": null, "apt_dependencies": [], "pip_dependencies": []}}}}}