Can someone please give me an example of a graph search algorithm that uses a recursion and linked list based stacks to determine a route from a single point on a graph to another single point on a graph?

you can read about DFS or BFS. They can be implemented using recursion.

elaborate your question more if you need more information.

elaborate your question more if you need more information.

I am having trouble returning a dynamic array, because when I return an array of size 2 with only elements A and B. I get something like [A B jjjjjjjjjjjjj]

and a bunch of junk afterwards. It is weird because I have already declared the size of the array to be 2

and a bunch of junk afterwards. It is weird because I have already declared the size of the array to be 2

the returning function knows that the size of array is 2 but whoever gets the return value may not be knowing.. so either terminate the string with a 0 or tell the size of array to whoever is printing it.

Topic archived. No new replies allowed.