DP with Bitmasks : Travelling Salesman Problem(2-D DP)

#1

Here in the problem statement we said that we can start from any vertex and we have to return to that vertex after visiting all of the nodes----but in the code we have kept our source vertex as the first vertex only i.e. the vertex A-----Why?

#2

hello @ankur8632
answer is not going to change even if we change the vertex.
pls check the tsp video Prateek bhaiya has explained it .