Skip to content
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.

Sign up for GitHub

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

Jump to bottom

planarity helpers #1

Open
RSully opened this issue Dec 14, 2017 · 0 comments
Open

planarity helpers #1

RSully opened this issue Dec 14, 2017 · 0 comments

Comments

@RSully
Copy link

RSully commented Dec 14, 2017

Not sure how difficult this would be, but would be nice if you could add algorithms for finding graphs with fewest crossings and/or planar embeddings.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@RSully