hi everybody,
i am a new in c and i need your help.
I have to make a sparse array (insert, delete, print). Every node must have 4 pointer(up, down,left,right). Then this array i want to change to a tree with breadth first search algorithm. i am ok with the first part(sparse array)but i can't understand how i'll make bfs algorithm. i searched in the internet and all i found was in pascal. please help me.
Thanks!!!!

Well, that's not so hard to translate the algorithm. I remember I used this algorithm last year, but I haven't got it on my computer, sorry.

Well, what's the problem with it? Do you understand how it works? If yes, what's the problem? It looks pretty simple for me? Maybe your array is not the way you can use in this algorithm? The idea of this algorithm is that you go into the first node, mark it as checked, then select connected nodes to visit on the next loop (probably a vector would be nice for this).
Another, simpler way to do so (and I think that was the way I did last year) is to make a loop from 0 to N-1 (N - a number of nodes, N-1 because the arrays starts at 0) and make another loop in it, which finds the first node, which is not visited and is supposed to be visited. (I had to find the shortest way, so I checked if the way to the node is shorter than the one that exists already.

__________________

How to set up portable C++ IDE (Dev-C++)

Writing in C or C++ is like running a chain saw with all the safety guards removed," — Bob Gray.

Hey, I have tried its not problem .....its easy to use.