7

The prototypical graph search algorithm Dijkstra's algorithm for finding the shortest paths between nodes in a graph which works for unbounded non-negative weights has a time complexity for $O(|V|^2)$ where $|V|$ is the number of nodes/vertices in a graph which is in $P$. There are special cases where further knowledge (such as heuristics) or the graph ...


Only top voted, non community-wiki answers of a minimum length are eligible