Graph Theory Lab

Nodes: 10

Graph Theory Visualizer – Networks, Paths & Algorithms

Graph theory studies mathematical structures composed of vertices and edges, providing the language for modeling networks, relationships, and connectivity problems across computer science, logistics, and social science. This visualizer lets you build directed or undirected graphs by clicking and dragging, then apply algorithms—BFS, DFS, Dijkstra's shortest path, Prim's and Kruskal's spanning trees—and watch them traverse the graph node by node with animated highlighting. The abstract concepts of degree sequences, Eulerian paths, and graph coloring become immediately tangible.

What you can do in this simulation

Add vertices and edges by clicking the canvas and label them with custom weights
Run BFS and DFS from any source vertex and watch traversal order animate in real time
Find the shortest path between two vertices using Dijkstra's algorithm step by step
Generate a minimum spanning tree with Prim's or Kruskal's and highlight the result
Detect cycles, check bipartiteness, and compute degree sequences for any graph

Concepts covered

graph theory · BFS · DFS · shortest path · spanning tree · graph coloring

Related simulations

Browse all Mathematics simulations →

Free to use in your browser — no signup required. Found a bug or have an idea to make it better? Tell us.

Please wait

Loading mathematics simulations

The requested content is still loading.

Finished experimenting?

Save one completion to this browser's signed guest ledger, or directly to your account when signed in.