Did you mean Shortest path from one node to another Use BFS i think we can find the shortest path
On Tue, Jun 14, 2011 at 5:37 PM, Raghavan <[email protected]> wrote: > Hi, > How to find the shortest path in a 4-ary tree in an optimal way? > > Node tree{ > Node *left,*right,*top,*bottom; > int val; > }; > > Let the above given be the tree structure. > > -- > Thanks and regards, > Raghavan.K.L > <http://in.linkedin.com/in/raghavankl> > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Sunny Aggrawal B-Tech IV year,CSI Indian Institute Of Technology,Roorkee -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
