First Pre-release

The code works properly for all our needs. There are a lot of features missing (mainly additional features as more efficient memory management, more user input/output choices, etc) but they are going to be implemented under demand since we are more focused on the core methods.

This pre-release includes:
Low level algorithms

• FMM (Fast Marching Method): with different heaps (binary, Fibonacci and boost priority queue (vector)).
• SFMM (Simplified Fast Marching Method): this is achieved using the boost priority queue on the standard FMM. The code automatically performs SFMM.

High level algorithms

• FM2 (Fast Marching Square).
• FM2* (Fast Marching Square ) FM2 is to FM2 what A* is to Dijsktra.
• FM2D (Fast Marching Square Directional).