How can i write Blossom algorithm in prolog?

Question

I am strugling to implement augmenting path finder in prolog

vertexCover(N,L1,M,L2) :- numlist(1, N, L), comb(M,L,L2), covers(L2,L1).

covers(_,[]).
covers(L,