ok...thanx for correcting... On 8/10/07, Muntasir Azam Khan <[EMAIL PROTECTED]> wrote: > > > > On Aug 10, 9:41 pm, "Manish Garg" <[EMAIL PROTECTED]> wrote: > > in Java...whatever data structure u want...there is a seperate library > for > > that... > > it also provides the inbuilt function to access and manipulate the data > > structure... > > like for tree there is jtree for proirity queue there is one like > proirity > > queue .... > > for knowing this u better use javadoc its well known and standard help > for > > JAVA... > > just search on this and get the package or class name.... > > i hope it will help u... > > > > JTree is actually a GUI component, not a general prupose tree data > structure. The closest thing to balanced binary search trees in Java > are probably the TreeSet and TreeMap containers. > > As for implementing Dijkstra's algorithm in Java, I think Java's > java.util.PriorityQueue class is quite adequate for most purposes. > Other data structures, like adjacency lists or adjacecny matrices, you > will have to implement yourself. But those are trivial to implement in > any language. > > Hope this helps, > Muntasir > > > > >
-- With Best Regards... --------------------- Manish Kumar Garg 09989888591 [EMAIL PROTECTED] --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
