c++ - 如何在boost::grid_graph中使用给定的vertex_descriptor访问edge_descriptor

我正在尝试更改grid_graph中边缘的权重，但无法通过以下方式访问edge_descriptor:

std::pair<bEdgeDescriptor, bool> ed_right = boost::edge(bVertexDescriptor {{i - 1, j, k}}, bVertexDescriptor {{i, j, k}}, grid);

其中grid是boost::grid_graph<3>
然后我发现grid_graph不支持此功能。为了利用astar_search，是否有任何便捷的方法来访问edge_descriptor中给定的vertex_descriptor而不是boost::grid_graph中的给定adjacency_list？

最佳答案

您可以获取任何特定节点的入/出边缘:

http://www.boost.org/doc/libs/1_63_0/libs/graph/doc/grid_graph.html#indexing



使用具有非包装尺寸的3d 4x4x4网格进行演示(此示例显示了边缘节点的程度较低):

Live On Coliru

#include <boost/graph/grid_graph.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <iostream>

using Grid = boost::grid_graph<3>;
using Traits = boost::graph_traits<Grid>;
using vertex_descriptor = Grid::vertex_descriptor;
using edge_descriptor = Grid::edge_descriptor;

static inline std::ostream& operator<<(std::ostream& os, vertex_descriptor const& vd) {
    return os << "(" << vd[0] << ", " << vd[1] << ", " << vd[2] << ")";
}

void print_in_edges(vertex_descriptor vd, Grid const& grid) {
    for (Traits::degree_size_type ei = 0; ei < in_degree(vd, grid); ++ei) {
        auto ed_left = in_edge_at(vd, ei, grid);
        std::cout << "Detected in edge: " << ed_left.first << " -> " << ed_left.second << "\n";
    }
}

void print_out_edges(vertex_descriptor vd, Grid const& grid) {
    for (Traits::degree_size_type ei = 0; ei < out_degree(vd, grid); ++ei) {
        auto ed_left = out_edge_at(vd, ei, grid);
        std::cout << "Detected out edge: " << ed_left.first << " -> " << ed_left.second << "\n";
    }
}

int main() {
    Grid grid({ { 4, 4, 4 } }, false);

    print_in_edges({{ 2, 2, 2 } }, grid);
    print_out_edges({{ 2, 2, 2 } }, grid);
    std::cout << "----\n";
    print_in_edges({{ 0, 0, 0 } }, grid);
    print_out_edges({{ 0, 0, 0 } }, grid);
}

打印品:

Detected in edge: (1, 2, 2) -> (2, 2, 2)
Detected in edge: (3, 2, 2) -> (2, 2, 2)
Detected in edge: (2, 1, 2) -> (2, 2, 2)
Detected in edge: (2, 3, 2) -> (2, 2, 2)
Detected in edge: (2, 2, 1) -> (2, 2, 2)
Detected in edge: (2, 2, 3) -> (2, 2, 2)
Detected out edge: (2, 2, 2) -> (1, 2, 2)
Detected out edge: (2, 2, 2) -> (3, 2, 2)
Detected out edge: (2, 2, 2) -> (2, 1, 2)
Detected out edge: (2, 2, 2) -> (2, 3, 2)
Detected out edge: (2, 2, 2) -> (2, 2, 1)
Detected out edge: (2, 2, 2) -> (2, 2, 3)
----
Detected in edge: (1, 0, 0) -> (0, 0, 0)
Detected in edge: (0, 1, 0) -> (0, 0, 0)
Detected in edge: (0, 0, 1) -> (0, 0, 0)
Detected out edge: (0, 0, 0) -> (1, 0, 0)
Detected out edge: (0, 0, 0) -> (0, 1, 0)
Detected out edge: (0, 0, 0) -> (0, 0, 1)