This preview shows page 1. Sign up to view the full content.
Unformatted text preview: For a fixed density, generate graphs of different sizes and run Prim's algorithm and the log *n phases algorithm using a binary and Fibonacci heaps on the test graphs generated. Work out the same process for different densities. Plot the results obtained for varying densities and varying sizes(for each density) i.e Input Graphs of different sizes, fixed density. (for atleast 5 different densities) The assignment includes usage of Fibonacci Heap Library developed in assignment 1 of the course. The marking will thus be based on the complete system submitted on the deadline mentioned below. Submissions : A) Nov 4 : Design Document including descriptions for graph generating techniques employed B) Nov 15 : Final Code Submission. C) Nov 1618 : Demos Happy Programming!...
View
Full
Document
This note was uploaded on 03/09/2011 for the course CSE 630 taught by Professor Snm during the Spring '11 term at Indian Institute of Technology, Delhi.
 Spring '11
 snm
 Algorithms, Data Structures

Click to edit the document details