Borůvka's Algorithm

Borůvka's Algorithm is a greedy approach to find a Minimum Spanning Tree (MST) in a graph. It works by repeatedly selecting the cheapest edge connecting two components and adding all such edges at once. By merging multiple components in every iteration, the algorithm quickly reduces the number of components until the entire graph becomes a single connected tree.

Draw Graph

Curious to Learn More?

Hand-picked resources to deepen your understanding

Beginner Friendly

Grokking Algorithms

A friendly, fully illustrated guide. The best starting point for visual learners.

Practical Guide

A Common-Sense Guide to Data Structures and Algorithms

A practical guide with clear explanations and real-world examples.

Deep Dive

Introduction to Algorithms

The definitive guide (CLRS). Comprehensive and rigorous, perfect for deep diving into theory.

As an Amazon Associate, I earn from qualifying purchases. This helps support the site at no extra cost to you.

SORTING

Bubble Sort

Insertion Sort

Selection Sort

Heap Sort

Merge Sort

Quick Sort

Radix Sort

GRAPH

Depth First Search

Breadth First Search

Dijkstra's Algorithm

Prim's Algorithm

Kruskal's Algorithm

Borůvka's Algorithm

Hamiltonian Cycle

Topological Sorting

DATA STRUCTURES

Linked List

Circular Queue

Binary Heap

Binary Search Tree

AVL Tree

Red-Black Tree

OTHER

Convex Hull

Huffman Coding

Borůvka's Algorithm

Draw Graph

Curious to Learn More?

Grokking Algorithms

A Common-Sense Guide to Data Structures and Algorithms

Introduction to Algorithms