Lec 17 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005

[TheOlliey]

Nobody wants to sit in front of the camera, :(

[NganaJHone]

I am very happy to see the vidoe from you, hopefully the others also are happy for You Lecture 17: Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search

[Ondelendo]

Steady I Really Like This Video Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search

[bebeheuy]

Good, I like that you share this video Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search, I wish success always

[willamricard]

Nice Video Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search That You Share , So Very Nice Thanks You

[imegatrone]

I Really Like The Video From Your Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search

[bundawartini]

Your Video Is Very Useful Sharing Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search

[anakmudajaman]

after i watched this video, my insight is very open because the video is very good to give information

[PurpleGrumpyBear]

Thanks for sharing



[litinha19]

outfit belongs to the school..he must wear all the time..

[firework25]

When in the hell is anyone gonna use this? He lost me one minute in.

[stackcycler]

@firework25

Google Maps and navigation systems in your car use this kind of algorithms to find the shortest path from you current location to your destination, because the road network can be seen as a giant path, so there's at least one important application (there are many more)

[necrowizzard]

is it even possible for a path to go out and into S? (like seen around 1:07)

if a node along a path is outside of S and a subsequent node on the same path is inside S, wouldn't the whole shortest path be also in S?

i mean since this particular node was added to S, every previous node would have been added to S as well?

(maybe i forget some cases?)

[Cammie010]

BFS at 1:21

[carnevil09]

I work as a network administrator and deal with OSPF/dijkstra's algorithm all the time. Its great to know the complexities which run our systems on a second to second basis.

[pkercov07]

For Dijkstra example skip to 36:30

[Cammie010]

@pkercov07 thanks

[toolhog10]

This Guy is in a documentary on Origami called, BETWEEN THE FOLDS. Him and his dad both work at MIT. I recommend that documentary, it is pretty awesome even though at first glance it looks boring. Go to the PBS pbs.org/independentlens/betwee­n-the-folds/people.html

Thumbs this up so it gets to the top!!

[aHmEdShErIfZeIn]

Why did he say "It's the best ways we know how to solve going from A to B is to solve how to go from A to everywhere else." , isn't that why algorithms like A* exist , also you can always terminate the search if you reach your target node (B) ??

[koaxmetal]

@aHmEdShErIfZeIn I think he meant that there is no known algorithm to find a single shortest path that is faster than the algorithm to find all shortest paths (either dijkstra's or A* which is essentially improved Dijkstra's). Terminating the search is fine, but its not really a different algorithm, just a slight modification.

[aHmEdShErIfZeIn]

@koaxmetal Ah , I See , Thanks =)

[AntonTheOmniscient]

I envy you so much, students of MIT. This is how real programmers are being born...

[jhonnatan1620]

que abusivo ! xD

[rickylove831]

This is so cool! Have you seen the interactive transcript? I wish my school did this :)

[navid07]

instructor teaches very well. he is awesome. I like the way he uses the board. powerpoint sucks !

[nightwolfff666]

cooollll!! thanks!

[mylove1618]

wow.

[speedemon1234]

how to get from alderon to cambridge...lol

Such a Star wars geek, but good at algorithms!

[somrules]

really nice...

[0shravan0]

helped me a lot! though I wonder why is this prof wearing the same outfit all the time!

[WikiPeoples]

@0shravan0 because he's a true computer science nerd

[shokoluv]

nice.

[bluepilljunkie]

very helpful, thanks