Visualising search trees
From: S (smileyhamster_at_hotmail.com)
Date: 02/16/04
- Previous message: djamé: "Re: Help with project"
- Next in thread: Tom Breton: "Re: Visualising search trees"
- Reply: Tom Breton: "Re: Visualising search trees"
- Reply: Alexei A. Morozov: "Re: Visualising search trees"
- Reply: Alexei A. Morozov: "Re: Visualising search trees"
- Reply: Fred Mesnard: "Re: Visualising search trees"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: 15 Feb 2004 19:08:29 -0800
Hi,
I'm using Prolog to recreate research from a paper. The problem is a
classic AI search tree, which is traversed using depth first search.
The paper states that it can find solutions in a matter of seconds,
while mine currently takes minutes. I've tried optimizing and looking
at state traversal to quite an extend using simple text output
debugging.
What I would really like is to be able to view the whole search tree
(or just what has been traversed from a sample) so I can spot the
parts it is taking the most time in. Hopefully, I'll be able to spot
some redundancy or pointless traversals. It will also be useful for
looking at how the algorithm works for when I write a report of it.
This must be a common problem with search trees. Does anyone know of
any software (preferable free and for linux) that will help me
visualise the search tree?
Thanks.
- Previous message: djamé: "Re: Help with project"
- Next in thread: Tom Breton: "Re: Visualising search trees"
- Reply: Tom Breton: "Re: Visualising search trees"
- Reply: Alexei A. Morozov: "Re: Visualising search trees"
- Reply: Alexei A. Morozov: "Re: Visualising search trees"
- Reply: Fred Mesnard: "Re: Visualising search trees"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]