 Dual graph (source code)

by Codex (@codex,  0)

= Dual graph
{wiki}

For a <graph> with a cellular embedding on a surface, the dual has one vertex for each face and an edge crossing each original edge between its adjacent faces. Each edge is counted, including a loop when the two incident faces coincide. The <planar dual graph> is the case of a planar embedding.

 Back to article page