A planarity game
November 27th, 2007 – by Yong Zhang
Graph theory is one of the topics in discrete mathematics. It is also important for a CS major to know some graph theory since many real-life problems concerning computer networks and computer circuit design are in fact problems in graph theory.
A planar graph is a graph that can be drawn on a piece of paper without any edge crossing. It is especially important in areas of computer engineering such as VLSI design. Determining whether a given graph is planar is not hard, but finding the planar drawing of a planar graph can be quite time consuming — check out the planarity game. It took me about five minutes to finish the first three levels, then the game gets more challenging…
