Solved

A Classic Algorithm That Calculates a Least-Cost Path Through a Network

Question 100

Multiple Choice

A classic algorithm that calculates a least-cost path through a network is ____ algorithm.

A) Dijkstra's maximum-cost
B) Dijkstra's longest-path
C) Turing's longest-path
D) Dijkstra's least-cost

Related Questions

Q91: Circuit-switched networks were designed primarily for voice

Q92: A wide area network connects its workstations

Q93: _ and virtual circuit networks require path

Q94: Most wide area networks use some form

Q95: _ avoids congestion by requiring users to

Q96: _ and distributed routing are methods for

Q97: Many of the same technologies and communications

Q98: A _ area network is typically confined

Q99: SONET rings typically have a failover time

Q101: _ are advertised as networks with very