

0 / 2 embers
0 / 3000 xp
click for more info
Complete a lesson to start your streak
click for more info
Difficulty: 4
click for more info
Not enough gems
Cost: 6 gems
1: Breadth First Search (BFS)
incomplete
2: Complete Graph
incomplete
3: Depth First Search (DFS)
incomplete
4: DFS vs. BFS
incomplete
Back
ctrl+,
Next
ctrl+.
This lesson's interactive features are locked, please to keep using them
A complete graph is a graph where every pair of vertices is connected by an edge.
| Vertices | Edges |
|---|---|
| 2 | 1 |
| 3 | 3 |
| 4 | 6 |
| 5 | 10 |
| ... | ... |
The formula for the number of edges in a complete graph is n(n - 1)/2, where n is the number of vertices.