Posted by: atri | October 2, 2010

Lect 14: Trees

In today’s lecture we defined trees and proved that a tree with n vertices has exactly n-1 edges. The slides have been posted.

Next lecture, we will study the Breath First Search (BFS) algorithm. This material is from Section 3.2 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: