Title: Add "Find the Shortest Path in a Weighted Graph" question

[leotran20]

Initiative (Required)

Hacktoberfest 2024 🎃

Is your feature request related to a problem? Please describe.

no

Describe the solution you'd like.

Find the Shortest Path in a Weighted Graph

You are given a weighted graph with 5 nodes (A, B, C, D, E) and the following edges:

From	To	Weight
A	B	4
A	C	2
B	C	1
B	D	5
C	D	3
C	E	2
D	E	1

Find the shortest path from node A to node E using Dijkstra's algorithm.

Requirements:

1. Implement Dijkstra's algorithm in Python.
2. Use a priority queue to efficiently select the next node.
3. Return the shortest path and its total weight.

Output:

Shortest path: A -> C -> E
Total weight: 4

Add any other context or screenshots about the feature request here.

No response

[github-actions]

@leotran20

It's great having you contribute to this project

Thanks for opening this Issue 🙌 , Welcome to SkillShow 💖 We will review everything and get back to you.
Make sure to give a star to this repo before making a fork! Thank you :)

[Ghanshyam-07]

I can solve this issue. @Kushal997-das, please assign it to me

[github-actions]

Hi @leotran20 👋, your issue #21 has been successfully closed ✅. Thank you for your valuable contribution! 🙌