planarity helpers #1
Description
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.
{{ message }}
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.