void DataSDMap
::parse_graph(OsmGraph const &sdMap,
Eigen
::Affine3d const &transformation
Matrix,
std
::vector<EdgeInfo> &edges_info,
bool crop) const noexcept {
// get roi corner points
std
::vector<Point> canvas_polygon;
if (crop) {
double min_x = -1 * roiLength;
double max_x = roiLength;
double min_y = -1 * roiWidth;
double max_y = roiWidth;
canvas_polygon.push_back(Point(min_x, min_y));
canvas_polygon.push_back(Point(min_x, max_y));
canvas_polygon.push_back(Point(max_x, max_y));
canvas_polygon.push_back(Point(max_x, min_y));
}
auto start = std
::chrono
::high_resolution_clock
::now();
edges_info.clear();
// 读取graph中的edges数据,还原edge geometry
// std
::cout << "Number of edges
: " <<
boost::num_edges(sdMap) << std
::endl;
std
::pair<
boost::adjacency_list<>
::vertex_iterator,
boost::adjacency_list<>
::vertex_iterator>
vertices_pair =
boost::vertices(sdMap);
//
boost::iterator_range<
boost::graph_traits<OsmGraph>
::vertex_iterator>
// vertices_pair =
boost::make_iterator_range(vertices(sdMap)); for (auto e
:
//
boost::make_iterator_range(
boost::edges(sdMap)))
for (auto e =
boost::edges(sdMap).first; e !=
boost::edges(sdMap).second;
++e) {
const OsmEdgeProperties &edgeProps = sdMap[*e];
// get vertices geometry
LineString linestring_global;
std
::string line_geometry_string = edgeProps.geometry;
if (line_geometry_string.empty()) {
boost::adjacency_list<>
::vertex_descriptor source =
boost::source(*e, sdMap);
boost::adjacency_list<>
::vertex_descriptor target =
boost::target(*e, sdMap);
if (source == target) continue;
line_geometry_string = "LINESTRING (";
const OsmNodeProperties &startNodeProps =
sdMap[*(vertices_pair.first + source)];
line_geometry_string = line_geometry_string + startNodeProps.x + " " +
startNodeProps.y + ", ";
const OsmNodeProperties &endNodeProps =
sdMap[*(vertices_pair.first + target)];
line_geometry_string = line_geometry_string + " " + endNodeProps.x + " " +
endNodeProps.y + ")";
}
boost::geometry
::read_wkt(line_geometry_string, linestring_global);
auto end = std
::chrono
::high_resolution_clock
::now();
auto delay = std
::chrono
::duration_cast<std
::chrono
::milliseconds>(end - start).count();
分析这段代码在周期性调用时，运行时间在递增，分析可能的原因？
本文介绍如何使用Boost库中的boost::adjacency_matrix来表示和操作图的邻接矩阵。通过一个简单的测试程序，展示了创建无向图、添加边、遍历节点和边的过程，帮助理解如何利用Boost库处理图形问题。
订阅专栏 解锁全文
扫一扫
193
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
