6.4 Hamiltonian Cycle - Backtracking

preview_player
Показать описание
Hamiltonian Cycle using Backtracking

Courses on Udemy
================
Java Programming

Data Structures using C and C++

C++ Programming
Рекомендации по теме
Комментарии
Автор

Thank u so much Abdul Bari Sir..Your Channel is helping a lot to our CSE & IT Department :)

islstudentzone
Автор

I just realised my teacher watches your videos first and then teaches us😂🤦‍♂️

KevinAMathew
Автор

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

dorkCatechol
Автор

You Indians! You are amazing! Thank you for your help. Best Regrads from Turkey!

msafadonus
Автор

sending love and respect from EGYPT, thank you

MiddleEasternInAmerica
Автор

He is absolutely the clearest teacher on YouTube and other online sources. Thank you so much

hollyj
Автор

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.

jayapandey
Автор

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!

dimitarmitranov
Автор

What a wonderful explanation.
Keep going sir. Students needs teachers like you.
-bangalore

yaseenmac
Автор

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

tompower
Автор

There’s a direct entry ticket reserved fr u in heaven fr making me to understand this concept fr my tomorrow algorithm exam 🙃

pravinnaga
Автор

6 years and still one of the best playlist to learn algorithms

Chaitanyat
Автор

Thank you very much ! Your video helped solving one of the major challenges to the project we are doing !

winsont.
Автор

Your algorithm playlist is really so helpful and pretty clear for complex ones, thanks a million sir.

nohaahmed
Автор

Just awesome express your help sir throughout my DAA journey....a lot of respect for you

srijani_mondal
Автор

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.

TusharSingh-unwn
Автор

You rock, Sir. Complex concept is explained simply and clearly.

程龙-bw
Автор

Sir you explain these algorithms so perfectly. I really thank you for helping us in building a strong foundation of algorithms.

thedisciplinedguy
Автор

Sir, You are Pride of Data Structures and Algorithm! A Big Thank You :)

ShivAdiShakti
Автор

After watching your explanation there is no chance to dislike....
Tqq sir

naninani