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:

Comments

Post a Comment

Popular posts from this blog

Write a C Program to Find Transpose of a Matrix.

#include<stdio.h> int main()  // main function which returns integer value {     int r, c, i, j;     //declaration of integer variables     printf(">> Enter rows and columns of matrix: ");    // print statement to get size of rows and cols     scanf("%d %d", &r, &c);     // run time initialization for 'r' and 'c'     // here we have two multi dimentional arrays of type integer.. 1) 'a' 2) 'transpose'     int a[r][c], transpose[r][c];   // declaration of array with run time size allocation.     // Storing elements of the matrix     printf("\nEnter %d elements of matrix:\n",(r*c));   // printing total elements to insert in array.     for(i=0; i<r; i++)  // for loop to iterate rows         for(j=0; j<c; j++)  // for loop t...
Read more