Choose your own application that uses the Depth First Search

(Cannot be knights tour problem)

Must implement in python using the implementation below

Depth First Search -

Can be similar to the knights tour problem ( in which a knight is on a 8x8 grid and must visit all spaces). Please use python language and show indentation in code if possible. Thanks in advance

from pythonds.graphs import Graph class DFSGraph(Graph) def _init__(self) superO._init__O self.time 0 def dfs(self) for aVertex in self: aVertex.setColor('white' aVertex.setPred(-1) for aVertex in self: if avertex.getColor() == 'White': self.dfsvisit(aVertex) def dfsvisit(self,startVertex): startVertex.setColor('gray') self.time += 1 startVertex.setDiscovery(self.time) for nextVertex in startVertex.getConnectionsO: if nextVertex.getColorO'white' nextVertex.setPred(startVertex) self.dfsvisit(nextVertex) startVertex.setColor('black self.time += 1 startVertex.setFinish(self.time) from pythonds.graphs import Graph class DFSGraph(Graph) def _init__(self) superO._init__O self.time 0 def dfs(self) for aVertex in self: aVertex.setColor('white' aVertex.setPred(-1) for aVertex in self: if avertex.getColor() == 'White': self.dfsvisit(aVertex) def dfsvisit(self,startVertex): startVertex.setColor('gray') self.time += 1 startVertex.setDiscovery(self.time) for nextVertex in startVertex.getConnectionsO: if nextVertex.getColorO'white' nextVertex.setPred(startVertex) self.dfsvisit(nextVertex) startVertex.setColor('black self.time += 1 startVertex.setFinish(self.time)