Travelling Salesman Problem - Upper Bound - Minimum Spanning Tree Method

[@adarshsharmanit356]

Thank you nice & short video . Loved it

[@mathshelpwithmrorys8555]

I'm glad it was useful for you.

[@natashadavina7592]

thank you very much!! your video was very helpful

[@divanshmahajan1769]

is the triangle ineqaulity imp for this type of graph and then only can we use it?

[@mathshelpwithmrorys8555]

We do not need to consider the triangle inequality here as we are looking for a tree. If it was a route inspection problem, we may have to consider it.

[@amineahardane999]

and is a lower bound if you dont multiply by 2

[@oranalyst]

Thank you!

[@divanshmahajan1769]

how to code in c++..plz provide code