Reverse-delete Algorithm: Graph Theory, Minimum Spanning Tree, Kruskal's Algorithm - Tapa blanda

Reverse-delete Algorithm

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. Thereverse-delete algorithm is an algorithm in graph theory used to obtaina minimum spanning tree from a given connected, edge-weighed graph. Ifthe graph is disconnected, this algorithm will find a minimum spanningtree for each disconnected part of the graph. The set of these minimumspanning trees is called a minimum spanning forest, which contains everyvertex in the graph. This algorithm is a greedy algorithm, choosing thebest choice given any situation. It is the reverse of Kruskal'salgorithm, which is another greedy algorithm to find a minimum spanningtree. Kruskal's algorithm starts with an empty graph and adds edgeswhile the Reverse-Delete algorithm starts with the original graph anddeletes edges from it. The algorithm works as follows: \* Start withgraph G, which contains a list of edges E. \* Go through E in decreasingorder of edge weights. \* For each edge, check if deleting the edge willfurther disconnect the graph. \* Perform any deletion that does not leadto additional disconnection.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 76 pp. Englisch. Nº de ref. del artículo: 9786131259715

Contactar al vendedor