Master Prim's Algorithm for Minimum Spanning Trees: grow one tree from a start vertex by always adding the cheapest crossing edge. Build it in your language of choice and answer bottleneck-edge and connectivity queries, the counterpart to Kruskal.
Prerequisites:
- Knowledge of a programming language of your choice.
- Basic understanding of weighted graphs.
- Helpful: the Kruskal course (the other MST algorithm).
