Jul-06-2019, 09:47 PM
Crawling urls is only an example of a graph's breadth first traversal algorithm. You have a pseudo code in wikipedia which you can adapt to python by using a list as ichabod801 suggests, or a
collections.deque
instance, which makes it easy to implement a FIFO.