Reduced overhead.Run empirical studies to determine the effect of using primitive types instead of Edge values in EdgeWeightedGraph, as described in exercise 4.3.28.
Exercise4.3.28:
Space-efficient data structures.Develop an implementation of the lazy version of Prim’s algorithm that saves space by using lower-level data structures for EdgeWeightedGraph and for MinPQ instead of Bag and Edge. Estimate the amount of memory saved as a function of V and E,using the memory-cost model of section 1.4 (see exercise 4.3.11).
Exercise4.3.11:
Determine the amount of memory used by EdgeWeightedGraph to represent a graph with Vvertices and Eedges, using the memory-cost model of section 1.4
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.