Yes. In this case she wanted to visit the Maximum number of houses so we pick the maximum optimal value in each case. If for some reason she wanted to visit the least number of houses you would pick the lowest value each time.
Looks like it. You would need to calculate it by taking the lowest value each time. In this case she wants to visit the most number of houses so you pick the maximum value each time. Thanks for your comment.
sortest path is SCGIT -->>34
Is it correct or not ply confirm me.
If the question is looking for a shortest value do you just take the smallest values for the value part of the question
Yes. In this case she wanted to visit the Maximum number of houses so we pick the maximum optimal value in each case. If for some reason she wanted to visit the least number of houses you would pick the lowest value each time.
Looks like it. You would need to calculate it by taking the lowest value each time. In this case she wants to visit the most number of houses so you pick the maximum value each time. Thanks for your comment.