In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints.
Their are many algorithms which exist for planar graph testing (i.e. determining if a given graph is Planar). The best ones are in O(n) where n is the number of vertices.
Which open source programs exist which support the following features:
- Can Draw Planar Graphs
- Support an O(n) Planar graph testing.
- Support variable node size.
- Support fixed drawing boundary region
- Are open source