Assertion: algorithm | /r/HasProperty | countered with linear θ | e |
Facets:
value: completely
type: DEGREE
Source sentences:
text: In the special case of integer weights and undirected connected graphs, Dijkstra's algorithm can be completely countered with a linear Θ ( | E | ) {