Planar Layout: Positions nodes without edge intersections.
Note that only planar graphs (graphs that can be drawn without edge crossings)
can be processed by this algorithm. K5 (complete graph with 5 nodes) and K3,3
(complete bipartite with 3,3 nodes) are examples of non-planar graphs.