MIT 6.046J / 18.410J Introduction to Algorithms - Fall 2005

Lecture 19: Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson

author: Erik Demaine, Center for Future Civic Media, Massachusetts Institute of Technology, MIT
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 10, 2009, recorded: November 2005, views: 33708
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)

Switch off the lights

Slides

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.

Lecture popularity: You need to login to cast your vote.

Description

"-- shortest paths. This is the finale. Hopefully it was worth waiting for. Remind you there's a quiz coming up soon, you should be studying for it. There's no problem set due at the same time as the quiz because you should be studying now. It's a take-home exam. It's required that you come to class on Monday. Of course, you'll all come, but everyone watching at home should also come next Monday to get the quiz. It's the required lecture. So, we need a bit of a recap in the trilogy so far. So, the last two lectures, the last two episodes, or about single source shortest paths...

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Reviews and comments:

1 mohammad manafi, August 9, 2010 at 5:29 p.m.:

thanks for lectures

2 Salman86, July 1, 2019 at 11:38 a.m.:

Hello guys have to getting the batter function for follow here http://documentswindows10.com and I believe there will be many people who share my views when they read this article from you.

Write your own review or comment:

Comment:
Name:
Email address:
URL:

make sure you have javascript enabled or clear this field: