خوارزمية الحل الجشع لتكوين الفريق - كتاب الذكاء الإصطناعي - الصف 12 - الفصل 1 - المملكة العربية السعودية

def greedy_solver(problem): worker_skills = problem['worker_skills'] required_skills = problem['required_skills'] # skills that still have not been covered uncovered_required_skills = required_skills.copy() best_team = [] # remembers only the skills of each worker that are required but haven't been covered yet uncovered_worker_skills = {} for worker_id in worker_skills: # remembers only the required uncovered skills that this worker has uncovered_worker_skills[worker_id] = worker_skills[worker_id]. intersection(uncovered_required_skills) # while there are still required skills to cover while len(uncovered_required_skills) > 0: best_worker_id = None # the best worker to add next # number of uncovered skills required for the best worker to cover best_new_coverage = 0 for worker_id in uncovered_worker_skills: # uncovered required skills that this worker can cover my_uncovered_skills = uncovered_worker_skills[worker_id] # if this worker can cover more uncovered required skills than the best worker so far if len(my_uncovered_skills) > best_new_coverage: best_worker_id=worker_id # makes this worker the best worker best_new_coverage=len(my_uncovered_skills) if best_worker_id != None: # if a best worker was found best_team.append(best_worker_id) # adds the worker to the solution # removes the best worker's skills from the skills to be covered uncovered_required_skills = uncovered_required_skills - uncovered_worker_skills[best_worker_id] for worker_id in uncovered_worker_skills: # remembers only the required uncovered skills that this worker has uncovered_worker_skills[worker_id] = uncovered_worker_skills[worker_id].intersection(uncovered_required_skills) else: # no best worker has been found and some required skills are still uncovered return None # no solution could be found return best_team

تُظهر الدالة ()intersections مجموعة جديدة تحتوي فقط على المهارات المشتركة من جميع مهارات العمال الموجودة في worker_skills، والمهارات المطلوبة التي لم تُستوفَ في uncovered_worker_skills.

وزارة التعليم Ministry of Education 2023 - 1447 261

--- SECTION: def greedy_solver(problem): --- def greedy_solver(problem): worker_skills = problem['worker_skills'] required_skills = problem['required_skills']# skills that still have not been covered uncovered_required_skills = required_skills.copy() best_team = [] # remembers only the skills of each worker that are required but haven't been covered yet uncovered_worker_skills = {}for worker_id in worker_skills: # remembers only the required uncovered skills that this worker has uncovered_worker_skills[worker_id] = worker_skills[worker_id]. intersection(uncovered_required_skills)# while there are still required skills to cover while len(uncovered_required_skills) > 0: best_worker_id = None # the best worker to add next # number of uncovered skills required for the best worker to cover best_new_coverage = 0for worker_id in uncovered_worker_skills: # uncovered required skills that this worker can cover my_uncovered_skills = uncovered_worker_skills[worker_id]# if this worker can cover more uncovered required skills than the best worker so far if len(my_uncovered_skills) > best_new_coverage: best_worker_id=worker_id # makes this worker the best worker best_new_coverage=len(my_uncovered_skills)if best_worker_id != None: # if a best worker was found best_team.append(best_worker_id) # adds the worker to the solution# removes the best worker's skills from the skills to be covered uncovered_required_skills = uncovered_required_skills - uncovered_worker_skills[best_worker_id]for worker_id in uncovered_worker_skills: # remembers only the required uncovered skills that this worker has uncovered_worker_skills[worker_id] = uncovered_worker_skills[worker_id].intersection(uncovered_required_skills)else: # no best worker has been found and some required skills are still uncovered return None # no solution could be found return best_team--- SECTION: تُظهر الدالة ()intersections --- تُظهر الدالة ()intersections مجموعة جديدة تحتوي فقط على المهارات المشتركة من جميع مهارات العمال الموجودة في worker_skills، والمهارات المطلوبة التي لم تُستوفَ في uncovered_worker_skills.2023 - 1447--- VISUAL CONTEXT --- **HIGHLIGHT_BOX**: تُظهر الدالة ()intersections Description: A blue-bordered box containing an Arabic explanation of the intersections() function. It clarifies that the function creates a new set containing only the common skills from 'worker_skills' and the required skills that have not yet been covered in 'uncovered_worker_skills'. Context: This sidebar provides a crucial explanation in Arabic for a specific function, 'intersections()', used within the Python code for the greedy solver algorithm. It helps Arabic-speaking learners understand the purpose and output of this function in the context of skill management.