Graph Theory

Draw a handful of nodes on a blank canvas, connect them with edges, and then watch a chosen algorithm move through your graph step by step. Graph Theory lets you build any network you like — small or sprawling — and run BFS, DFS, Dijkstra's shortest path, or Kruskal's minimum spanning tree directly on it. Each algorithm animates one move at a time, so you can see exactly why a node gets visited when it does.

It's a genuinely useful tool if you're studying for a computer science course or trying to build intuition that textbook diagrams never quite deliver. Construct a weighted graph with a tricky shortest path, run Dijkstra, and the result is usually more memorable than reading about it. For broader education apps, the catalog has plenty of other interactive tools worth browsing. If you want to explore functions visually on a coordinate plane instead, Graphing Calculator goes in a different direction but shares that same hands-on, draw-and-see approach.

A larger screen helps here because the node canvas expands to fill the display, giving you room to place more nodes without them crowding together — a laptop or tablet is noticeably better than a phone.