Practical 6 (AI)

PRACTICAL NO :- 6 Aim : - Write a program to implement Depth First Search. Program Code: domains path=symbol* predicates search(symbol,symbol,path) edge(symbol,symbol) member(symbol,path) clauses search(X,X,T). search(X,Y,T):- edge(X,Z), not(member(Z,T)), search(Z,Y,[Z|T]). member(X,[X|_]):-!. member(X,[_|Y]):- member(X,Y). edge(g,h). edge(g,d). edge(e,d). edge(h,f). edge(e,f). edge(a,e). edge(a,b). edge(b,f). edge(b,c). edge(f,c). Output: