Bonjour,

Je trouves une difficulté pour calculer la complexité de l'algorithme ci-dessous:

Inputs: N, M0, βg, βl, Mref; Outputs: Seq, Cost
1. Place M0 into OPEN.
2. For each candidate M remaining into OPEN do
a. Generate the successors of M.
b. For each successor M’of M.
If M’ = Mref, then construct the sequence of transition firings Seq’ from M0 to Mref and return Seq’ and Cost as the sum of durations and risk of Seq’. Otherwise, calculate the cost function f(M0, M’, Mref) and place M’ into a temporary list TEMPLIST.
c. Select up to the βl best children markings from TEMPLIST and place them into a temporary list GENERATION.
d. Clear TEMPLIST and remove M from OPEN.
3. Select up to the βg best markings from GENERATION and place them into OPEN.
4. Clear GENERATION.
5. If OPEN is empty, exit return Seq =  and Cost = ∞, otherwise, go to step 2.

Pouvez-vous m'aider SVP pour le calcul de la complexité de ce pseudo-code !

Merci d'avance.