## Complexities

__Kruskal’s__

Kruskal’s Algorithm has

**cubic complexity**.

e.g. For a network of 10 edges which equates to 30 seconds:

- 15 edges would equate to 30 x (15/10)³ seconds
- 20 edges would equate to 30 x (20/10)³ seconds

__Prim’s__

Prim’s Algorithm has

**cubic complexity**.

__Dijkstra’s__

Dijkstra’s Algorithm has

**quadratic complexity**.

e.g. For a network of 10 edges which equates to 30 seconds:

- 15 edges would equate to 30 x (15/10)² seconds
- 20 edges would equate to 30 x (20/10)² seconds