计算零抑制二元决策图中连接的算法
计算两个零抑制二元决策图的连接的算法是什么？
我已经找了几个小时了，就是找不到。据我所知，高德纳的书中也没有这个内容，尽管它确实给出了结果的定义。
我宁愿不必费力地完成任何具体的实施；我发现实施细节非常分散注意力。
ZDD f 和 g 的连接为 { a ∪ b | a ∈ f 且 b ∈ g }
What is the algorithm to compute the join of two zero suppressed binary decision diagrams?
I've searched for it for hours now, I just can't find it. It's not in Knuth's book either, as far as I can find, though it does give a definition of the result.
I would prefer not to have to wade through any specific implementation; I find the implementation details very distracting.
The join of ZDDs f and g is { a ∪ b | a ∈ f and b ∈ g }
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（1）
在我的《计算机编程艺术》第 4A 卷中，这个确切的问题在第 7.1.4 节中作为练习 205 提出。它与前两个问题相关，但这三个问题的答案都在书的后面。您可能想将其作为资源来查看。
几年前，我参加了 Knuth 的一次演讲，他讨论了 ZDD 及其算法，包括如何进行连接。如果您有兴趣，我相信讲座已录制并且应该在线这里。
希望这有帮助！
In my copy of The Art of Computer Programming, Volume 4A this exact question is posed as Exercise 205 in section 7.1.4. It's related to the two previous questions, but the answers to all three are in the back of the book. You might want to check that out as a resource.
I was at a talk Knuth gave a few years ago where he was discussing ZDDs and their algorithms, including how to do join. If you're interested, I believe that the lecture was recorded and should be online here.
Hope this helps!