Edge graph to polygons

Created by: zeffii

I'm investigating this now, automatically iterate through edges to find Edge Cycles with which to construct polygons. I think it makes sense to have a min=3 max=n parameter for the input. Hopefully will find the right graph theory paper to read, else I implement my own.

Suggestions welcome.