{"id":51054083,"url":"https://github.com/gdiasag/graph-repr","last_synced_at":"2026-06-22T19:32:43.271Z","repository":{"id":191313094,"uuid":"681378375","full_name":"gdiasag/graph-repr","owner":"gdiasag","description":"Algorithms and Data Structures related to the representation and manipulation of graphs","archived":false,"fork":false,"pushed_at":"2023-11-06T02:24:12.000Z","size":101,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2026-02-24T08:52:49.446Z","etag":null,"topics":["data-structures","graph-algorithms","graph-theory"],"latest_commit_sha":null,"homepage":"","language":"C","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/gdiasag.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}},"created_at":"2023-08-21T22:19:18.000Z","updated_at":"2023-08-29T02:27:02.000Z","dependencies_parsed_at":null,"dependency_job_id":"5e8939b8-8537-4fcd-a9f2-c8b4b6742085","html_url":"https://github.com/gdiasag/graph-repr","commit_stats":null,"previous_names":["gustavodiasag/graph-repr","gdiasag/graph-repr"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/gdiasag/graph-repr","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gdiasag%2Fgraph-repr","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gdiasag%2Fgraph-repr/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gdiasag%2Fgraph-repr/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gdiasag%2Fgraph-repr/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/gdiasag","download_url":"https://codeload.github.com/gdiasag/graph-repr/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gdiasag%2Fgraph-repr/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34663524,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-22T02:00:06.391Z","response_time":106,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["data-structures","graph-algorithms","graph-theory"],"created_at":"2026-06-22T19:32:39.349Z","updated_at":"2026-06-22T19:32:43.248Z","avatar_url":"https://github.com/gdiasag.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# graph-repr\n\n[![CMake on multiple platforms](https://github.com/gustavodiasag/graph-repr/actions/workflows/cmake-multi-platform.yml/badge.svg)](https://github.com/gustavodiasag/graph-repr/actions/workflows/cmake-multi-platform.yml)\n\nThis initial version of the project is composed of one representation for directed graphs and the chu-liu-edmonds algorithm for finding the minimum spanning tree of a given digraph.\n\nThe chosen representation is an adaptation derived from a somewhat generic graph implementation provided by Kyle Loudon on his book [Mastering Algorithms in C](https://everythingcomputerscience.com/books/Mastering-Algorithms-with-C-Loudon.pdf), which defines an adjacency list  where each of its elements is structured as an origin vertex and a set of the vertices that the origin contains an edge to.\n\nThe algorithm for finding a directed MST is derived from Jack Edmonds' paper [Optimum Branchings](https://nvlpubs.nist.gov/nistpubs/jres/71B/jresv71Bn4p233_A1b.pdf), along with a list of other sources, such as:\n\n- [Edmonds' algorithm](https://en.wikipedia.org/wiki/Edmonds%27_algorithm).\n\n* [Graph-based Dependency Parsing](https://courses.cs.washington.edu/courses/cse490u/17wi/slides/CLE.pdf).\n\n- [danieldk/chu-liu-edmonds](https://github.com/danieldk/chu-liu-edmonds/blob/main/src/lib.rs).\n\n# Build\n\nIn order to build and compile the project, CMake must be installed. After setting it up, build the project as follows:\n\n```bash\ngit clone https://github.com/gustavodiasag/graph-repr.git\n\ncd graph-repr/\n\nmkdir build\ncd build\n\ncmake ..\ncmake --build .\n```\n\n# License\n\nThis project is licensed under the [MIT License](LICENSE).","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgdiasag%2Fgraph-repr","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgdiasag%2Fgraph-repr","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgdiasag%2Fgraph-repr/lists"}