Assertion: expression's number | /r/HasProperty | considered
Facets:
Source sentences:
text: This is similar to a situation which arises in graph algorithms: the Bellman–Ford algorithm and Floyd–Warshall algorithm appear to have the same running time ( O ( | V | 3 ) {\displaystyle O(|V|^{3})} ) if only the number of vertices is considered.