Contact US

Log In

Come Join Us!

Are you a
Computer / IT professional?
Join Tek-Tips Forums!
  • Talk With Other Members
  • Be Notified Of Responses
    To Your Posts
  • Keyword Search
  • One-Click Access To Your
    Favorite Forums
  • Automated Signatures
    On Your Posts
  • Best Of All, It's Free!

*Tek-Tips's functionality depends on members receiving e-mail. By joining you are opting in to receive e-mail.

Posting Guidelines

Promoting, selling, recruiting, coursework and thesis posting is forbidden.

Students Click Here

Prolog DFS method implementation for a tree

Prolog DFS method implementation for a tree

Prolog DFS method implementation for a tree

i tried to write a prolog code for Depth First Search (DFS). Program has given a certain state space on input, which is rated tree and i need to realize browsing of this state space with DFS method.

My code is:

dfs(state(NAME,TRANSITIONS)) :- write(NAME), write('\n'), expand(TRANSITIONS).
expand([H]) :- dfs(H).
expand([H|T]) :- dfs(H), expand(T).

And my defination for goal is:


Answer of prolog is:


I dont know how to define certain space. Do you have any advice ?

Thank you and ha ve a nice day Vinnie

Red Flag This Post

Please let us know here why this post is inappropriate. Reasons such as off-topic, duplicates, flames, illegal, vulgar, or students posting their homework.

Red Flag Submitted

Thank you for helping keep Tek-Tips Forums free from inappropriate posts.
The Tek-Tips staff will check this out and take appropriate action.

Reply To This Thread

Posting in the Tek-Tips forums is a member-only feature.

Click Here to join Tek-Tips and talk with other members! Already a Member? Login

Close Box

Join Tek-Tips® Today!

Join your peers on the Internet's largest technical computer professional community.
It's easy to join and it's free.

Here's Why Members Love Tek-Tips Forums:

Register now while it's still free!

Already a member? Close this window and log in.

Join Us             Close