Hello there,

I need you guys help on implementing Prim's algorithm..I have read about 40 pdf's and I am ashamed to find them confusing with their freaking symbols..I need some English algorithm..

I understand I can use a priority queue or an array..

I want to start with a priority queue but I don't understand how the pq should be stored..

if the priority queue is a binary tree.does that mean the parent nodes must be smaller than the child nodes, since I am finding minimum weights?

How do I represent the edges..the tree? Array or linked list?

If you can provide intuitive steps in solving the problem..I would appreciate it.. thanks.