Minimum spanning tree:given a start and destination, how to travel the whole tree.?given a start and destination, and a minimum spanning tree.
what is the algorithm to travel the whole tree with minimum total weight.
For example, given a MST G and start vertex S and destination vertex D.
Question: show the routine of traveling the whole tree.
best given the call in java.
0 коммент.:
Post a Comment