释义 |
dual graph The dual graph G of a planar graph G has the faces of G as its vertices, and there is an edge between the vertices of G if an edge of G separates the faces of G that those vertices represent. The dual graph of the dual graph is the original graph. An example of a planar graph and its dual are:
|