Random fixes.
Refactor monodromy code.

It only made partial sense to have Monodromy be a class
that is inherited by RiemannSurface since, by the time
monodromy is computed, we have all of the information
we need to pass on to RiemannSurface. So, for simplicity,
we refactor the code so it behaves like a function,
instead. This should make it easier to use
RiemannSurfacePath in the future for performing the
analytic continuation.
Monodromy refactor.

We refactor monodromy to behave like a function.
Additionally, we eliminate the need to compute an "initial
monodromy" and simply use the combinatorial data to
determine whether or not a given monodromy path should
pass above or below a branch point.

We also use RiemannSurfacePath objects to perform the
analytic continuation.
RiemannSurfacePath + Monodromy checkpoint.

Analytic continuation works so far on several test paths
on the monodromy group for f = f10, an example with
some small circles and long paths.
Add testing routine to riemannsurface_path.py.