STUDY PROBLEM 20 (True/False) DFS can be used to find the connected components of a directed graph . In an undirected graph G with distinct nonnegative edge weights, if we increase all the .The complexity of running Dijkstra's algorithm with adjacency list representation is . The complexity of searching an item in a B-Tree can be the same as the complexity of edge weights by 1, all shortest paths will stay the same. O(VlogE) searching in a BST with a careful design. The following is a valid B-tree for both t-2 and t-3 Bellman-Ford algorithm could be used to find the shortest paths from a node to all other nodes in a graph with non-negative edges. IfT is the MST of the graph G, for every pair s and t in G, the shortest path from s tot in G is the path from s to t in T . anpi, i would be BFS Prim Dijkstra