COS 212 Stuff

Use at own risk

Sunday, 27 April 2014

Minimum spanning tree

Finding MST using Kruskal's algorithm

Another algorithm for finding the MSP is Prim's algorithm.
There are cases where there might be more than one possible minimum spanning tree

Posted by InfraMouse at 21:18
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

Search This Blog

Labels

  • topological ordering (2)
  • topological sorting (2)
  • topsort (2)

About Me

My photo
InfraMouse
View my complete profile

Topics

  • ►  2013 (3)
    • ►  April (3)
  • ▼  2014 (19)
    • ▼  April (7)
      • General Sorting Stuff
      • Counting Sort
      • Bubble Sort
      • Selection Sort
      • Insertion Sort
      • Topological Stuff
      • Minimum spanning tree
    • ►  May (5)
    • ►  June (6)
    • ►  August (1)
  • ►  2015 (4)
    • ►  March (1)
    • ►  April (1)
    • ►  May (2)
  • ►  2016 (1)
    • ►  March (1)
  • ►  2024 (1)
    • ►  May (1)
Simple theme. Powered by Blogger.