How to certify a flat investment?

Question

I am going to implement a flat embedding calculation algorithm.

I started checking my results by running against a set of graphs ( rome charts ) and comparing the results with the results of another implementation (yfiles). However, I can only check if the flat / non-planar answer is equal, because for this planar graph there can be many different embeddings.

How can I verify that the embedding I computed (ordering in adjacencies) is the correct flat nesting?

I have already discovered some cases where I am probably mistakenly introducing myself. For unsuccessful schedules, as a rule, manual attachment of investments becomes difficult. I found that boost docs claims that with any graph, you can create a flat drawing of the graph that will certify that the graph is flat and the planarity certificate is easy to verify. But I'm also not sure if I can / how I can create such a pattern in an algorithm with an error as from ordered adjacency lists.

(Btw. Here is my code )

Answer 1

, , - , , . dnext (e) e v v, sym (e) - , e, rprev (e) = sym (dnext (e)) . Algorithm.java : http://www.davideisenstat.com/trickle/

. (= dnext) (= rprev) , . , (V - C) + (F - C) = E.