x
Yes
No
Do you want to visit DriveHQ English website?
首页
产品服务
价格
免费试用
下载客户端
关于我们
云文件服务
|
云备份服务
|
FTP服务
|
企业邮箱服务
|
网站托管
|
客户端软件
云文件服务
云备份服务
FTP服务
企业级邮箱服务
网站托管
客户端软件
graph_archetypes.hpp - Hosted on DriveHQ Cloud IT Platform
返回上层目录
上传
下载
共享
发布
新建文件夹
新建文件
复制
剪切
删除
粘贴
评论
升级服务
路径: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\boost_1_35_0\boost\graph\graph_archetypes.hpp
旋转
特效
属性
历史版本
//======================================================================= // Copyright 2002 Indiana University. // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek // // 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 BOOST_GRAPH_ARCHETYPES_HPP #define BOOST_GRAPH_ARCHETYPES_HPP #include
#include
namespace boost { // should use a different namespace for this namespace detail { struct null_graph_archetype : public null_archetype<> { struct traversal_category { }; }; } //=========================================================================== template
struct incidence_graph_archetype : public Base { typedef typename Base::traversal_category base_trav_cat; struct traversal_category : public incidence_graph_tag, public base_trav_cat { }; #if 0 typedef immutable_graph_tag mutability_category; #endif typedef Vertex vertex_descriptor; typedef unsigned int degree_size_type; typedef unsigned int vertices_size_type; typedef unsigned int edges_size_type; struct edge_descriptor { edge_descriptor() { } edge_descriptor(const detail::dummy_constructor&) { } bool operator==(const edge_descriptor&) const { return false; } bool operator!=(const edge_descriptor&) const { return false; } }; typedef input_iterator_archetype
out_edge_iterator; typedef Directed directed_category; typedef ParallelCategory edge_parallel_category; typedef void adjacency_iterator; typedef void in_edge_iterator; typedef void vertex_iterator; typedef void edge_iterator; }; template
V source(const typename incidence_graph_archetype
::edge_descriptor&, const incidence_graph_archetype
& ) { return V(static_object
::get()); } template
V target(const typename incidence_graph_archetype
::edge_descriptor&, const incidence_graph_archetype
& ) { return V(static_object
::get()); } template
std::pair
::out_edge_iterator, typename incidence_graph_archetype
::out_edge_iterator> out_edges(const V&, const incidence_graph_archetype
& ) { typedef typename incidence_graph_archetype
::out_edge_iterator Iter; return std::make_pair(Iter(), Iter()); } template
typename incidence_graph_archetype
::degree_size_type out_degree(const V&, const incidence_graph_archetype
& ) { return 0; } //=========================================================================== template
struct adjacency_graph_archetype : public Base { typedef typename Base::traversal_category base_trav_cat; struct traversal_category : public adjacency_graph_tag, public base_trav_cat { }; typedef Vertex vertex_descriptor; typedef unsigned int degree_size_type; typedef unsigned int vertices_size_type; typedef unsigned int edges_size_type; typedef void edge_descriptor; typedef input_iterator_archetype
adjacency_iterator; typedef Directed directed_category; typedef ParallelCategory edge_parallel_category; typedef void in_edge_iterator; typedef void out_edge_iterator; typedef void vertex_iterator; typedef void edge_iterator; }; template
std::pair
::adjacency_iterator, typename adjacency_graph_archetype
::adjacency_iterator> adjacent_vertices(const V&, const adjacency_graph_archetype
& ) { typedef typename adjacency_graph_archetype
::adjacency_iterator Iter; return std::make_pair(Iter(), Iter()); } template
typename adjacency_graph_archetype
::degree_size_type out_degree(const V&, const adjacency_graph_archetype
& ) { return 0; } //=========================================================================== template
struct vertex_list_graph_archetype : public Base { typedef incidence_graph_archetype
Incidence; typedef adjacency_graph_archetype
Adjacency; typedef typename Base::traversal_category base_trav_cat; struct traversal_category : public vertex_list_graph_tag, public base_trav_cat { }; #if 0 typedef immutable_graph_tag mutability_category; #endif typedef Vertex vertex_descriptor; typedef unsigned int degree_size_type; typedef typename Incidence::edge_descriptor edge_descriptor; typedef typename Incidence::out_edge_iterator out_edge_iterator; typedef typename Adjacency::adjacency_iterator adjacency_iterator; typedef input_iterator_archetype
vertex_iterator; typedef unsigned int vertices_size_type; typedef unsigned int edges_size_type; typedef Directed directed_category; typedef ParallelCategory edge_parallel_category; typedef void in_edge_iterator; typedef void edge_iterator; }; template
std::pair
::vertex_iterator, typename vertex_list_graph_archetype
::vertex_iterator> vertices(const vertex_list_graph_archetype
& ) { typedef typename vertex_list_graph_archetype
::vertex_iterator Iter; return std::make_pair(Iter(), Iter()); } template
typename vertex_list_graph_archetype
::vertices_size_type num_vertices(const vertex_list_graph_archetype
& ) { return 0; } // ambiguously inherited from incidence graph and adjacency graph template
typename vertex_list_graph_archetype
::degree_size_type out_degree(const V&, const vertex_list_graph_archetype
& ) { return 0; } //=========================================================================== struct property_graph_archetype_tag { }; template
struct property_graph_archetype : public GraphArchetype { typedef property_graph_archetype_tag graph_tag; typedef ValueArch vertex_property_type; typedef ValueArch edge_property_type; }; struct choose_edge_property_map_archetype { template
struct bind_ { typedef mutable_lvalue_property_map_archetype
type; typedef lvalue_property_map_archetype
const_type; }; }; template <> struct edge_property_selector
{ typedef choose_edge_property_map_archetype type; }; struct choose_vertex_property_map_archetype { template
struct bind_ { typedef mutable_lvalue_property_map_archetype
type; typedef lvalue_property_map_archetype
const_type; }; }; template <> struct vertex_property_selector
{ typedef choose_vertex_property_map_archetype type; }; template
typename property_map
, P>::type get(P, property_graph_archetype
&) { typename property_map
, P>::type pmap; return pmap; } template
typename property_map
, P>::const_type get(P, const property_graph_archetype
&) { typename property_map
, P>::const_type pmap; return pmap; } template
typename property_traits
, P>::const_type>::value_type get(P p, const property_graph_archetype
& g, K k) { return get( get(p, g), k); } template
void put(P p, property_graph_archetype
& g, const Key& key, const V& value) { typedef typename boost::property_map
, P>::type Map; Map pmap = get(p, g); put(pmap, key, value); } struct color_value_archetype { color_value_archetype() { } color_value_archetype(detail::dummy_constructor) { } bool operator==(const color_value_archetype& ) const { return true; } bool operator!=(const color_value_archetype& ) const { return true; } }; template <> struct color_traits
{ static color_value_archetype white() { return color_value_archetype (static_object
::get()); } static color_value_archetype gray() { return color_value_archetype (static_object
::get()); } static color_value_archetype black() { return color_value_archetype (static_object
::get()); } }; template
class buffer_archetype { public: void push(const T&) {} void pop() {} T& top() { return static_object
::get(); } const T& top() const { return static_object
::get(); } bool empty() const { return true; } }; } // namespace boost #endif // BOOST_GRAPH_ARCHETYPES_HPP
graph_archetypes.hpp
网页地址
文件地址
上一页
33/95
下一页
下载
( 10 KB )
Comments
Total ratings:
0
Average rating:
无评论
of 10
Would you like to comment?
Join now
, or
Logon
if you are already a member.