Posted by: atri | October 16, 2010

Lect 20: Computing Topological Sorting

In today’s lecture, we looked at an algorithm to compute the topological sorting of a DAG. The slides have been posted.

In Wednesday’s lecture, we will start looking at greedy algorithms, which is Chapter 4 in the book.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Categories

%d bloggers like this: