GRADER

Name:
Login ID:
Student ID:
Discussion section number:
===============================================================================
Does your program compile without errors?


Have you tested your program on mingus.eecs?


Which is faster on a large dense graph--your implementation of PrimSparse or
of PrimDense?  Explain why.


Which is faster on a large sparse graph--your implementation of PrimSparse or
of PrimDense?  Explain why.


When you dynamically recompute the MST (in PrimSparse) upon adding an edge to
the graph, there are two cases:  the MST changes, or it does not; give timings
for both cases.  How much faster is this than recomputing the graph from
scratch?


When you dynamically recompute the MST (in PrimSparse) upon removing an edge
from the graph, there are two cases:  the MST changes, or it does not; give
timings for both cases.  How much faster is this than recomputing the graph
from scratch?