815. Bus Routes

We have a list of bus routes. Each routes[i] is a bus route that the i-th bus repeats forever. For example if routes[0] = [1, 5, 7], this means that the first bus (0-th indexed) travels in the sequence 1->5->7->1->5->7->1->... forever.

We start at bus stop S (initially not on a bus), and we want to go to bus stop T. Travelling by buses only, what is the least number of buses we must take to reach our destination? Return -1 if it is not possible.

Example:
Input: 
routes = [[1, 2, 7], [3, 6, 7]]
S = 1
T = 6
Output: 2
Explanation: 
The best strategy is take the first bus to the bus stop 7, then take the second bus to the bus stop 6.

Note:

• 1 <= routes.length <= 500.
• 1 <= routes[i].length <= 500.
• 0 <= routes[i][j] < 10 ^ 6.

直接DFS，遍历每个group，一次性把group里面的所有点都遍历完，记录也是记录某个group有没有visited过

from collections import defaultdict
class Solution:
    def numBusesToDestination(self, routes, S, T):
        """
        :type routes: List[List[int]]
        :type S: int
        :type T: int
        :rtype: int
        """
        if S==T: return 0
        d = defaultdict(set)
        for i,l in enumerate(routes):
            for t in l: d[t].add(i)
        
        res = 1
#        step = {}
        vis = set()
        q,qq=[],[]
        for t in d[S]: 
            vis.add(t)
            q.append(t)
        while q:
            while q:
                g = q.pop()
                for t in routes[g]:
                    if t==T: return res
                    for tg in d[t]:
                        if tg not in vis:
                            vis.add(tg)
                            qq.append(tg)
            q,qq=qq,q
            res+=1
        
        return -1