Math Problem Statement
Jika A adalah himpunan pekerjaan, maka notasi A → p diartikan pekerjaan p hanya dapat dilakukan secara langsung setelah menyelesaikan salah satu pekerjaan pada A.
Diketahui,
{3,6} → 1,
{} → 2,
{4,5} → 3,
{2} → 4,
{} → 5, dan
{2,5} → 6
Urutan penyelesaian pekerjaan agar dapat melakukan pekerjaan 1 adalah….
(1) 5 → 4 → 3 → 1 (3) 2 → 4 → 5 → 1
(2) 4 → 5 → 2 → 1 (4) 2 → 4 → 3 → 1
Solution
Ask a new question for Free
By Image
Drop file here or Click Here to upload
Math Problem Analysis
Mathematical Concepts
Dependency Resolution
Graph Theory
Set Notation
Formulas
-
Theorems
Directed Acyclic Graph (DAG)
Topological Sorting
Suitable Grade Level
Grades 10-12
Related Recommendation
Dependency Order for Task Completion: Directed Graph Problem
Project Scheduling Using Task Priority List and Precedence Constraints
Two-Processor Scheduling Problem for Directed Acyclic Graph (DAG)
Two-Processor Project Scheduling with Priority List
Using Decreasing Time Algorithm for Project Scheduling with Two Processors