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