Method path

HackerEarth_problems/Edges on a path/solution.py:64–79

(self,x,y)

    #parent arr means for given edge V -- > u in arr[u] = v

    def path(self,x,y):
        q = deque()
        visited = [False] * (self.V)
        q.append(x)
        parent = [-1] * (self.V)
        while(len(q)>0):
            u = q.popleft()
            for v in self.graph[u]:
                if(v == y):
                    visited[v] = True
                    parent[v] = u
                    return parent
                if(visited[v] == False):
                    q.append(v)
                    visited[v] = True
                    parent[v] = u