dag-break-down-table.md

Step #	Illustration	State of Queue	Pool of workers	Description
1		1,	r,y,g,b	Initial state, node 1 is scheduled for processing
2			y,g,b	Red worker pops up node 1 from the queue and processes it
3		2,3,	r,y,g,b	Red worker finishes with node 1 and pushes all adjacent nodes to the queue
4			r,b	Green and Yellow workers pop up from the queue and process node 2 and node 3
5		5,	r,y,b	Yellow worker finishes processing node 3 and pushes all it's adjacent nodes (it's a single node 5 though) to the queue. Node 3 is still under processing with Green worker.
6			r,y	Blue worker pops up node 5 from the queue and starts processing it
7		6,	r,y,b	Blue worker finishes processing node 5 and pushes node 6 to the queue
8			y,b	Red worker pops up node 6 and attempts processing it
9			r,y,b	Red worker checked if all the nodes that have path to *node 6* were already processed, and nodes *2* and *4* didn't fall into that category, so Red worker simply returns to the pool without processing *node 6*
10		4	r,y,g,b	Green worker finally finishes processing node 3 and pushes node 4 to the queue
11			r,g,b	Yellow worker pops up node 4 and starts processing it
12		6	r,y,g,b	Yellow worker finishes processing node 4 and pushes node 6 to the queue
13			r,y,b	Green worker pops up node 6 and starts processing it
14		7,8,9	r,y,g,b	Green worker finishes processing node 6 and adds all it's adjacent nodes to the queue