Assertion: algorithm | /r/HasProperty | the number of vertices
Facets:
Source sentences:
text: Using a simple binary heap data structure, Prim's algorithm can now be shown to run in time O(|E| log |V|) where |E| is the number of edges and |V| is the number of vertices.