Assertion: algorithm's complexity | /r/HasProperty | depend on the data structure
Facets:
Source sentences:
text: The complexity bound depends mainly on the data structure used to represent the set Q. In the following, upper bounds can be simplified because | E | {\displaystyle |E|} is Θ ( | V | 2 ) {\displaystyle \Theta (|V|^{2})} for any graph, but that simplification disregards the fact that in some problems, other upper bounds on | E | {\displaystyle |E|} may hold.