I know that these two algorithms are used to solve different problems, using the graph of the diJaxra algorithm In order to find the shortest path, Krishkal's algorithm is used to find the MST of the graph.But are they like each other? What is the relationship between them? And what is the relationship between these two authors? Why are they very similar?
These are different algorithms in cruscals you choose the smallest edge in the entire graph ) You can choose Top with the least amount of time in Dizxtra (and remove it from the forward thinking). Naturally, the solution to the problems is quite different. On the one side there is a class of 1 square, by removing any one edge you will get a minimum spanning tree, but the smallest path in the original will be. Well, compared to the pre-crusculla, it is closer to the dizstra. For perfection, Prim always takes the tree to the nearest peak. In contrast, Djaxtra can not ultimately choose the closest peak in the upper part of the set. For example, 1, 2, 3, 1, 2, 4. With the edge of the clock's length a hexagon can be clockwise all the time clockwise. The visual will grow in both ways.
No comments:
Post a Comment