@vzn I want to be a self taught cscientist so I am learning undergraduate math right now I am in very developed country where I am able to access course materials but I don't know where to begin. I have read Bjarne C++ 1400+ page and forgot them kinda completely... Due to my grade is monotonic decreasing since I am usy self teaching due to my parents financial problem is unstable so I am trying to finish it as fast as possible to earn money and do research in this field+math and physics.

I think soon I will not be able to access internet so I must learn this asap so can you provide me course list. I am really serious and persistent to learn it.

I need list of formal books for computer science

And this summer I will try to learn and occupy as much time as I want

My interest is in Robotics, Hacking and Modeling and simulating algorithms though I know nothing about it.

Is there some scheme for a DAG to remain a DAG when adding nodes and edges?

Adding nodes is viable by simply replacing a known edge with two edges in the same direction and a new node in between

It seems difficult to determine valid edges, as checking whether an edge is valid requires a DFS check to see if the To node already has a path to the From node, and doing this repeatedly will be expensive?