Please enable JavaScript.
Coggle requires JavaScript to display documents.
(M12) CHAPTER 9 (9.3) - Coggle Diagram
(M12) CHAPTER 9 (9.3)
DIJKSTRA'S ALGORITHM
SINGLE-SOURCE SHORTEST-PATHS PROBLEM
WEIGHTED AND CONNECTED GRAPH
USES TO
TRANSPORTATION PLANNING
PACKET ROUTING IN COMMUNICATION
SOCIAL NETWORK
SPEECH RECOGNITION
DOCUMENT FORMATTING
ROBOTICS
COMPILERS
AIRLINE CREW SCHEDULING
DIRECTED OR UNDIRECTED GRAPHS WITH NO NEGATIVE WEIGHTS
DO NOT ACCEPT NEGATIVE WEIGHT
FIND THE SHORTEST WAYS TO THE GRAPH'S VERTICES FROM A SOURCE, IN ORDER
SIMILAR TO PRIM'S ALGORITHM
TEMPORAL EFFICIENCY
MATRIX
Θ(|V²|)
LISTS
O(|E| log |V|)
CAN BE IMPROVED WITH FIBONACCI HEAP