Posted by: atri | October 3, 2012

A clarification on Q2 in HW 4

This was brought up by some of you, so I thought it would be best to share it with everyone.

You cannot assume that any pair of BPFs are connected by a friendship path. In other words, you algorithm should also work in the case when for the input instance there exists pairs for whom the friendship distance is not defined. (For such pair you do not have to satisfy the distance compatibility property.)

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: