What kind of graph does Dijkstra's algorithm solve?
a. Weighted graph
b. Acyclic graph
c. Directed cyclic graph
d. Adjacency list
a. Weighted graph
Dijkstra's algorithm solves the weighted graph problem for the shortest path provided the weights are positive.
You might also like to view...
You can use the ________ statement to make decisions.
Fill in the blank(s) with the appropriate word(s).
Which feature of the Analysis ToolPak is best suited to determine if samples were taken from the same population?
A) ANOVA B) Correlation C) Histogram D) Descriptive Statistics
Which of the following consists of the policies, procedures, and resources required to ensure that a business can continue to function after a major catastrophe that renders the site unable to operate?
A. Business continuity B. Disaster relief C. Enterprise backup D. Data recovery policy
Totals that are summed one at a time in a loop are known as what type of totals?
A. decremented B. incremented C. derived D. accumulated