Suppose that in the existing database structure, the presumptive relationships are stored directly in the database, meaning that for each activity, only the activities directly required for that activity are stored.
Based on this information, it is possible to plot the priority of the activities.
Now, if we want to find out for all activities that are directly or indirectly the prerequisite of the current activity, we should look at the survey in order to enable us to go back to the required activities for each activity. Find all the possible requirements.
This implementation method is very costly.
How can I implement an algorithm that performs these calculations with a better order?
Aucun commentaire:
Enregistrer un commentaire