วีดีโอ

An eulerian trail does not necessarily start and end at the same vertex; Eulerian trail is a trail where each edge from graph g appears in the trail.

Sir, you may be very knowledgeable... But students like me need teachers who can get dowm to my level

That's great , thanks

Too long. Slow and boring 😮but anyway thank you

fastest man alive:)

well explained

one of few nptel lectures that are actually good.

Thanks for the lecture❤

Please try to make it intersting

I was struggling to understand residual network and augmenting path and went through many many videos. None could explain this concept so clearly as you did. Thanks a lot.

Thanks a lot for the very clear explanations❣

Thanks a lot for the nice lecture

Nice lecture. Thanks a lot♥

Thanks a lot♥

Hello, Do any one know answer for "Does there exist a 3-edge colorable graph with 10 vertices and 20 edges ?"

Thanks a lot for very clear explanation❣

Loop is consider for one edge or two

Very nice sir

Sir your transcript are overlap on your writing plz correct

Thank you sir for the wonderful series of videos .

each occurrence of the vertex in trail T contributes 2 to the degree but not the extremum ones, so their contribution is to be taken as 1, once when you start from it and once when you end over this vertex.

Tq sir.. nice explanation

Tq sir.. very nice explanation..

Aoa

Thank you very much

wow thanks dude you made this concept really clear

Poor presentation

Thanks a lot sir... Amazing teaching sir .... 🎉

Hey math people out there! Do I need any dedicated graphics for running MATLAB. I am second year undergraduate student at Chandigarh University with an inclination towards math research.I am going to buy a laptop under 70k, can you guys suggest something?

Like share and subscribe 🙂

Really, you are the best prof I have seen. You are very clear in your explaination. Thanks very very much for this.

The silence in the video made me question about my existence

thanks

where we get these pdfs?

thanks sir

thanks sir. nice illustration for this hard to read algorithm

Excellent explanation.

Thank you sir!!

feel bad for b2 :(

How the degree of v1 is 3??Why you have counted degree 2 for the corresponding loop??

Sir what is loop?In the first example you said e1,e2 are parallel edges while e6 is a loop.

sir..plse do a video on the Edmond carp algorithm too..if u already had one..plse specify the link

watch at 1.25 x

Thank you sir

19:50

20:03

Thank you sir. These lectures are very nice and understandable.

Watch this video in 2.5x

Thank you sir