Sir This is Siddhartha from Bangalore , Your Courses are even helpful for Data science Preparation ,,,.. Which includes - Linear Algebra + Calculus + Statistics & Discrete mathematics + Geometric - basics - Thank You Sir
00:01 Graph Theory: Weighted Graph & Shortest Path 01:55 Calculating shortest path from vertex A to other vertices 05:13 The shortest path from A to F is A-B-C-D-F with a distance of 9. 06:58 Finding the shortest path between vertices in a weighted graph 09:59 The shortest path from B to C is AC with a distance of 5. 11:35 Finding the minimum distance in a weighted graph using the shortest path algorithm. 14:42 Finding the minimum distance in a graph using weighted edges 16:49 Shortest path from A to D is 4 with intermediate nodes A and B 19:49 The video discusses weighted graphs and shortest paths in graph theory. 21:17 Minimum distance from A to C is 8
Sir in question 2 as the weight of both B and D were same i.e 7, how to know which one to select. because if we use D then the distance till L would be 9????
sir please solve this question🙏🙏🙏🙏🙏🙏🙏 Q. Implement Dijkstra's algorithm step by step on the 8 following graph to find the minimum distance and path from vertex 0 to vertex 4. If weight of edge 7 to 6 is changed from 1 to -1. Will Dijkstra algorithm work on this graph? Justify your answer
SIr, My mam told me diffenrent method like she writes like source and so many things and i undrestand your method so may i use this in my University Exam.....
Q. find the shortest path between a and z in the graph below :
Minimum distance a to z = 8
shortest path = acez
🙏Thank you GP Sir.
same
@@allinone__0 same
Minimum distance (a to z) = 8
Path = a -> c -> e -> z
Thank you sir
correct answar hai
bro can you tell me how ??
@@Kasidhashmi2025 yss
Path is wrong
Z? What! Where is z
Shortest distance A to Z is =8
Shortest path =A,C,E,z
Thanku sir for this wonderful class ❤
sir 8 is correct answer and path is a-c-e-z
correct
Correct
Buddy..🦧 Us Moment 🗿🍺
For which question @Deepak Sharma
Correct
Shortest Distance is : 8 ; and Shortest Path is : a->c->e->z
Shortest distance = 8
Path = a-c-e-z
Thank you so much sir.❤❤
BROOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO
YOU ARE CORRECT !!!!!
YOU ARE THE BEST
Path - acez
Shortest distance - 8
Excellent teaching and explain. ✍️✍️🙏🙏📚
Thank you so much sir 👌👌🙏🙏🔥🤗
correct answer
length = 8 and path = acez
thank you sir for your efforts..
Thanks a lot sir for providing us the best education for free. May your channel grow more and more.🙏
The Minimum Distance is (8)
And the shortest path is (a - c - e - z) Thanks a lot sir 😇
Hi sir. I don't know how we'd pass our engineering mathematics exams without your channel . Thanks a lot.
I have seen many videos of this channel really this teacher make good videos which is very useful for me
So thank you very much sir
minimum distance (a to z) = 8
shortest path = A> c> e> z
Minimum distance from A To Z =8
The path is A>-c>-e>-z=8
Thank You Sir.
Your video is helping a lot.
THANKS GURU JI>>>>>>>>>>
Sir
This is Siddhartha from Bangalore , Your Courses are even helpful for Data science Preparation ,,,.. Which includes - Linear Algebra + Calculus + Statistics & Discrete mathematics + Geometric - basics -
Thank You Sir
Minimum distance (a to z ) is 8
Shortest path is a -> c -> e -> z
Thank you Sir, understood the lecture nicely.
Sir i am Yor big fan....because in a short time you teaches us a lot ...A large no of topics clear in short time....this is very helpfull for me....
he is not clearing anything . he is skipping a lots of topics
Thankyou so much sir. I tried so hard to understand this concept but I was fail. Your lecture made it very easy to understand this concept.🙏
Thanks for this playlist sir , thank you sir
Thank you so much sir ❤️🙏, very helpful video
Shortest distance from a to z is 8
Shortest path from a to z is acez
Answer of the Homework Question : Find shortest path between a & z.
Distance = 8.
shortest path = acez .
.........................Thank you sir 🙏
Thank you sir
Aap bhot achha explain karte ho
Length->8
Path-> a-c-e-z
Thank you sir
You are the best mathematician teacher in youtube channel
00:01 Graph Theory: Weighted Graph & Shortest Path
01:55 Calculating shortest path from vertex A to other vertices
05:13 The shortest path from A to F is A-B-C-D-F with a distance of 9.
06:58 Finding the shortest path between vertices in a weighted graph
09:59 The shortest path from B to C is AC with a distance of 5.
11:35 Finding the minimum distance in a weighted graph using the shortest path algorithm.
14:42 Finding the minimum distance in a graph using weighted edges
16:49 Shortest path from A to D is 4 with intermediate nodes A and B
19:49 The video discusses weighted graphs and shortest paths in graph theory.
21:17 Minimum distance from A to C is 8
thanks ai
Thank You Very Much Sir, Your Way of Teaching is just Ming-Blowing.
Yes bro
Sir, i couldn't thanks for your efforts. Really u are doing the best ❤
Path is acez
Length = 8.
Thank you sir❤❤
Sir you are the Best maths teacher
path=a-c-e-z
shortest distance=8
thanks a lot sir
bro ek baar explain karna please mera ABEZ - 9 aa raha hai
@@RajatSharma-jn3cm bro i think you changed the value of f from 6 to 7 on third last step ....keep it 6 you will the correct answer.
Path :- a,c,e,d
length :- 8
thank you !
A to Z is
= 8
Path = a -> c -> e -> z
acez is a shortest path
Shortest path=8
Path=a,c,ez
And thakyou so much sir this video is very helpful for me ❣️❣️
path is acez and minimum distance is 8 .
thank you so much sir for better understanding ..................
minimum shortest length: (a to z) -> 8 and shortest path is : a-c-e-z
Thank you sir for ur hardwork
Answer to last ques.
shortest path=acez
min.distance=8
ThankYou Sir!!
without you ,i would have ruined everything...thank you so so so soso much sir..
i am from bangladesh.. again so so so much thank you sir
path = acez
Min. distance = 8 (for last given problem)
Awesome Content and excellent explanation sir
Thans sir because you are so powerful explainer
thank you so much sir for posting such a helpful video
Thank you sir,
Easy to understand.
Wahh sir bahot mast samjhaya ❤❤❤
Crucial video for us
Love from KASHMIR
SD : 8
Path : a->c->e->z
thank you so much sir for sharing knowledge .
Path = ACEZ
Minimum distance = 8
Thankyou so much sir.
21:57
Minimum distance between a to z : 8
Shortest Path: acez
minimum distance=8
path=a,c,e,z
Tysm sir bahut hi acche se samj aaya
Sir , Ans of Last Ques is
=> Minimum Distance(a to z) => 8
S0, the sortest path is acez
Pls like my Ans.
Distance: 8 and shortest path=acez
Thank you soo much sir 🙏🙏🙏
U r the best ❤
min distance = 8
path a>c>e>z
Sir in question 2 as the weight of both B and D were same i.e 7, how to know which one to select. because if we use D then the distance till L would be 9????
@@jajabor1957 same doubt do I got the ans pls reply meee?????!!!!
Thank you so much sir for your support
Ans ---- "8" ----- shortest path A-C-E-Z
Dhanyawad guruji ❤
ans 8
path a>c>e>z
22:00 question
solution
distance a to z = 8
shortest path =acez
Shortest distance is 8
Shortest path is a->c->e->z
Gajju sir pyaar ho jata h aapse exam time pr jda hi
Ans -8) path a-c-e-z
shortest distance-8
path-acez
H.M. Graph Theory Q.for shortest path between a and z in the graph for
minimum distance = 8 and
shortest path = acez
at 21:28
I think length is no of edges in path so it would be 3 and distance would be 8
Answer of the question is:=
minimum distance is =8
shortest path= a-->c-->e-->z
if i am not wrong!!!
dhanyawad guru ji!!!
Shortest distance = 8
Path = acez
Thank you so much sir.💖💖
Can you explain?
Last Question's answer: Length = 8
and path between a to z is: acez.
sir please solve this question🙏🙏🙏🙏🙏🙏🙏
Q. Implement Dijkstra's algorithm step by step on the 8
following graph to find the minimum distance and path
from vertex 0 to vertex 4.
If weight of edge 7 to 6 is changed from 1 to -1. Will
Dijkstra algorithm work on this graph? Justify your answer
shortest distance is 8 and the path is a-c-e-z
Shortest distance = 8
Path = a-c-e-z Dhanyabad sir
How?
Distance _8
Path _a,c,e,z
8 , acez..... 😇 Thank you so much sir ❣️❣️💫
Thank you bhaisaab🫶🏻🫶🏻
THANK U SO MUCH SIR
🥰🥰🥰🥰🥰🥰
a->c->e->z =8
Can we update a point even if it is not in direct contact ?
thanks a lot my dear guru jiii
Great Teacher 🎉❤
Thank You sir. 👍
8 shortest distance and shortest path is a-c-e-z
Sortest distance = 8
Sir 🙏ek se jyada shortest path ho sakte h n same minimum distance k sath?
Minimum distance --8 and shortest path --- acez
SIr, My mam told me diffenrent method like she writes like source and so many things and i undrestand your method so may i use this in my University Exam.....
Thank you so much sir
length - 8
path - acez
very very helpful ❤
Sir answer is 8 and path is acez 🙏 thank u sir
a->c->e->z A to Z =8
a to z shortest path is acez
Thank u so much sir 🙏🙏🙏🙏
sir can you plz cover kuratowski theorem and eulers formula also
Amazing 🎉
path = a-c-e-d
distance (a to z) = 8
thankyou sir
answer :
minimum distance is 8
a -> c -> e -> z
Sir For this question shortest path between a and z is 8.
Good afternoon sir 🙏🙏🙏