Hi C# lovers
My question is about Tree and graph in C#
How to implement such structure, which I will need them to compare depth first search, breadth first search and A* .
I found with google some implementation(http://msdn.microsoft.com/en-US/library/ms379572(v=vs.80).aspx) but they use recursive search and I can't move between nodes?
And why there are no one talk about tree and graph with pointer?
Thank you
Selva GanapathyPosted Apr 11, 2014, 11:59 PM
Refer the following article that uses depth first technique
http://www.c-sharpcorner.com/UploadFile/6f0898/simple-and-effective-way-to-find-the-boundary-items-of-a-bin/
Regards,
Selva Ganapathy K