Search
Search
Current:
Queue
Graphs is Markov Labs’ interactive graph theory editor, calculator, and algorithm visualizer. Build directed or undirected graphs with optional edge weights, using Cartesian or polar coordinates. Inspect connectivity, connected components, cycles, bipartiteness, and tree or forest structure. Compare breadth-first search (BFS) and depth-first search (DFS) live, check planarity, identify Kuratowski obstructions, and preview planar layouts. Upcoming calculators cover shortest paths, minimum spanning trees (MST), maximum flow, source–sink and global minimum cuts, topological sorting, and search tree operations, including red-black trees. Generate grids, Erdős–Rényi random graphs, bipartite graphs, and hypercubes.
Based on:
Editing:
Your graph is saved either way.
Options