Example
In the following example green edges are being evaluated by the algorithm and red edges have been deleted.
| This is our original graph. The numbers near the edge indicate their edge weight. | |
| The algorithm will start with the maximum weighted edge, which in this case is DE with an edge weight of 15. Since deleting edge DE does not further disconnect the graph it is deleted. | |
| The next largest edge is FG so the algorithm will check if deleting this edge will further disconnect the graph. Since deleting the edge will not further disconnect the graph, the edge is then deleted. | |
| The next largest edge is edge BD so the algorithm will check this edge and delete the edge. | |
| The next edge to check is edge EG, which will not be deleted since it would disconnect node G from the graph. Therefore, the next edge to delete is edge BC. | |
| The next largest edge is edge EF so the algorithm will check this edge and delete the edge. | |
| The algorithm will then search the remaining edges and will not find another edge to delete; therefore this is the final graph returned by the algorithm. |
Read more about this topic: Reverse-delete Algorithm
Famous quotes containing the word example:
“Our intellect is not the most subtle, the most powerful, the most appropriate, instrument for revealing the truth. It is life that, little by little, example by example, permits us to see that what is most important to our heart, or to our mind, is learned not by reasoning but through other agencies. Then it is that the intellect, observing their superiority, abdicates its control to them upon reasoned grounds and agrees to become their collaborator and lackey.”
—Marcel Proust (1871–1922)