摘要
在并发程序复杂性度量研究中,我们曾定义了一种B图,用以作为Ada并发程序中一种会合关系的模型。我们将B图推广到BB图。n节点BB图是在n个节点的串联树上再添加若干条边,其约束条件是:每个节点的入度不大于二,每个节点的出度也不大于二。给出BB图的若干若干枚举特征,指出同第二类Stirling数的密切关系。
We define the so - called B graph in research on concurrent program complexity metrics as one the models of rendezvous relations in Ada programs. In this paper, we generalize the B graph to BB graph. A BB graph of order n is the oriented tree of order n and height n - 1 by adding some edges with the constraint that both of the in- degree or out - degree for every node are two at most. The paper gives some enumerating characteristics of BB Graph, and points out the closed relationship with the Stiding＇ s numbers of second kind.
出处
《计算机与数字工程》
2006年第2期21-23,共3页
Computer & Digital Engineering
