Lecture12-1_Part11 - Underline the first dotted node on the...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
2. Repeat until no new nodes are marked: Underline first un-dotted node on list, n 1 . 3. For every node of G , v , if v is connected to a marked node, mark it as connected –
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Underline the first dotted node on the list, n 2 . Search edges for ( n 1 ,n 2 ) edge. Implementation 11...
View Full Document

This note was uploaded on 04/30/2009 for the course CSE 105 taught by Professor Paturi during the Winter '99 term at UCSD.

Ask a homework question - tutors are online