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

#dijkstraalgorithminhindi #dijkstraalgorithmshortestpath
#singlesourceshortestpathusingdijkstra
Connect with me
Instagram : / i._am._arfin
LinkedIn : / arfin-parween
Twitter : / startpracticing
Email : [e-mail]
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
• Lec-40 Ford Fulkerson ...
How to draw network diagram all basic concepts
• Lec-35 How To Draw Net...
Calculation of earliest time latest time float and critical activity
• Lec-36 Calculation of ...
Critical Path Method ( CPM )
• Lec-37 Critical Path M...
Program evaluation and review techniques (pert)
• Lec-38 Program Evaluat...
Difference between pert and cpm
• Lec-39 Difference Betw...
Travelling salesman problem
• Lec-33 Travelling Sale...
Maximization in assignment problem
• Lec-32 Maximization As...
for watch more tutorials pls visit the playlist in the channel
channel: / @startpracticing
playlist of operation research
• Operation Research In ...
Playlist of Transportation Problem
• Transportation problem...
playlist of probability for engineering mathematics
• Probability (engineeri...
Playlist of Data Structure and Algorithm
• Data Structure and Alg...
My TH-cam Shorts of Operation Research
• Operation Research Shorts
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-bb9wx]

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

[@natureofpakistan5662]

Paper sa 20 mint phla dkhna wala hzir ho

[@Ajaykurmi01]

Present 😅

[@natureofpakistan5662]

hhh kn sa paper h@@Ajaykurmi01

[@rono993]

✌️🤣

[@GoogleAccount-wf2lk]

Mahavirwa wala tohra ma.....

[@aaliajabeen3331]

Ye level exist krta h. ?😂

[@lkls987]

Amazing video, I appretiate your explaination power.....

[@navpreetramgarhia1322]

Thanks mam for making the future of the new generation 😊

[@nayanmongia2440]

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

[@CScademy]

Be prepared for CS exam 👍

[@navedanjum6150]

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

[@okgamerzz]

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

[@meetmimii]

Thanks alot bht acha smjhaya ap ney ❤️

[@TechandFun7895]

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

[@muhammadosamahanif0082]

Good explained!
you deserve million views and million subs.

[@nurmohammed5520]

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❤️❤️❤️❤️❤️

[@nomaankhan6498]

Vvgvvvvvvvvvvvvgvvgvvcgvgvvgvvvgvvvvgvvvvvvgvgvvvvggggvvvvv

[@nomaankhan6498]

Vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvgvvvvvv

[@nomaankhan6498]

Gvgvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv

[@divakardaiya7761]

Very good explanation 💓

[@Manu.8]

Brilliant Explaination👏👏Thnkuu Mam 💕

[@CScademy]

Be prepared for CS exam 👍

[@dirghpatel8849]

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

[@TechandFun7895]

Operation reseacrch apke hi haath m h ab🤗

[@ravipatel7835]

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

[@sangrampuri5457]

U r really good at this

[@vamanbhandarkar7676]

Thank you so much 🥰

[@gopal3320]

Great explanation...❤️

[@ozonewagle]

Thank you so much.

[@ADITYA_1303]

Thank You So Much ma'am..!

[@labanidas4318]

Thank you soo much ❤️❤️❤️

[@jayshreeroy6391]

Excellent 😍

[@SohailKhan-pn9lx]

Proper explanation 👍🥳🥳

[@tullurimanjula640]

Excellent explanation.. thank you madam

[@harshuke5831]

Excellent explaination

[@raohussain8741]

Good work keep it mam 👍

[@surbhipaliwal3576]

Wow mam nice very tommorow is my exam and it is very helpful

[@aritraambudhdutta201]

Very Helpful Video!! LOVED IT !!!!

[@CScademy]

Be prepared for CS exam 👍

[@skakramulali6881]

Thank you very much ma'am.really helpful

[@amjadiqbal3230]

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

[@merajghosi331]

Thank you so much ❤❤❤❤

[@harishbhardwaj7816]

Thanks mam apki bajah se paper bada acha ho geya opreation ka....🙏

[@Dhkgbhj12]

Well taught

[@anshugaur500]

Thanku ❤nice explain ma'am

[@siddhantsrivastava7683]

Good explanation

[@er-manishyadav2454]

Amazing

[@yan-rp5sq]

Thanks a ton

[@deepaksinghrajput9818]

Nice 👍👍

[@rudranshusahoo5147]

your voice is so sweet❤😊 👍

[@kamakshagupta5800]

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

[@prathushaprathu5212]

Thank you ❤️❤️

[@ayubkhan2893]

Thankyou so much

[@govindnishad8175]

thank you so much mam well explained....14th date is my exam of dsa . I very understood easily

[@AbdulAziz-wu1ce]

Thank you so much ma'am for this topic. 😊

[@marvelworld5210]

Ma'am jo questions apne truth table bana kar kiya hai last me usko rgpv exam me likh sakte hai kya agr aye to ? Size choti hone se marks to nahi katege ?

[@er-manishyadav2454]

Vry nice

[@gnlohith5965]

Really you explained very well ma'am

[@mohammadehson3065]

Thankyou madam...😇

[@MuhammadNaeem-uc1jk]

Thankuuuuuuuuuuuuuuuuuu mam subha hmara exam hai Dua kijye ga

[@namansharma6479]

Mam please Game theory pr lecture bana dijiye app bhut acha explain krti he..

[@user-dm7xb9ss9n]

thanks a lot mam👌👌👌👌👌👌🏾👌🏾👌🏾

[@ankushkashyap6521]

Mam , Show all the steps.
Just as, EXTRACT-MIN, and Relax all edges leaving.

[@R_w_t]

Will u not explain Decision Theory in operation research?

[@c2ctech336]

Thankyou ma'am ..

[@bhoomikasaxena1789]

well explained....!! but bhot tough lgri h

[@randomdestroyers]

Thanks a lot mam

[@sushantgupta4757]

thank you ma'am

[@ThakurKaranPrakashchand]

Thanks

[@samriddhigupta7611]

Thanks ma'am

[@rajendertanwar1881]

Acha padhaya❤

[@tamannakhan2579]

Thank you so much 🥹❤

[@vinayakpuri3855]

Thanks 👍

[@pokexpro6651]

Paper se 10 min. Phle😅

[@jigargupta9933]

Thankyou!

[@nihalkumar6876]

Tq mam nice explanation

[@RAUTPRADNYIK]

Good Video

[@AadeshingaleOfficial-zl5fd]

Nice Mam 😊

[@Sanjay_kumawat]

Thanx mam

[@nadeenlillahshamaslillah2908]

Good

[@trading-observation]

thanku mam

[@metoyou4]

thank you maam

[@kaushiksuresh1176]

yes

[@darklightgaming4257]

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

[@shivamsingh2496]

Bhai pta chala ho kya use tha to bta do kl exam hai

[@Facts_Agenda]

nice explain

[@nitishkumar-yf6qm]

excellent
autonomas system ka video plz

[@RanjeetKumar-tf1ef]

nice

[@ShubhamKumar-km8pm]

Thanks mam❤

[@introvertvsextrovert747]

Mam plz Playlist bna do , aaj he iske complete

[@user-mr8cw8nn9m]

👍👍👍👍

[@shashankkumar7095]

Thanks ma'am ❤️

[@pavankrishnatirutullai8419]

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

[@tusharthegreatest176]

i think A is source

[@jasdeepkaur6556]

Both we can take it's our choice

[@rupayannath8974]

The source will be A then

[@anilmaurya4400]

If they ask dist btw E to A then we will choose E else A will choosen

[@lavanyasharma8666]

Mam kya aap game theory nhi krwati ???.... wo bhi operation research m aata h naa mam ..plzz btaiye mam 🙏🙏

[@codingchip]

Well explained. What vertex do we have to select when the minimum distance of two vertices are same?

[@shivamshekhar7392]

any one random

[@MythiliPuttala]

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

[@afnainshariff3163]

Thanks mam

[@parthanuj8611]

arey mam kahan chale gaye the aap . main aapko subscribe kar diya

[@ayubkhan2893]

Next Lecture kab Tak AaYeGa

[@er-manishyadav2454]

It is a fabulas sessions

[@rohanthakur3339]

😮😮😮

[@punjabichachi]

My exam is today at 9:30 am now I am leaning at 1:05am

[@Amitalmiya_07]

My exam is today at 1:30PM i am learning at 12:15PM

[@hariomkush77]

Samajh me to kuch nahi aaya lekin sun ke achha laga 😂

[@hemramjayapuria9529]

Shortest rule problem v same hai kya

[@rohitpatel6236]

🎉

[@ashishpaliya9067]

Mam last mai agar 2 vertex bacche hai aur dono ki value same hai (for ex. Suppose dono ki value 8 aai ) toh vese case mai kese solve kare ??

[@itzR4Zza]

To ap us me ksi ek value ko le k sakte ho

[@Savagegirl5635]

Ap jab d se e pr gai ap ne 7+2 kia jab ky pacha ap ne 7 ki juga 4 likha or 5 ko update nhi kia

[@fatimazahra3420]

Bellman fort algorithm kii video ha to share Kr dn z

[@priyeranjankumar1703]

Ma'am please make a video on
spanning tree for finding number of spanning tree of 7 verteces which is not complete graph 🙏🙏

[@kunalpatil4916]

Pradeep giri academy yt channel pr ekdam aasan hai

[@khadijashaikh6248]

yeh apne 2 mathod seh solve kiya haina? aur hamari marzi hum koi bh method used karein?

[@user-cy1xf4cf4p]

Mam I'm a beginner but the question isB to minimum is1not 2E

[@user-db7nm1qf4y]

😘