Assertion: algorithm | /r/HasProperty | o(\log n
Facets:
Source sentences:
text: For all undirected, positively weighted graphs, there is an algorithm that finds the target vertex in O ( log ⁡ n ) {\displaystyle O(\log n)} queries in the worst case.