خوارزمية البحث بأولوية العمق (DFS) - كتاب الذكاء الإصطناعي - الصف 12 - الفصل 1 - المملكة العربية السعودية

--- SECTION: 5 --- احذف العقدة B.--- SECTION: 6 --- عالج العقدة C ثم أضفها إلى المكدس.--- SECTION: 7 --- عالج العقدة F ثم أضفها إلى المكدس.--- SECTION: 8 --- المكدس خالي وبالتالي ستتوقف خوارزمية البحث بأولوية العمق (DFS).والآن سنتعلم طريقة تنفيذ خوارزمية البحث بأولوية العمق (DFS) في لغة البايثون.العقد التي فحصت باستخدام خوارزمية البحث بأولوية العمق (DFS) هي F, C, E, D, B, A.graph = { "A" : ["B", "C"], "B" : ["D", "E"], "C" : ["F"], "D" : [], "E" : [], "F" : [] }visitedDFS = [] # list to keep track of visited nodes# dfs function def dfs(visited, graph, node): if node not in visited: print(node, end = " ") visited.append(node) for neighbor in graph[node]: dfs(visited, graph, neighbor)# main program dfs(visitedDFS, graph, "A")يستخدم المكدس بصورة غير مباشرة عبر مكدس أثناء التشغيل (Runtime Stack) لتتبع الاستدعاءات التكرارية.A B D E C F2023 - 1447--- VISUAL CONTEXT --- **DIAGRAM**: خطوات تنفيذ خوارزمية البحث بأولوية العمق (DFS) - الخطوة 5 Description: Diagram illustrating step 5 of the Depth-First Search algorithm. It shows a graph with nodes A, B, C, D, E, F. Node B is highlighted, indicating it is being processed or removed. The accompanying stack diagram shows a stack initially containing 'A' at the bottom and 'B' on top. An arrow indicates 'B' is being popped from the stack, resulting in a stack containing only 'A'. Data: Graph nodes: A (root), B, C (children of A), D, E (children of B), F (child of C). Stack state changes from [A, B] to [A] after B is removed. Key Values: Node B removed, Stack: A Context: Demonstrates the removal of a node from the stack after its subtree has been fully explored in DFS.**DIAGRAM**: خطوات تنفيذ خوارزمية البحث بأولوية العمق (DFS) - الخطوة 6 Description: Diagram illustrating step 6 of the Depth-First Search algorithm. It shows a graph with nodes A, B, C, D, E, F. Node C is highlighted, indicating it is being processed or added. The accompanying stack diagram shows a stack initially containing 'A' at the bottom. An arrow indicates 'C' is being pushed onto the stack, resulting in a stack containing 'A' at the bottom and 'C' on top. Data: Graph nodes: A (root), B, C (children of A), D, E (children of B), F (child of C). Stack state changes from [A] to [A, C] after C is added. Key Values: Node C added, Stack: A, C Context: Demonstrates adding a new unvisited node (C) to the stack during DFS traversal.**DIAGRAM**: خطوات تنفيذ خوارزمية البحث بأولوية العمق (DFS) - الخطوة 7 Description: Diagram illustrating step 7 of the Depth-First Search algorithm. It shows a graph with nodes A, B, C, D, E, F. Node F is highlighted, indicating it is being processed or added. The accompanying stack diagram shows a stack initially containing 'A' at the bottom and 'C' on top. An arrow indicates 'F' is being pushed onto the stack, resulting in a stack containing 'A', 'C', and 'F' on top. Data: Graph nodes: A (root), B, C (children of A), D, E (children of B), F (child of C). Stack state changes from [A, C] to [A, C, F] after F is added. Key Values: Node F added, Stack: A, C, F Context: Demonstrates adding a new unvisited node (F) to the stack as DFS continues deeper into the graph.**DIAGRAM**: خطوات تنفيذ خوارزمية البحث بأولوية العمق (DFS) - الخطوة 8 Description: Diagram illustrating step 8 of the Depth-First Search algorithm. It shows the same graph structure. The accompanying stack diagram shows a stack initially containing 'A', 'C', 'F'. Arrows indicate 'F', 'C', and 'A' are being popped sequentially from the stack, resulting in an empty stack. Data: Graph nodes: A (root), B, C (children of A), D, E (children of B), F (child of C). Stack state changes from [A, C, F] to empty [] as all nodes are processed and popped. Key Values: Stack becomes empty, DFS traversal complete Context: Demonstrates the completion of the DFS algorithm when the stack becomes empty, indicating all reachable nodes have been visited.