There are already works that attempt to find the MFEP by directing solving the Eikonal equation. The method that is presented in this work, however, utilises a method known as the Fast Marching Tree (FMT). This algorithm was originally used in the realm of robotics for path planning. A detailed description of the implementation of FMT can be found in the literature. The benefit of FMT is that it always returns a path where the 'cost' is minimised given a search radius r and converges asymptotically to its global minimum. Here, we provide an account of how the original FMT algorithm can be modified so that it can be used in path planning to find the initial guess of MFEP given that there are two CVs.