EngineersofAI LogoCoursesBlogResearch LabAI LettersThe LabCode BankInteractive 3DKodrEarnestJobs
Skip to main content
Interactive 3D/Graph Explorer
Click empty space: add node | Drag node to move
Mode
Graph Type
Actions
Random Graph G(n,p)
n nodes6
p (edge prob)0.40
Statistics
Nodes: 0
Edges: 0
Components: 0
Degree seq: []
Type: Undirected

Graph Explorer - Interactive Visualization

Graphs model relationships: social networks, molecules, knowledge bases, transportation systems. A graph G = (V, E) consists of vertices V and edges E. The adjacency matrix A[i][j] = 1 if edge (i,j) exists. Degree d(v) counts connections. This interactive explorer lets you build arbitrary graphs by clicking and see adjacency matrix and degree sequence update live.

  • Click empty space to add nodes, click two nodes to add an edge
  • Toggle directed mode to see asymmetric adjacency matrices
  • Watch degree sequence and adjacency matrix update live
  • Delete mode: click to remove nodes or edges
  • Foundation for GNNs, graph databases, social network analysis

Part of the EngineersOfAI Interactive 3D - free interactive visualizations covering every major concept in machine learning and AI engineering. Hover any element for a plain-English explanation. No code required.