Namespaces
	aligned_storage

	function

	graph

	multi_array

	parallel

	static_log2_impl

	variant

	win32

Classes
struct	_project2nd

struct	add_pointer_impl

struct	add_reference_impl

struct	add_reference_rvalue_layer

struct	add_reference_rvalue_layer< T && >

struct	add_reverse_edge_descriptor

struct	add_reverse_edge_descriptor< Desc, boost::reverse_graph< G, GR > >

struct	add_reverse_edge_descriptor< reverse_graph_edge_descriptor< Desc >, boost::reverse_graph< G, GR > >

struct	addr_impl_ref

struct	addressof_impl

struct	addressof_impl< addr_nullptr_t >

struct	addressof_impl< addr_nullptr_t const >

struct	addressof_impl< addr_nullptr_t const volatile >

struct	addressof_impl< addr_nullptr_t volatile >

struct	adj_matrix_edge_iter

struct	alignment_logic

struct	alignment_of_hack

struct	alignment_of_impl

struct	astar_bfs_visitor

class	base_future
	Common implementation for all the futures independently of the return type. More...

class	base_state

class	basic_condition_variable

class	basic_cv_list_entry

class	basic_future
	Common implementation for future and shared_future. More...

struct	basic_recursive_mutex_impl

struct	basic_timed_mutex

struct	bd_helper

struct	bfs_dispatch

struct	bfs_dispatch< param_not_found >

class	bfs_king_visitor

class	bfs_rcm_visitor

struct	bgl_parameter_not_found_type

struct	bicomp_dispatch1

struct	bicomp_dispatch1< param_not_found >

struct	bicomp_dispatch2

struct	bicomp_dispatch2< param_not_found >

struct	bicomp_dispatch3

struct	bicomp_dispatch3< param_not_found >

struct	biconnected_components_visitor

struct	binary_pred_over_iter

struct	binary_traits_imp

struct	binary_traits_imp< Operation * >

struct	binary_traits_imp< R(*)(A1, A2)>

struct	bipartite_visitor_error
	The bipartite_visitor_error is thrown if an edge cannot be colored. More...

struct	bipartition_check
	Functor which tests an edge to be monochromatic. More...

struct	bipartition_colorize
	Functor which colors edges to be non-monochromatic. More...

class	bk_max_flow

struct	bridges_visitor

struct	choose_copier_parameter

struct	choose_default_edge_copier

struct	choose_default_vertex_copier

struct	choose_edge_copier_helper

struct	choose_edge_copy

struct	choose_edge_copy< param_not_found >

struct	choose_graph_copy

struct	choose_impl_helper

struct	choose_impl_helper< false >

struct	choose_impl_helper< true >

struct	choose_impl_result

struct	choose_rev_edge_iter

struct	choose_rev_edge_iter< false >

struct	choose_rev_edge_iter< true >

struct	choose_vertex_copier_helper

struct	choose_vertex_copy

struct	choose_vertex_copy< param_not_found >

struct	compare_first

class	components_recorder

struct	const_type_as_type

class	constant_value_property_map

struct	convert_bgl_params_to_boost_parameter

struct	convert_bgl_params_to_boost_parameter< bgl_named_params< P, int, R > >

struct	convert_bgl_params_to_boost_parameter< boost::no_named_parameters >

struct	convert_bgl_params_to_boost_parameter< boost::no_property >

struct	convert_one_keyword

struct	convert_one_keyword< BOOST_PP_CAT(attractive_force, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(buffer_param, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(cooling, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(diameter_range, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(distance_combine, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(distance_compare, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(distance_inf, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(distance_zero, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(edge_capacity, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(edge_centrality, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(edge_color, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(edge_copy, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(edge_residual_capacity, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(edge_reverse, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(edge_weight, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(edge_weight2, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(edges_equivalent, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(force_pairs, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(graph_visitor, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(in_parallel, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(index_in_heap_map, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(iterations, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(learning_constant_range, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(lookahead, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(max_priority_queue, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(orig_to_copy, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(parity_map, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(polling, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(repulsive_force, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(root_vertex, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(vertex_assignment_map, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(vertex_centrality, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(vertex_color, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(vertex_copy, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(vertex_discover_time, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(vertex_displacement, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(vertex_distance, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(vertex_distance2, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(vertex_index, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(vertex_index1, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(vertex_index2, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(vertex_invariant, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(vertex_invariant1, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(vertex_invariant2, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(vertex_isomorphism, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(vertex_lowpoint, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(vertex_max_invariant, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(vertex_predecessor, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(vertex_rank, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(vertex_root, _t)>

struct	convert_one_keyword< BOOST_PP_CAT(vertices_equivalent, _t)>

struct	copy_converter_impl

struct	copy_graph_impl

struct	copy_graph_impl< 0 >

struct	copy_graph_impl< 1 >

struct	copy_graph_impl< 2 >

struct	cpp0x_result_of

struct	cpp0x_result_of_impl

class	crc_helper

class	crc_helper< Bits, false >

struct	crc_table_t

struct	cycle_finder

struct	darken_and_push
	A unary predicate that decides when to push into a breadth-first search queue. More...

struct	default_color_map_generator

struct	default_color_map_generator_helper

struct	default_color_map_generator_helper< Graph, IndexMap, false >

struct	default_color_map_generator_helper< Graph, IndexMap, true >

struct	default_construct_iterator

class	degreelists_marker

struct	deleted_edge_status

struct	dijkstra_bfs_visitor

struct	dir_adj_matrix_in_edge_iter

struct	dir_adj_matrix_out_edge_iter

struct	do_call_finish_edge

struct	do_call_finish_edge< false >

struct	do_heap_delete

struct	does_edge_exist

class	dominator_visitor

class	dummy_constructor

struct	dummy_edge_property_selector

struct	dummy_pmap_reference

class	dummy_property_copier

struct	dummy_vertex_property_selector

class	dynamic_property_map_adaptor

struct	edge1_predicate

struct	edge2_predicate

struct	edge_capacity_value

struct	edge_copier

struct	edge_predicate

struct	edge_property_map

struct	edmonds_karp_dispatch1

struct	edmonds_karp_dispatch1< param_not_found >

struct	edmonds_karp_dispatch2

struct	edmonds_karp_dispatch2< param_not_found >

class	empty_base

struct	empty_helper

struct	empty_helper< T, true >

struct	empty_helper_t1

struct	empty_helper_t2

struct	enable_if_unrelated

struct	enable_if_unrelated< T, U, U2...>

struct	equivalent_edge_exists

struct	equivalent_edge_exists< Graph, typename boost::disable_if< is_multigraph< Graph > >::type >

class	esft2_deleter_wrapper

struct	exact_signed_base_helper

struct	exact_signed_base_helper< sizeof(signed char)*CHAR_BIT >

struct	exact_unsigned_base_helper

struct	exact_unsigned_base_helper< sizeof(unsigned char)*CHAR_BIT >

struct	extent_imp

struct	extent_imp< T const [], 0 >

struct	extent_imp< T const [], N >

struct	extent_imp< T const [R], 0 >

struct	extent_imp< T const [R], N >

struct	extent_imp< T const volatile[], 0 >

struct	extent_imp< T const volatile[], N >

struct	extent_imp< T const volatile[R], 0 >

struct	extent_imp< T const volatile[R], N >

struct	extent_imp< T volatile[], 0 >

struct	extent_imp< T volatile[], N >

struct	extent_imp< T volatile[R], 0 >

struct	extent_imp< T volatile[R], N >

struct	extent_imp< T[], 0 >

struct	extent_imp< T[], N >

struct	extent_imp< T[R], 0 >

struct	extent_imp< T[R], N >

struct	extract_lg_tag

struct	extract_lg_tag< global_property< P > >

struct	extract_lg_tag< local_property< P > >

struct	false_or_cpp11_noexcept_move_assignable

struct	false_or_cpp11_noexcept_move_assignable< T, typename::boost::enable_if_c< sizeof(T)&&BOOST_NOEXCEPT_EXPR(::boost::declval< T & >()=::boost::declval< T >())>::type >

struct	false_or_cpp11_noexcept_move_constructible

struct	false_or_cpp11_noexcept_move_constructible< T, typename::boost::enable_if_c< sizeof(T)&&BOOST_NOEXCEPT_EXPR(T(::boost::declval< T >()))>::type >

struct	false_t

class	find_free_in_fan

struct	float_wrapper

struct	forward_adapter_impl

struct	forward_adapter_impl< MD, F, FC, 0, 0 >

struct	forward_adapter_result

struct	fr_apply_force

struct	fr_force_directed_layout

struct	fr_force_directed_layout< param_not_found >

struct	function_traits_helper

struct	function_traits_helper< R(*)(T1)>

struct	function_traits_helper< R(*)(T1, T2)>

struct	function_traits_helper< R(*)(T1, T2, T3)>

struct	function_traits_helper< R(*)(T1, T2, T3, T4)>

struct	function_traits_helper< R(*)(T1, T2, T3, T4, T5)>

struct	function_traits_helper< R(*)(T1, T2, T3, T4, T5, T6)>

struct	function_traits_helper< R(*)(T1, T2, T3, T4, T5, T6, T7)>

struct	function_traits_helper< R(*)(T1, T2, T3, T4, T5, T6, T7, T8)>

struct	function_traits_helper< R(*)(T1, T2, T3, T4, T5, T6, T7, T8, T9)>

struct	function_traits_helper< R(*)(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)>

struct	function_traits_helper< R(*)(void)>

struct	functor_to_visitor

struct	future_async_shared_state
	future_async_shared_state More...

struct	future_async_shared_state< Rp &, Fp >

struct	future_async_shared_state< void, Fp >

struct	future_async_shared_state_base
	future_async_shared_state_base More...

struct	future_deferred_shared_state
	future_deferred_shared_state More...

struct	future_deferred_shared_state< Rp &, Fp >

struct	future_deferred_shared_state< void, Fp >

class	future_waiter

struct	generic_owner_less

struct	get_default_starting_vertex_t

struct	get_edge_property_type

struct	get_graph_property_type

struct	get_max

struct	get_underlying_descriptor_from_reverse_descriptor

struct	get_underlying_descriptor_from_reverse_descriptor< reverse_graph_edge_descriptor< Desc > >

struct	get_vertex_property_type

struct	graph_as_tree_edge_property_selector

struct	graph_as_tree_vertex_property_selector

struct	graph_copy_visitor

struct	graph_tag_or_void

struct	graph_tag_or_void< Graph, typename return_void< typename Graph::graph_tag >::type >

struct	grid_graph_adjacent_vertex_at

struct	grid_graph_edge_at

struct	grid_graph_in_edge_at

struct	grid_graph_out_edge_at

struct	grid_graph_vertex_at

struct	gursoy_shortest

struct	gursoy_shortest< dummy_property_map >

struct	has_new_operator_impl

struct	has_not_been_seen

struct	has_nothrow_assign_imp

struct	has_nothrow_constructor_imp

struct	has_nothrow_copy_imp

struct	has_one_T

class	has_size_type

struct	has_trivial_assign_impl

struct	has_trivial_copy_impl

struct	has_trivial_ctor_impl

struct	has_trivial_dtor_impl

struct	has_trivial_move_assign_impl

struct	has_trivial_move_ctor_impl

struct	high_uint_t

struct	icast_identity

struct	in_edge_predicate

struct	inL_edge_status

struct	int_convertible

struct	int_least_helper

struct	int_least_helper< 2 >

struct	int_least_helper< 3 >

struct	int_least_helper< 4 >

struct	int_least_helper< 5 >

class	integer_traits_base

struct	is_abstract_imp

struct	is_abstract_imp2

struct	is_abstract_select

struct	is_abstract_select< false >

struct	is_aligned

struct	is_arithmetic_and_not_xchars

struct	is_arithmetic_impl

struct	is_base_and_derived_impl

struct	is_base_and_derived_impl2

struct	is_base_and_derived_impl3

struct	is_base_and_derived_select

struct	is_base_and_derived_select< true, true, false >

struct	is_base_of_imp

struct	is_char_array_to_stdstring

struct	is_char_array_to_stdstring< boost::container::basic_string< CharT, Traits, Alloc >, CharT * >

struct	is_char_array_to_stdstring< boost::container::basic_string< CharT, Traits, Alloc >, const CharT * >

struct	is_char_array_to_stdstring< std::basic_string< CharT, Traits, Alloc >, CharT * >

struct	is_char_array_to_stdstring< std::basic_string< CharT, Traits, Alloc >, const CharT * >

struct	is_class_impl

struct	is_class_or_union

struct	is_compound_impl

struct	is_const_rvalue_filter

struct	is_const_rvalue_filter< T && >

struct	is_convertible_basic_impl

class	is_convertible_basic_impl< From, To, false >

struct	is_convertible_from_tester

struct	is_convertible_impl

struct	is_convertible_impl_dispatch

struct	is_convertible_impl_dispatch_base

struct	is_convertible_impl_select

struct	is_convertible_impl_select< false, false, true >

struct	is_convertible_impl_select< true, false, true >

struct	is_convertible_impl_select< true, true, false >

struct	is_copy_assignable_impl

struct	is_copy_assignable_impl2

struct	is_copy_assignable_impl2< true, T >

struct	is_copy_constructible_impl

struct	is_copy_constructible_impl2

struct	is_copy_constructible_impl2< true, T >

struct	is_distributed_selector< distributedS< ProcessGroup, LocalS, DistributionS > >

struct	is_empty_impl

struct	is_enum_helper

struct	is_enum_helper< false >

struct	is_enum_impl

struct	is_final_impl

struct	is_function_chooser

struct	is_function_chooser< false >

struct	is_function_impl

struct	is_function_with_no_args

struct	is_function_with_no_args< F(void)>

struct	is_fundamental_impl

struct	is_member_object_pointer_impl

struct	is_mutex_type_wrapper

struct	is_no_property
	This trait returns true if T is no_property. More...

struct	is_nothrow_move_assignable_imp

struct	is_nothrow_move_assignable_imp< T & >

struct	is_nothrow_move_assignable_imp< T && >

struct	is_nothrow_move_assignable_imp< T const >

struct	is_nothrow_move_assignable_imp< T const volatile >

struct	is_nothrow_move_assignable_imp< T volatile >

struct	is_nothrow_move_constructible_imp

struct	is_nothrow_move_constructible_imp< const volatile T >

struct	is_nothrow_move_constructible_imp< T & >

struct	is_nothrow_move_constructible_imp< T && >

struct	is_nothrow_move_constructible_imp< volatile T >

struct	is_object_impl

struct	is_pod_impl

struct	is_pod_impl< T[sz]>

struct	is_pointer_helper

struct	is_pointer_helper< T * >

struct	is_pointer_impl

struct	is_polymorphic_imp

struct	is_polymorphic_imp1

struct	is_polymorphic_imp2

struct	is_polymorphic_selector

struct	is_polymorphic_selector< true >

struct	is_random_access

struct	is_random_access< vecS >

struct	is_random_imp

struct	is_random_imp_selector

struct	is_random_imp_selector< true >

struct	is_random_pointer_imp

struct	is_recursive_wrapper_impl

struct	is_recursive_wrapper_impl< recursive_wrapper< T > >

struct	is_reference_impl

struct	is_related

struct	is_scalar_impl

struct	is_scalar_impl< void >

struct	is_scalar_impl< void const >

struct	is_scalar_impl< void const volatile >

struct	is_scalar_impl< void volatile >

struct	is_signed_helper

struct	is_signed_imp

struct	is_signed_select_helper

struct	is_signed_select_helper< false >

struct	is_signed_values

struct	is_stateless_impl

struct	is_static_visitor_impl

struct	is_static_visitor_tag

struct	is_stdstring

struct	is_stdstring< boost::container::basic_string< CharT, Traits, Alloc > >

struct	is_stdstring< std::basic_string< CharT, Traits, Alloc > >

struct	is_union_impl

struct	is_unsigned_imp

struct	is_unsigned_values

struct	is_ununsigned_helper

struct	is_ununsigned_select_helper

struct	is_ununsigned_select_helper< false >

struct	is_virtual_base_of_impl

struct	is_virtual_base_of_impl2

struct	is_virtual_base_of_impl< Base, Derived, mpl::true_ >

struct	is_volatile_rval_filter

struct	is_volatile_rval_filter< T && >

struct	is_xchar_to_xchar

class	isomorphism_algo

struct	iterator_pointee

class	ks_smart_pointer

struct	less_over_iter

class	lexical_stream

struct	lightweight_forward_adapter_impl

struct	lightweight_forward_adapter_impl< MD, F, FC, 0, 0 >

struct	lightweight_forward_adapter_result

class	lookup_one_property_f

struct	lookup_one_property_f_result

struct	lookup_one_property_f_result< PList, Tag, const lookup_one_property_f< PList, Tag >(const PList &)>

struct	lookup_one_property_f_result< PList, Tag, const lookup_one_property_f< PList, Tag >(PList &)>

struct	lookup_one_property_f_result< PList, Tag, const lookup_one_property_f< PList, Tag >(PList)>

union	lower_alignment

struct	lower_alignment_helper

struct	lower_alignment_helper< false, target, TestType >

class	lvalue_pmap_iter

struct	make_arg_pack_type

struct	make_arg_pack_type< void(K, A)>

struct	make_degree_invariant

struct	make_priority_queue_from_arg_pack_gen

class	make_property_map_from_arg_pack_gen

class	make_property_map_from_arg_pack_gen< MapTag, void >

struct	make_signed_imp

struct	make_unsigned_imp

struct	map_maker

struct	map_maker_helper

struct	map_maker_helper< false, Graph, ArgPack, Value, PM >

class	MapReducedWeight

class	Marker

class	mas_min_cut_visitor

struct	mask_uint_t

struct	mask_uint_t< std::numeric_limits< unsigned char >::digits >

class	matrix_edge_desc_impl

union	max_align

struct	max_comparator_props

struct	max_pow2_less

struct	max_pow2_less< 0, 0 >

struct	maximum_subgraph_interceptor

struct	mcgregor_common_subgraph_traits

class	mcr_howard
	Calculates optimum (maximum/minimum) cycle ratio of a directed graph. More...

class	mcr_howard1
	Finds optimum cycle raio and a critical cycle. More...

struct	min_comparator_props

struct	min_cycles

struct	min_cycles< undirected_tag >

class	mmd_impl

struct	my_tuple_get_class

struct	neighbor_bfs_dispatch

struct	neighbor_bfs_dispatch< param_not_found >

struct	none_helper

struct	nontruth2

struct	null_graph_archetype

class	Numbering

class	odd_components_counter

struct	once_context

struct	or_helper

struct	out_edge_predicate

struct	over_distance_limit

struct	override_const_property_result

struct	override_const_property_t

struct	override_const_property_t< ArgType, Prop, Graph, false >

struct	override_property_result

struct	override_property_t

struct	override_property_t< ArgType, Prop, Graph, false >

struct	parameter_exists

class	predicate_remove_tagged_edges

class	predicateRemoveEdge1

struct	preflow_layer

struct	priority_queue_maker

struct	priority_queue_maker_helper

struct	priority_queue_maker_helper< false, Graph, ArgPack, KeyT, ValueT, KeyMapTag, IndexInHeapMapTag, Compare, Q >

struct	promote_impl

struct	property_kind_from_graph

struct	property_kind_from_graph< G, R T::* >

class	push_relabel

struct	range_lock_guard

struct	range_size

struct	range_size< C, BOOST_DEDUCED_TYPENAME::boost::enable_if< has_size_type< C >, void >::type >

struct	rank_imp

struct	rank_imp< T const [], N >

struct	rank_imp< T const [R], N >

struct	rank_imp< T const volatile[], N >

struct	rank_imp< T const volatile[R], N >

struct	rank_imp< T volatile[], N >

struct	rank_imp< T volatile[R], N >

struct	rank_imp< T[], N >

struct	rank_imp< T[R], N >

class	readable_pmap_iter

class	RecordEdgeMapAndCycleVertex

struct	reflector

struct	relocker

class	remainder

class	remainder< Bits, false >

struct	remove_const_helper

struct	remove_const_helper< T, true >

struct	remove_const_impl

struct	remove_const_impl< T && >

struct	remove_cv_ref

struct	remove_first_property

struct	remove_reverse_edge_descriptor

struct	remove_reverse_edge_descriptor< Graph, reverse_graph_edge_descriptor< Desc > >

struct	remove_rvalue_ref

struct	remove_rvalue_ref< T && >

struct	remove_volatile_helper

struct	remove_volatile_helper< T, true >

struct	remove_volatile_impl

struct	remove_volatile_impl< T && >

struct	report_errors_reminder

struct	resetter

struct	result_of_always_void

struct	result_of_nested_result

struct	result_of_pointer

struct	result_of_void_impl

struct	result_of_void_impl< R(&)(void)>

struct	result_of_void_impl< R(*)(void)>

struct	return_void

class	reverse_graph_edge_descriptor

struct	reverse_graph_edge_descriptor_maker

struct	reverse_graph_edge_property_map

struct	rvalue_ref_filter_rem_cv

struct	rvalue_ref_filter_rem_cv< T && >

struct	sgb_choose_property_map

struct	sgb_choose_property_map< edge_property_tag, PropertyTag >

struct	sgb_choose_property_map< vertex_property_tag, PropertyTag >

struct	shared_state

struct	shared_state< T & >

struct	shared_state< void >

struct	shared_state_base

struct	smart_ptr_pointee

struct	smart_ptr_reference

struct	sp_aligned_storage

struct	sp_array_access

struct	sp_array_access< T[] >

struct	sp_array_access< T[N] >

class	sp_as_deleter

struct	sp_dereference

struct	sp_dereference< T[] >

struct	sp_dereference< T[N] >

struct	sp_dereference< void >

struct	sp_dereference< void const >

struct	sp_dereference< void const volatile >

struct	sp_dereference< void volatile >

struct	sp_element

struct	sp_element< T[] >

struct	sp_element< T[N] >

struct	sp_enable_if_auto_ptr

struct	sp_enable_if_auto_ptr< std::auto_ptr< T >, R >

struct	sp_extent

struct	sp_extent< T[N] >

struct	sp_if_not_array

struct	sp_if_not_array< T[] >

struct	sp_if_not_array< T[N] >

struct	sp_member_access

struct	sp_member_access< T[] >

struct	sp_member_access< T[N] >

class	sp_ms_deleter

class	Stacks

class	state

struct	stream_char

struct	stream_char< const wchar_t * >

struct	stream_char< std::wstring >

struct	stream_char< wchar_t * >

struct	stream_char< wchar_t >

class	string_ref_traits_eq

struct	strong_comp_dispatch1

struct	strong_comp_dispatch1< param_not_found >

struct	strong_comp_dispatch2

struct	strong_comp_dispatch2< param_not_found >

struct	subgraph_choose_pmap

struct	subgraph_choose_pmap_helper

struct	subgraph_choose_pmap_helper< global_property< Tag > >

struct	subgraph_choose_pmap_helper< global_property< vertex_index_t > >

struct	subgraph_choose_pmap_helper< local_property< Tag > >

struct	subgraph_choose_pmap_helper< local_property< vertex_index_t > >

struct	subgraph_choose_pmap_helper< vertex_index_t >

struct	subgraph_global_pmap

struct	subgraph_local_pmap

struct	subgraph_property_generator

struct	subscript_t

class	tarjan_scc_visitor

struct	test

struct	thread_data_base

class	time_stamper_with_vertex_vector
	An extended time_stamper which also records vertices for each dfs number. More...

struct	timeout

struct	tr1_result_of_impl

struct	tr1_result_of_impl< F, FArgs, false >

struct	tr1_result_of_impl< F, FArgs, true >

class	translate_exception

class	translate_exception_base

struct	true_t

struct	try_lock_impl_return

struct	try_lock_impl_return< Iterator, false >

singleton	try_lock_wrapper

struct	tss_cleanup_function

struct	tss_data_node

class	type_with_alignment_imp

struct	udfs_dispatch

struct	udfs_dispatch< param_not_found >

struct	uint_least_helper

struct	uint_least_helper< 2 >

struct	uint_least_helper< 3 >

struct	uint_least_helper< 4 >

struct	uint_least_helper< 5 >

struct	unary_traits_imp

struct	unary_traits_imp< Operation * >

struct	unary_traits_imp< R(*)(A)>

struct	underlying_edge_desc_map_type

struct	underlying_type_impl

struct	undir_adj_matrix_in_edge_iter

struct	undir_adj_matrix_out_edge_iter

struct	unique_maximum_subgraph_interceptor

struct	unique_subgraph_interceptor

struct	unused_tag_type

struct	update_position_visitor

struct	val_edge

struct	val_out_edge_iter

class	val_out_edge_iterator

struct	val_out_edge_ret

struct	vector_matrix

struct	vertex_copier

struct	vertex_frequency_degree_cmp

struct	vertex_in_out_degree_cmp

struct	vertex_property_map

struct	vertex_property_map_generator

struct	vertex_property_map_generator_helper

struct	vertex_property_map_generator_helper< Graph, IndexMap, Value, false >

struct	vertex_property_map_generator_helper< Graph, IndexMap, Value, true >

struct	vf2_match_continuation

struct	width

Typedefs
typedef std::nullptr_t	addr_nullptr_t

typedef boost::shared_ptr < thread_data_base >	thread_data_ptr

typedef basic_recursive_mutex_impl < basic_timed_mutex >	basic_recursive_mutex

typedef basic_recursive_mutex_impl < basic_timed_mutex >	basic_recursive_timed_mutex

typedef ::boost::detail::basic_timed_mutex	underlying_mutex

typedef char	once_char_type

typedef void(*	function_ptr )()

typedef intalignment_dummy::*	member_ptr

typedef int(alignment_dummy::*	member_function_ptr )()

typedef void	static_visitor_default_return

Enumerations
enum	target_graph_t { tg_k_3_3, tg_k_5 }

enum	planar_canonical_ordering_state { PCO_PROCESSED, PCO_UNPROCESSED, PCO_ONE_NEIGHBOR_PROCESSED, PCO_READY_TO_BE_PROCESSED }

enum	bm_case_t { BM_NO_CASE_CHOSEN, BM_CASE_A, BM_CASE_B, BM_CASE_C, BM_CASE_D, BM_CASE_E }

enum	problem_selector { subgraph_mono, subgraph_iso, isomorphism }

enum	event_visitor_enum { on_no_event_num, on_initialize_vertex_num, on_start_vertex_num, on_discover_vertex_num, on_finish_vertex_num, on_examine_vertex_num, on_examine_edge_num, on_tree_edge_num, on_non_tree_edge_num, on_gray_target_num, on_black_target_num, on_forward_or_cross_edge_num, on_back_edge_num, on_finish_edge_num, on_edge_relaxed_num, on_edge_not_relaxed_num, on_edge_minimized_num, on_edge_not_minimized_num }

enum	ePropertyMapID { READABLE_PA, WRITABLE_PA, READ_WRITE_PA, LVALUE_PA, OP_BRACKET_PA, RAND_ACCESS_ITER_PA, LAST_PA }

enum	once_action { try_, break_, continue_ }

Functions
template<typename ForwardIter , class Compare >
std::pair< ForwardIter, ForwardIter >	basic_minmax_element (ForwardIter first, ForwardIter last, Compare comp)

template<typename ForwardIter , class BinaryPredicate >
ForwardIter	basic_first_min_element (ForwardIter first, ForwardIter last, BinaryPredicate comp)

template<typename ForwardIter , class BinaryPredicate >
ForwardIter	basic_last_min_element (ForwardIter first, ForwardIter last, BinaryPredicate comp)

template<typename ForwardIter , class BinaryPredicate >
ForwardIter	basic_first_max_element (ForwardIter first, ForwardIter last, BinaryPredicate comp)

template<typename ForwardIter , class BinaryPredicate >
ForwardIter	basic_last_max_element (ForwardIter first, ForwardIter last, BinaryPredicate comp)

template<typename ForwardIter , class BinaryPredicate >
std::pair< ForwardIter, ForwardIter >	basic_first_min_last_max_element (ForwardIter first, ForwardIter last, BinaryPredicate comp)

template<typename ForwardIter , class BinaryPredicate >
std::pair< ForwardIter, ForwardIter >	basic_last_min_first_max_element (ForwardIter first, ForwardIter last, BinaryPredicate comp)

template<typename ForwardIter , class BinaryPredicate >
std::pair< ForwardIter, ForwardIter >	basic_last_min_last_max_element (ForwardIter first, ForwardIter last, BinaryPredicate comp)

report_errors_reminder &	report_errors_remind ()

int &	test_errors ()

void	test_failed_impl (char const expr, char const file, int line, char const *function)

void	error_impl (char const msg, char const file, int line, char const *function)

void	throw_failed_impl (char const excep, char const file, int line, char const *function)

template<class T , class U >
void	test_eq_impl (char const expr1, char const expr2, char const file, int line, char const function, T const &t, U const &u)

template<class T , class U >
void	test_ne_impl (char const expr1, char const expr2, char const file, int line, char const function, T const &t, U const &u)

template<class T >
void	test_trait_impl (char const trait, void()(T), bool expected, char const file, int line, char const function)

void	current_function_helper ()

template<typename T >
T	make_non_const (T t)

template<typename EdgeProperty >
bool	get_edge_exists (const std::pair< bool, EdgeProperty > &stored_edge, int)

template<typename EdgeProperty >
void	set_edge_exists (std::pair< bool, EdgeProperty > &stored_edge, bool flag, int)

template<typename EdgeProxy >
bool	get_edge_exists (const EdgeProxy &edge_proxy,...)

template<typename EdgeProxy >
EdgeProxy &	set_edge_exists (EdgeProxy &edge_proxy, bool flag,...)

template<typename EdgeProperty >
const EdgeProperty &	get_edge_property (const std::pair< bool, EdgeProperty > &stored_edge)

template<typename EdgeProperty >
EdgeProperty &	get_edge_property (std::pair< bool, EdgeProperty > &stored_edge)

template<typename StoredEdgeProperty , typename EdgeProperty >
void	set_edge_property (std::pair< bool, StoredEdgeProperty > &stored_edge, const EdgeProperty &ep, int)

const no_property &	get_edge_property (const char &)

no_property &	get_edge_property (char &)

template<typename EdgeProxy , typename EdgeProperty >
void	set_edge_property (EdgeProxy, const EdgeProperty &,...)

template<typename VertexAndEdgeListGraph , typename Size , typename WeightMap , typename PredecessorMap , typename DistanceMap , typename P , typename T , typename R >
bool	bellman_dispatch2 (VertexAndEdgeListGraph &g, typename graph_traits< VertexAndEdgeListGraph >::vertex_descriptor s, Size N, WeightMap weight, PredecessorMap pred, DistanceMap distance, const bgl_named_params< P, T, R > &params)

template<typename VertexAndEdgeListGraph , typename Size , typename WeightMap , typename PredecessorMap , typename DistanceMap , typename P , typename T , typename R >
bool	bellman_dispatch2 (VertexAndEdgeListGraph &g, param_not_found, Size N, WeightMap weight, PredecessorMap pred, DistanceMap distance, const bgl_named_params< P, T, R > &params)

template<class EdgeListGraph , class Size , class WeightMap , class DistanceMap , class P , class T , class R >
bool	bellman_dispatch (EdgeListGraph &g, Size N, WeightMap weight, DistanceMap distance, const bgl_named_params< P, T, R > &params)

template<typename Graph , typename ComponentMap , typename OutputIterator , typename VertexIndexMap , typename DiscoverTimeMap , typename LowPointMap , typename PredecessorMap , typename DFSVisitor >
std::pair< std::size_t, OutputIterator >	biconnected_components_impl (const Graph &g, ComponentMap comp, OutputIterator out, VertexIndexMap index_map, DiscoverTimeMap dtm, LowPointMap lowpt, PredecessorMap pred, DFSVisitor dfs_vis)

template<typename PartitionMap >
bipartition_colorize < PartitionMap >	colorize_bipartition (PartitionMap partition_map)
	Creates a bipartition_colorize functor which colors edges to be non-monochromatic. More...

template<typename PartitionMap >
bipartition_check< PartitionMap >	check_bipartition (PartitionMap partition_map)
	Creates a bipartition_check functor which raises an error if a monochromatic edge is found. More...

template<typename BiDirectionalIterator1 , typename BiDirectionalIterator2 >
std::pair < BiDirectionalIterator1, BiDirectionalIterator2 >	reverse_mismatch (std::pair< BiDirectionalIterator1, BiDirectionalIterator1 > sequence1, std::pair< BiDirectionalIterator2, BiDirectionalIterator2 > sequence2)
	Find the beginning of a common suffix of two sequences. More...

template<class VertexListGraph , class ColorMap , class BFSVisitor , class P , class T , class R >
void	bfs_helper (VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, ColorMap color, BFSVisitor vis, const bgl_named_params< P, T, R > &params, boost::mpl::false_)

template<typename Graph >
bool	is_connected_to_clique (const Graph &g, typename graph_traits< Graph >::vertex_descriptor u, typename graph_traits< Graph >::vertex_descriptor v, typename graph_traits< Graph >::undirected_category)

template<typename Graph >
bool	is_connected_to_clique (const Graph &g, typename graph_traits< Graph >::vertex_descriptor u, typename graph_traits< Graph >::vertex_descriptor v, typename graph_traits< Graph >::directed_category)

template<typename Graph , typename Container >
void	filter_unconnected_vertices (const Graph &g, typename graph_traits< Graph >::vertex_descriptor v, const Container &in, Container &out)

template<typename Graph , typename Clique , typename Container , typename Visitor >
void	extend_clique (const Graph &g, Clique &clique, Container &cands, Container &nots, Visitor vis, std::size_t min)

template<class Graph >
graph_traits< Graph > ::degree_size_type	possible_edges (const Graph &g, std::size_t k, directed_tag)

template<class Graph >
graph_traits< Graph > ::degree_size_type	possible_edges (const Graph &g, size_t k, undirected_tag)

template<class Graph >
graph_traits< Graph > ::degree_size_type	count_edges (const Graph &g, typename graph_traits< Graph >::vertex_descriptor u, typename graph_traits< Graph >::vertex_descriptor v, directed_tag)

template<class Graph >
graph_traits< Graph > ::degree_size_type	count_edges (const Graph &g, typename graph_traits< Graph >::vertex_descriptor u, typename graph_traits< Graph >::vertex_descriptor v, undirected_tag)

template<typename Graph1 , typename Graph2 >
edge_copier< Graph1, Graph2 >	make_edge_copier (const Graph1 &g1, Graph2 &g2)

template<typename Graph1 , typename Graph2 >
vertex_copier< Graph1, Graph2 >	make_vertex_copier (const Graph1 &g1, Graph2 &g2)

template<typename Param , typename G1 , typename G2 >
detail::choose_edge_copier_helper < Param, G1, G2 >::result_type	choose_edge_copier (const Param &params, const G1 &g_in, G2 &g_out)

template<typename Param , typename G1 , typename G2 >
detail::choose_vertex_copier_helper < Param, G1, G2 >::result_type	choose_vertex_copier (const Param &params, const G1 &g_in, G2 &g_out)

template<typename Graph , typename MutableGraph , typename CopyVertex , typename CopyEdge , typename Orig2CopyVertexIndexMap , typename Params >
graph_traits< MutableGraph > ::vertex_descriptor	copy_component_impl (const Graph &g_in, typename graph_traits< Graph >::vertex_descriptor src, MutableGraph &g_out, CopyVertex copy_vertex, CopyEdge copy_edge, Orig2CopyVertexIndexMap orig2copy, const Params &params)

template<typename Graph , typename CoreMap , typename EdgeWeightMap >
void	compute_in_degree_map (Graph &g, CoreMap d, EdgeWeightMap wm)

template<typename Graph , typename CoreMap , typename EdgeWeightMap , typename MutableQueue , typename Visitor >
property_traits< CoreMap > ::value_type	core_numbers_impl (Graph &g, CoreMap c, EdgeWeightMap wm, MutableQueue &Q, Visitor vis)

template<typename Graph , typename CoreMap , typename EdgeWeightMap , typename IndexMap , typename CoreNumVisitor >
property_traits< CoreMap > ::value_type	core_numbers_dispatch (Graph &g, CoreMap c, EdgeWeightMap wm, IndexMap im, CoreNumVisitor vis)

template<typename Graph , typename CoreMap , typename PositionMap , typename Visitor >
property_traits< CoreMap > ::value_type	core_numbers_impl (Graph &g, CoreMap c, PositionMap pos, Visitor vis)

template<class Graph , class P , class T , class R , class ResidualCapacity , class Weight , class Reversed , class Pred , class Distance >
void	cycle_canceling_dispatch2 (const Graph &g, Weight weight, Reversed rev, ResidualCapacity residual_capacity, Pred pred, Distance dist, const bgl_named_params< P, T, R > &params)

template<class Graph , class P , class T , class R , class Pred , class ResidualCapacity , class Weight , class Reversed >
void	cycle_canceling_dispatch2 (Graph &g, Weight weight, Reversed rev, ResidualCapacity residual_capacity, Pred pred, param_not_found, const bgl_named_params< P, T, R > &params)

template<class Graph , class P , class T , class R , class ResidualCapacity , class Weight , class Reversed , class Pred >
void	cycle_canceling_dispatch1 (Graph &g, Weight weight, Reversed rev, ResidualCapacity residual_capacity, Pred pred, const bgl_named_params< P, T, R > &params)

template<class Graph , class P , class T , class R , class ResidualCapacity , class Weight , class Reversed >
void	cycle_canceling_dispatch1 (Graph &g, Weight weight, Reversed rev, ResidualCapacity residual_capacity, param_not_found, const bgl_named_params< P, T, R > &params)

template<class VertexListGraph , class DijkstraVisitor , class DistanceMap , class WeightMap , class ColorMap , class IndexMap , class Params >
void	dag_sp_dispatch2 (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, DistanceMap distance, WeightMap weight, ColorMap color, IndexMap, DijkstraVisitor vis, const Params &params)

template<class VertexListGraph , class DijkstraVisitor , class DistanceMap , class WeightMap , class ColorMap , class IndexMap , class Params >
void	dag_sp_dispatch1 (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, DistanceMap distance, WeightMap weight, ColorMap color, IndexMap id, DijkstraVisitor vis, const Params &params)

template<typename E , typename G , typename Vis >
void	call_finish_edge (Vis &vis, const E &e, const G &g)

template<class IncidenceGraph , class DFSVisitor , class ColorMap , class TerminatorFunc >
void	depth_first_visit_impl (const IncidenceGraph &g, typename graph_traits< IncidenceGraph >::vertex_descriptor u, DFSVisitor &vis, ColorMap color, TerminatorFunc func=TerminatorFunc())

template<class VertexListGraph , class DistanceMap , class WeightMap , class IndexMap , class Params >
void	dijkstra_dispatch2 (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, DistanceMap distance, WeightMap weight, IndexMap index_map, const Params &params)

template<class VertexListGraph , class DistanceMap , class WeightMap , class IndexMap , class Params >
void	dijkstra_dispatch1 (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, DistanceMap distance, WeightMap weight, IndexMap index_map, const Params &params)

template<typename Graph , typename DistanceMap , typename WeightMap , typename VertexIndexMap , typename Params >
void	dijkstra_no_color_map_dispatch2 (const Graph &graph, typename graph_traits< Graph >::vertex_descriptor start_vertex, DistanceMap distance_map, WeightMap weight_map, VertexIndexMap index_map, const Params &params)

template<typename Graph , typename DistanceMap , typename WeightMap , typename IndexMap , typename Params >
void	dijkstra_no_color_map_dispatch1 (const Graph &graph, typename graph_traits< Graph >::vertex_descriptor start_vertex, DistanceMap distance_map, WeightMap weight_map, IndexMap index_map, const Params &params)

template<typename Archiver , typename Directed , typename Vertex >
void	serialize (Archiver &ar, edge_base< Directed, Vertex > &e, const unsigned int)

template<typename Archiver , typename Directed , typename Vertex >
void	serialize (Archiver &ar, edge_desc_impl< Directed, Vertex > &e, const unsigned int)

template<typename IndexMap >
void	swap (has_not_been_seen< IndexMap > &x, has_not_been_seen< IndexMap > &y)

template<class DistributedGraph , class ColorMap , class BFSVisitor , class BufferRef , class VertexIndexMap >
void	parallel_bfs_helper (DistributedGraph &g, typename graph_traits< DistributedGraph >::vertex_descriptor s, ColorMap color, BFSVisitor vis, BufferRef Q, VertexIndexMap)

template<class DistributedGraph , class ColorMap , class BFSVisitor , class VertexIndexMap >
void	parallel_bfs_helper (DistributedGraph &g, typename graph_traits< DistributedGraph >::vertex_descriptor s, ColorMap color, BFSVisitor vis, boost::param_not_found, VertexIndexMap vertex_index)

template<class DistributedGraph , class ColorMap , class BFSVisitor , class P , class T , class R >
void	bfs_helper (DistributedGraph &g, typename graph_traits< DistributedGraph >::vertex_descriptor s, ColorMap color, BFSVisitor vis, const bgl_named_params< P, T, R > &params, boost::mpl::true_)

template<class TimeMap , class VertexVector , class TimeT , class Tag >
time_stamper_with_vertex_vector < TimeMap, VertexVector, TimeT, Tag >	stamp_times_with_vertex_vector (TimeMap timeMap, VertexVector &v, TimeT &t, Tag)
	A convenient way to create a time_stamper_with_vertex_vector. More...

template<typename Graph , typename ColorMap >
bool	is_free (const Graph &g, ColorMap color, typename boost::graph_traits< Graph >::vertex_descriptor u, typename boost::property_traits< ColorMap >::value_type free_color)

template<typename Graph , typename ColorMap >
std::vector< typename boost::graph_traits< Graph > ::vertex_descriptor >	maximal_fan (const Graph &g, ColorMap color, typename boost::graph_traits< Graph >::vertex_descriptor x, typename boost::graph_traits< Graph >::vertex_descriptor y)

template<typename Graph , typename ColorMap >
boost::property_traits < ColorMap >::value_type	find_free_color (const Graph &g, ColorMap color, typename boost::graph_traits< Graph >::vertex_descriptor u)

template<typename Graph , typename ColorMap >
void	invert_cd_path (const Graph &g, ColorMap color, typename boost::graph_traits< Graph >::vertex_descriptor x, typename boost::graph_traits< Graph >::edge_descriptor eold, typename boost::property_traits< ColorMap >::value_type c, typename boost::property_traits< ColorMap >::value_type d)

template<typename Graph , typename ColorMap >
void	invert_cd_path (const Graph &g, ColorMap color, typename boost::graph_traits< Graph >::vertex_descriptor x, typename boost::property_traits< ColorMap >::value_type c, typename boost::property_traits< ColorMap >::value_type d)

template<typename Graph , typename ColorMap , typename ForwardIterator >
void	rotate_fan (const Graph &g, ColorMap color, typename boost::graph_traits< Graph >::vertex_descriptor x, ForwardIterator begin, ForwardIterator end)

template<class Graph >
std::pair< typename graph_traits< Graph > ::vertex_descriptor, typename graph_traits< Graph > ::degree_size_type >	min_degree_vertex (Graph &g)

template<class Graph , class OutputIterator >
void	neighbors (const Graph &g, typename graph_traits< Graph >::vertex_descriptor u, OutputIterator result)

template<class Graph , class VertexIterator , class OutputIterator >
void	neighbors (const Graph &g, VertexIterator first, VertexIterator last, OutputIterator result)

template<class Graph , class ResCapMap >
filtered_graph< Graph, is_residual_edge< ResCapMap > >	residual_graph (Graph &g, ResCapMap residual_capacity)

template<class Graph , class PredEdgeMap , class ResCapMap , class RevEdgeMap >
void	augment (Graph &g, typename graph_traits< Graph >::vertex_descriptor src, typename graph_traits< Graph >::vertex_descriptor sink, PredEdgeMap p, ResCapMap residual_capacity, RevEdgeMap reverse_edge)

template<typename T , typename BinaryPredicate >
T	min_with_compare (const T &x, const T &y, const BinaryPredicate &compare)

template<typename VertexListGraph , typename DistanceMatrix , typename BinaryPredicate , typename BinaryFunction , typename Infinity , typename Zero >
bool	floyd_warshall_dispatch (const VertexListGraph &g, DistanceMatrix &d, const BinaryPredicate &compare, const BinaryFunction &combine, const Infinity &inf, const Zero &zero)

template<class VertexListGraph , class DistanceMatrix , class WeightMap , class P , class T , class R >
bool	floyd_warshall_init_dispatch (const VertexListGraph &g, DistanceMatrix &d, WeightMap, const bgl_named_params< P, T, R > &params)

template<class VertexAndEdgeListGraph , class DistanceMatrix , class WeightMap , class P , class T , class R >
bool	floyd_warshall_noninit_dispatch (const VertexAndEdgeListGraph &g, DistanceMatrix &d, WeightMap w, const bgl_named_params< P, T, R > &params)

template<typename Topology , typename PropMap , typename Vertex >
void	maybe_jitter_point (const Topology &topology, const PropMap &pm, Vertex v, const typename Topology::point_type &p2)

	BOOST_MPL_HAS_XXX_TRAIT_DEF (adjacency_iterator) template< typename T > struct BOOST_JOIN(get_member_

template<typename T >
struct	BOOST_JOIN (get_opt_member_, adjacency_iterator)

	BOOST_MPL_HAS_XXX_TRAIT_DEF (out_edge_iterator) template< typename T > struct BOOST_JOIN(get_member_

template<typename T >
struct	BOOST_JOIN (get_opt_member_, out_edge_iterator)

	BOOST_MPL_HAS_XXX_TRAIT_DEF (in_edge_iterator) template< typename T > struct BOOST_JOIN(get_member_

template<typename T >
struct	BOOST_JOIN (get_opt_member_, in_edge_iterator)

	BOOST_MPL_HAS_XXX_TRAIT_DEF (vertex_iterator) template< typename T > struct BOOST_JOIN(get_member_

template<typename T >
struct	BOOST_JOIN (get_opt_member_, vertex_iterator)

	BOOST_MPL_HAS_XXX_TRAIT_DEF (edge_iterator) template< typename T > struct BOOST_JOIN(get_member_

template<typename T >
struct	BOOST_JOIN (get_opt_member_, edge_iterator)

	BOOST_MPL_HAS_XXX_TRAIT_DEF (vertices_size_type) template< typename T > struct BOOST_JOIN(get_member_

template<typename T >
struct	BOOST_JOIN (get_opt_member_, vertices_size_type)

	BOOST_MPL_HAS_XXX_TRAIT_DEF (edges_size_type) template< typename T > struct BOOST_JOIN(get_member_

template<typename T >
struct	BOOST_JOIN (get_opt_member_, edges_size_type)

	BOOST_MPL_HAS_XXX_TRAIT_DEF (degree_size_type) template< typename T > struct BOOST_JOIN(get_member_

template<typename T >
struct	BOOST_JOIN (get_opt_member_, degree_size_type)

bool	is_directed (directed_tag)

bool	is_directed (undirected_tag)

bool	allows_parallel (allow_parallel_edge_tag)

bool	allows_parallel (disallow_parallel_edge_tag)

template<class Graph_ , class RandomAccessIterator , class VertexID >
void	write_graphviz_subgraph (std::ostream &out, const subgraph< Graph_ > &g, RandomAccessIterator vertex_marker, RandomAccessIterator edge_marker, VertexID vertex_id)

template<typename FT , typename TG , typename TVIM , typename TEW1 , typename TEW2 , typename EV >
FT::value_type	optimum_cycle_ratio (const TG &g, TVIM vim, TEW1 ewm, TEW2 ew2m, EV *pcc)

template<typename Graph >
Graph	make_K_5 ()

template<typename Graph >
Graph	make_K_3_3 ()

template<typename AdjacencyList , typename Vertex >
void	contract_edge (AdjacencyList &neighbors, Vertex u, Vertex v)

template<typename Graph , typename InDegreeMap >
void	compute_in_degree (const Graph &g, InDegreeMap in_degree_map)

template<typename Graph1 , typename Graph2 , typename IsoMapping , typename IndexMap1 , typename IndexMap2 , typename P , typename T , typename R >
bool	isomorphism_impl (const Graph1 &G1, const Graph2 &G2, IsoMapping f, IndexMap1 index_map1, IndexMap2 index_map2, const bgl_named_params< P, T, R > &params)

template<class VertexAndEdgeListGraph , class DistanceMatrix , class P , class T , class R , class Weight , class VertexID >
bool	johnson_dispatch (VertexAndEdgeListGraph &g, DistanceMatrix &D, const bgl_named_params< P, T, R > &params, Weight w, VertexID id)

template<class Graph , class OutputIterator , class Rank , class Parent , class Weight >
void	kruskal_mst_impl (const Graph &G, OutputIterator spanning_tree_edges, Rank rank, Parent parent, Weight weight)

template<class Graph , class WeightMap , class MASVisitor , class VertexAssignmentMap , class KeyedUpdatablePriorityQueue >
void	maximum_adjacency_search (const Graph &g, WeightMap weights, MASVisitor vis, const typename boost::graph_traits< Graph >::vertex_descriptor start, VertexAssignmentMap assignments, KeyedUpdatablePriorityQueue pq)

template<typename GraphFirst , typename GraphSecond , typename CorrespondenceMapFirstToSecond , typename CorrespondenceMapSecondToFirst , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate >
bool	can_extend_graph (const GraphFirst &graph1, const GraphSecond &graph2, CorrespondenceMapFirstToSecond correspondence_map_1_to_2, CorrespondenceMapSecondToFirst, typename graph_traits< GraphFirst >::vertices_size_type subgraph_size, typename graph_traits< GraphFirst >::vertex_descriptor new_vertex1, typename graph_traits< GraphSecond >::vertex_descriptor new_vertex2, EdgeEquivalencePredicate edges_equivalent, VertexEquivalencePredicate vertices_equivalent, bool only_connected_subgraphs)

template<typename GraphFirst , typename GraphSecond , typename VertexIndexMapFirst , typename VertexIndexMapSecond , typename CorrespondenceMapFirstToSecond , typename CorrespondenceMapSecondToFirst , typename VertexStackFirst , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename SubGraphInternalCallback >
bool	mcgregor_common_subgraphs_internal (const GraphFirst &graph1, const GraphSecond &graph2, const VertexIndexMapFirst &vindex_map1, const VertexIndexMapSecond &vindex_map2, CorrespondenceMapFirstToSecond correspondence_map_1_to_2, CorrespondenceMapSecondToFirst correspondence_map_2_to_1, VertexStackFirst &vertex_stack1, EdgeEquivalencePredicate edges_equivalent, VertexEquivalencePredicate vertices_equivalent, bool only_connected_subgraphs, SubGraphInternalCallback subgraph_callback)

template<typename GraphFirst , typename GraphSecond , typename VertexIndexMapFirst , typename VertexIndexMapSecond , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename SubGraphInternalCallback >
void	mcgregor_common_subgraphs_internal_init (const GraphFirst &graph1, const GraphSecond &graph2, const VertexIndexMapFirst vindex_map1, const VertexIndexMapSecond vindex_map2, EdgeEquivalencePredicate edges_equivalent, VertexEquivalencePredicate vertices_equivalent, bool only_connected_subgraphs, SubGraphInternalCallback subgraph_callback)

template<typename ArgPack , typename Tag , typename Prop , typename Graph >
override_const_property_result < ArgPack, Tag, Prop, Graph > ::type	override_const_property (const ArgPack &ap, const boost::parameter::keyword< Tag > &t, const Graph &g, Prop)

template<typename ArgPack , typename Tag , typename Prop , typename Graph >
override_property_result < ArgPack, Tag, Prop, Graph > ::type	override_property (const ArgPack &ap, const boost::parameter::keyword< Tag > &t, const Graph &g, Prop)

template<typename G >
boost::graph_traits< G > ::vertex_descriptor	get_null_vertex (const G &)

template<typename G >
boost::graph_traits< G > ::vertex_descriptor	get_default_starting_vertex (const G &g)

template<class BidirectionalGraph , class Buffer , class BFSVisitor , class ColorMap >
void	neighbor_bfs_impl (const BidirectionalGraph &g, typename graph_traits< BidirectionalGraph >::vertex_descriptor s, Buffer &Q, BFSVisitor vis, ColorMap color)

template<class VertexListGraph , class ColorMap , class BFSVisitor , class P , class T , class R >
void	neighbor_bfs_helper (VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, ColorMap color, BFSVisitor vis, const bgl_named_params< P, T, R > &params)

template<class Graph , class P , class T , class R , class Weight >
void	prim_mst_impl (const Graph &G, typename graph_traits< Graph >::vertex_descriptor s, const bgl_named_params< P, T, R > &params, Weight)

template<class Graph , class Tag >
graph_property_iter_range < Graph, Tag >::type	get_property_iter_range_kind (Graph &graph, const Tag &tag, const vertex_property_tag &)

template<class Graph , class Tag >
graph_property_iter_range < Graph, Tag >::const_type	get_property_iter_range_kind (const Graph &graph, const Tag &tag, const vertex_property_tag &)

template<class Graph , class Tag >
graph_property_iter_range < Graph, Tag >::type	get_property_iter_range_kind (Graph &graph, const Tag &tag, const edge_property_tag &)

template<class Graph , class Tag >
graph_property_iter_range < Graph, Tag >::const_type	get_property_iter_range_kind (const Graph &graph, const Tag &tag, const edge_property_tag &)

template<class Graph , class VertexIndexMap , class EdgeIndexMap , class Resource_Container , class Resource_Extension_Function , class Dominance_Function , class Label_Allocator , class Visitor >
void	r_c_shortest_paths_dispatch (const Graph &g, const VertexIndexMap &vertex_index_map, const EdgeIndexMap &, typename graph_traits< Graph >::vertex_descriptor s, typename graph_traits< Graph >::vertex_descriptor t, std::vector< std::vector< typename graph_traits< Graph >::edge_descriptor > > &pareto_optimal_solutions, std::vector< Resource_Container > &pareto_optimal_resource_containers, bool b_all_pareto_optimal_solutions, const Resource_Container &rc, Resource_Extension_Function &ref, Dominance_Function &dominance, Label_Allocator, Visitor vis)

template<class Property , class G , class RandomGenerator >
void	randomize_property (G &g, RandomGenerator &rg, Property, vertex_property_tag)

template<class Property , class G , class RandomGenerator >
void	randomize_property (G &g, RandomGenerator &rg, Property, edge_property_tag)

template<typename Graph , typename PredMap , typename ColorMap , typename NextEdge >
void	random_spanning_tree_internal (const Graph &g, typename graph_traits< Graph >::vertex_descriptor s, PredMap pred, ColorMap color, NextEdge next_edge)

template<class Graph , class CapacityMap , class ReverseEdgeMap >
int	read_dimacs_max_flow_internal (Graph &g, CapacityMap capacity, ReverseEdgeMap reverse_edge, typename graph_traits< Graph >::vertex_descriptor &src, typename graph_traits< Graph >::vertex_descriptor &sink, std::istream &in, bool require_source_and_sink, const std::string &problem_type)

template<typename EdgeDesc , typename Iter >
std::pair< transform_iterator < reverse_graph_edge_descriptor_maker < EdgeDesc >, Iter > , transform_iterator < reverse_graph_edge_descriptor_maker < EdgeDesc >, Iter > >	reverse_edge_iter_pair (const std::pair< Iter, Iter > &ip)

template<class E >
E	get (underlying_edge_desc_map_type< E > m, const reverse_graph_edge_descriptor< E > &k)

template<class UndirectedGraph , class WeightMap , class ParityMap , class VertexAssignmentMap , class KeyedUpdatablePriorityQueue , class IndexMap >
boost::property_traits < WeightMap >::value_type	stoer_wagner_min_cut (const UndirectedGraph &g, WeightMap weights, ParityMap parities, VertexAssignmentMap assignments, KeyedUpdatablePriorityQueue &pq, IndexMap index_map)
	Computes a min-cut of the input graph. More...

template<class Graph , class ComponentMap , class RootMap , class DiscoverTime , class P , class T , class R >
property_traits< ComponentMap > ::value_type	strong_components_impl (const Graph &g, ComponentMap comp, RootMap root, DiscoverTime discover_time, const bgl_named_params< P, T, R > &params)

template<class Graph , class ComponentMap , class RootMap , class P , class T , class R , class DiscoverTimeMap >
property_traits< ComponentMap > ::value_type	scc_helper2 (const Graph &g, ComponentMap comp, RootMap r_map, const bgl_named_params< P, T, R > &params, DiscoverTimeMap time_map)

template<class Graph , class ComponentMap , class RootMap , class P , class T , class R >
property_traits< ComponentMap > ::value_type	scc_helper1 (const Graph &g, ComponentMap comp, const bgl_named_params< P, T, R > &params, RootMap r_map)

template<typename Vertex , typename Edge , typename Graph >
void	add_edge_recur_down (Vertex u_global, Vertex v_global, Edge e_global, subgraph< Graph > &g)

template<typename Vertex , typename Edge , typename Children , typename G >
void	children_add_edge (Vertex u_global, Vertex v_global, Edge e_global, Children &c, subgraph< G > *orig)

template<typename Vertex , typename Edge , typename Graph >
void	add_edge_recur_down (Vertex u_global, Vertex v_global, Edge e_global, subgraph< Graph > &g, subgraph< Graph > *orig)

template<typename Vertex , typename Graph >
std::pair< typename subgraph < Graph >::edge_descriptor, bool >	add_edge_recur_up (Vertex u_global, Vertex v_global, const typename Graph::edge_property_type &ep, subgraph< Graph > &g, subgraph< Graph > *orig)

template<typename Vertex , typename Graph >
void	remove_edge_recur_down (Vertex u_global, Vertex v_global, subgraph< Graph > &g)

template<typename Vertex , typename Children >
void	children_remove_edge (Vertex u_global, Vertex v_global, Children &c)

template<typename Vertex , typename Graph >
void	remove_edge_recur_up (Vertex u_global, Vertex v_global, subgraph< Graph > &g)

template<typename G , typename Edge , typename Children >
void	children_remove_edge (Edge e_global, Children &c)

template<typename G >
subgraph< G >::vertex_descriptor	add_vertex_recur_up (subgraph< G > &g)

template<class Graph , class Weight , class Distance , class Reversed >
MapReducedWeight< Graph, Weight, Distance, Reversed >	make_mapReducedWeight (const Graph &g, Weight w, Distance d, Reversed r)

template<class Graph , class Capacity , class ResidualCapacity , class Weight , class Reversed , class Pred , class Distance , class Distance2 , class VertexIndex >
void	successive_shortest_path_nonnegative_weights_dispatch3 (const Graph &g, typename graph_traits< Graph >::vertex_descriptor s, typename graph_traits< Graph >::vertex_descriptor t, Capacity capacity, ResidualCapacity residual_capacity, Weight weight, Reversed rev, VertexIndex index, Pred pred, Distance dist, Distance2 dist_pred)

template<class Graph , class Capacity , class ResidualCapacity , class Weight , class Reversed , class Pred , class Distance , class VertexIndex >
void	successive_shortest_path_nonnegative_weights_dispatch3 (Graph &g, typename graph_traits< Graph >::vertex_descriptor s, typename graph_traits< Graph >::vertex_descriptor t, Capacity capacity, ResidualCapacity residual_capacity, Weight weight, Reversed rev, VertexIndex index, Pred pred, Distance dist, param_not_found)

template<class Graph , class P , class T , class R , class Capacity , class ResidualCapacity , class Weight , class Reversed , class Pred , class Distance , class VertexIndex >
void	successive_shortest_path_nonnegative_weights_dispatch2 (Graph &g, typename graph_traits< Graph >::vertex_descriptor s, typename graph_traits< Graph >::vertex_descriptor t, Capacity capacity, ResidualCapacity residual_capacity, Weight weight, Reversed rev, VertexIndex index, Pred pred, Distance dist, const bgl_named_params< P, T, R > &params)

template<class Graph , class P , class T , class R , class Capacity , class ResidualCapacity , class Weight , class Reversed , class Pred , class VertexIndex >
void	successive_shortest_path_nonnegative_weights_dispatch2 (Graph &g, typename graph_traits< Graph >::vertex_descriptor s, typename graph_traits< Graph >::vertex_descriptor t, Capacity capacity, ResidualCapacity residual_capacity, Weight weight, Reversed rev, VertexIndex index, Pred pred, param_not_found, const bgl_named_params< P, T, R > &params)

template<class Graph , class P , class T , class R , class Capacity , class ResidualCapacity , class Weight , class Reversed , class Pred , class VertexIndex >
void	successive_shortest_path_nonnegative_weights_dispatch1 (Graph &g, typename graph_traits< Graph >::vertex_descriptor s, typename graph_traits< Graph >::vertex_descriptor t, Capacity capacity, ResidualCapacity residual_capacity, Weight weight, Reversed rev, VertexIndex index, Pred pred, const bgl_named_params< P, T, R > &params)

template<class Graph , class P , class T , class R , class Capacity , class ResidualCapacity , class Weight , class Reversed , class VertexIndex >
void	successive_shortest_path_nonnegative_weights_dispatch1 (Graph &g, typename graph_traits< Graph >::vertex_descriptor s, typename graph_traits< Graph >::vertex_descriptor t, Capacity capacity, ResidualCapacity residual_capacity, Weight weight, Reversed rev, VertexIndex index, param_not_found, const bgl_named_params< P, T, R > &params)

template<typename Graph , typename Path >
bool	is_vertex_in_path (const Graph &, typename graph_traits< Graph >::vertex_descriptor v, const Path &p)

template<typename Graph , typename ClosedMatrix >
bool	is_path_closed (const Graph &g, typename graph_traits< Graph >::vertex_descriptor u, typename graph_traits< Graph >::vertex_descriptor v, const ClosedMatrix &closed)

template<typename Graph , typename Path , typename ClosedMatrix >
bool	can_extend_path (const Graph &g, typename graph_traits< Graph >::edge_descriptor e, const Path &p, const ClosedMatrix &m)

template<typename Graph , typename Path >
bool	can_wrap_path (const Graph &g, const Path &p)

template<typename Graph , typename Path , typename ClosedMatrix >
graph_traits< Graph > ::vertex_descriptor	extend_path (const Graph &g, Path &p, ClosedMatrix &closed)

template<typename Graph , typename Path , typename ClosedMatrix >
bool	exhaust_paths (const Graph &g, Path &p, ClosedMatrix &closed)

template<typename Graph , typename Visitor >
void	all_cycles_from_vertex (const Graph &g, typename graph_traits< Graph >::vertex_descriptor v, Visitor vis, std::size_t minlen, std::size_t maxlen)

void	union_successor_sets (const std::vector< std::size_t > &s1, const std::vector< std::size_t > &s2, std::vector< std::size_t > &s3)

template<typename TheContainer >
subscript_t< TheContainer >	subscript (TheContainer &c)

template<typename Graph , typename GraphTC , typename G_to_TC_VertexMap , typename VertexIndexMap >
void	transitive_closure_dispatch (const Graph &g, GraphTC &tc, G_to_TC_VertexMap g_to_tc_map, VertexIndexMap index_map)

template<typename Graph , typename Func , typename Seq , typename Map >
void	rec_two_graphs_common_spanning_trees (const Graph &iG, bimap< bimaps::set_of< int >, bimaps::set_of< typename graph_traits< Graph >::edge_descriptor > > iG_bimap, Map aiG_inL, Map diG, const Graph &vG, bimap< bimaps::set_of< int >, bimaps::set_of< typename graph_traits< Graph >::edge_descriptor > > vG_bimap, Map avG_inL, Map dvG, Func func, Seq inL)

template<typename IncidenceGraph , typename DFSVisitor , typename VertexColorMap , typename EdgeColorMap >
void	undir_dfv_impl (const IncidenceGraph &g, typename graph_traits< IncidenceGraph >::vertex_descriptor u, DFSVisitor &vis, VertexColorMap vertex_color, EdgeColorMap edge_color)

template<typename Graph1 , typename Graph2 , typename IndexMap1 , typename IndexMap2 , typename VertexOrder1 , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename SubGraphIsoMapCallback , problem_selector problem_selection>
bool	match (const Graph1 &graph1, const Graph2 &graph2, SubGraphIsoMapCallback user_callback, const VertexOrder1 &vertex_order1, state< Graph1, Graph2, IndexMap1, IndexMap2, EdgeEquivalencePredicate, VertexEquivalencePredicate, SubGraphIsoMapCallback, problem_selection > &s)

template<typename Graph , typename IndexMap , typename VertexOrder >
void	sort_vertices (const Graph &graph, IndexMap index_map, VertexOrder &order)

template<problem_selector problem_selection, typename GraphSmall , typename GraphLarge , typename IndexMapSmall , typename IndexMapLarge , typename VertexOrderSmall , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename SubGraphIsoMapCallback >
bool	vf2_subgraph_morphism (const GraphSmall &graph_small, const GraphLarge &graph_large, SubGraphIsoMapCallback user_callback, IndexMapSmall index_map_small, IndexMapLarge index_map_large, const VertexOrderSmall &vertex_order_small, EdgeEquivalencePredicate edge_comp, VertexEquivalencePredicate vertex_comp)

template<class Visitor , class T , class Graph >
void	invoke_dispatch (Visitor &v, T x, Graph &g, mpl::true_)

template<class Visitor , class T , class Graph >
void	invoke_dispatch (Visitor &, T, Graph &, mpl::false_)

template<typename T >
int	integer_log2_impl (T x, int n)

template<typename Value >
Value	read_value (const std::string &value)

template<>
std::string	read_value< std::string > (const std::string &value)

template<typename PMap , typename Key >
boost::property_traits< PMap > ::reference	get_wrapper_xxx (const PMap &pmap, const Key &key)

bool	is_high_surrogate (::boost::uint16_t v)

bool	is_low_surrogate (::boost::uint16_t v)

template<class T >
bool	is_surrogate (T v)

unsigned	utf8_byte_count (boost::uint8_t c)

unsigned	utf8_trailing_byte_count (boost::uint8_t c)

void	invalid_utf32_code_point (::boost::uint32_t val)

template<class X , class Y >
void	sp_enable_shared_from_this (boost::shared_ptr< X > ppx, Y const py, boost::enable_shared_from_raw const *pe)

template<class X , class Y , class T >
void	sp_enable_shared_from_this (boost::shared_ptr< X > const ppx, Y const py, boost::enable_shared_from_this< T > const *pe)

void	sp_enable_shared_from_this (...)

template<class Y , class T >
void	sp_assert_convertible ()

template<class T , class Y >
void	sp_pointer_construct (boost::shared_ptr< T > ppx, Y p, boost::detail::shared_count &pn)

template<class T , class Y >
void	sp_pointer_construct (boost::shared_ptr< T[] > , Y p, boost::detail::shared_count &pn)

template<class T , std::size_t N, class Y >
void	sp_pointer_construct (boost::shared_ptr< T[N] > , Y p, boost::detail::shared_count &pn)

template<class T , class Y >
void	sp_deleter_construct (boost::shared_ptr< T > ppx, Y p)

template<class T , class Y >
void	sp_deleter_construct (boost::shared_ptr< T[] > , Y )

template<class T , std::size_t N, class Y >
void	sp_deleter_construct (boost::shared_ptr< T[N] > , Y )

template<class D , class T >
D *	basic_get_deleter (shared_ptr< T > const &p) BOOST_NOEXCEPT

system::error_code *	throws ()

template<typename MutexType1 , typename MutexType2 >
unsigned	try_lock_internal (MutexType1 &m1, MutexType2 &m2)

template<typename MutexType1 , typename MutexType2 , typename MutexType3 >
unsigned	try_lock_internal (MutexType1 &m1, MutexType2 &m2, MutexType3 &m3)

template<typename MutexType1 , typename MutexType2 , typename MutexType3 , typename MutexType4 >
unsigned	try_lock_internal (MutexType1 &m1, MutexType2 &m2, MutexType3 &m3, MutexType4 &m4)

template<typename MutexType1 , typename MutexType2 , typename MutexType3 , typename MutexType4 , typename MutexType5 >
unsigned	try_lock_internal (MutexType1 &m1, MutexType2 &m2, MutexType3 &m3, MutexType4 &m4, MutexType5 &m5)

template<typename MutexType1 , typename MutexType2 >
unsigned	lock_helper (MutexType1 &m1, MutexType2 &m2)

template<typename MutexType1 , typename MutexType2 , typename MutexType3 >
unsigned	lock_helper (MutexType1 &m1, MutexType2 &m2, MutexType3 &m3)

template<typename MutexType1 , typename MutexType2 , typename MutexType3 , typename MutexType4 >
unsigned	lock_helper (MutexType1 &m1, MutexType2 &m2, MutexType3 &m3, MutexType4 &m4)

template<typename MutexType1 , typename MutexType2 , typename MutexType3 , typename MutexType4 , typename MutexType5 >
unsigned	lock_helper (MutexType1 &m1, MutexType2 &m2, MutexType3 &m3, MutexType4 &m4, MutexType5 &m5)

template<typename MutexType1 , typename MutexType2 >
void	lock_impl (MutexType1 &m1, MutexType2 &m2, is_mutex_type_wrapper< true >)

template<typename Iterator >
void	lock_impl (Iterator begin, Iterator end, is_mutex_type_wrapper< false >)

template<typename MutexType1 , typename MutexType2 >
int	try_lock_impl (MutexType1 &m1, MutexType2 &m2, is_mutex_type_wrapper< true >)

template<typename Iterator >
Iterator	try_lock_impl (Iterator begin, Iterator end, is_mutex_type_wrapper< false >)

BOOST_THREAD_DECL thread_data_base *	get_current_thread_data ()

template<typename T >
T *	heap_new ()

template<typename T , typename A1 >
T *	heap_new (A1 &&a1)

template<typename T , typename A1 , typename A2 >
T *	heap_new (A1 &&a1, A2 &&a2)

template<typename T , typename A1 , typename A2 , typename A3 >
T *	heap_new (A1 &&a1, A2 &&a2, A3 &&a3)

template<typename T , typename A1 , typename A2 , typename A3 , typename A4 >
T *	heap_new (A1 &&a1, A2 &&a2, A3 &&a3, A4 &&a4)

template<typename T >
void	heap_delete (T *data)

timespec	to_timespec (boost::intmax_t const &ns)

boost::intmax_t	to_nanoseconds_int_max (timespec const &ts)

bool	timespec_ge_zero (timespec const &ts)

timespec	timespec_now ()

timespec	timespec_zero ()

timespec	timespec_plus (timespec const &lhs, timespec const &rhs)

timespec	timespec_minus (timespec const &lhs, timespec const &rhs)

bool	timespec_gt (timespec const &lhs, timespec const &rhs)

bool	timespec_ge (timespec const &lhs, timespec const &rhs)

system_time	get_system_time_sentinel ()

unsigned long	get_milliseconds_until (system_time const &target_time)

BOOST_THREAD_DECL void	set_tss_data (void const key, boost::shared_ptr< tss_cleanup_function > func, void tss_data, bool cleanup_existing)

BOOST_THREAD_DECL void *	get_tss_data (void const *key)

void	intrusive_ptr_add_ref (basic_cv_list_entry *p)

void	intrusive_ptr_release (basic_cv_list_entry *p)

long	interlocked_read_acquire (long volatile *x) BOOST_NOEXCEPT

void *	interlocked_read_acquire (void volatile x) BOOST_NOEXCEPT

void	interlocked_write_release (long volatile *x, long value) BOOST_NOEXCEPT

void	interlocked_write_release (void volatile x, void *value) BOOST_NOEXCEPT

bool	enter_once_region (once_flag &flag, once_context &ctx) BOOST_NOEXCEPT

void	commit_once_region (once_flag &flag, once_context &ctx) BOOST_NOEXCEPT

void	rollback_once_region (once_flag &flag, once_context &ctx) BOOST_NOEXCEPT

template<class I >
void	int_to_string (I p, once_char_type *buf)

void	name_once_mutex (once_char_type mutex_name, void flag_address)

void *	open_once_event (once_char_type mutex_name, void flag_address)

void *	create_once_event (once_char_type mutex_name, void flag_address)

void	intrusive_ptr_add_ref (thread_data_base *p)

void	intrusive_ptr_release (thread_data_base *p)

uintmax_t	pin_to_zero (intmax_t value)

void *	allocate_raw_heap_memory (unsigned size)

void	free_raw_heap_memory (void *heap_memory)

	BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC2 (is_convertible, void, void, true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC2(is_convertible

template<class charT , class traits >
void	insert_fill_chars (std::basic_ostream< charT, traits > &os, std::size_t n)

template<class charT , class traits >
void	insert_aligned (std::basic_ostream< charT, traits > &os, const basic_string_ref< charT, traits > &str)

Variables
adjacency_iterator typedef T::adjacency_iterator	type

	out_edge_iterator {typedef typename T:: out_edge_iterator type

	in_edge_iterator {typedef typename T:: in_edge_iterator type

	vertex_iterator {typedef typename T:: vertex_iterator type

	edge_iterator {typedef typename T:: edge_iterator type

	vertices_size_type {typedef typename T:: vertices_size_type type

	edges_size_type {typedef typename T:: edges_size_type type

	degree_size_type {typedef typename T:: degree_size_type type

unsigned const	once_mutex_name_fixed_length =54

unsigned const	once_mutex_name_length

	void

void	const

void true void const	volatile

Typedef Documentation

typedef std::nullptr_t boost::detail::addr_nullptr_t

typedef basic_recursive_mutex_impl<basic_timed_mutex> boost::detail::basic_recursive_mutex

typedef basic_recursive_mutex_impl<basic_timed_mutex> boost::detail::basic_recursive_timed_mutex

typedef void(* boost::detail::function_ptr)()

typedef int(alignment_dummy::* boost::detail::member_function_ptr)()

typedef intalignment_dummy::* boost::detail::member_ptr

typedef char boost::detail::once_char_type

typedef void boost::detail::static_visitor_default_return

typedef boost::intrusive_ptr< detail::thread_data_base > boost::detail::thread_data_ptr

typedef ::boost::detail::basic_timed_mutex boost::detail::underlying_mutex

Enumeration Type Documentation

enum boost::detail::bm_case_t

Enumerator
BM_NO_CASE_CHOSEN
BM_CASE_A
BM_CASE_B
BM_CASE_C
BM_CASE_D
BM_CASE_E

enum boost::detail::ePropertyMapID

Enumerator
READABLE_PA
WRITABLE_PA
READ_WRITE_PA
LVALUE_PA
OP_BRACKET_PA
RAND_ACCESS_ITER_PA
LAST_PA

enum boost::detail::event_visitor_enum

Enumerator
on_no_event_num
on_initialize_vertex_num
on_start_vertex_num
on_discover_vertex_num
on_finish_vertex_num
on_examine_vertex_num
on_examine_edge_num
on_tree_edge_num
on_non_tree_edge_num
on_gray_target_num
on_black_target_num
on_forward_or_cross_edge_num
on_back_edge_num
on_finish_edge_num
on_edge_relaxed_num
on_edge_not_relaxed_num
on_edge_minimized_num
on_edge_not_minimized_num

enum boost::detail::once_action

Enumerator
try_
break_
continue_

enum boost::detail::planar_canonical_ordering_state

Enumerator
PCO_PROCESSED
PCO_UNPROCESSED
PCO_ONE_NEIGHBOR_PROCESSED
PCO_READY_TO_BE_PROCESSED

enum boost::detail::problem_selector

Enumerator
subgraph_mono
subgraph_iso
isomorphism

enum boost::detail::target_graph_t

Enumerator
tg_k_3_3
tg_k_5

Function Documentation

template<typename Vertex , typename Edge , typename Graph >

void boost::detail::add_edge_recur_down	(	Vertex	u_global,
		Vertex	v_global,
		Edge	e_global,
		subgraph< Graph > &	g
	)

Referenced by children_add_edge().

template<typename Vertex , typename Edge , typename Graph >

void boost::detail::add_edge_recur_down	(	Vertex	u_global,
		Vertex	v_global,
		Edge	e_global,
		subgraph< Graph > &	g,
		subgraph< Graph > *	orig
	)

References children_add_edge(), boost::subgraph< Graph >::find_vertex(), boost::subgraph< Graph >::local_add_edge(), boost::subgraph< Graph >::m_children, and boost::Vertex.

template<typename Vertex , typename Graph >

std::pair<typename subgraph<Graph>::edge_descriptor, bool> boost::detail::add_edge_recur_up	(	Vertex	u_global,
		Vertex	v_global,
		const typename Graph::edge_property_type &	ep,
		subgraph< Graph > &	g,
		subgraph< Graph > *	orig
	)

References boost::add_edge(), children_add_edge(), boost::edge_index, boost::subgraph< Graph >::is_root(), boost::subgraph< Graph >::m_children, boost::subgraph< Graph >::m_edge_counter, boost::subgraph< Graph >::m_global_edge, boost::subgraph< Graph >::m_graph, boost::subgraph< Graph >::m_parent, boost::xpressive::make_pair, and boost::put().

Referenced by boost::add_edge().

template<typename G >

subgraph<G>::vertex_descriptor boost::detail::add_vertex_recur_up ( subgraph< G > & g )

References boost::add_vertex(), boost::subgraph< Graph >::is_root(), boost::subgraph< Graph >::m_global_vertex, boost::subgraph< Graph >::m_graph, boost::subgraph< Graph >::m_local_vertex, and boost::subgraph< Graph >::m_parent.

Referenced by boost::add_vertex().

template<typename Graph , typename Visitor >

void boost::detail::all_cycles_from_vertex	(	const Graph &	g,
		typename graph_traits< Graph >::vertex_descriptor	v,
		Visitor	vis,
		std::size_t	minlen,
		std::size_t	maxlen
	)

inline

References boost::BOOST_CONCEPT_ASSERT(), can_wrap_path(), boost::geometry::closed, exhaust_paths(), extend_path(), boost::iostreams::zlib::null, boost::num_vertices(), boost::multiprecision::backends::p, and boost::Vertex.

Referenced by boost::tiernan_all_cycles().

void* boost::detail::allocate_raw_heap_memory ( unsigned size )

inline

References boost::throw_exception().

bool boost::detail::allows_parallel ( allow_parallel_edge_tag )

inline

Referenced by boost::allows_parallel_edges().

bool boost::detail::allows_parallel ( disallow_parallel_edge_tag )

inline

template<class Graph , class PredEdgeMap , class ResCapMap , class RevEdgeMap >

void boost::detail::augment	(	Graph &	g,
		typename graph_traits< Graph >::vertex_descriptor	src,
		typename graph_traits< Graph >::vertex_descriptor	sink,
		PredEdgeMap	p,
		ResCapMap	residual_capacity,
		RevEdgeMap	reverse_edge
	)

inline

References BOOST_PREVENT_MACRO_SUBSTITUTION, BOOST_USING_STD_MIN, boost::polygon::delta(), boost::accumulators::extract::max, boost::accumulators::extract::min, boost::multiprecision::backends::p, boost::put(), and boost::source().

Referenced by boost::cycle_canceling(), boost::edmonds_karp_max_flow(), and boost::successive_shortest_path_nonnegative_weights().