Assertion: algorithm | /r/HasProperty | made for graphs of even greater density
Facets:
Source sentences:
text: For graphs of even greater density (having at least |V|c edges for some c > 1), Prim's algorithm can be made to run in linear time even more simply, by using a d-ary heap in place of a Fibonacci heap.