-
Notifications
You must be signed in to change notification settings - Fork 46
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Output of PlanarEmbedding
#669
Comments
Thanks @MeikeWeiss I'll think about this, and see if we can't offer what you suggest? |
This was hopefully resolved by #696, @MeikeWeiss, any chance you can confirm this? |
I wanted to test the method with some examples to confirm this, but I pulled the new version and now I get the error message:
I'm not sure what the problem is. |
Argh that's annoying. Would you mind sharing the code that generated this error, and the full output from the error please? |
@MeikeWeiss you probably just need to recompile Digraphs, then it should work! |
Oh wow:) Thank you! I looked at some examples and there the output is correct! In the course of the next week I will probably incorporate the method into my embedding algorithm so that it can be tested intensively. |
The planar embedding method returns only a minimal rotation system, i.e. for each vertex the method returns only a list with entries of smaller vertices. Such a list is not easy to work with. It must be possible to extend this list in such a way that we get a list containing for each vertex all neighbours in such a order that it defines a planar embedding.
Here are some examples of how the actual output and how it would be easier to work with the computed planar embedding:
Cubical Graph:
Note that the rotation system for a planar graph is not unique so the output could differ.
The text was updated successfully, but these errors were encountered: