Search:

Thank you guys.
I got a piece of sample code here for shortest path, it is working. But I don't understand vertexQueue.remove(v), my understanding is "after executing Vertex u =...

Hi Helloworld922

Thanks for your advice. ..If I really want to try those "ready-to-use" methods, do I just need to put "import org.graphstream.algorithm.Dijkstra" at the top? like import things...

I found these two mehtods getShortestPath() and treeWeight() provided in Class Dijkstra in below link: http://graphstream.sourceforge.net/javadoc/org/miv/graphstream/algorithm/Dijkstra.html
Any idea...

Thank you for your advice. :) Ok, will have two classes.

If the cities are a number of vertexs, and put them into an arraylist, but how to show the connections between them?

Thanks heaps

Thank you helloworld!
Dijkstra on Wikipedia gives below Pseudocode, I am surprised you said their pseudo-code can be used verbatim, it still looks far too simple to me. :o After reading the...

ok, I have read class Dijkstra, I think the mehtods getShortestPath() and treeWeight() sounds useful, but I don't know how to use them.
:) Any chance you could continue to tell me a bit more about...

Hi guys
I got a CHALLENGE here, below question is From the ACM South Pacific Regional Programming Contest 2009. It is a bit long reading, :) hope you have some patience. Will anyone be able to tell...