Question: write code in C language. There are N cities and M bidirectional roads. The i-th road connects city A, and city B,, and the cost




write code in C language.
There are N cities and M bidirectional roads. The i-th road connects city A, and city B,, and the cost of passing it is C. You have a VIP card, that can let you go through any road for free. The VIP card can be used only once. Your objective is to travel from city 1 to city N. Find the minimum possible total cost.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
