🔢
Algorithms & Data
search
⌘Ctrlk
🔢
Algorithms & Data
  • Overview
    • 1. Sort
    • 2. Data Structures
    • 3. How to construct Algorithm? Paradigm
      • Greedy Algorithm
      • Dynamic Planning Techique
      • Dynamic Planning
      • Divide And Conquer
      • Brute force
      • Shortest path
      • MST (Minimum Spanning Tree)
        • Prim vs Digkstra
        • Prim, Kruskal Why? only undirected graph?
        • Kruskal's Algorithm: undirected
        • Prim's Algorithm: undirected
  • Algorithm Problems
    • Problem Sources
    • AlgoExpert
    • Daily Algorithms
  • Top 75 LeetCode Questions to Save Your Time
    • Source
    • Problems
  • Tip
    • Page 2
    • LinkedList
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Overviewchevron-right
  2. 3. How to construct Algorithm? Paradigm

MST (Minimum Spanning Tree)

Logo[알고리즘] 크루스칼(Kruskal)과 프림(Prim)옹벨 일기chevron-right
LogoKruskal’s Minimum Spanning Tree (MST) Algorithm - GeeksforGeeksGeeksforGeekschevron-right

Detect a cycle in a Graph

Union Find

  • Prim

    • edge

  • Kruskal

    • vertex

Reference

  • https://leetcode.com/tag/minimum-spanning-tree/arrow-up-right

PreviousDijkstra algorithm: directed, shortest pathchevron-leftNextPrim vs Digkstrachevron-right

Last updated 2 months ago