Hi all!
I'm veeeery new to C++. and honestly, I thought a lot before putting this post due to some comments I read in this forum which made me a little bit worried that I might receive some (let say) half answer(s) or a "punch to the face" replies, sorry to say that it is I'm really worried that I would receive a reply that would make me unmotivated to work on programming. Anyhow, I hope the message is clear.
Let us cut to the chase. I would like to know how would I pass a graph or state from a graph (either DFS or BFS is used) to a binary tree which would be also producing a state to be used in a Simulated Annealing algorithm. In other words, first phase, graph traversal, second, tree traversal. And finally, Simulated Annealing. Would it be possible to pass a state from the graph to the tree then finally so the Simulated Annealing algorithm to check for a better solution?
By the way, I already found a BFS code and also found a binary tree code, still cannot figure how to pass the graph to the tree though.
Important note: I would like to note again that my knowledge of C++ and it's terminology is not much, please try to use simple terms or explanation when replying if possible, your suggestion is much appreciated