3.(15%) Use an example to explain why Dijkstra's shortest path algorithm cannot be applied to graphs with negative edge weights. In your example graph, please highlight the source and the destination.

6. (15%) Consider an n-node sorted singly linked list L, where the first node (ie., the head) stores the smallest data, the last node (i.e., the tail) stores the largest data, and thenode stores the smallest data. Given the address of L's head and a key, is it possible to search for the key in L in O(logn) time? Please explain your answer.

3.(15%) Use an example to explain why Dijkstra's shortest path algorithm cannot be applied to graphs with negative edge weights. In your example graph, please highlight the source and the destination.

相關申論題

相關試卷