Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/BeeBombshell/Python-DSA
/ dfs.py
File
dfs.py
Tree Data Structure/dfs.py:None–None ·
view source on GitHub ↗
Source
from the content-addressed store, hash-verified
1
# Depth First Search
2
# Using a Python dictionary to act as an adjacency list
3
graph = {
4
'A'
: [
'B'
,
'C'
],
Callers
nothing calls this directly
Calls
1
dfs
Function · 0.85
Tested by
no test coverage detected