searchtree visualized as graph

Hi,

ist it possible to visualize a searchtree like the one which results from a 
problem like that:

the edges of a graph are represented as siple facts:

e(a,c).
e(c,b).
e(b,d).
e(d,c).
e(a,e).

A subgraph is wanted asking the following question:

alldifferent( [V1,V2,V3,V4] ), e(V1,V2), e(V2, V3), e(V3,V4), e(V4,V2)

which gives the result:

V1 = a
V3 = b
V4 = d
V2 = c

Now I'm interested in the visualization of the searchtree as a daVinci graph.
Any suggestions are welcome ;-)

thanks a lot
Manuel
-- 
Manuel Weindorf (weindorf@ipf.uni-karlsruhe.de)
Institut fuer Photogrammetrie und Fernerkundung, Universitaet Karlsruhe
Postfach 6980 D-76128 Karlsruhe, Tel. +49 721 608-6010 Fax +49 721 608-8450
http://www-ipf.bau-verm.uni-karlsruhe.de