Graphs and Networks
This topic is about how connected things create routes, patterns and choices.
Explore the main idea
Placeholder text: this section will explain how the main tool works, what the user can change, and what they should notice as the visual responds.
Placeholder text: this section will connect the tool back to the wider topic, showing how the same mathematical idea appears in related projects and real situations.
About this topic
Graphs and networks describe relationships: routes, dependencies, colours, flows, spread and structure.
This is one of the strongest bridges between mathematics and computer science.
Explore this through search algorithms: bfs, dfs, dijkstra, a*, bellman-ford and floyd-warshall, colouring, planarity and map problems, random graphs and networks that change suddenly.
Further exploration
Look up: Dijkstra's shortest path algorithm
Explore next: the four colour theorem
Try searching for: network centrality and connected components