inline42

@kboyarinov, Thanks very much! Please, is it not recommended because of performance? Because at the end of the day I can connect the two graphs using a common queue and...

@anton-potapov fixed it! But I don't know how to do it in premake. @anton-potapov I don't know the difference between source and other options.

thanks so much

@kboyarinov Thanks very much, but reading the descriptions, they don't clearly state that the graph nor the context will go back to there initial state, meaning construction state i.e. no...

@kboyarinov I see what you mean and I thought about it, the nodes will be destroyed when the session ends. A session is an instance giving the user the possibiliy...

@kboyarinov Thanks very much. "If all of the nodes are destroyed, the stored node list is empty" [btw, destroyed I mean here deleting them as my starting point are pointer...

@kboyarinov Yes, my design is as what you desribed. **Thanks very much!! I think I got my answer.** About: "Also, is it implied that the user may have several opened...

OK! Thanks very much :)

I mean the thread will be doing the while looping while the queue is empty and this what I mean by ressources, the thread doing nothing but just looping because...

Thanks so much!! Will check the async_node and see if I can include it. I think maybe I describe in details what I am doing. The goal is to implement...