Directed acylic graphs: longest paths
Vložit
- čas přidán 26. 09. 2017
- To access the translated content:
1. The translated content of this course is available in regional languages. For details please visit nptel.ac.in/translation
The video course content can be accessed in the form of regional language text transcripts, books which can be accessed under downloads of each course, subtitles in the video and Video Text Track below the video.
Your feedback is highly appreciated. Kindly fill this form forms.gle/XFZhSnHsCLML2LXA6
2. Regional language subtitles available for this course
To watch the subtitles in regional languages:
1. Click on the lecture under Course Details.
2. Play the video.
3. Now click on the Settings icon and a list of features will display
4. From that select the option Subtitles/CC.
5. Now select the Language from the available languages to read the subtitle in the regional language.
Thanks a lot ! Simple and efficient teaching techniques. Much appreciate that
best tutorial on graphs I have find so far.
Thanks for the video!! Amazing!
Thanks for your explanation!
Muchas gracias, a pesar de estar en inglés se entendió súper bien :)
extremely helpful, thanks a lot
My first child will be named Design and Analysis of Algorithms you beautiful god
haha
Thanks for the video! It was extremely useful :)
yeah
thanks for this awesome video, final exam will use it
Thank you so much sir.. It helps me most.. I am preparing for CMI entrance..
Very well explained.
Excellent:)))
Good video for Computer Science - Foundation of Algorithms
Nice
How can we prove that there's always a longest path in an acyclic graph?
It's not a theory to prove. It's a fact noted.
Can someone please share related problems to this topic.
you can do Love babbar's DSA cracker sheet... It's very useful !
Why + 1?
Ужасный индийский акцент