Hamiltonian Path & Cycles in Graphs and Graph Theory

NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we explain about Hamiltonian path and cycle in Graphs.

1. A Hamiltonian path, is a path in an undirected or directed graph that visits each vertex exactly once.
2. Given an undirected graph the task is to check if a Hamiltonian path is present in it or not.

#graphs #algorithms #hamiltonian

[niteshdubey]

I was scared of graph data structures since 3 years and now I'm capable of solving harder problems on graph just by learning graph from your playlist sir... Thank you so much for your content.

[suvigyabasnotra]

Most people come for his teaching... I'm here for his singing!

[sudhanshusharma]

Thank you so much sir for putting such efforts on dry run every time.

[ajmalhussain]

I am became your fan sir. You explain the logic behind code is very logical.

[sounak_dey]

Sir, you can also add 'src' to visited before making the function call from main(), as visited.insert(src);
that way we can put base case as
if(visited.size() == graph.size()) in the function.
Thank you, sir!

[gulshanrajput]

We can also write visited. add(src) ;
Before checking hemiltonian path and cycle condition
So that there is no confusion to taking -1 .

[factswithai]

Ab kya hi bataye, khuda kasam maza sa aane laga hai padne mein jabse mulaakaat hui hai sumeet sir ke content se. Thank u sir, tussi great ho and as i always say "east or west sumeet sir is the best"

[prashuchaudhry]

19:48 or we can pass another parameter names as dest, and when visited.contains(dest) then print the path and return.
like 1. add to the hashset
then 2. base condition
then 3. for loop + recursion.

[hritikanand]

This question was asked in online assessment of Samsung Research for internship

[PankajGupta-ghcm]

we can also write the base condition if the ( psf length == graph.length ) -

[praveenraghav]

One of the best Explanation Dear Sir...Lots of respect and love..❤️

[ghanibhai]

did all graph questions on my own just because of follwing you from start

[XxelitebeautyxX]

Ghazal at 23:07 is Awargi by Ghulam Ali Khan Sahab.

[AnkitSharma-wjtb]

12:00 here comes our indian idol SUMEET sir ... :-)

[mehulbisht]

sir can you make a graph video where you show how to find solution to a SUDOKU puzzle ?
would be really amazing if you do sir ! thanks for all the content !

[SCRIPTSAG]

Sir apne jo base case me cycle hone ke liye jo base case hai jaise ki e. nbr= original sorce esme sir ek dikket hai sir graph ke sare path ko to wo check krega na recursion wali path ko kyo check krega

[lalitjain]

I thought content old hai, then I heard a song from bandish bandits. Thank you so much, sir.

[rohansharma]

kya aapka graph.length-1 se yeh matlab hai ki psf me last vala include ho chuka hai toh ab use visited me true karane ki need khatam agar karaya toh aagey badh jaayega isiliye wahin code rok do base case me .??kuch kuch aisa he karna chah re ho na sir aap>

[procrastinator]

majbur ka english "helpless" 😁 . Nice explanation sir.

[shuddhoshawttoroy]

Is the name of the teacher, Dip Dipankar? He is my senior friend.