current position:Home>Special minimum spanning tree problem

Special minimum spanning tree problem

2022-01-26 22:18:10 CSDN Q & A

The phenomenon and background of the problem

n Establish interconnected roads between cities , When the city road is attached to the connected city, add 1, The cost of the road will also double . Solve how to minimize the construction cost of urban roads .
As shown in the figure below ”

img

Operation results and error reporting contents
My solution ideas and tried methods

Use triangulation algorithm to generate the most basic interconnected graph , Using dynamic prim solve , The question is how to distinguish whether other sections of the road should increase the cost

What I want to achieve



Refer to the answer 1:

Hello , I am a little assistant who answers every question , So sorry , This time, you have to answer all your questions , The panel of technical experts timed out and did not answer for you


The number of times to answer all questions deducted from this question , Will answer with questions VIP Experience card (1 A chance to answer every question 、 Shopping malls buy physical books and enjoy 95 A discount ) It will be reissued to your account in the form of .


Because all questions must be answered VIP The experience card is only valid for 1 God , When you need it 【 Direct messages 】 Contact me , I'll reissue it for you .




Refer to the answer 2:

copyright notice
author[CSDN Q & A],Please bring the original link to reprint, thank you.
https://en.cdmana.com/2022/01/202201262218085935.html

Random recommended