Planar Graph Data Structure Visualizer

How to Use

Add Node: Enter a label and click "Add Node"
Add Edge: Enter source and destination, click "Add Edge"
Random Planar Graph: Click to instantly generate a planar graph
Remove Node/Edge: Enter node or edge and click remove
Planarity Check: Click to check if the graph is planar
Reset: Click to clear the graph

Planar Graph Concept

Planar Graph is a graph that can be drawn on a plane without any edges crossing.

Key Characteristics:

No two edges cross when drawn in the plane
Can be embedded in the plane
Useful for circuit design, geography, and more

Purpose & Applications

Circuit design
Geographical mapping
Network visualization
Graph drawing algorithms

Time & Space Complexity

Operation	Time Complexity	Space Complexity
Add Node	O(1)	O(V+E)
Add Edge	O(1)	O(1)
Remove Node	O(E)	O(V+E)
Remove Edge	O(E)	O(1)
Planarity Check	O(V+E)	O(V+E)

Strengths & Limitations

Strengths:

Models real-world planar systems
Useful for visualization and layout

Limitations:

Not all graphs are planar
Planarity testing can be complex

Planar Graph Code Implementation

// Pseudocode for Planar Graph Data Structure

STRUCTURE PlanarGraph:
    nodes ← empty map/dictionary
    edges ← empty list/array

FUNCTION addNode(label):
    IF label NOT IN nodes THEN
        nodes[label] ← {x: random(0, 400), y: random(0, 300)}
        RETURN true
    END IF
    RETURN false

FUNCTION addEdge(from, to):
    IF from ≠ to AND from IN nodes AND to IN nodes THEN
        edges.append({from: from, to: to})
        RETURN true
    END IF
    RETURN false

FUNCTION removeNode(label):
    IF label IN nodes THEN
        nodes.remove(label)
        FOR each edge IN edges DO
            IF edge.from = label OR edge.to = label THEN
                edges.remove(edge)
            END IF
        END FOR
        RETURN true
    END IF
    RETURN false

FUNCTION removeEdge(from, to):
    FOR each edge IN edges DO
        IF (edge.from = from AND edge.to = to) OR 
           (edge.from = to AND edge.to = from) THEN
            edges.remove(edge)
            RETURN true
        END IF
    END FOR
    RETURN false

FUNCTION isPlanar():
    v ← number of nodes
    e ← number of edges
    
    IF v < 3 THEN
        RETURN true
    END IF
    
    // Euler's formula for planar graphs: e ≤ 3v - 6
    IF e > 3 * v - 6 THEN
        RETURN false
    END IF
    
    RETURN true

Planar Graph Data Structure Visualizer

Planar Graph Setup

Planar Graph Operations

Graph Visualization

Operation Steps

How to Use

Planar Graph Concept

Purpose & Applications

Time & Space Complexity

Strengths & Limitations

Planar Graph Code Implementation