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. --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
