Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/geekyharsh05/bipartite-graph-verifier
It is a command-line tool that quickly validates whether a given graph is bipartite.
https://github.com/geekyharsh05/bipartite-graph-verifier
bipartite-graphs cli graph-algorithms graphtheory
Last synced: 22 days ago
JSON representation
It is a command-line tool that quickly validates whether a given graph is bipartite.
- Host: GitHub
- URL: https://github.com/geekyharsh05/bipartite-graph-verifier
- Owner: geekyharsh05
- License: mit
- Created: 2023-11-21T13:18:23.000Z (about 1 year ago)
- Default Branch: main
- Last Pushed: 2023-11-21T13:23:48.000Z (about 1 year ago)
- Last Synced: 2024-11-09T02:38:23.995Z (3 months ago)
- Topics: bipartite-graphs, cli, graph-algorithms, graphtheory
- Language: Python
- Homepage:
- Size: 3.91 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Bipartite Graph Verification
## Usage
Run the script with the following command:
```bash
python src/main.py --nodes N
```
## Arguments
- --nodes N: Specifies the number of nodes in the graph.
## Functionality
### 1. `is_bipartite(graph)`
This function checks if a given graph is bipartite.
#### Parameters:
- `graph` (dict): An adjacency list representation of the graph where keys represent nodes, and values are lists of neighbors.
#### Returns:
- `bool`: True if the graph is bipartite, False otherwise.
### 2. `main()`
The main function acts as a command-line interface for bipartite graph verification.
- Parses command-line arguments using `argparse`.
- Accepts user input for the neighbors of each node to construct the graph.
- Calls `is_bipartite` to check if the graph is bipartite.
- Prints the result.
## Demonstration
```bash
python bipartite.py --nodes 4
Enter neighbors of node 0 (space-separated): 1 3
Enter neighbors of node 1 (space-separated): 0 2
Enter neighbors of node 2 (space-separated): 1 3
Enter neighbors of node 3 (space-separated): 0 2
The graph is bipartite.
```
## Note
- An empty graph is considered **bipartite** by default.
- The script uses a depth-first search (DFS) approach to check for bipartiteness.
- The result is printed, indicating whether the graph is bipartite or not
## Author
**Author Name** : Harsh Vardhan Pandey
**Author URI** : [www.aboutharsh.vercel.app](https://aboutharsh.vercel.app/)
**GitHub URI** : [geekyharsh05](https://github.com/geekyharsh05)
## License
[](https://opensource.org/licenses/MIT)