![]() ![]() The idea of using key values is to pick the minimum weight edge from the cut. For every adjacent vertex v, if the weight of edge u-v is less than the previous key value of v, update the key value as the weight of u-v To update the key values, iterate through all adjacent vertices.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |