(self, startVertex, visited)
| 34 | self.DFSRec(i, visited) |
| 35 | |
| 36 | def DFSRec(self, startVertex, visited): |
| 37 | # mark start vertex as visited |
| 38 | visited[startVertex] = True |
| 39 | |
| 40 | print(startVertex, end = ' ') |
| 41 | |
| 42 | # Recur for all the vertexes that are adjacent to this node |
| 43 | for i in self.vertex.keys(): |
| 44 | if visited[i] == False: |
| 45 | self.DFSRec(i, visited) |
| 46 | |
| 47 | if __name__ == '__main__': |
| 48 | g = Graph() |