Search Algorithms
A landing page for BFS, DFS, Dijkstra, A*, Bellman-Ford and Floyd-Warshall.
Beauty in maths topic
Graphs and networks describe relationships: routes, dependencies, colours, flows, spread and structure.
7
live pages
6
prototype tools
5
planned ideas
Search algorithms: BFS, DFS, Dijkstra, A*, Bellman-Ford and Floyd-Warshall
Colouring, planarity and map problems
Random graphs and networks that change suddenly
Connections to epidemics, diffusion and Markov chains
What changes when we focus on connections instead of coordinates?
Which properties are local and which are global?
How can a network suddenly become connected?
These are the pages currently available to open from this topic.
A landing page for BFS, DFS, Dijkstra, A*, Bellman-Ford and Floyd-Warshall.
Build graphs and compare BFS and DFS traversal step by step.
Explore weighted shortest paths, tentative distances and settled nodes.
Explore goal-directed shortest path search using g, h and f scores.
Use greedy colouring and compare vertex-order strategies.
Explore G(n, p), connected components and random network behaviour.
A thought experiment connecting rational slopes, irrational directions and exact lattice hits.
Explore planar graphs, Euler's formula, crossings and why maps become graph-colouring problems.
These ideas are not built yet, but they show where this topic could grow next.
Planned exploration of musical patterns generated by curved, warped or graph-like spaces.
Planned exploration of chord progressions, voice leading and melodic movement as networks.
Planned bridge between graph networks, probability and differential-equation models of spread.
Planned exploration of heat, pollution or information flowing across connected networks.
Planned lab linking probability, matrices and long-run behaviour in systems that move between states.
A portal for connected mathematical explorations: pattern, surprise, structure, nature and emergence.
Rhythm, tuning, symmetry, timing, pattern and musical structure through mathematics.
Codes, ciphers, primes, modular arithmetic, public keys and secure communication.
Shape, connectedness, holes, surfaces, knots and geometry that survives stretching.
Optimisation, scheduling, routing, allocation and making good decisions under constraints.
This is one of the strongest bridges between mathematics and computer science.