Scribd
Upload
12 views

Assignment 2: Spanning Tree Algorithms

This assignment requires verifying the known time bounds of various spanning tree algorithms by running experiments on random graphs of varying sizes and densities. Specifically, the tasks are: 1. Generate random graphs of different sizes with fixed densities, and different densities with varying sizes. 2. Run Prim's algorithm and the log*n phases algorithm using binary and Fibonacci heaps on the test graphs. 3. Plot the results showing time taken for different graph sizes at fixed densities, and for varying densities and sizes. 4. Determine the graph size where performance of the different algorithms becomes competitive.

Uploaded by

simardeepsingh3
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
12 views

Assignment 2: Spanning Tree Algorithms

This assignment requires verifying the known time bounds of various spanning tree algorithms by running experiments on random graphs of varying sizes and densities. Specifically, the tasks are: 1. Generate random graphs of different sizes with fixed densities, and different densities with varying sizes. 2. Run Prim's algorithm and the log*n phases algorithm using binary and Fibonacci heaps on the test graphs. 3. Plot the results showing time taken for different graph sizes at fixed densities, and for varying densities and sizes. 4. Determine the graph size where performance of the different algorithms becomes competitive.

Uploaded by

simardeepsingh3
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Assignment 2 : Spanning Tree Algorithms

Note : This assignment is to be done individually. Group working is not allowed. Use the FibHeap Library built in first assignment to perform the work. Aim : To verify the known bounds of various spanning tree algorithms subject to changes in Input Graph Density Input Graph Size Data Structures Used The focus of this exercise is to determine experimental evidence of the performance of various spanning tree algorithms on graphs with varying sizes and densities, and with different data structures. The results need to be plotted according to the time taken for graphs of different sizes and fixed densities. Also, in each case you need to determine the size at which performance of different algorithms becomes competitive. Thus, you need to generate random graphs of varying densities and sizes. 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 16-18 : Demos Happy Programming!

You might also like