{"id":22825067,"url":"https://github.com/michaeljklein/hcy2c","last_synced_at":"2026-05-11T02:06:49.974Z","repository":{"id":155486924,"uuid":"47084521","full_name":"michaeljklein/HCy2C","owner":"michaeljklein","description":"A small library for finding/counting cycles in graphs and finding the maximally-cyclic orientation of a graph","archived":false,"fork":false,"pushed_at":"2015-12-10T06:08:21.000Z","size":196611,"stargazers_count":0,"open_issues_count":6,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-02-06T05:32:39.790Z","etag":null,"topics":["assembly","c","cycle","graph","haskell","orientation","parallel"],"latest_commit_sha":null,"homepage":null,"language":"HTML","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/michaeljklein.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}},"created_at":"2015-11-29T23:20:57.000Z","updated_at":"2017-11-20T21:56:50.000Z","dependencies_parsed_at":"2023-04-25T22:47:06.567Z","dependency_job_id":null,"html_url":"https://github.com/michaeljklein/HCy2C","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/michaeljklein%2FHCy2C","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/michaeljklein%2FHCy2C/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/michaeljklein%2FHCy2C/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/michaeljklein%2FHCy2C/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/michaeljklein","download_url":"https://codeload.github.com/michaeljklein/HCy2C/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246397269,"owners_count":20770525,"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":["assembly","c","cycle","graph","haskell","orientation","parallel"],"created_at":"2024-12-12T17:09:24.202Z","updated_at":"2026-05-11T02:06:49.941Z","avatar_url":"https://github.com/michaeljklein.png","language":"HTML","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Hcy2C: A library for counting, finding, and maximizing the number of cycles in graphs\n\n[Project Haddock Documentation](http://michaeljklein.github.io/HCy2C/)\n\n\nThe primary goal of this project is to find an orientation of a given graph with the maximum possible number of cycles.\n-See [this](https://en.wikipedia.org/wiki/Orientation_(graph_theory)) Wikipedia article for some basics\n\nThe project is implemented in Haskell and C, with the main features tested on OSX (Macbook Pro, Late 2011) and the automatically generated C code tested on the Raspberry Pi 1, Model B (though there have been some tweaks since then, so it might take a little fiddling to get up and running).\n\nSee [TODO](https://github.com/michaeljklein/HCy2C/blob/master/TODO) for implemented and planned features.\n\nThe program flow goes: graph -\u003e path finding, input graph specific C code -\u003e compiled/optimized -\u003e imported by Haskell -\u003e pre-processed -\u003e desired number of portable, independent, and parallel pieces in C code -\u003e run in parallel or sequentially -\u003e results reaped and consolidated (unimplemented/buggy) -\u003e results output as orientations\n\nBesides batch processing of a list of graphs, most everything needed has been implemented. Look [here](http://michaeljklein.github.io/HCy2C/Main.html) for cursory test documentation.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmichaeljklein%2Fhcy2c","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmichaeljklein%2Fhcy2c","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmichaeljklein%2Fhcy2c/lists"}