Make a 3-by-3 chart with row and column labels "unvisited, visited, finished". (This corresponds to the colors white, gray, black in the book.) In each cell (i, j) indicate whether, at any point during a DFS of a directed graph, there can be an edge from a vertex with property i to a vertex with property j