Research Article
[Retracted] Fault-Tolerant Secure Routing Based on Trust Evaluation Model in Data Center Networks
Table 1
Comparison of shortest path algorithms.
| | | Floyd | Dijkstra | Bellman–Ford | SPFA | Double-stack_DFS |
| | Spatial complexity | O(N2) | O(E) | O(E) | O(E) | O(N) | | Time complexity | O(N3) | O(N+E)logN | O(NE) | O(NE) | O(N!) | | Application | Dense graph
Nodes are closely related | Dense graph
Nodes are closely related | Sparse graph
Edges are closely related | Sparse graph
Edges are closely related | Sparse graph
Edges are closely related | | Usage | The optimal path of any two nodes can be obtained by executing once | Once executed, the optimal path from the first node to any node can be obtained | Once executed, the optimal path from the first node to any node can be obtained | Once executed, the optimal path from the first node to any node can be obtained | Once executed, all paths are specified between two nodes | | Spatial complexity | O(N2) | O(E) | O(E) | O(E) | O(N) |
|
|
