Suppose that the graph G = (V,E) is represented as an adjacency matrix.

b) Suppose that the graph G = (V,E) is represented as an adjacency matrix. Give a simple
implementation of Prim’s algorithm for this case that runs in O(V2) time.

Leave a Reply