ขนาดวิดีโอ: 1280 X 720853 X 480640 X 360
แสดงแผงควบคุมโปรแกรมเล่น
เล่นอัตโนมัติ
เล่นใหม่
Thank you 💜✨ brother sema explanation ...😊
Welcome 😊💯💓
Thank you sir it's really helpful ❤
Good explanation 👍
Never give up
Nice..Can't we draw it as a path (shortest) from 1 to 7?
Yes, you can draw......this video also one of the correct method . You can draw or write like this steps
Thank you so much 😊
You're welcome 😊
Awesome video thanks!
Glad you liked it!
thank you sister
Arey it's boy 😂
Bro what about 7 th vertex
Seventh vertex la thaan end aaguthu bro so don't want
Vertex 7 ku calculate pannala?
College students Kum videos upload panunga Naa... datastructures c programming
ohh♦♥♥
Super bro
dijkstra algorithm and grredy algorithm is same? or nar
Yes same
Bro one doubt......Prims kruskal dijkstra ku lam algorithm mattum pothuma illa coading uhm elzhuthanuhmah bro exam kuh....for anna university question
Same doubt bro
Bro ella concept kum coding eluthanum bro...
Ada nalaiki exam na ipathaa pakave seiren ethula coding veraiya 🥺
@@jenovarebolin.j3063As my facility say program is not necessary and also no mark allocated for this subject ( cs3301 Data structure)
@@jiminshiiahjumma6470 yooo ur pfp😭♥️🖐🏻
What about 4th vertex bro???
ME Cse students ku data structures notes upload panunga pls
Good explanation. vertex 2 to 3 cost is 20. why is mentioned as 30.
Because we r finding the shortest path from the source vertex which is 1...from 1 to 2, cost is 10 and from 2 to 3 cost is 20..so the total cost is 30
but we are looking from vertex 2 only bro.. so cost is 20 only right
Atha diagram epadi broo 10,30 podanum
Thanks
Super 😊
Python க்கு சேம் கான்செப்ட் ah
Yeah concept is same...
Bro please explain short and need don't explain too much this small concept this will waste our time
Sure thanks for your feedback
No bro it is best because of some body don't know basic thanks for brief explain@@CONQUERVICTORY
No bro this is usefull last min la prepare panravagalku best uh
Thank you 💜✨ brother sema explanation ...😊
Welcome 😊💯💓
Thank you sir it's really helpful ❤
Good explanation 👍
Never give up
Nice..
Can't we draw it as a path (shortest) from 1 to 7?
Yes, you can draw......this video also one of the correct method . You can draw or write like this steps
Thank you so much 😊
You're welcome 😊
Awesome video thanks!
Glad you liked it!
thank you sister
Arey it's boy 😂
Bro what about 7 th vertex
Seventh vertex la thaan end aaguthu bro so don't want
Vertex 7 ku calculate pannala?
College students Kum videos upload panunga Naa... datastructures c programming
ohh
♦♥♥
Super bro
dijkstra algorithm and grredy algorithm is same? or nar
Yes same
Bro one doubt......
Prims kruskal dijkstra ku lam algorithm mattum pothuma illa coading uhm elzhuthanuhmah bro exam kuh....for anna university question
Same doubt bro
Bro ella concept kum coding eluthanum bro...
Ada nalaiki exam na ipathaa pakave seiren ethula coding veraiya 🥺
@@jenovarebolin.j3063As my facility say program is not necessary and also no mark allocated for this subject ( cs3301 Data structure)
@@jiminshiiahjumma6470 yooo ur pfp😭♥️🖐🏻
What about 4th vertex bro???
ME Cse students ku data structures notes upload panunga pls
Good explanation. vertex 2 to 3 cost is 20. why is mentioned as 30.
Because we r finding the shortest path from the source vertex which is 1...from 1 to 2, cost is 10 and from 2 to 3 cost is 20..so the total cost is 30
but we are looking from vertex 2 only bro.. so cost is 20 only right
Atha diagram epadi broo 10,30 podanum
Thanks
Super 😊
Python க்கு சேம் கான்செப்ட் ah
Yeah concept is same...
Bro please explain short and need don't explain too much this small concept this will waste our time
Sure thanks for your feedback
No bro it is best because of some body don't know basic thanks for brief explain@@CONQUERVICTORY
No bro this is usefull last min la prepare panravagalku best uh