Assignment 03 - DFS cycle detection

Assignment 03 - DFS cycle detection - O | V |(and hence...

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

View Full Document Right Arrow Icon
COMP 271: Design and Analysis of Algorithms Fall 2007 Assignment 3 Assigned: 27/9/07 Due Date: 4pm, 4/10/07 Question 1 : Design an algorithm to determine whether an undirected graph G = ( E,V ) contains a cycle. The running time of your algorithm should be
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: O ( | V | ) (and hence should not depend on | E | ). Prove the correctness of your algorithm. Notes : You can discuss homework question with your classmates, but you must write up your answers independently. Acknowledge the people with whom you have discussed the assignment. 1...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online