/shortest-friend-chain

An algorithm to find the shortest chain of friends between two friends in a social network implemented in Haskell.

Primary LanguageHaskell

To compile the code, make sure you have ghc installed on your machine. Then run "ghc bfs.hs" to obtain an executable. Executing the executable will execute the main function in bfs.hs, which runs the test suite. The answers to the discussion questions are at the bottom of bfs.hs.