You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
# We apply a rule on a node/edge only once in each timestep to prevent it from being added to the to_be_added list continuously (this will improve performance
593
-
nodes_to_skip[i].append(n)
596
+
# It's possible to have an annotation function that keeps changing the value of a node/edge. Do this only for delta_t>0
597
+
ifdelta_t!=0:
598
+
nodes_to_skip[i].append(n)
594
599
595
600
# Handle loop parameters for the next (maybe) fp operation
596
601
# If it is a t=0 rule or an immediate rule we want to go back for another fp operation to check for new rules that may fire
# We apply a rule on a node/edge only once in each timestep to prevent it from being added to the to_be_added list continuously (this will improve performance
625
-
edges_to_skip[i].append(e)
633
+
# It's possible to have an annotation function that keeps changing the value of a node/edge. Do this only for delta_t>0
634
+
ifdelta_t!=0:
635
+
edges_to_skip[i].append(e)
626
636
627
637
# Handle loop parameters for the next (maybe) fp operation
628
638
# If it is a t=0 rule or an immediate rule we want to go back for another fp operation to check for new rules that may fire
0 commit comments