THE GRAPH LABORATORY
Draw a connection.
Follow an idea.
Build your own graph. Move its vertices. Watch five algorithms think.
05 ALGORITHMSYour graph.
Your experiment.Weighted · Directed or undirected · C++ intuition
Your experiment.Weighted · Directed or undirected · C++ intuition
Random graphInclusive integer range.
Import Graph
Export Graph
○ Unvisited● Frontier● Processed
Integer weights may be negative. Dijkstra requires nonnegative weights. BFS and DFS ignore weights.
Looking for random trees and tree algorithms? Open Tree Lab →