Compute a shortest non-contractible cycle on a surface

A new package about the computation of some topological invariants on surfaces is under development in CGAL. The goal of this project is to add a new method in this package in order to compute a shortest non-contractible cycle on a given surface. The goal is to implement the algorithm described in this paper (Algorithms for the edge-width of an embedded graph, Sergio Cabello, Éric Colin de Verdière, Francis Lazarus, Computational Geometry, Volume 45, Issues 5–6, 2012, Pages 215-224).