Minimum Possible Stress Level of a Path

Problem Statement

You have a weighted undirected graph with graph_nodes nodes and m edges. The stress level of a path between two nodes is defined as the weight of the heaviest edge in that path. Given a source node source and a destination node destination , find the minimum possible stress level of a path. If no such path exists, return -1. Example Consider the following example below, where source=1 and destination=3. There are two paths, from node 1 to node 3. The max weighted edge/stress level in path 1 -> 2 -> 3 is 200. The max weighted edge/stress level in the path 1 -> 4 -> 3 is 20. Return 20, the lower stress level from the second path. Function Description Complete the function getMinimumStress in the editor with the following parameter(s): int graph_nodes: number of nodes int graph_from[m]: one end node for an edge int graph_to[m]: one end node for an edge int graph_weight[m]: the weights of the edges int source: the source node int destination: the destination node Returns int: t