Route between nodes

1class Solution:
2    def routeBetweenNodes(self, s, e):
3        visited = set()
4        return self.dfs(s, e, s, visited)
5    
6    def dfs(self, s, e, node, visited):
7        if not node: return False
8        if node == e: return True
9
10        visited.add(node)
11        for neighbour in node.neighbours:
12            if neighbour not in visited: 
13                if self.dfs(s, e, neighbour, visited): return True
14        return False