I just don't get DAG and I can see that they keep pushing nodes onto a stack and use examples of A-Z
but what makes node 'B' a neighbor of 'A' and is this stack passed from node to node with the results all being
send back to participating node.

Whats stops node 'Z' from having a direct connection to node 'B' because I don't understand how the
order is created for flow control if nodes "N,O,P" join the network at a later date.

Feels like I am missing something that maybe useful here and even if the order was based on
converting a public key to a Bigint to give direction then new connections would need to be created
and old ones removed at a huge rate of speed

Sorry, it's just not sinking in.