% Auto-generated on Tue Oct 05 22:44:55 PDT 1999
 
% is_start(N) is true if N is a start node.
is_start('mi').

% is_goal(N) is true if N is a goal node.
is_goal('cp').

%
% neighbours(N,NN) is true if NN is the list of neighbours of node N

neighbours(mi,[uv,fg,hi,mv]).
neighbours(fg,[hi,mi]).
neighbours(hi,[fg,mi]).
neighbours(mv,[mi,tw,gb]).
neighbours(tw,[fv,mv,gb]).
neighbours(fv,[cp,tw]).
neighbours(cp,[fv]).
neighbours(gb,[mv,tw,bg]).
neighbours(uv,[mi,rs]).
neighbours(rs,[ab,uv]).
neighbours(ab,[re,rs]).
neighbours(re,[ab]).
neighbours(bg,[gb]).

% cost(N,M,C) is true if C is the arc cost for the arc from node N to node M

cost(mi,uv,18.3).
cost(mi,fg,10.7).
cost(mi,hi,9.5).
cost(mi,mv,18.3).
cost(fg,hi,12.3).
cost(fg,mi,10.7).
cost(hi,fg,12.3).
cost(hi,mi,9.5).
cost(mv,mi,18.3).
cost(mv,tw,13.1).
cost(mv,gb,9.5).
cost(tw,fv,13.2).
cost(tw,mv,13.1).
cost(tw,gb,9.6).
cost(fv,cp,8.5).
cost(fv,tw,13.2).
cost(cp,fv,8.5).
cost(gb,mv,9.5).
cost(gb,tw,9.6).
cost(gb,bg,4.7).
cost(uv,mi,18.3).
cost(uv,rs,21.3).
cost(rs,ab,8.8).
cost(rs,uv,21.3).
cost(ab,re,12.1).
cost(ab,rs,8.8).
cost(re,ab,12.1).
cost(bg,gb,4.7).

% h(N,C) is true if C is the heuristic estimate the distance from N to g.
h(mi,6.2).
h(fg,15.5).
h(hi,15.4).
h(mv,15.3).
h(tw,16.2).
h(fv,8.5).
h(cp,0.0).
h(gb,7.4).
h(uv,14.8).
h(rs,20.0).
h(ab,27.4).
h(re,27.1).
h(bg,6.4).

