Network Topology Generator
The classic topologies are easy to describe and hard to picture at scale. A full mesh on five nodes looks fine; on fifteen it needs 105 links, which is the whole reason meshes are rare. This draws each shape at the size you choose and states the edge count that shape forces, so the trade-off is visible rather than asserted.
What this generator does
Draws each of five standard topologies at the node count you set. The edge count is a property of the shape: a star and a line both need n-1 links, a ring needs n, and a full mesh needs n(n-1)/2 — which is why the mesh figure grows so much faster than the others.
How to use this tool
- Pick a shape and a number of nodes.
- Draw it — the edge count comes from the shape, not from you.
- Compare a mesh with a star at the same size to see the difference.
- Copy the DOT source for a diagram tool.
Understanding the controls
- Shape
- Star and hub-and-spoke centre everything on one node; ring closes the loop; line is a simple chain; mesh connects every pair.
- How many nodes
- Between 2 and 60, though a mesh becomes unreadable well before that — which is itself the point.
Common use cases
- Explaining topology trade-offs with a picture rather than a table
- Showing why a full mesh stops scaling
- Producing a diagram source for documentation
- Teaching network fundamentals with concrete edge counts
- Generating structured link data for a simulation
How this generator works
Each topology is constructed directly from its definition rather than sampled, so it is exactly the canonical shape every time. The drawing places nodes on a circle, which is deterministic and never overlaps two nodes.
Randomness and fairness
The shape itself is not random — a ring on eight nodes is always the same ring. Only the edge weights are drawn, and only when you turn weights on: seeded for reproducibility, otherwise from the browser's cryptographically secure generator, which is reproducible-by-seed and therefore explicitly not cryptographic.
For how randomness is produced across the whole site, see how Generate Random works.
Limitations and good to know
- These are idealised shapes. Real networks are hybrids with redundant links and asymmetric capacity.
- It models structure only — no bandwidth, latency or failure behaviour.
- A mesh past about 12 nodes is drawn correctly but is not readable.
Privacy and your data
Diagrams are drawn locally in your browser. No shape, size or exported DOT source is sent anywhere.
Related generators
- Random Graph GeneratorRandom graphs at a density you choose, drawn and exported as an edge list or DOT, with connectivity measured rather than assumed.
- Flow Network GeneratorCapacitated networks with the maximum flow found by Edmonds-Karp and the minimum cut that proves it cannot be beaten.
- Random Tree GeneratorRandom trees with exactly one path between any two nodes — n nodes, n minus 1 edges, no cycles, guaranteed connected.
- DAG GeneratorDirected acyclic graphs where the absence of cycles is structural rather than checked afterwards — for testing schedulers, build systems and topological sorts.
- State Transition Path GeneratorDescribe a state machine and walk random valid paths through it, to find the routes your tests are not covering.