https://github.com/lordmathis/prolog-bipartite-matching
Bipartite Matching through Network Flow
https://github.com/lordmathis/prolog-bipartite-matching
bipartite graph matching prolog
Last synced: 5 months ago
JSON representation
Bipartite Matching through Network Flow
- Host: GitHub
- URL: https://github.com/lordmathis/prolog-bipartite-matching
- Owner: lordmathis
- Created: 2017-06-11T11:01:19.000Z (about 9 years ago)
- Default Branch: master
- Last Pushed: 2017-06-11T11:10:58.000Z (about 9 years ago)
- Last Synced: 2025-10-08T22:04:55.245Z (10 months ago)
- Topics: bipartite, graph, matching, prolog
- Language: Prolog
- Homepage:
- Size: 5.86 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Bipartite Matching
This was a school assignment for Non-procedural Programming course. It's written in Prolog and implements Dinic's max-flow algorithm.
## Usage
```
parovanie(+N, -Matching)
```
where N is a number of bipartite graph from `testData.pl`
or
```
parovanie(+A, +B, +E, -Matching)
```
where the input graph is G=(V,E) and V=A∪B