00:05 Hamiltonian cycle is a problem of finding a cycle that visits every vertex exactly once in a graph. 02:32 There are multiple Hamiltonian cycles possible in a graph 04:47 Hamiltonian cycles are not possible in a graph that contains articulation points and pendent vertices. 07:18 The Hamiltonian algorithm starts from vertex 1 and tries to form a valid path. 09:47 The algorithm checks for cycles in an array. 12:09 The method is to use the mod function to get the values in a specific pattern. 14:23 There are two possible Hamiltonian cycles in the given example 16:34 The Hamiltonian cycle algorithm works by recursively checking for cycles in a graph. hope this helps
sir, you are a mind blowing teacher. While studying any of your tutorials, i have got no doubts though i had no prior knowledge on the topics. Thank you for making these videos.
Sir, I just want to say, that this is the first Indian scientist who teaches programming or mathematics with an accent I am willing to listen to. Great English, great explanation. Good Job!
Sir thank you. .your teaching was excellent. .what ever your concept logic is to good for student understanding. After watching your videos we are confident about the concept. .
I had never saw the content like that and the way you explain the algorithm is like a boom fire....Yeah I realize and it is true that if a teacher is expertise in that perticular subject then no one subject is hard for student.
Exact same question, answer and method in my college notes means my teacher first watches Abdul sir's video and then teach us😂 Thank you Sir for such a good explanation 😊
Very nice explainations sir....This is first time studying,can't understand some topics in this subject...But ur class and explaination, give more clear and good pronounsation to understand...thankq so much sir...continue🙏
Thank you so much sir! Made my day.. really was'nt able to find appropriate notes that articulates the main thing which is in fact way easier than rather complicatedly mentioned in regular classses.
Sir can you do a video on Edit Distance and Counting Inversion problems? I love your work and would really want to see these topics covered by you, you're simply magical
Abdul Sir, you are explaining stuff really well. Can you make videos on Dynamic Programming and how to tackle those problems in top-down and bottom up approach!
thank u so much sir.. you have outstandin way of teaching... finally i cleared on some other Daa topics by your lectures... once again thank you so much
Mr. Bari, I successfully implemented this algorithm in Java for directed graphs, slightly complicated by the fact that Java arrays are 0-based, the algorithm is 1-based though. Anyway, thank you very much. Would you mind telling me the origin of this algorithm, ideally putting a link into the video's description? Is there any scientific paper or other credible source explaining the algorithm? I am trying to get it accepted into a scientific graph library, but that requires an academical source.
You Indians! You are amazing! Thank you for your help. Best Regrads from Turkey!
love from india
indians have no understanding of the material
@@SuperMaDBrothers which material ?
Thank u so much Abdul Bari Sir..Your Channel is helping a lot to our CSE & IT Department :)
Physics students too by learning classical algorithms and trying to find an efficient quantum algorithm for the same problem.
@@sohamparmar4976Pardon my ignorance,do you guys learn these things too?
00:05 Hamiltonian cycle is a problem of finding a cycle that visits every vertex exactly once in a graph.
02:32 There are multiple Hamiltonian cycles possible in a graph
04:47 Hamiltonian cycles are not possible in a graph that contains articulation points and pendent vertices.
07:18 The Hamiltonian algorithm starts from vertex 1 and tries to form a valid path.
09:47 The algorithm checks for cycles in an array.
12:09 The method is to use the mod function to get the values in a specific pattern.
14:23 There are two possible Hamiltonian cycles in the given example
16:34 The Hamiltonian cycle algorithm works by recursively checking for cycles in a graph.
hope this helps
so useful, thx a lot
👏🏻👏🏻👏🏻
Thank you ❤
Thank you bro❤
I just realised my teacher watches your videos first and then teaches us😂🤦♂️
Same here😂😂
same here... our teacher even recommended us to watch his playlist
@@ZapySolo, your teacher is a good person.
All teachers who watch him and then teach are good learner's ...
lol same
He is absolutely the clearest teacher on UA-cam and other online sources. Thank you so much
sir, you are a mind blowing teacher. While studying any of your tutorials, i have got no doubts though i had no prior knowledge on the topics. Thank you for making these videos.
6 years and still one of the best playlist to learn algorithms
sending love and respect from EGYPT, thank you
this man is exact definition of "teacher"
I watch your videos first thing in the morning , as they say, To make your whole day better do something good after you wake up.
Sir, I just want to say, that this is the first Indian scientist who teaches programming or mathematics with an accent I am willing to listen to. Great English, great explanation. Good Job!
What a wonderful explanation.
Keep going sir. Students needs teachers like you.
-bangalore
Too much respect Teacher from Ethiopia ❤❤❤😊😊
There’s a direct entry ticket reserved fr u in heaven fr making me to understand this concept fr my tomorrow algorithm exam 🙃
Your algorithm playlist is really so helpful and pretty clear for complex ones, thanks a million sir.
welcome
Sir, You are Pride of Data Structures and Algorithm! A Big Thank You :)
Thank you very much ! Your video helped solving one of the major challenges to the project we are doing !
Just awesome sir.......can't express your help sir throughout my DAA journey....a lot of respect for you sir.....🙏🙏🙏🙏
Hello how are you 😊
Paying lakhs to college but still studying in UA-cam 🤧
Bcoz UA-cam does not give you the degree
Sir you explain these algorithms so perfectly. I really thank you for helping us in building a strong foundation of algorithms.
You rock, Sir. Complex concept is explained simply and clearly.
u stand
my teacher directly playing this playlist in class.
😂
Vidyaniketan students,hit the thumbs here to show thankfulness to sir at the last moment.
After watching your explanation there is no chance to dislike....
Tqq sir
So you were disliking before, without watching the video?
watching this class from brazil, amazing teacher!
I just realised that this is the only way to learn my subject because our teacher never teaches us
As always the best teacher on internet!!
Thank you so much Sir! You do an amazing job at explaining these concepts. Much appreciation in the US!
do u understand hindi
Thank you sir, 🙏🏼 you explained well as nobody else did yet..but it is a NP - complete problem!
Sir thank you. .your teaching was excellent. .what ever your concept logic is to good for student understanding. After watching your videos we are confident about the concept. .
i had given up on exams, until i saw your tutorials sir thankyou very much :)
I had never saw the content like that and the way you explain the algorithm is like a boom fire....Yeah I realize and it is true that if a teacher is expertise in that perticular subject then no one subject is hard for student.
Abdul, based on the information in Corman's book, Travel Salesman and H-Cycle problems are NP-Complete. 1:30 you mentioned it's an NP-hard problem
NPC is both NP-hard and NP problem
This will help me in my semesters which is due tomorrow!!
Assalamua'likum, sir. Love from University of Dhaka. Your explanation is way too good Alhamdulillah, and really helpful as well.
sir i always found everyone blessed you for what you are doing
this is some epic stuff !! the way of explanation is just amazing !
great teaching skill. simply rocking sir,
Thanks sir today my design and analysis of algorithms exam they asked this question . ❤
Is it me or does this video look normal in 2x speed??????
you not alone.
Really, impressive. You explained perfectly.
You make complex things dead easy... Kudos Sir
I just realised i watch your videos first and then teach my teacher
u are the teacher of our teacher's
best explanation ever
Gr8 work sir
very nice and clearly explained..
I wish I had a sir like this irl
Wow amazingly clear explanation. Very good teacher
Exact same question, answer and method in my college notes means my teacher first watches Abdul sir's video and then teach us😂
Thank you Sir for such a good explanation 😊
Wow the best explanation anyone can give. thank you so much.
This way of describing algorithm is very easy to understand
*simply,rocking sir*
you are the best teacher i have ever seen
i realised that our college teachers teach us after learning from these videos
Very nice explainations sir....This is first time studying,can't understand some topics in this subject...But ur class and explaination, give more clear and good pronounsation to understand...thankq so much sir...continue🙏
you are always with me in my shower before an exam. 🚿
He's also with me in the exam 😊
Let me also join 😄, ill also bring mausam 👉👈
@@syedaaryan5985STAY AWAY from my mausam. he makes me wetter than the shower
I wish you would show us the code for every other problem like you do in this particular one. Very nice explanation!
I want to be a teacher like you....your vedios help me a lot to teach DAA.☺
Thank you so much sir......it was the best explanation one could ever get
great teaching sir👍👍👍
You are amazing! Thank you for your help. Best Regrads from syria
Thank you🙏, Sir your teaching very useful for AI students.
For Revision start at : 7:00
thanks for the algorithm... love your teaching style Sir..
Very helpful and good explanation 👍
Sir ur videos Are very helpful for us....
thank sooo much! explained so clear for us students.您配享太庙。
It was clear and clean,thanks a lot sir
I am preparing for the exam. Thank you so much for your lesson.
Great job sir....!! Tqsm for making Daa so simple and easy to understand!
Sir thank you very much for making it understable and easy
a goldmine in youtube
Thank you so much sir! Made my day.. really was'nt able to find appropriate notes that articulates the main thing which is in fact way easier than rather complicatedly mentioned in regular classses.
Sir can you do a video on Edit Distance and Counting Inversion problems? I love your work and would really want to see these topics covered by you, you're simply magical
doing in 9 mins
Clearing my subjects with good marks only because of you and gate smashers 😂🛐
Teacher of Teachers.
keeping spreading knowledge and love sir.... Thanks for this video course.
Thank you very much. I don't think anyone could explain it in better words.
Abdul Sir, you are explaining stuff really well. Can you make videos on Dynamic Programming and how to tackle those problems in top-down and bottom up approach!
You are the saviour sir😊
Best ever explanation.....Thanks sir.....😇😇😇😇
Thank you, thank you, thank you, thank you sir. you are a god sent
thank u so much sir.. you have outstandin way of teaching... finally i cleared on some other Daa topics by your lectures... once again thank you so much
sir your teaching style is very nice i am underatanding easily keep it up sir
Thank you sooo much sir .... Just made it very clear ❤❤❤❤❤❤
Thanks, you carried my assignment :D
I wish google had a double like or triple like option for ur videos
Controlling function is itself the permutation it will use graph only as lookups
It was really really helpful. Thank you so so so much.
I loved your teaching techniques sir.
Keep going.
thank you, uni student from syd.
Mr. Bari, I successfully implemented this algorithm in Java for directed graphs, slightly complicated by the fact that Java arrays are 0-based, the algorithm is 1-based though. Anyway, thank you very much. Would you mind telling me the origin of this algorithm, ideally putting a link into the video's description? Is there any scientific paper or other credible source explaining the algorithm? I am trying to get it accepted into a scientific graph library, but that requires an academical source.
could you share the code??
Amazing explanation, Thank you!
Thanks a lot abdul sir . Liked that you explained the written code as well. Pls try and do it for all problems .
Very Helpful. Thank you sir
Its really very help full...thank u so much sir
Thanks for teaching very well with smile face .we understand your teaching..if you please say important semester year qns of daa
U r truly a great guy sir, respect
It is very helpful for me 👍👍
Very Nicely Explained.Thanks a lot sir....
Why we took k
impressive sir,u'll reach heights sir