If you define a sparse graph, its | E |=O (| V |), for such a figure, which kind of DFS better implementation time efficiency, is the realization of the use of adjacency matrix, and the realization of using adjacency list?