OpenSoure_Repos/TheAlgorithms-Python
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/Python.git synced 2023-10-11 13:06:12 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fixes depth_first_search_2.py formatting

Browse Source
This commit is contained in:
Praful Katare 2023-10-08 15:19:47 +05:30 committed by GitHub
parent 5e7e00b2ac
commit fda3aed222
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 4 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
graphs/depth_first_search_2.py
View File

@ -56,7 +56,8 @@ class Graph:
def dfs(self) -> None: def dfs(self) -> None:
""" """
Perform depth-first search (DFS) traversal on the graph and print the visited vertices. Perform depth-first search (DFS) traversal on the graph
and print the visited vertices.
Example: Example:
>>> g = Graph() >>> g = Graph()
@ -99,11 +100,12 @@ class Graph:
# mark start vertex as visited # mark start vertex as visited
visited[start_vertex] = True visited[start_vertex] = True
print(start_vertex, end=" ") print(start_vertex, end="")
# Recur for all the vertices that are adjacent to this node # Recur for all the vertices that are adjacent to this node
for i in self.vertex: for i in self.vertex:
if not visited[i]: if not visited[i]:
print(" ", end="")
self.dfs_recursive(i, visited) self.dfs_recursive(i, visited)