Maximize the distance through every edge

#1

i didnt got that every edge** approach. actually if i consider first edge and i send first vertex to other side it may goto right next to it, then when i consider edge somewhat in middle then i am sending all 6 to other side(including that first one), then this may contradict?
Please explain.

#2

how this will contradict??
if 1 will pass the first edge then it may also pass through middle edge

if anybody will change it’s position he has to travel through edge
so in this approach we are considering each edge and calculating cost for every edge

if you have not satisfied yet then take some examples and try to find answer using this approach

you will understand

i hope this helps
if yes hit a like and don’t forgot to mark doubt as resolved :grinning:
if you have more doubts regarding this feel free to ask