title: Find all non-overlapping polygons in a list of edges/vertices
body: <p>I have a list of edges and a list of vertices. Each edge references two vertices, each vertex maintains a list of edges.</p>
  
  <p>I want to find all non-overlapping polygons produced from this graph.</p>
  
  <p>An example would be</p>
  
  <p>0,0) (4,0) (4,2) (4,4) (2,4) (2,2) (4,2) (6,2) (6,6) (0,6) (0,0) </p>
  
  <p>This path should describe each unique edge with collisions on some verticies. In the actual graph, the vertices are distinct. The two polygons I would need from this set are (0,0) (4,0) (4,2) (2,2) (2,4) (4,4) (4,2) (6,2) (6,6) (0,6) and (2,2) (2,4) (4,4) (4,2)</p>