A question about BFS in the prossess of generating 2-hop neighbors.

[FairyFali]

Hello, authors.

I have learnt a lot from your code, while I have a question about the bfs function described as follows:

I know the code of create_batch.py lines#259-276 is to achieve breadth-first search and it is effective, but I have a doubt about whether lines#271-273 does not work or not because line#266 q.put((target, graph[top[0]][target])) have put the child node to queue, such that the time of constructing 2-hop neighbors is so long (as you mentioned in previous issues, about 45 minutes), so in my opinion whether we could move line#266 to the next line of if distance[target] > 2: continue to make it work.

Thanks.