Prim’s Algorithm: The Tinder of Graphs

Do you know how dating apps work? I don’t and they always confuse me.

You’ve got a bunch of potential matches (nodes), everyone’s connected through vibes (edges), and each connection comes with a cost (emotional investment :: the worst of kind). Now, you don’t want to date everyone (too messy, you can, just don’t let that one aunt know about it!!!). So for safer side we just want to form a Minimum Spanning Tree (MST): one wholesome connected squad with the least drama.

The Premise

• Each person = a node.
• The effort/energy to maintain a friendship = edge weight.
• We want everyone connected but with the least emotional expense = MST.

How Prim’s Algorithm Works

1. Pick your starter crush (any node).
2. Look around → add the cheapest connection to your circle (low maintenance, good vibes ).
3. Keep expanding your squad by picking the next cheapest edge from your existing group to an outsider.
4. Repeat until everyone’s in the friend group (aka no one’s left out).

You basically grow relationships one person at a time instead of Kruskal’s chaotic “let’s rank everyone first” strategy.

Dating Graph

Person 1 --(1)--> Person 2
Person 1 --(2)--> Person 3
Person 2 --(3)--> Person 3

• Start with Person 1 (your crush ).
• Cheapest bond? With Person 2 (effort = 1).
• Next cheapest? With Person 3 (effort = 2).
• Boom You’ve got a connected friend circle with total emotional cost = 3.

Prim’s Algorithm is like building your squad one low-drama friendship at a time until you’re all connected — minimal cost, max chill.