Results are out! Find what you need...fast. Get quick advice or join the chat
x

Unlock these great extras with your FREE membership

  • One-on-one advice about results day and Clearing
  • Free access to our personal statement wizard
  • Customise TSR to suit how you want to use it

Differences between Prim's and Kruskal's algorithms?

Announcements Posted on
Rate your uni — help us build a league table based on real student views 19-08-2015
  1. Offline

    ReputationRep:
    I've read the Edexcel D1 textbook over and over, and I can't get it clear in my head what the difference is between Kruskal's and Prim's algorithms for finding minimum spanning trees.

    Can anyone clarify?
  2. Offline

    ReputationRep:
    Kruska's builds a minimum spanning tree by adding one edge at a time. The next line is always the shortest (minimum weight) ONLY if it does NOT create a cycle.

    Prims builds a mimimum spanning tree by adding one vertex at a time. The next vertex to be added is always the one nearest to a vertex already on the graph.
  3. Offline

    ReputationRep:
    The attachments are from an OCR (MEI) cheatsheet but I am sure Edexcel will tackle these questions in the same way.

    Hopefully, they make the different methods simple enough.
    Attached Thumbnails
    Click image for larger version. 

Name:	kruskal.GIF 
Views:	8001 
Size:	21.6 KB 
ID:	23571   Click image for larger version. 

Name:	prim.GIF 
Views:	7348 
Size:	18.6 KB 
ID:	23572  
  4. Offline

    ReputationRep:
    Prim always joins a "new" vertex to an "old" vertex, so that every stage is a tree. Kruskal's allows both "new" to "new" and "old" to "old" to get connected, so it risks creating a circuit and must check for them every time. So Kruskal's has a larger complexity than Prim.
  5. Offline

    ReputationRep:
    (Original post by James)
    I've read the Edexcel D1 textbook over and over, and I can't get it clear in my head what the difference is between Kruskal's and Prim's algorithms for finding minimum spanning trees.

    Can anyone clarify?
    Here you find the best answer: http://stackoverflow.com/questions/1...ruskal-vs-prim

    However, try and understand each algorithm - wikipedia is a good start.
  6. Offline

    ReputationRep:
    (Original post by declique)
    Here you find the best answer: http://stackoverflow.com/questions/1...ruskal-vs-prim

    However, try and understand each algorithm - wikipedia is a good start.
    Sorry, you're a bit late.

    5 years late.
  7. Offline

    ReputationRep:
    (Original post by tehforum)
    Sorry, you're a bit late.

    5 years late.
    Are you from the late police? This is the 3rd result in Google for "prim kruskal" so I didn't do it for the OP but for the people who get here from Google results.
    But, yes... assume I don't know to read when this was posted.
  8. Offline

    ReputationRep:
    (Original post by declique)
    Are you from the late police? This is the 3rd result in Google for "prim kruskal" so I didn't do it for the OP but for the people who get here from Google results.
    But, yes... assume I don't know to read when this was posted.
    Oh sorry, my mind reading machine wasn't working at that precise moment.

    My bad.
  9. Offline

    ReputationRep:
    Prim's is easier to draw.

    Aside from that, Prim's selects edges only from the set of edges that are adjacent to those you have already put in your tree. Kruskal's selects edges from the set of all possible edges.
  10. Offline

    ReputationRep:
    (Original post by edmundwillis)
    The attachments are from an OCR (MEI) cheatsheet but I am sure Edexcel will tackle these questions in the same way.

    Hopefully, they make the different methods simple enough.
    you sir may have just got me the B I need in maths!
  11. Offline

    ReputationRep:
    i like Prim's... i used not to like the matrix method but it is OK now

    one of my textbooks says you should also check that Prim's does not form a cycle but i guess that is just a mistake.

    Prim's reminds me of Pimms...
  12. Offline

    ReputationRep:
    then why is prims algorithm easily adapted to a distance matrix??

Reply

Submit reply

Register

Thanks for posting! You just need to create an account in order to submit the post
  1. this can't be left blank
    that username has been taken, please choose another Forgotten your password?
  2. this can't be left blank
    this email is already registered. Forgotten your password?
  3. this can't be left blank

    6 characters or longer with both numbers and letters is safer

  4. this can't be left empty
    your full birthday is required
  1. By joining you agree to our Ts and Cs, privacy policy and site rules

  2. Slide to join now Processing…

Updated: January 20, 2013
TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

New on TSR

Rate your uni

Help build a new league table

Poll
How do you read?
Study resources
Quick reply
Reputation gems: You get these gems as you gain rep from other members for making good contributions and giving helpful advice.