In the case of adjacency list, the time complexity of BFS would be O(n + e), where e = |E| is the total number of edges. Note that the number of edges of any graph varies from 0 to n2, assuming no self-loops and no multiedge between two nodes. Thus, worst case time ...
The complexity of the algorithm can be expressed as O(n2) [18]. In order to solve the problem of automated guided vehicle (AGV) access path planning in the smart garage and overcome the shortcomings of the traditional Dijkstra algorithm such as high time complexity, large search range, and ...