{"id":22898974,"url":"https://github.com/dwarfmaster/blossom","last_synced_at":"2025-10-25T00:10:17.981Z","repository":{"id":148099807,"uuid":"117222574","full_name":"dwarfmaster/blossom","owner":"dwarfmaster","description":"Implementation of the blossom algorithm","archived":false,"fork":false,"pushed_at":"2019-07-16T06:26:49.000Z","size":548,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"blossom","last_synced_at":"2025-02-07T02:48:21.634Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"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/dwarfmaster.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":"2018-01-12T09:38:24.000Z","updated_at":"2019-07-16T06:26:51.000Z","dependencies_parsed_at":"2023-05-19T04:00:21.297Z","dependency_job_id":null,"html_url":"https://github.com/dwarfmaster/blossom","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/dwarfmaster%2Fblossom","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dwarfmaster%2Fblossom/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dwarfmaster%2Fblossom/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dwarfmaster%2Fblossom/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/dwarfmaster","download_url":"https://codeload.github.com/dwarfmaster/blossom/tar.gz/refs/heads/blossom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246569009,"owners_count":20798341,"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":"2024-12-14T00:35:33.293Z","updated_at":"2025-10-25T00:10:17.934Z","avatar_url":"https://github.com/dwarfmaster.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"\nBlossom\n=======\n\nThis is an implementation of the Blossom algorithm in O(nm a(n)) where n is the\nnumber of vertices in the graph, m the number of edges and a is the inverse\nAckermann function.\n\nInput\n-----\n\nIt expects a description of the graph on its standard input. The graph is a\nsuccession of number. First is the number of nodes n, then the number of edges m,\nthen the edges as couples of numbers (identifier of nodes between 0 included and\nn not included). For example, the cycle of size 5 would be :\n\n```\n5 5\n0 1\n1 2\n2 3\n3 4\n4 0\n```\n\nOutput\n------\n\nThe program outputs the matching in the form of a list of edges, each being two\nnodes identifiers separated by `--`. For the cycle of size 5, an output could\nbe :\n\n```\n0 -- 1\n2 -- 3\n```\n\nIt also outputs the duration of the execution of the blossom function in\nmicroseconds, without the time to load the graph or print the output.\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdwarfmaster%2Fblossom","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdwarfmaster%2Fblossom","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdwarfmaster%2Fblossom/lists"}