Unformatted text preview: 4 UG/ 5 Grad. Write a linear algorithm to determine if an input undirected graph is a tree or not. Programming Project 2 Points: 20 Due: October 5 Submission: Commented source code and a sample run on hard copy. In class demo. UG. Implement the critical path finding algorithm where an eventnode graph is the input. You must use heap. Grad. (Use of Matlab is encouraged) Implement the strongly connected component detection algorithm....
View
Full
Document
This note was uploaded on 02/10/2012 for the course CSE 5211 taught by Professor Dmitra during the Spring '12 term at FIT.
 Spring '12
 Dmitra
 Algorithms

Click to edit the document details