If you want to work on one of these, put your name in the block so we know someone's working on it. Then, change n in your block to the appropriate problem number, and fill in the <Problem description>,<example in lisp>,<example in Haskell>,<solution in haskell> and <description of implementation> fields.

1 Graphs

2 Problem 80

<Problem description>

Example:
<example in lisp>
Example in Haskell:
<example in Haskell>

Solution:

<solution in haskell>

<description of implementation>

3 Problem 81

Path from one node to another one

Write a function that, given two nodes a and b in a graph, returns all the acyclic paths from a to b.