The abstract superclass of a class of Asynchronous Algorithms that
propagate information from the leaves of a BFS tree to its root.
|
|
|
|
|
|
|
|
trans_i(self,
p,
msgs)
Determines what state transition a Process, p, will perform, having
received messages, msgs |
source code
|
|
|
|
cleanup_i(self,
p)
Determines what final state transition a Process, p, will perform,
after the algorithm terminates. |
source code
|
|
|
|
trans_root(self,
p,
msgs)
Determines the state transition the root node should undergo when it
receives messages |
source code
|
|
|
|
output_root(self,
p)
Determines the output action, if any, that the root should perform at
the end of the Convergecast. |
source code
|
|
|
|
|
|
|
trans_msg_to_parent(self,
p,
msgs)
Defines the message a non-leaf, non-root Process should send to its
parent when it has received all its children's messages |
source code
|
|
|
Inherited from distalgs.Asynchronous_Algorithm:
run,
run_process
Inherited from distalgs.Algorithm:
__call__,
__init__,
cleanup,
count_msg,
delete,
get,
halt,
halt_i,
has,
increment,
output,
print_algorithm_terminated,
set
|