Which of the following algorithms solves the unweighted single
source shortest path problem?
a. breadth first search
b. Dijkstra’s algorithm
c. Kruskal’s algorithm
d. all of the above
e. none of (a), (b), and (c)
A
Computer Science & Information Technology
You might also like to view...
Turn off the option that prevents accidental log off when [Ctrl-d] key is used
What will be an ideal response?
Computer Science & Information Technology
Adware is a type of spyware
Indicate whether the statement is true or false
Computer Science & Information Technology
When would you use tabular lining figures?
What will be an ideal response?
Computer Science & Information Technology
A ____ repeatedly compares a value being searched for against a name in a list. This process continues until the desired value is found or the list is exhausted.
a. selection sort b. while loop c. sequential search d. binary search
Computer Science & Information Technology