{"id":22914596,"url":"https://github.com/egri-nagy/orbit","last_synced_at":"2025-07-11T15:17:13.533Z","repository":{"id":62433919,"uuid":"93218004","full_name":"egri-nagy/orbit","owner":"egri-nagy","description":"Generic orbit and graph search algorithms in Clojure.","archived":false,"fork":false,"pushed_at":"2025-06-03T09:13:50.000Z","size":65,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-06-03T19:17:45.007Z","etag":null,"topics":["clojure","computer-algebra","orbit","search-algorithm"],"latest_commit_sha":null,"homepage":"","language":"Clojure","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/egri-nagy.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2017-06-03T02:24:55.000Z","updated_at":"2025-06-03T09:13:51.000Z","dependencies_parsed_at":"2025-05-13T06:30:34.619Z","dependency_job_id":null,"html_url":"https://github.com/egri-nagy/orbit","commit_stats":{"total_commits":75,"total_committers":1,"mean_commits":75.0,"dds":0.0,"last_synced_commit":"9af59b298098a6642c8dcee017e44909ca648e00"},"previous_names":[],"tags_count":10,"template":false,"template_full_name":null,"purl":"pkg:github/egri-nagy/orbit","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/egri-nagy%2Forbit","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/egri-nagy%2Forbit/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/egri-nagy%2Forbit/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/egri-nagy%2Forbit/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/egri-nagy","download_url":"https://codeload.github.com/egri-nagy/orbit/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/egri-nagy%2Forbit/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":263894515,"owners_count":23526488,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["clojure","computer-algebra","orbit","search-algorithm"],"created_at":"2024-12-14T05:15:49.858Z","updated_at":"2025-07-11T15:17:13.286Z","avatar_url":"https://github.com/egri-nagy.png","language":"Clojure","funding_links":[],"categories":[],"sub_categories":[],"readme":"[![Clojars Project](https://img.shields.io/clojars/v/orbit.svg)](https://clojars.org/orbit)\n[![Build Status](https://travis-ci.org/egri-nagy/orbit.svg?branch=master)](https://travis-ci.org/egri-nagy/orbit)\n[![cljdoc badge](https://cljdoc.org/badge/orbit/orbit)](https://cljdoc.org/d/orbit/orbit/CURRENT)\n\n# orbit\nThe library came out from the observation that most problems in computational abstract algebra require a search algorithm. Instead of writing them again and again, it is natural to abstract the search part out. It is used by [KIGEN](https://github.com/egri-nagy/kigen).\n\nThis library contains generic search algorithms. A set-valued operator and predicates for recognizing possible and actual solutions need to be given.\n\nThe abstraction overhead is counterbalanced by parallel execution (using the reducers library).\n\n## Orbit computation example\nFor computing al subsets of a set, we define the following set-valued function.\n\n```clj\n(defn subset-covers\n  \"All covering (missing a single element only) subsets of a collection.\n  The collection is assumed to be a set.\"\n  [coll]\n  (map (fn [x]\n         (remove (partial = x) coll))\n       coll))\n```\nThen we can call a full-orbit function by giving the seeds (a 4-element set in this case) to calculate all subsets.\n```clj\n(orbit.core/full-orbit [(range 4)] subset-covers)\n#{(0 1 3) (2 3) (0 2 3) (0 1 2) () (3) (1 3) (0) (0 3) (1 2 3) (0 2) (2) (1 2) (1) (0 1 2 3) (0 1)}\n```\n\n[Attila Egri-Nagy](http://www.egri-nagy.hu)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fegri-nagy%2Forbit","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fegri-nagy%2Forbit","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fegri-nagy%2Forbit/lists"}