- #1
yakin
- 42
- 0
How to figure out the shortest path using dijkstra algorithm?
Click For Summary
SUMMARY
The discussion centers on the implementation of Dijkstra's algorithm for finding the shortest path in a graph. Participants emphasize the importance of demonstrating effort when seeking help and validating the correctness of the algorithm's implementation. The conversation highlights the need for clarity in presenting work, such as sharing images or code snippets, to facilitate constructive feedback. Ultimately, the focus is on ensuring that users understand the algorithm's mechanics and can effectively apply it to their specific problems.
PREREQUISITES- Understanding of graph theory concepts
- Familiarity with Dijkstra's algorithm
- Proficiency in a programming language (e.g., Python, Java)
- Basic knowledge of data structures (e.g., priority queues)
- Implement Dijkstra's algorithm in Python using the heapq module
- Explore graph representation techniques (adjacency list vs. adjacency matrix)
- Learn about time complexity analysis of Dijkstra's algorithm
- Investigate alternative shortest path algorithms (e.g., A* algorithm)
Students, software developers, and data scientists interested in algorithm design and optimization, particularly those working with graph data structures.
- #2
Nono713
Gold Member
MHB
- 615
- 4
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? 
- #3
yakin
- 42
- 0
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?
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
Last edited:
Similar threads
- · Replies 2 ·
- · Replies 6 ·
- · Replies 2 ·
- · Replies 1 ·
- · Replies 5 ·
- · Replies 9 ·
- · Replies 20 ·
- · Replies 4 ·