测试

test

集合 head - body - tail head: 入>=1 出=0 只从集合外入 只从集合内出 body: 只访问集合内元素 tail: 入>=1 出=1 只从集合内入 只从集合外出

从终点向前找 出=1 节点 D, S={D} 从D往前找,加入集合S

flowchart LR
0([0.sllvm.blk12]) --> 1([1.sllvm.split.blk9])
0([0.sllvm.blk12]) --> 3([3.sllvm.split.blk8])
0([0.sllvm.blk12]) --> 2([2.sllvm.split.blk6])
0([0.sllvm.blk12]) --> 4([4.sllvm.split.blk])
1([1.sllvm.split.blk9]) --> 301([301.sllvm.split.blk10])
2([2.sllvm.split.blk6]) --> 302([302.sllvm.split.blk7])

2+4+8+16 2^(n+1)-2

2* (2^l-1)/(2-1)

t*(t+1)