c++ - Updating a Prims algorithm for Minimum spanning trees -
i need doing c++ or java method prints minimum spanning tree prints minimum spanning tree without of vertices in graph. if min span tree has weight 37 min span tree without edge b has weight 49, , next tree out edge b c has weight 50.
so question is, how can take out arbitrary edges of mst , calculate new 1 without edge minimal time complexity.
Comments
Post a Comment