When should I use Kruskal as opposed to Prim (and vice versa)?

Use Prim’s algorithm when you have a graph with lots of edges.

For a graph with V vertices E edges, Kruskal’s algorithm runs in O(E log V) time and Prim’s algorithm can run in O(E + V log V) amortized time, if you use a Fibonacci Heap.

Prim’s algorithm is significantly faster in the limit when you’ve got a really dense graph with many more edges than vertices. Kruskal performs better in typical situations (sparse graphs) because it uses simpler data structures.

Related Posts:

  1. How to find maximum spanning tree?
  2. When is it practical to use Depth-First Search (DFS) vs Breadth-First Search (BFS)? [closed]
  3. Why is the time complexity of both DFS and BFS O( V + E )
  4. Time Complexity of the Kruskal Algorithm?
  5. Looking for algorithm finding euler path
  6. In a triangulated isometric grid, what triangle is a given point in?
  7. What is a loop invariant?
  8. What is a loop invariant?
  9. What does O(log n) mean exactly?
  10. how to calculate binary search complexity
  11. What does O(log n) mean exactly?
  12. What is Sliding Window Algorithm? Examples?
  13. Quicksort with Python
  14. What is the difference between tree depth and height?
  15. how to implement quick sort algorithm in C++
  16. Python: maximum recursion depth exceeded while calling a Python object
  17. Time complexity of a Priority Queue in C++
  18. What is stability in sorting algorithms and why is it important?
  19. Breadth First Search time complexity analysis
  20. Counting the sum of every nodes’ neighbors’ degrees?
  21. Quick Sort Vs Merge Sort
  22. Polynomial time and exponential time
  23. Insertion Sort vs. Selection Sort
  24. Difference and advantages between dijkstra & A star
  25. Best Case for Bubble Sort
  26. How to find the kth smallest element in the union of two sorted arrays?
  27. Big O, how do you calculate/approximate it?
  28. Performing Breadth First Search recursively
  29. Is Quicksort in-place or not?
  30. Find how many connected groups of nodes in a given adjacency matrix
  31. longest increasing subsequence(O(nlogn))
  32. O(n log n) vs O(n) — practical differences in time complexity
  33. Trying to understand max heapify
  34. Shortest possible depth of a leaf in decision tree (comparison sorting algorithm)
  35. Python Weighted Random [duplicate]
  36. What is the meaning of “exclusive” and “inclusive” when describing number ranges?
  37. What’s a good algorithm to generate a maze?
  38. Intuition for perceptron weight update rule
  39. Easy: Solve T(n)=T(n-1)+n by Iteration Method
  40. What is tail call optimization?
  41. PacMan: what kinds of heuristics are mainly used?
  42. Quicksort vs heapsort
  43. Big-oh vs big-theta
  44. Best case time complexity for selection sort
  45. Trie complexity and searching
  46. What does this definition of contiguous subsequences mean?
  47. Is log(n!) = Θ(n·log(n))?
  48. Is complexity O(log(n)) equivalent to O(sqrt(n))?
  49. Exactly how many comparisons does merge sort make?
  50. Algorithm to return all combinations of k elements from n
  51. How to calculate big-theta
  52. What is the time complexity of while loops?
  53. Merge sort time and space complexity
  54. Intuitive explanation for why QuickSort is n log n?
  55. Calculate distance between two latitude-longitude points? (Haversine formula)
  56. Shuffle a deck of cards in Java
  57. How to calculate time complexity of backtracking algorithm?
  58. Median of Medians in Java
  59. What is a loop invariant?
  60. Hash table runtime complexity (insert, search and delete)
  61. Which is better: O(n log n) or O(n^2)
  62. What is O(log* N)?
  63. Quickselect time complexity explained
  64. What is the proper equivalent of “while(true)” in plain C?
  65. Bellman-Ford vs Dijkstra: Under what circumstances is Bellman-Ford better?
  66. Asymptotic Notation – does n (log n) (log n) simplify?
  67. Difference between Big-O and Little-O Notation
  68. What is the big-O of the function (log n)^k
  69. How to calculate an angle from three points?
  70. Why is O(n) better than O( nlog(n) )?
  71. How to solve: T(n) = T(n/2) + T(n/4) + T(n/8) + (n)
  72. Is there an O(n) integer sorting algorithm?
  73. An example of Best Case Scenario for Quick Sort (Need someone to check if my answer is correct)
  74. how to write a recurrence relation for a given piece of code
  75. Why is merge sort worst case run time O (n log n)?
  76. Why is merge sort worst case run time O (n log n)?
  77. What is the time and space complexity of a breadth first and depth first tree traversal?
  78. Create your own MD5 collisions
  79. Image Segmentation using Mean Shift explained
  80. Finding the median of an unsorted array
  81. Difference between Big-Theta and Big O notation in simple language
  82. What is the difference between bucket sort and radix sort?
  83. How are the following functions O(N^3)?
  84. Difference between O(n) and O(log(n)) – which is better and what exactly is O(log(n))?
  85. Finding all possible combinations of numbers to reach a given sum
  86. Are there any real O(n^n) algorithms?
  87. Sorting an array in C?
  88. Is Dijkstra’s algorithm for directed or undirected graphs?
  89. How to determine if a point is in a 2D triangle?
  90. Modular multiplicative inverse function in Python
  91. Minesweeper solving algorithm
  92. About bubble sort vs merge sort
  93. Time Complexity of Prims Algorithm?
  94. Python: maximum recursion depth exceeded while calling a Python object
  95. What is meant by diameter of a network?
  96. Efficient swapping of elements of an array in Java
  97. Java, Shifting Elements in an Array
  98. hash function for string
  99. Big Oh for (n log n)
  100. A tool for calculating the big-O time complexity of Java code? [closed]

Leave a Comment