{"id":19081574,"url":"https://github.com/geekyharsh05/bipartite-graph-verifier","last_synced_at":"2026-06-17T06:31:58.470Z","repository":{"id":208449941,"uuid":"721636213","full_name":"geekyharsh05/Bipartite-Graph-Verifier","owner":"geekyharsh05","description":"It is a command-line tool that quickly validates whether a given graph is bipartite.","archived":false,"fork":false,"pushed_at":"2023-11-21T13:23:48.000Z","size":4,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-10-26T13:43:35.793Z","etag":null,"topics":["bipartite-graphs","cli","graph-algorithms","graphtheory"],"latest_commit_sha":null,"homepage":"","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/geekyharsh05.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-11-21T13:18:23.000Z","updated_at":"2023-11-21T13:25:03.000Z","dependencies_parsed_at":null,"dependency_job_id":"df764fb2-dee5-41f8-b4ca-933c59149d9e","html_url":"https://github.com/geekyharsh05/Bipartite-Graph-Verifier","commit_stats":null,"previous_names":["geekyharsh05/bipartite-graph-verifier"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/geekyharsh05/Bipartite-Graph-Verifier","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/geekyharsh05%2FBipartite-Graph-Verifier","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/geekyharsh05%2FBipartite-Graph-Verifier/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/geekyharsh05%2FBipartite-Graph-Verifier/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/geekyharsh05%2FBipartite-Graph-Verifier/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/geekyharsh05","download_url":"https://codeload.github.com/geekyharsh05/Bipartite-Graph-Verifier/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/geekyharsh05%2FBipartite-Graph-Verifier/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34437449,"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-17T02:00:05.408Z","response_time":127,"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":["bipartite-graphs","cli","graph-algorithms","graphtheory"],"created_at":"2024-11-09T02:37:08.321Z","updated_at":"2026-06-17T06:31:58.446Z","avatar_url":"https://github.com/geekyharsh05.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Bipartite Graph Verification\n\n## Usage\n\nRun the script with the following command:\n\n```bash\npython src/main.py --nodes N\n```\n\n## Arguments\n\n- --nodes N: Specifies the number of nodes in the graph.\n\n## Functionality\n\n### 1. `is_bipartite(graph)`\n\nThis function checks if a given graph is bipartite.\n\n#### Parameters:\n\n- `graph` (dict): An adjacency list representation of the graph where keys represent nodes, and values are lists of neighbors.\n\n#### Returns:\n\n- `bool`: True if the graph is bipartite, False otherwise.\n\n### 2. `main()`\n\nThe main function acts as a command-line interface for bipartite graph verification.\n\n- Parses command-line arguments using `argparse`.\n- Accepts user input for the neighbors of each node to construct the graph.\n- Calls `is_bipartite` to check if the graph is bipartite.\n- Prints the result.\n\n\n## Demonstration\n\n```bash\npython bipartite.py --nodes 4\nEnter neighbors of node 0 (space-separated): 1 3\nEnter neighbors of node 1 (space-separated): 0 2\nEnter neighbors of node 2 (space-separated): 1 3\nEnter neighbors of node 3 (space-separated): 0 2\nThe graph is bipartite.\n```\n\n## Note\n\n- An empty graph is considered **bipartite** by default.\n- The script uses a depth-first search (DFS) approach to check for bipartiteness.\n- The result is printed, indicating whether the graph is bipartite or not\n\n## Author\n\n**Author Name** \u0026nbsp; : \u0026nbsp; Harsh Vardhan Pandey \u003cbr\u003e\n**Author URI** \u0026nbsp; \u0026nbsp; \u0026nbsp; : \u0026nbsp; [www.aboutharsh.vercel.app](https://aboutharsh.vercel.app/) \u003cbr\u003e\n**GitHub URI** \u0026nbsp; \u0026nbsp; \u0026nbsp; : \u0026nbsp; [geekyharsh05](https://github.com/geekyharsh05)\n\n## License\n\n[![License: MIT](https://img.shields.io/badge/License-MIT-red.svg)](https://opensource.org/licenses/MIT)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgeekyharsh05%2Fbipartite-graph-verifier","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgeekyharsh05%2Fbipartite-graph-verifier","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgeekyharsh05%2Fbipartite-graph-verifier/lists"}