Graph Planarity
A challenge by
Description
A graph is planar if it’s possible to draw onto a plane with no intersecting edges.
I explained some context for the algorithm here: github.com/mousetail/graphs/blob/…/README.md
Input is given as a comma separated list of edges fore each vertex. Output only the graphs that are planar. Each graph is fully connected and has up to 100 total vertices.
Leaderboard
| Author | Score | ||
|---|---|---|---|
| No solutions yet | |||
Challenge ends in
26 January 2026
JavaScript (Deno)
Kotlin
JavaScript (NodeJS)
Python
Rust
C (tcc)
APL (TinyAPL)
Vyxal
Vyxal 3