in short: How to find min value in a list? (thanks for the advise kaarel)
long story:
I have created a weighted graph in amzi prolog and given 2 nodes, I am
Solution without "is".
min([],X,X). min([H|T],M,X) :- H =< M, min(T,H,X). min([H|T],M,X) :- M < H, min(T,M,X). min([H|T],X) :- min(T,H,X).