简体繁体 English

提升图adjacency_list，检索节点的父级

[英]boost graph adjacency_list, retrieving a node's parents

原文 2010-04-03 19:57:51 7 1 c++/ boost/ graph/ adjacency-list

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. 我想在bgl的邻接图中找到如何给出Vertexdescriptor并获取作为该给定节点的父节点的节点集。

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. 我想在有向图中执行此操作，看来您可以使用双向图，但我希望能够对其进行限制，以便没有循环。

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. 似乎恰到好处您想要的信息。

Boost.Graph：保存和加载带有名称的boost :: adjacency_list - Boost.Graph: saving and loading a boost::adjacency_list with a name

从boost :: adjacency_list图中删除多个顶点 - Removing multiple vertices from a boost::adjacency_list graph

如何在boost :: adjacency_list中置换节点？ - How to permute nodes in a boost::adjacency_list?

将图表（adjacency_list）复制到另一个 - copy a graph (adjacency_list) to another one

使用boost :: copy_graph从grid_graph复制到adjacency_list - Copying from grid_graph to adjacency_list with boost::copy_graph

Boost图形库：在并行模式下从adjacency_list读取时访问冲突 - boost graph library: access violation in reading from adjacency_list in parallel mode

有没有一种简单的方法来找出boost :: adjacency_list是否为空？ - Is there a simple way to find out if a boost::adjacency_list is empty?

带有 vecS 的 adjacency_list 上的`boost::edge()` 的运行时复杂度是多少？ - What is the runtime complexity of `boost::edge()` on an adjacency_list with vecS?

交换两个 boost::adjacency_list 图，类似于 std::swap - Swapping two boost::adjacency_list graphs, akin to std::swap

为什么<>在邻接表<>中为空 - why <> is empty in adjacency_list<>

暂无

暂无

声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

相关问题 Boost.Graph：保存和加载带有名称的boost :: adjacency_list - Boost.Graph: saving and loading a boost::adjacency_list with a name 从boost :: adjacency_list图中删除多个顶点 - Removing multiple vertices from a boost::adjacency_list graph 如何在boost :: adjacency_list中置换节点？ - How to permute nodes in a boost::adjacency_list? 将图表（adjacency_list）复制到另一个 - copy a graph (adjacency_list) to another one 使用boost :: copy_graph从grid_graph复制到adjacency_list - Copying from grid_graph to adjacency_list with boost::copy_graph Boost图形库：在并行模式下从adjacency_list读取时访问冲突 - boost graph library: access violation in reading from adjacency_list in parallel mode 有没有一种简单的方法来找出boost :: adjacency_list是否为空？ - Is there a simple way to find out if a boost::adjacency_list is empty? 带有 vecS 的 adjacency_list 上的`boost::edge()` 的运行时复杂度是多少？ - What is the runtime complexity of `boost::edge()` on an adjacency_list with vecS? 交换两个 boost::adjacency_list 图，类似于 std::swap - Swapping two boost::adjacency_list graphs, akin to std::swap 为什么<>在邻接表<>中为空 - why <> is empty in adjacency_list<>

相关标签

粤ICP备18138465号 © 2020-2024 STACKOOM.COM