In the code given , graphs paths are generated from source to destination. DFS algorithm has been used. But this code generates proper path from source to destination if all the inputs for the graph is unique.
like :
if I have a graph 4 4. And inputs are
0 1 2 3
4 5 6 7
8 9 10 11
12 13 14 15
Then it create graph paths properly. There is a children array which is used to create the graph paths. But now I need to give input as below:
row and column:
4 4
0 2 3 100
1 3 1 2
2 999 998 4
997 101 101 5
Here in this input, in some nodes I have used same input at different [login to view URL] is actually my requirement. I have to create paths of this kind of graph. In my code what I did, can generate correct path if nodes are not repeated as I have given in the previous example. But now need to edit the code so that , correct graph paths can be generated for the second example also.
Hi I am a computer science graduate working in C, C++ since past 7 years. Contact me to discuss your project further. I assure speedy delivery of the code.
I am willing to work on this project. I have gone through the details and if i get hired i assure you of total satisfaction with proper time management. The Bid amount is negotiable. I will be ready to work for further projects as well.