logoSEE ALGORITHMS
    Bubble Sort
    Insertion Sort
    Selection Sort
    Radix Sort
    Heap Sort
    Merge Sort
    Quick Sort
    Depth First Search
    Breadth First Search
    Prim's Algorithm
    Kruskal's Algorithm
    Dijkstra's Algorithm
    Topological Sorting
    Hamiltonian Cycle
    Binary Search Tree
    Binary Heap
    Circular Queue
    Convex Hull
    Huffman Coding
Prim's Algorithm

Prim's Algorithm builds a Minimum Spanning Tree (MST) by starting from any node and adding the smallest edge that connects the tree to a new node, repeating until all nodes are included. It is used for optimizing network designs like computer and road networks.

Draw Graph