Does Dijkstra’s shortest path algorithm work effectively with negative values as edge weights? Justify your answer.
What will be an ideal response?
No. Dijkstra’s shortest path algorithm does not work when the edge weights are negative
values. The reason for this is that the function used for finding minimal path cost (Min
function) does not work correctly due to the addition of edges with negative edge weights. A
simple example of a graph with negative edge weights can prove this fact.
You might also like to view...
What are the challenges in establishing a network connection between two points over a large distance?
What will be an ideal response?
COGNITIVE ASSESSMENT Which of the following is NOT a name of an Android release?
A. Gingerbread B. Ice Cream Sandwich C. Blackberry D. Key Lime Pie
Mission-critical IT systems should be outsourced only if the result is a cost-attractive, reliable business solution that fits the company’s long-term business strategy.
Answer the following statement true (T) or false (F)
What is the name of a program that follows hyperlinks, collecting information about Web sites?
a. daemon b. hacker c. spider d. trawler e. worm