Follow your curiosity

What discovery has been shared with you?

FACTREE gives you something interesting to discover every day — and something worth talking about together.

Start with one fact. Explore it, go deeper, then follow whichever branch catches your imagination.

Choose subjects for a surprise

Exploring any topic

Begin your discovery

Your next discovery is one click away.

Choose one or more subjects above, or leave Any Topic selected and let curiosity decide.

Mathematics

Kruskal's Algorithm for Building Minimum Spanning Trees

Quick fact

Kruskal's algorithm can always find the minimum spanning tree of any connected, weighted graph, and it does so by simply sorting edges by weight and adding the smallest safe edge, guaranteeing an optimal solution.

Why this is interesting

How can you connect all the cities in a region with the least total length of road, without building any loops? The answer uses a surprisingly simple rule: always pick the cheapest road that doesn't create a cycle.