Assertion: algorithm's implementation | /r/CapableOf | run time
Facets:
Source sentences:
text: A simple implementation of Prim's, using an adjacency matrix or an adjacency list graph representation and linearly searching an array of weights to find the minimum weight edge to add, requires O(|V|2) running time.