{"id":28755511,"url":"https://github.com/marcelm/tgp","last_synced_at":"2025-06-17T02:05:36.586Z","repository":{"id":297764369,"uuid":"997835222","full_name":"marcelm/tgp","owner":"marcelm","description":"Transitive graph projection – greedy heuristic","archived":false,"fork":false,"pushed_at":"2025-06-07T09:38:42.000Z","size":0,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-06-07T10:26:59.878Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Python","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/marcelm.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":"2025-06-07T09:36:39.000Z","updated_at":"2025-06-07T09:38:47.000Z","dependencies_parsed_at":"2025-06-07T10:37:30.221Z","dependency_job_id":null,"html_url":"https://github.com/marcelm/tgp","commit_stats":null,"previous_names":["marcelm/tgp"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/marcelm/tgp","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/marcelm%2Ftgp","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/marcelm%2Ftgp/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/marcelm%2Ftgp/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/marcelm%2Ftgp/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/marcelm","download_url":"https://codeload.github.com/marcelm/tgp/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/marcelm%2Ftgp/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":260275173,"owners_count":22984650,"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":[],"created_at":"2025-06-17T02:05:35.872Z","updated_at":"2025-06-17T02:05:36.569Z","avatar_url":"https://github.com/marcelm.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Transitive graph projection - greedy heuristic\n\nA greedy algorithm for solving the transitive graph projection problem.\n\nThis is old code written for my diploma thesis in 2007.\n\nThe algorithm has also been published in a paper:\n\nExact and Heuristic Algorithms for Weighted Cluster Editing.\nSven Rahmann, Tobias Wittkop, Jan Baumbach, Marcel Martin, Anke Truß, Sebastian Böcker\nhttps://www.lifesciencessociety.org/CSB2007/toc/391.2007.html\n\nThe original code was written in Python 2.\nIt can be run using Conda:\n\n    conda create -n tgp python==2.7\n    conda activate tgp\n    easy_install networkx==0.99\n    python rewedge.py data/*.cm\n\nRun the tests:\n\n    easy_install pytest==3.0.0\n    pytest\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmarcelm%2Ftgp","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmarcelm%2Ftgp","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmarcelm%2Ftgp/lists"}