Lec-42 Dijkstra Algorithm In Hindi | Single Source Shortest Path | Operation Research

#dijkstraalgorithminhindi #dijkstraalgorithmshortestpath
#singlesourceshortestpathusingdijkstra

Connect with me

Hiii.... Today our topic is Dijkstra Algorithm. This Algorithm is used to find the single source shortest path in weighted graph. The graph either be directed or undirected.

Dijkstra's algorithm is an algorithm that is used to solve the shortest distance problem. That is, we use it to find the shortest distance between two vertices on a graph. Depending on what the graph represents, we can find shortest routes, minimum costs, etc. all using this algorithm.

THANK YOU FOR WATCHING

___________________________________________
Please like share comments and subscribe
___________________________________________

To watch more tutorial, press the below link

Ford fulkerson algorithm for max flow problem

How to draw network diagram all basic concepts

Calculation of earliest time latest time float and critical activity

Critical Path Method ( CPM )

Program evaluation and review techniques (pert)

Difference between pert and cpm

Travelling salesman problem

Maximization in assignment problem

for watch more tutorials pls visit the playlist in the channel

playlist of operation research

Playlist of Transportation Problem

playlist of probability for engineering mathematics

Playlist of Data Structure and Algorithm

My YouTube Shorts of Operation Research

Dijkstra Algorithm In Hindi, Dijkstra Algorithm single source shortest path, single source shortest path using Dijkstra Algorithm, single source shortest path algorithm in hindi, Dijkstra Algorithm example, Dijkstra Algorithm In Operation Research,

[Music-bbwx]

Bahot sara video dekha par samajh ni aya lekin apki video dekha to samajh aa gya thankkyou so much ❤️🙏

[AhsanMalik-fj]

Paper sa 20 mint phla dkhna wala hzir ho

[nayanmongia]

finally i understood after searching so many videos. i was about to break my keyboard in rage yesterday cause it was looking so confusing

[dirghpatel]

last ke 2 min aap easy se samja sakte the lekin apne bahut complicated kardiya, KHAN SIR

[navedanjum]

Thank you soo much ❤️❤️ apke vajah se ye subject clear ho gya first time me hi 8.1❤️ sabse jyada dikkat iss subject me hi tha mujhe thank you

[navpreetramgarhia]

Thanks mam for making the future of the new generation 😊

[_abdullahworld]

AP KA VIDEO DEKH K PICHY WALA SARA BHOL GYA . BHT SARI VIDEOS DEKHI SAMAJH A GAI LAKIN APKI VIDEO DEKH K SAB BHOL GYA😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭

[lkls]

Amazing video, I appretiate your explaination

[TechandFun]

Madam queening theory or sequencing bhi kradijiye accha pdhati h aap👍❤️

[nurmohammed]

At first a lot of thanks to you.Every episode is very nice and easy method.Specially operation research's solution is the best.Thank you so much from #Bangladesh❤️❤️❤️❤️❤️

[muhammadosamahanif]

Good explained!
you deserve million views and million subs.

[okgamerzz]

You are amazing teacher I never saw teacher explained in this way every term❤❤❤

[meetmimii]

Thanks alot bht acha smjhaya ap ney ❤️

[TechandFun]

Operation reseacrch apke hi haath m h ab🤗

[ravipatel]

Thnxxx ma'am it's very very helpful.... Now i'm finally understood the concept Thnxxx

[kamakshagupta]

Thank u so much didi for giving me excellent knowledge on this topic and too much love from Nepal 🙂🙂🙂

[MythiliPuttala]

My paper is in 30 min i watched this video in 1.75x speed

[amjadiqbal]

Thank you so. Much ma'am and nice voice❤❤

[pavankrishnatirutullai]

If they ask shortest distance from A to E then what we should consider source vertex "A" Or "E" And slove

[darklightgaming]

Thanks really explained well but what's the need of making that graph at first? We didn't use that in whole question?