x
Yes
No
Do you want to visit DriveHQ English website?
首页
产品服务
价格
免费试用
下载客户端
关于我们
云文件服务
|
云备份服务
|
FTP服务
|
企业邮箱服务
|
网站托管
|
客户端软件
云文件服务
云备份服务
FTP服务
企业级邮箱服务
网站托管
客户端软件
make_biconnected_planar.hpp - Hosted on DriveHQ Cloud IT Platform
返回上层目录
上传
下载
共享
发布
新建文件夹
新建文件
复制
剪切
删除
粘贴
评论
升级服务
路径: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\boost_1_35_0\boost\graph\make_biconnected_planar.hpp
旋转
特效
属性
历史版本
//======================================================================= // Copyright 2007 Aaron Windsor // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) //======================================================================= #ifndef __MAKE_BICONNECTED_PLANAR_HPP__ #define __MAKE_BICONNECTED_PLANAR_HPP__ #include
#include
//for tie #include
#include
#include
#include
#include
#include
namespace boost { template
void make_biconnected_planar(Graph& g, PlanarEmbedding embedding, EdgeIndexMap em, AddEdgeVisitor& vis ) { typedef typename graph_traits
::vertex_descriptor vertex_t; typedef typename graph_traits
::edge_descriptor edge_t; typedef typename graph_traits
::edges_size_type edge_size_t; typedef typename property_traits
::value_type embedding_value_t; typedef typename embedding_value_t::const_iterator embedding_iterator_t; typedef iterator_property_map
::iterator, EdgeIndexMap> component_map_t; edge_size_t n_edges(num_edges(g)); std::vector
articulation_points; std::vector
component_vector(n_edges); component_map_t component_map(component_vector.begin(), em); biconnected_components(g, component_map, std::back_inserter(articulation_points)); typename std::vector
::iterator ap, ap_end; ap_end = articulation_points.end(); for(ap = articulation_points.begin(); ap != ap_end; ++ap) { vertex_t v(*ap); embedding_iterator_t pi = embedding[v].begin(); embedding_iterator_t pi_end = embedding[v].end(); edge_size_t previous_component(n_edges + 1); vertex_t previous_vertex = graph_traits
::null_vertex(); for(; pi != pi_end; ++pi) { edge_t e(*pi); vertex_t e_source(source(e,g)); vertex_t e_target(target(e,g)); //Skip self-loops and parallel edges if (e_source == e_target || previous_vertex == e_target) continue; vertex_t current_vertex = e_source == v ? e_target : e_source; edge_size_t current_component = component_map[e]; if (previous_vertex != graph_traits
::null_vertex() && current_component != previous_component) { vis.visit_vertex_pair(current_vertex, previous_vertex, g); } previous_vertex = current_vertex; previous_component = current_component; } } } template
inline void make_biconnected_planar(Graph& g, PlanarEmbedding embedding, EdgeIndexMap em ) { default_add_edge_visitor vis; make_biconnected_planar(g, embedding, em, vis); } template
inline void make_biconnected_planar(Graph& g, PlanarEmbedding embedding) { make_biconnected_planar(g, embedding, get(edge_index,g)); } } // namespace boost #endif //__MAKE_BICONNECTED_PLANAR_HPP__
make_biconnected_planar.hpp
网页地址
文件地址
上一页
56/95
下一页
下载
( 3 KB )
Comments
Total ratings:
0
Average rating:
无评论
of 10
Would you like to comment?
Join now
, or
Logon
if you are already a member.