search

codesankalp / dsalgo

MIT License
8 stars 24 forks source link

Dijkstra’s shortest path algorithm(graphs) #26

Open Aryamanz29 opened 3 years ago

HariniJeyaraman commented 3 years ago

Can I work on this issue @Aryamanz29 for hacktoberfest ?

Exter-dg commented 3 years ago

I would like to work on this (C++). Can you assign this to me?

codesankalp commented 3 years ago

Before start working on this issue please explain how you are going to implement this. Also read about packages in the python.

codesankalp commented 3 years ago

I would like to work on this (C++). Can you assign this to me?

Sorry, @Exter-dg this is a package for python.

Biggy54321 commented 3 years ago

Can I work on this issue?

The most common input for any graph problem is giving the total number of vertices (V) and a list of edges, where each edge is nothing but a list/tuple of 3 elements i.e. the (src, dest, weight).

So the dijkstra method will take the above two parameters along with the source vertex and return the distance list.

Biggy54321 commented 3 years ago

Also #18 says about implementing the graph abstraction, however the master branch's code does not have any graph abstraction as such yet, else designing dijsktra method in lines with that would also be possible.