Programming Dijkstra's Algorithm

I have a question where I'm making my own implementation of Dijkstra's Algorithm (shortest weighed path through a graph). I have a current working version that doesn't need to be marking each vertex (or node or whatever, I think you get my point) as known. I'm not sure exactly if this is going to work correctly 100% of the time, and I was just wondering if anyone knows if its acceptable to not worry about nodes being "known".

I can post code if you'd like, but I was hoping more for a general answer rather than one specific to my own code.

Thanks

[575 byte] By [OneWingdPhoenixa] at [2007-11-27 3:08:26]

«« Problem with JViewport setViewPosition - it doesnt always sets the position
»» How am I able to use an injected EJB in a Managed Bean Constructor?

# 1

So you're saying it sort-a works and you wondering if that's okay?

DrLaszloJamfa at 2007-7-12 3:56:29 >

top of Java-index,Java Essentials,Java Programming...

# 2

Ouch. I deserved that. It works every time I've tested it so far. I was wondering if there was a general situation that could occur where it WOULDN'T work. Ah, and I'm using a PriorityQueue to make sure I'm still running the algorithm itself on the shortest path vertex within the

OneWingdPhoenixa at 2007-7-12 3:56:29 >

# 3

I'm still trying to understand what someone could post that would satisfy your question:it worked on all the tests you've done, but you're wondering if it might fail onan example you haven't tried. Maybe.

DrLaszloJamfa at 2007-7-12 3:56:29 >

# 4

Bahhhh.... You're right. Thanks anyways.

OneWingdPhoenixa at 2007-7-12 3:56:29 >

Java programming resources: FAQs, tutorials, compiler and browser download sites, documentation, books lists, IDEs, etc.

Programming Dijkstra's Algorithm

Java Essentials New Topic

Java Essentials Hot Topic

Java Essentials

All Classified