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: 96
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: 102
Last edited:

Thread 'Value of intuitionistic logic'

I'm taking a look at intuitionistic propositional logic (IPL). Basically it exclude Double Negation Elimination (DNE) from the set of axiom schemas replacing it with Ex falso quodlibet: ⊥ → p for any proposition p (including both atomic and composite propositions). In IPL, for instance, the Law of Excluded Middle (LEM) p ∨ ¬p is no longer a theorem. My question: aside from the logic formal perspective, is IPL supposed to model/address some specific "kind of world" ? Thanks.
View full post »

Thread 'Formal derivation of statement from Peano Arithmetic system'

I was reading a Bachelor thesis on Peano Arithmetic (PA). PA has the following axioms (not including the induction schema): $$\begin{align} & (A1) ~~~~ \forall x \neg (x + 1 = 0) \nonumber \\ & (A2) ~~~~ \forall xy (x + 1 =y + 1 \to x = y) \nonumber \\ & (A3) ~~~~ \forall x (x + 0 = x) \nonumber \\ & (A4) ~~~~ \forall xy (x + (y +1) = (x + y ) + 1) \nonumber \\ & (A5) ~~~~ \forall x (x \cdot 0 = 0) \nonumber \\ & (A6) ~~~~ \forall xy (x \cdot (y + 1) = (x \cdot y) + x) \nonumber...
View full post »

Similar threads

MHB Finding Shortest Path in G: Dijkstra's Algorithm
Replies
2
Views
2K
MHB Applying Dijkstra Algorithm: Solving a Problem
Replies
6
Views
2K
I Dijkstra's algorithm - Shortest Path Query
Replies
2
Views
1K
Comp Sci Shortest path problem in bipartite graph
Replies
1
Views
2K
I Traffic simulation : directed graph including specific rules
Replies
5
Views
2K
B Logic Problem: Figuring Out How Many Apples Each Man Ate
Replies
9
Views
3K
Use greedy vertex coloring algorithm to prove the upper bound of χ
Replies
0
Views
181
MHB Is it the algorithm the optimal one?
Replies
20
Views
4K
Dijkstra's algorithm: choosing which point to begin with
Replies
4
Views
2K
MHB Optimizing Wireless Internet Coverage for Houses: A Greedy Algorithm Approach
Replies
3
Views
2K

Hot Threads

Recent Insights

Back
Top