you give undirected weighted graph n node 0indexe represent edge list edgesi b undirected edge connect node b probability success traverse edge succprobigiven node start end find path maximum probability success start end return success probabilityIf path start end return 0 your answer accept differ correct answer 1e5 example 1input n 3 edge 011202 succprob 050502 start 0 end 2output 025000explanation there path start end have probability success 02 05 05 025example 2input n 3 edge 011202 succprob 050503 start 0 end 2output 030000example 3input n 3 edge 01 succprob 05 start 0 end 2output 000000explanation there path 0 2 constraints2 n 1040 start end nstart end0 b na b0 succproblength edgeslength 21040 succProbi 1There edge node