boost graph adjacency_list,检索节点的父节点
我想在 bgl 的邻接图中找到如何给出顶点描述符并获取作为该给定节点的父节点的节点集。
我想在有向图中执行此操作,似乎您可以使用双向图,但我希望能够限制它,以便不存在循环。
I want to find in an adjacency graph from the bgl how give a Vertexdescriptor and get the set of nodes that are parents of this given node.
i would like to do this in directed graph, it seems you could use a bidirectional graph but i want to be able to restrict it so that there are no cycles.
如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱,如果其他用户或者作者回复了您的评论,将不能在第一时间通知您!
发布评论
评论(1)
双向图不是无向图:它是一个有向图,仅存储有关入站弧的信息。这似乎正是您想要的信息。
The bidirectional graph is not an undirected graph: it's a directed graph that simply stores the information on inbound arcs. It seems just right the info you want.