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

المثال التالي يوضح طريقة عمل خوارزمية البحث بأولوية الاتساع (BFS). باستخدام المخطط التالي، حدد العقد التي يجب فحصها للانتقال من عقدة الجذر A إلى العقدة F: ملاحظة: استخدم هيكل البيانات المناسب. عليك فحص كل العقد في المستوى 1 قبل الانتقال إلى العقد في المستوى 2. --- SECTION: الخطوة 1 --- 1 البداية من العقدة الجذرية (العقدة A). أضف العقدة الجذرية إلى الطابور. --- SECTION: الخطوة 2 --- 2 احذف العقدة الجذرية من الطابور لمعالجتها، ثم أضف فروع هذه العقدة إلى الطابور (العقدتين B و C). --- SECTION: الخطوة 3 --- 3 احذف العقدة من مقدمة الطابور (العقدة B) لمعالجتها، ثم أضف فروع هذه العقدة إلى الطابور (العقدتين D و E). وزارة التعليم Ministry of Education 2025 - 1447 80 --- VISUAL CONTEXT --- **DIAGRAM**: المخطط والطابور الأولي Description: A tree diagram and an empty queue representing the initial state for the Breadth-First Search algorithm. The tree has a root node 'A', with children 'B' and 'C'. Node 'B' has children 'D' and 'E'. Node 'C' has a child 'F'. All nodes are depicted as grey circles. Below the tree, an empty queue is shown as three grey boxes labeled 0, 1, 2. Key Values: A, B, C, D, E, F, 0, 1, 2 Context: This visual sets up the problem, showing the graph (tree) to be traversed and the initial empty queue data structure. **DIAGRAM**: الخطوة 1: إضافة العقدة الجذرية إلى الطابور Description: This diagram illustrates the first step of the BFS algorithm. The tree shows node 'A' highlighted in blue, indicating it's the current node being processed or added. All other nodes (B, C, D, E, F) are grey. Below the tree, the queue shows node 'A' in a blue box at index 0. Boxes 1 and 2 are empty and grey. Key Values: A, 0, 1, 2 Context: Demonstrates the initial action of BFS: adding the starting (root) node to the queue. **DIAGRAM**: الخطوة 2: معالجة A وإضافة B و C إلى الطابور Description: This diagram illustrates the second step of BFS. The tree shows node 'A' as grey (processed), while its children 'B' and 'C' are highlighted in blue. Nodes D, E, F are grey. Above the main queue, a smaller transition diagram shows a faded blue box with 'A' and an arrow pointing to a queue containing blue 'B' and 'C' in boxes 0 and 1, representing 'A' being dequeued and 'B', 'C' being enqueued. The main queue below shows blue 'B' in box 0, blue 'C' in box 1, and box 2 is empty and grey. Key Values: A, B, C, 0, 1, 2 Context: Shows the processing of node A, its removal from the queue, and the addition of its direct children (B and C) to the queue. **DIAGRAM**: الخطوة 3: معالجة B وإضافة D و E إلى الطابور Description: This diagram illustrates the third step of BFS. The tree shows nodes 'A' and 'B' as grey (processed). Nodes 'C', 'D', and 'E' are highlighted in blue. Node 'F' is grey. A blue box labeled 'فحصت' (checked) is connected by an arrow from node 'A' to node 'B'. Above the main queue, two smaller transition diagrams are shown: one with a faded blue box 'B' pointing to a queue with blue 'C' (representing 'B' being dequeued), and another with a faded blue box 'C' pointing to a queue with blue 'D' and 'E' (representing 'C' being dequeued and 'D', 'E' being enqueued). The main queue below shows blue 'C' in box 0, blue 'D' in box 1, and blue 'E' in box 2. Key Values: A, B, C, D, E, F, فحصت, 0, 1, 2 Context: Demonstrates the processing of node B, its removal from the queue, and the addition of its direct children (D and E) to the queue. It also shows the state of the queue after these operations.