Longest Simple Path - Intro to Algorithms

preview_player
Показать описание
Рекомендации по теме
Комментарии
Автор

you made me your fan when you started explaining why the shortest path wont have any repetitions lol

tarifm
Автор

The terminology clashes a little with most books on graph theory in regards to use of the word "path". Nothing said was wrong, but most texts use different wording to keep things separate. Most would say that the path with repeated edges and vertices is a walk. The term path is normally reserved for meaning that there are no repeated vertices and by extension no repeated edges.

krwowfreak
Автор

Hey, there
But isn't a path a walk where no edge is repeated

ahmedal-maqtari
Автор

why there is one guy who disliked this tutorial. it is a great explanation :(

YanuarTriAdityaNugraha