It is the reverse of Kruskal's algorithm, which is another greedy algorithm to find a minimum spanning tree. This algorithm is a greedy algorithm, choosing the best choice given any situation. The set of these minimum spanning trees is called a minimum spanning forest, which contains every vertex in the graph. If the graph is disconnected, this algorithm will find a minimum spanning tree for each disconnected part of the graph. It first appeared in Kruskal (1956), but it should not be confused with Kruskal's algorithm which appears in the same paper. The reverse-delete algorithm is an algorithm in graph theory used to obtain a minimum spanning tree from a given connected, edge-weighted graph. Minimum spanning forest algorithm that greedily deletes edges
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |