Constructing Temporally Extended Actions through Incremental Community Detection

Algorithm 1

Incremental processing algorithm for transition graph changes.

(1) Function updateCommunities (G, P, listChanges)

(2)  graph G.copy ()

(3)   P.copy ()

(4)  foreach listChanges do

(5)   graph.Applychanges (item)

(6)   if item is Case1 then

(7)    if then

(8)     Op1 (partition, item)

(9)    else

(10)    Op2 (partition, item)

(11)  else if item is Case2 then

(12)   Op3 (partition, item)

(13)  else if item is Case3 then

(14)    if then

(15)    Op3 (partition, item)

(16)    else

(17)    Op4 (partition, item)

(18) return (graph, partition)