The approaches of representing graph impact on the performance of depth-first-search algorithm for traversing a graph. I

[answerhappygod]

The Approaches Of Representing Graph Impact On The Performance Of Depth First Search Algorithm For Traversing A Graph I 1 (223.8 KiB) Viewed 26 times

The approaches of representing graph impact on the performance of depth-first-search algorithm for traversing a graph. Identify which one of the following statements is incorrect. a. An adjacency matrix is useful for some applications, particularly, when the graph G is dense in which the running time of O(n) may be acceptable b. Although depth-first-search may best be thought of as a recursive algorithm, recursion is not the best way to implement it. c. The adjacency matrix is commonly used because algebraic operations on the matrix a can be used to efficiently compute properties of the graph G. d. An adjacency matrix can be considered as an efficient traversal algorithm for a graph because of the reason described in statement c of the above. /2 mark e. An adjacency matrix yields a running time of O(n) time for traversing a graph with n vertices and medges. Of. The adjacency lists would result in a running time of O(n + m) for traversing a graph with n vertices and m edges. Save Answer