/*
 * Rick van der Zwet
 * 0433373
 * Prolog programming assigment 2
 * Licence: BSD
 * $Id: README.txt 299 2007-11-08 00:10:31Z rick $
 */

assignment1.pro = First exercise: Finite directed Graphs
assignment1.pro = Second Exercise: Binary Search Trees

Both programs has got inline comments which explains the code, I used
some sequential like coding in assignment2 -for example the 'once/call'- cause it made
programs far more understandable for me