Reverse Delete Algorithm Graph Theory (1 results)

Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The reverse-delete algorithm is an algorithm in graph theory used to obtain a minimum spanning tree from a given connected, edge-weighed graph. If the graph is disconnected, this algorithm will find a minimum spanning tree for each disconnected part of the graph. The set of these minimum spanning trees is called a minimum spanning forest, which contains every vertex in the graph. This algorithm is a greedy algorithm, choosing the best choice given any situation. It is the reverse of Kruskal''s algorithm, which is another greedy algorithm to find a minimum spanning tree. Kruskal''s algorithm starts with an empty graph and adds edges while the Reverse-Delete algorithm starts with the original graph and deletes edges from it. The algorithm works as follows: Start with graph G, which contains a list of edges E. Go through E in decreasing order of edge weights. For each edge, check if deleting the edge will further disconnect the graph. Perform any deletion that does not lead to additional disconnection.…