The repository contains python code to traverse any graph given in the form of dictionary to perform Breadth First Search (BFS) and Depth First Search (DFS) algorithms.
The output for BFS looks like this:
The output for DFS looks like this:
-
Notifications
You must be signed in to change notification settings - Fork 0
Agha-Muqarib/Graph-Traversal-Via-BFS-DFS
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
The repository contains python code to traverse any graph given in the form of dictionary to perform Breadth First Search (BFS) and Depth First Search (DFS).
Resources
Stars
Watchers
Forks
Releases
No releases published