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...
On 8/10/07, Varun S V <[EMAIL PROTECTED]> wrote: > > Graphs are represented by adjacency matrix or list representation has to > be used. U have to use any of these two as they are the standard > representation. > > On 8/9/07, PicO <[EMAIL PROTECTED]> wrote: > > > > > > how can i use Dijkstra with heap ... how the heap can find the next > > unvisited element to check , as the distance is changeable every time > > with the minimum one ? > > > > On Jul 20, 9:36 pm, TheTravellingSalesman < [EMAIL PROTECTED]> > > wrote: > > > I'm using Java programming language and I'm trying to implement the > > > shortest path algorithm. > > > > > > One thing I'm struggling with is how do I represent nodes and edges in > > > > > Java. Don't know of too many Java classes for Graph theory. > > > > > > Also, what kind of data sturcture should I use. I was told that Queue > > > is fast enough......... > > > > > > Any comments/suggestions are more than welcome. > > > > > > > > > > -- 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 algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
