Dijkstra_Algorithm (single-source shortest paths)

[Zeuidon]

Given a directed or undirected weighted graph with vertices and edges. The weights of all edges are non-negative and a starting vertex is also given. So this algorithm helps in finding the lengths of the shortest paths from a starting vertex to all other vertices, and output the shortest paths themselves.

Languages :-

• [ ] C
• [x] C++
• [ ] Python
• [ ] JAVA

Non-Code :-

• [x] add a README
• [ ] add images

Comment the language you want to make the code in. One person will be allowed to work on one language only.

[Dhruv031003]

@Zeuidon you can solve this and please comment the language you'll be working in And do read the CODER_INSTRUCTIONS

[PakaVishwaTeja]

please assign this task to me!, I want to write algorithm in c++ language

[Zeuidon]

@Dhruv031003 ThankYou for assigning the issue. Will be writing the code in C++.

[Dhruv031003]

@PakaVishwaTeja You can work in any lang other than C++, please comment the language you'll be working in.

[Zenith-Mind]

please assign this task to me i will write it in java language

[secretkontributer]

please assign the task to me i will write the code in c#

[secretkontributer]

i can do it c also

[secretkontributer]

can any1 pls guide me this my 1st time here on github