A schedule is an ordered list of directed edges of T , specifying which
flows are to be passed and in what order. Relative to such a schedule, a
flow is called active if, before it is sent, the source has itself already received
active flows from all its neighbours in T , with the possible exception of the
sink; and it is the first flow in the list with this property. This is a recursive
but effective definition. Note that the first active flow must originate in a
leaf of T , i.e., a clique in the tree with only one neighbour.
中的active flow是什么意思？能不能解释一下它的直观含义？
其中T是以图G中 clique为点的junction tree
非常感谢！！ |
回复此楼
+1/577
