In original krushal's algorithm, we were including edges till it doesn't form a cycle in increasing order of weight. This will ensure maximum weight edge in a cycle is never included.
Here, if there is a cycle then to get MST we will always like to delete edge with maximum weight,
So both are effectively doing the same thing.
Useful read: http://www.geeksforgeeks.org/reverse-delete-algorithm-minimum-spanning-tree/