Gabriel Graph generator notes

The more challenging aspects to the algorithm itself here given by cycles (polygon/face) generation. The Dijkstra wiki notes that I've furnished provide a basis for cycles generation, although I've included as an insulating layer added check methods to avoid duplicate cycles being furnished into a given cycles compilations list.

The following figure demonstrates the process of keying a cycle as well as testing a cycle, for instance, by a given key value on a hash set.