3650. Minimum Cost Path with Edge Reversals

A directed weighted graph. You may traverse edges in their direction for their weight, and also "reverse" an edge (traverse against its direction) for double the weight. Find the minimum cost of a…