Размер видео: 1280 X 720853 X 480640 X 360
Показать панель управления
Автовоспроизведение
Автоповтор
It would be helpful if you could explain how Kirchoff's Matrix Tree Theorem works internally.
You had me right up to the end. I wish you had covered how to solve with 8 as the answer.
You are the best man!!!
you deserve love
Thanku sir. Tommorow I have quiz of this topic surely i will pass bcuz of you
thank u so much millions crores more than that..realy u saved my time yaar........thanks alot
Sir, Please make a video on recurrance relation, how to solve it, how to create it from a given program
Yes sir please.
THANKS FOR THIS EXPLANATION
What about the 5 vertex problem5 rows and 5 cloumns How toh solve determinant than?
Excellent
What if we have 9*9 matrix...how to find its determinant.
use combination formula (edges)C(vertices-1) - no.of loops formed
here no of edges is 5 and vertices-1=(4-1)=3 now 5C3=10-no of loops formed=10-2=8
@@dotenvwithprajjal how number of loops are 2 can you tell?
@@Gaurav-zh4pm see according to Kirchoff 123 form 1 loop and 243 forms 2nd loop
@@dotenvwithprajjal doesn't 1234 makes another loop??
sir,please make a video for kruskal algorithm for mst (explain it's code ).Well known about it's algorithm but lots of students facing problemm while writng code.
super....upload more videos
tnks bro it is very useful
Thanks a lot!
bro u fucking kidding where da hell this formula comes? u awesome bro
please upload how to find running time complexities of algos. thank you
sir if the number of vertices in a graph is 6 how to calculate the number of spanning tree
5*5 determinant which is very complex.
Thanks! You're a life saver, Sire TvT
it was good video! but you skipped a part at the end when you were calculating the determinant..
Thank you a lot sir
thank bro :D
Hello friends ,lol
It would be helpful if you could explain how Kirchoff's Matrix Tree Theorem works internally.
You had me right up to the end. I wish you had covered how to solve with 8 as the answer.
You are the best man!!!
you deserve love
Thanku sir. Tommorow I have quiz of this topic surely i will pass bcuz of you
thank u so much millions crores more than that..realy u saved my time yaar........thanks alot
Sir, Please make a video on recurrance relation, how to solve it, how to create it from a given program
Yes sir please.
THANKS FOR THIS EXPLANATION
What about the 5 vertex problem
5 rows and 5 cloumns
How toh solve determinant than?
Excellent
What if we have 9*9 matrix...how to find its determinant.
use combination formula
(edges)C(vertices-1) - no.of loops formed
here no of edges is 5 and vertices-1=(4-1)=3 now 5C3=10-no of loops formed=10-2=8
@@dotenvwithprajjal how number of loops are 2 can you tell?
@@Gaurav-zh4pm see according to Kirchoff 123 form 1 loop and 243 forms 2nd loop
@@dotenvwithprajjal doesn't 1234 makes another loop??
sir,please make a video for kruskal algorithm for mst (explain it's code ).Well known about it's algorithm but lots of students facing problemm while writng code.
super....upload more videos
tnks bro it is very useful
Thanks a lot!
bro u fucking kidding where da hell this formula comes? u awesome bro
please upload how to find running time complexities of algos. thank you
sir if the number of vertices in a graph is 6 how to calculate the number of spanning tree
5*5 determinant which is very complex.
Thanks! You're a life saver, Sire TvT
it was good video! but you skipped a part at the end when you were calculating the determinant..
Thank you a lot sir
thank bro :D
Hello friends ,lol