I obtain strange results when i run some scheme files in STk, but when i
run them using the MIT Scheme i've got the right results i'm pretty sure
the problem isn't in my algorithms. because i'm using them for 9 months
now without any problems.
The main problem is that the results are false. The algotrithm ensure
that a certain property is verified by the created graph but this
property isn't there.
here is the code the is problematic :
just decompress the tarball and put the content of stud in a variable
(let's say a)
then do this :
(define **rb-var** (car a)) (define **rb-liaison** (cdr a))
(handle-command '(compil))
now junction-list should represent a tree ( ((a b) (a c)) = b-a-c )
where all the nodes on the path between 2 nodes contain the intersection
of the set of variables of the first and last node
(ex : (c d e) - (g d c f)- (x d c y) - (a b c d) )
------------------------------------ -o)
Evrard Nicolas (nicoe_at_wanadoo.be) /\\
Liège (Belgium) _\_v
-----------------------------------------
- application/octet-stream attachment: prb.tgz
Received on Tue Jul 25 2000 - 05:29:42 CEST