Fat Limey

I create an array where each entry is the index of the site with that site->index. A reverse lookup to "restore order". ``` c++ uint32_t* restore_order = new uint32_t[my_diagram.numsites]; std::memset(restore_order,...

You are correct, there are two issues (setting aside the problem that `jvc_diagram_get_next_edge()` seems to visit each edge twice): 1. When visiting adjacent sites, vertices that are shared often have...

Are the vertices logically the same? Well, if the sites are sharing an edge then the vertices of each end of the edge should be equal. But I understand that...