Search:

Thank you for your explanation

yea, they have the same distance, so Prim's algorithm will choose which path first? If we start the tree from A, so the next one is B, C or D?

For prim's algorithm, if a vertice have the same weight to other vertices, so which one will it be choosen to put in the tree?
For example

A to B is 3
A to C is 3
A to D is 3
B to C is 3
B to...