1514. Path with Maximum Probability

class Solution {
    public double maxProbability(int n, int[][] edges, double[] succProb, int start_node, int end_node) 
    {

        double[] max = new double[n];
        max[start_node] = 1.0;

        for(int i=0; i<n-1; i++)
        {
            boolean visited = false;

            for(int j=0; j< edges.length; j++)
            {

                int u = edges[j][0];
                int v = edges[j][1];

                double prob = succProb[j];

                if(max[u] * prob > max[v])
                {
                    max[v] =  max[u]*prob;
                    visited= true;

                }

                if(max[v] * prob > max[u])
                {
                    max[u] = max[v]*prob;
                    visited = true;

                }


            }

            if(!visited)  break;


        }

        return max[end_node];

        
        
    }
}