Perform depth-first search (DFS) traversal on the graph and print the visited vertices. Example: >>> g = Graph() >>> g.add_edge(0, 1) >>> g.add_edge(0, 2) >>> g.add_edge(1, 2) >>> g.add_edge(2, 0) >>> g.add_edge(2, 3)
(self)
| 55 | self.vertex[from_vertex] = [to_vertex] |
| 56 | |
| 57 | def dfs(self) -> None: |
| 58 | """ |
| 59 | Perform depth-first search (DFS) traversal on the graph |
| 60 | and print the visited vertices. |
| 61 | |
| 62 | Example: |
| 63 | >>> g = Graph() |
| 64 | >>> g.add_edge(0, 1) |
| 65 | >>> g.add_edge(0, 2) |
| 66 | >>> g.add_edge(1, 2) |
| 67 | >>> g.add_edge(2, 0) |
| 68 | >>> g.add_edge(2, 3) |
| 69 | >>> g.add_edge(3, 3) |
| 70 | >>> g.dfs() |
| 71 | 0 1 2 3 |
| 72 | """ |
| 73 | # visited array for storing already visited nodes |
| 74 | visited = [False] * len(self.vertex) |
| 75 | |
| 76 | # call the recursive helper function |
| 77 | for i in range(len(self.vertex)): |
| 78 | if not visited[i]: |
| 79 | self.dfs_recursive(i, visited) |
| 80 | |
| 81 | def dfs_recursive(self, start_vertex: int, visited: list) -> None: |
| 82 | """ |
no test coverage detected