Breadth First Search for Directed Graph

38 Views Asked by At

Consider the following graph
image of directed graph

I was asked to list the nodes of the graph in breath-first traversal, starting from node 0.

My result is as follow
Breadth First Search for Graph

I'm not sure about the 2 node. What do I do with nodes that connects like this to a graph and is my answer correct? If not, what is the correct answer.

Thank you.