Modify the dfs. java program (Listing 13.1) to use adjacency lists rather than an adjacency matrix. You can obtain a list by adapting the Link and LinkList classes from the linkList2. java program (Listing 5.2) in Chapter 5. Modify the
find () routine from LinkList to search for an unvisited vertex rather than for a key value.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.