{"id":20409716,"url":"https://github.com/sleekpanther/bipartite-matching","last_synced_at":"2025-04-12T15:51:56.216Z","repository":{"id":115108601,"uuid":"88350399","full_name":"SleekPanther/bipartite-matching","owner":"SleekPanther","description":"Application of Ford-Fulkerson algorithm to find the maximum matching between 2 sides of a bipartite graph","archived":false,"fork":false,"pushed_at":"2017-04-21T11:14:57.000Z","size":806,"stargazers_count":12,"open_issues_count":0,"forks_count":4,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-26T10:21:18.831Z","etag":null,"topics":["algorithm","bipartite-graphs","bipartite-network","capacity","cardinality","directed-edges","directed-graphs","flow-network","flow-networks","ford-fulkerson","graph","match","maxflow","maximum-matching"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/SleekPanther.png","metadata":{},"created_at":"2017-04-15T14:00:04.000Z","updated_at":"2025-02-04T08:00:54.000Z","dependencies_parsed_at":null,"dependency_job_id":"adf6be7a-1f78-4ddb-9317-65ed11e4bb06","html_url":"https://github.com/SleekPanther/bipartite-matching","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/SleekPanther%2Fbipartite-matching","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SleekPanther%2Fbipartite-matching/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SleekPanther%2Fbipartite-matching/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SleekPanther%2Fbipartite-matching/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/SleekPanther","download_url":"https://codeload.github.com/SleekPanther/bipartite-matching/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248591995,"owners_count":21130162,"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":["algorithm","bipartite-graphs","bipartite-network","capacity","cardinality","directed-edges","directed-graphs","flow-network","flow-networks","ford-fulkerson","graph","match","maxflow","maximum-matching"],"created_at":"2024-11-15T05:43:10.013Z","updated_at":"2025-04-12T15:51:56.211Z","avatar_url":"https://github.com/SleekPanther.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":null,"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsleekpanther%2Fbipartite-matching","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsleekpanther%2Fbipartite-matching","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsleekpanther%2Fbipartite-matching/lists"}