MHB How to figure out the shortest path using dijkstra algorithm?

AI Thread Summary
To determine the shortest path using Dijkstra's algorithm, it's essential to understand the algorithm's mechanics and how to apply it to a graph. Users are encouraged to share their attempts and specific challenges to facilitate constructive feedback. Visual representations of work can help clarify the approach taken. Engaging with the community by demonstrating effort is crucial for receiving effective assistance. Providing a clear context and details about the problem enhances the likelihood of getting accurate guidance.
yakin
Messages
42
Reaction score
0

Attachments

  • Capture.JPG
    Capture.JPG
    9.6 KB · Views: 95
Physics news on Phys.org
What have you tried? What are your thoughts on the problem, are you stuck somewhere? Could you please show a minimum of effort in your questions? :confused:
 
Bacterius said:
What have you tried? What are your thoughts on the problem, are you stuck somewhere? Could you please show a minimum of effort in your questions? :confused:

Actually, i have done my work. Just wanted to know if it is correct. Here is an image of my work.View attachment 2437
 

Attachments

  • DSC01003.JPG
    DSC01003.JPG
    31.4 KB · Views: 97
Last edited:
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top