spectre/cours
1
0
Fork 0
mirror of https://github.com/Fare-spec/cours.git synced 2025-12-09 11:30:38 +00:00
Code Issues Packages Projects Releases Wiki Activity

formatte file

Browse Source
This commit is contained in:
Spectre
2025-04-01 14:28:43 +02:00
parent f2ae2cbc13
commit e03e5458aa
77 changed files with 1231 additions and 945 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
graphes/DS_possible/main.py
View File

@@ -1,27 +1,26 @@
graphe = {
"node1": ["node2","node4"],
"node2": ["node2","node3","node6"],
"node1": ["node2", "node4"],
"node2": ["node2", "node3", "node6"],
"node3": ["node5"],
"node5": ["node5","node6"],
"node4": ["node1","node5"],
"node6": []
"node5": ["node5", "node6"],
"node4": ["node1", "node5"],
"node6": [],
}
print(graphe["node1"])
def bfs(graphe, start_node):
queue = [start_node]
visited = set()
while queue:
node = queue.pop(0)
node = queue.pop(0)
if node not in visited:
print(node)
visited.add(node)
print(node)
visited.add(node)
for neighbor in graphe[node]:
if neighbor not in visited:
queue.append(neighbor)
bfs(graphe,"node1")
bfs(graphe, "node1")