[NEW ALGORITHM] - Dijkstra Algorithm (GRAPHS)

[ananydev]

Issue will be closed if:

1. You mention more than one algorithm. You can create a separate issue for each algorithm once the current one is completed.
2. You propose an algorithm that is already present or has been mentioned in a previous issue.
3. You create a new issue without completing your previous issue.

Note: These actions will be taken seriously. Failure to follow the guidelines may result in the immediate closure of your issue.

---

Name: Dijkstra Algorithm(GRAPHS)

About:

Given a weighted, undirected and connected graph where you have given adjacency list adj. You have to find the shortest distance of all the vertices from the source vertex src, and return a list of integers denoting the shortest distance between each node and source vertex src.

Labels:

new algorithm, gssoc-ext, hacktoberfest, level1

---

Assignees:

• Contributor in GSSoC-ext
• Want to work on it

[ananydev]

KINDLY ASSIGN THIS TASK TO ME . I AM REALLY INTERESTED IN WORKING ON THIS ALGORITHM .
THANK YOU .
ANANY DEV