The minimum spanning tree links all node point or vertices of the network with the minimum length of all arcs. In this procedure find the minimum spanning tree of a network using greedy algorithm. If the network are not connected the solution, called a minimum spanning forest is a combination of minimum spanning trees formed on the connected subsets.
But the algorithm is used in application such as transportation networks like computer networks and water networks when the tree connecting all node must have minimum length.
No comments:
Post a Comment
To support my learning I ask you to comment as follows:
1. Something positive - something you like about what I have shared.
2. Thoughtful - A sentence to let us know you actually read/watched or listened to what I had to say
3. Something thoughtful - how have you connected with my learning? Give me some ideas for next time or ask me a question.
Note: only a member of this blog may post a comment.