What is <worst-case performance> of <Dijkstra's algorithm> ?
[]
What is the worst-case performance of Dijkstra's algorithm?
SELECT DISTINCT ?q WHERE { resource:Dijkstra's_algorithm property:worst-case_time_complexity ?q }
select distinct ?answer where { ?statement <http://www.w3.org/1999/02/22-rdf-syntax-ns#subject> <http://wikidata.dbpedia.org/resource/Q8548> . ?statement <http://www.w3.org/1999/02/22-rdf-syntax-ns#predicate> <http://www.wikidata.org/entity/P3752> . ?statement <http://www.w3.org/1999/02/22-rdf-syntax-ns#object> ?answer. }
select distinct ?answer where { wd:Q8548 wdt:P3752 ?answer}