I was asking about the sample algorithm that is removing the overlapped node in the hierarchical view. Let me explain first what I am doing.
I am having one main activity. That is having its own child activity and all those child again having their child. means its in a recursive way up to n number according to data that I am getting from the server. Like we can say multilevel hierarchy. Now I have to draw this hierarchy. The graph is ready but some nodes are overlapped somewhere. So I need to remove that overlapping. I had googling the algorithm that removes the overlapping of node. But I am unable to implement that algorithm. If you have any idea about that then let me know. Again thanks for at least replying me. On Oct 6, 5:38 pm, TreKing <[email protected]> wrote: > On Thu, Oct 6, 2011 at 1:17 AM, bhumi kania <[email protected]> wrote: > > Do you have any sample code for that which had implemented the algorithm. > > Do I happen to have sample code that solves *your* problem implementing an > algorithm that you did not explain? No, sorry. > > ------------------------------------------------------------------------------------------------- > TreKing <http://sites.google.com/site/rezmobileapps/treking> - Chicago > transit tracking app for Android-powered devices -- You received this message because you are subscribed to the Google Groups "Android Developers" 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/android-developers?hl=en
