Implement Mersenne Twister with Unit tests

Unit tests compare results with those generated by the C++ STL
Mersenne Twister mt19937 implementation.
fix binary tree left and right nodes calculation
Implement Depth-First-Search algorithm

Recursive implementation of DFS

The expected input:
	-graph represented as a adjacency list
	-starting node (vertex)

Ouput:
	-path to all other nodes
Add error-checking for not present node in graph

Also included unit tests for not present node in graph
Merge pull request #37 from skirkpatrick/mersenne

Implement Mersenne Twister with Unit tests
Added skirkpatrick to list of Authors and reformatted author list.
Added Mersenne Twister to list of completed algorithms.
Added correct spacing this time.
Added myself to list of authors.
Merge pull request #38 from ConanChou/master

Fixed the binary tree left and right nodes calculation
Added conan to list of Authors.
Merge pull request #39 from lcheung90/dfs

Implement Depth-First-Search algorithm
Added lcheung90 to list of Authors.
Added DFS to list of algorithms.
Added base framework for stack.
Basic Stack functionality working.
Renamed EmptyStack exception to make more sense and added non functioning unit tests for now.
Helps to import the correct module.
Also helps to have the correct list to test against.
Exception test now working.