Himesis V1.2 Final Prototype

Release Notes:

This version implements the fastest known matching algorithm 
for hierarchical graphs. The python version of the algorithm
was deprecated. A call to the python matching algorithm auto-
matically is redirected to the 'c' extension. For more infor-
mation about the design and on how to use Himesis, please re-
fer to my thesis at:

http://msdl.cs.mcgill.ca/people/mprovost/thesis.pdf

Discrepancies:

The current implementation of Himesis is a prototype. Even
though the most important features of the kernel are imple-
mented, some functionality specified in the thesis are not
currently supported:

- Event listening
- Graph Interface:

   - Even though the elements of a graph are ordered, it is
     currently impossible to modify their order without adding
     and removing them. The order the elements are added
     determine the internal ordering. (getAt, getChildOrd
     not supported).