# 8.5. Quiz ## Complexity Explain the worst-case complexities of the following algorithms in terms of `V` and `E` according to our implementations: * Prim's algorithm * Kruskal's algorithm * Chu-Liu-Edmonds' algorithm ## Comparison Provide an example of a graph where Prim's and Kruskal's algorithms find different minimum spanning trees from the same graph and explain how these trees are found. If you cannot find an example, explain why these algorithms always find the same minimum spanning tree given the same graph. {% hint style="info" %} Different MSTs can be found from the same graph only if there are multiple edges with the minimum weight for any of which can be polled from the priority queue. Consider cases where the `compareTo()` method is overridden differently from the original implementation. {% endhint %} ## Report Write a report `quiz7.pdf` that includes the complexity and comparison analyses. --- # Agent Instructions: Querying This Documentation If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question. Perform an HTTP GET request on the current page URL with the `ask` query parameter: ``` GET https://emory.gitbook.io/dsa-java/minimum-spanning-trees/exercises.md?ask= ``` The question should be specific, self-contained, and written in natural language. The response will contain a direct answer to the question and relevant excerpts and sources from the documentation. Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.