you give undirecte connect weighted graph consist n vertex m edge Lets denote length short path vertex 1 vertex d_i you erase edge graph k edge remain Lets vertex good exist path 1 length d_i erase edgesyour goal erase edge way number good vertex maximize