LeetCode
search
⌘Ctrlk
LeetCode
  • Default
  • Learning Temp
  • Template
  • Copy of Template
  • CodeChef_Codeforces
  • Array
  • String
  • Hash & Map
  • Linked List
  • Binary Search
  • Bit Masking
  • Stack
  • Sliding Window
  • Prefix & Suffix
  • Heaps and Priority Queue
  • Greedy
  • Trees
  • Graph
    • General
    • Topo Sort
    • Shortest Path
    • MST/ Disjoint Set
      • Minimum Spanning Tree (Prims)
      • Union by Rank/ Size
      • Kruskal Algorithm
      • 827. Making A Large Island
      • 778. Swim in Rising Water
    • Other Algo
    • DFS/BFS
    • Copy of Copy of Template
  • Recursion & Backtracking
  • Dynamic Programming
  • Trie
  • Insights & new Learnings
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Graph

MST/ Disjoint Set

Minimum Spanning Tree (Prims)chevron-rightUnion by Rank/ Sizechevron-rightKruskal Algorithmchevron-right827. Making A Large Islandchevron-right778. Swim in Rising Waterchevron-right
Previous2976. Minimum Cost to Convert String Ichevron-leftNextMinimum Spanning Tree (Prims)chevron-right