Single Source Shortest Path (SSSP) | All-Pairs Shortest Paths (APSP) | |
---|---|---|
Edge에 weight 없음 | Breadth First Search (BFS) | Floyd-Warshall Algorithm |
weight 있고, 음수 weight 없음 | Dijkstra Algorithm | Floyd-Warshall Algorithm |
weight 있고, 음수 weight 있음 | Bellman-Ford Algorithm | Floyd-Warshall Algorithm |
출처: https://shnoh.tistory.com/15
V: vertex(정점) 수
E: Edge(간선) 수
(추가중)