Reverse-delete algorithm
id:
reverse-delete-algorithm-178-4091007
title:
Reverse-delete algorithm
text:
The reverse-delete algorithm is an used to obtain a from a given connected, It first appeared in but it should not be confused with which appears in the same paper. 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. choosing the best choice which is another greedy algorithm to find a starts with an empty graph
brand slug:
wiki
category slug:
encyclopedia
description:
Minimum spanning forest algorithm that greedily deletes edges
original url:
https://en.wikipedia.org/wiki/Reverse-delete_algorithm
date created:
2007-02-15T05:26:48Z
date modified:
2024-09-04T11:38:36Z
main entity:
{"identifier":"Q4925151","url":"https://www.wikidata.org/entity/Q4925151"}
image:
fields total:
13
integrity:
15