boost Namespace Reference

Duration formatting facet for input. More...

Namespaces
	_bi
	_mfi
	accumulators
	adaptors
	algorithm
	alignment
	archive
	asio
	assign
	assign_detail
	atomics
	attributes
	aux
	bimaps
	BOOST_RT_PARAM_NAMESPACE
	BOOST_SIGNALS_NAMESPACE
	boyer_myrvold_params
	cb_details
	ccheck_aux
	chrono
	concept_checking
	concepts
	concurrent
	container
	context
	conversion
	core
	coroutines
	csbl
	CV
	Namespace containing constrained_value template and types.
	date_time
	debug
	deprecated
	detail
	exception_detail
	executors
	expressions
	filesystem
	flyweights
	foreach
	foreach_detail_
	function_types
	fusion
	future_state
	geometry
	gil
	graph
	graph_detail
	graph_introspect_detail
	gregorian
	Gregorian date system based on date_time components.
	hash_detail
	hawick_circuits_detail
	heap
	icl
	interprocess
	intrusive
	io
	iostreams
	iterator_range_detail
	iterators
	itest
	keywords
	lambda
	local_time
	locale
	This is the main namespace that encloses all localization classes.
	lockfree
	logic
	math
	math_detail
	minimal_test
	move_detail
	move_upd
	move_upmu
	movelib
	mpi
	mpl
	msm
	multi_array_concepts
	multi_array_types
	multi_index
	multiprecision
	next_prior_detail
	nfp
	noncopyable_
	numeric
	optional_detail
	parallel
	parameter
	phoenix
	phoenix_impl
	polygon
	posix
	posix_time
	Defines a non-adjusted time system with nano-second resolution and stable calculation properties.
	program_options
	Namespace for the library.
	property_tree
	proto
	pthread
	ptr_container
	ptr_container_detail
	python
	random
	range
	range_adl_barrier
	range_detail
	range_detail_microsoft
	re_detail
	regex_constants
	result_of
	rtti
	runtime
	scope_exit
	serialization
	signals2
	sinks
	sources
	sp_adl_block
	spirit
	statechart
	sync
	system
	test_tools
	this_thread
	thread_cv_detail
	thread_detail
	thread_v2
	timer
	to_string_detail
	tokenizer_detail
	tr1
	trivial
	tti
	tuples
	type_erasure
	type_of
	type_traits
	type_traits_detail
	typeindex
	unit_test
	units
	unordered
	uuids
	wave
	xpressive

Classes
struct	_requires_
struct	a_property
class	abstract_ordering
	Ordering predicate, based on opaque pointers to the record view implementation data. More...
struct	add_edge_property_tag
struct	add_edge_tag
struct	add_only_property_graph_tag
class	add_value_manip
	Attribute value manipulator. More...
struct	add_vertex_property_tag
struct	add_vertex_tag
struct	addable
struct	addable1
struct	addable2
struct	addable< T, T, B,::boost::detail::false_t >
struct	addable< T, U, B,::boost::detail::true_t >
class	addable_archetype
struct	additive
struct	additive1
struct	additive2
struct	additive< T, T, B,::boost::detail::false_t >
struct	additive< T, U, B,::boost::detail::true_t >
struct	adj_mat_pm_helper
struct	adj_mat_pm_helper< D, VP, EP, GP, A, Prop, vertex_property_tag >
struct	adj_mat_pm_helper< D, VP, EP, GP, A, Tag, edge_property_tag >
struct	adj_matrix_traversal_tag
struct	adjacency_graph_archetype
struct	adjacency_graph_tag
struct	adjacency_iterator
class	adjacency_iterator_generator
class	adjacency_list
class	adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >
	A distributed adjacency list. More...
struct	adjacency_list_traits
struct	adjacency_list_traits< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS >
	Adjacency list traits for a distributed adjacency list. More...
class	adjacency_matrix
struct	adjacency_matrix_class_tag
struct	adjacency_matrix_tag
class	adjacency_matrix_traits
struct	adopt_lock_t
class	aligned_storage
struct	alignment_of
struct	alignment_of< T & >
struct	all_force_pairs
struct	allow_parallel_edge_tag
struct	alternating
struct	always_equivalent
struct	andable
struct	andable1
struct	andable2
struct	andable< T, T, B,::boost::detail::false_t >
struct	andable< T, U, B,::boost::detail::true_t >
class	any
struct	apply
struct	arg
struct	arithmetic
struct	arithmetic1
struct	arithmetic2
struct	arithmetic< T, T, B,::boost::detail::false_t >
struct	arithmetic< T, U, B,::boost::detail::true_t >
singleton	array
class	array< T, 0 >
class	array_view_gen
struct	as_action_adapter
	Function object adapter for Boost.Spirit actions. More...
struct	assign_fun
	The function object that assigns its second operand to the first one. More...
class	assignable_archetype
class	associative_property_map
class	astar_heuristic
class	astar_visitor
struct	AStarHeuristicConcept
struct	AStarVisitorConcept
struct	attractive_force_t
class	attribute
	A base class for an attribute value factory. More...
class	attribute_name
	The class represents an attribute name in containers used by the library. More...
class	attribute_set
	An attribute set class. More...
class	attribute_value
	An attribute value class. More...
class	attribute_value_ordering
	Ordering predicate, based on attribute values associated with records. More...
class	attribute_value_set
	A set of attribute values. More...
struct	attributes_writer
struct	b_property
class	back_move_insert_iterator
	A move insert iterator that move constructs elements at the back of a container. More...
class	bad_any_cast
class	bad_function_call
	The bad_function_call exception class is thrown when a boost::function object is invoked. More...
class	bad_get
struct	bad_graph
struct	bad_graphviz_syntax
class	bad_index
class	bad_lexical_cast
class	bad_optional_access
struct	bad_parallel_edge
class	bad_pointer
class	bad_polymorphic_get
class	bad_ptr_container_operation
class	bad_rational
struct	bad_visit
class	bad_weak_ptr
class	ball_topology
class	barrier
class	base_from_member
class	base_from_member< MemberType &, UniqueID >
struct	base_visitor
struct	BaseRegexConcept
class	basic_filter_factory
	The base class for filter factories. More...
singleton	basic_format
class	basic_formatter
	Log record formatter function wrapper. More...
class	basic_formatter_factory
	Base class for formatter factories. More...
singleton	basic_formatting_ostream
	Stream wrapper for log records formatting. More...
class	basic_lockable_adapter
class	basic_nullbuf
class	basic_onullstream
class	basic_poly_lockable
class	basic_record_ostream
	Logging record adapter with a streaming capability. More...
singleton	basic_regex
class	basic_settings
	The class represents settings container. More...
class	basic_settings_section
	The class represents a reference to the settings container section. More...
singleton	basic_string_literal
	String literal wrapper. More...
singleton	basic_string_ref
class	basic_wrap_stringstream
struct	BasicLock
	BasicLock object supports the basic features required to delimit a critical region Supports the basic lock, unlock and try_lock functions and defines the lock traits. More...
struct	BasicLockable
	BasicLockable object supports the basic features required to delimit a critical region Supports the basic lock and unlock functions. More...
struct	bc_clustering_threshold
	Threshold termination function for the betweenness centrality clustering algorithm. More...
struct	begins_with_fun
	The begins_with functor. More...
class	bellman_visitor
struct	BellmanFordVisitorConcept
class	bfs_visitor
struct	BFSVisitorConcept
struct	bgl_named_params
struct	bidirectional_distributed_adj_list_tag
	Tag class for bidirectional, distributed adjacency list. More...
struct	bidirectional_graph_tag
struct	bidirectional_iteratable
class	bidirectional_iterator_archetype
struct	bidirectional_iterator_helper
struct	bidirectional_tag
struct	BidirectionalRangeConcept
	Check if a type T models the BidirectionalRange range concept. More...
struct	bidirectionalS
class	binary_function_archetype
class	binary_negate
class	binary_predicate_archetype
struct	binary_traits
struct	binary_traits< R(*)(A1, A2)>
struct	binder1st
	First argument binder. More...
struct	binder1st< FunT &, FirstArgT >
	First argument binder. More...
struct	binder2nd
	Second argument binder. More...
struct	binder2nd< FunT &, SecondArgT >
	Second argument binder. More...
struct	binder3rd
	Third argument binder. More...
struct	binder3rd< FunT &, ThirdArgT >
	Third argument binder. More...
struct	BitmaskConcept
struct	bitwise
struct	bitwise1
struct	bitwise2
struct	bitwise< T, T, B,::boost::detail::false_t >
struct	bitwise< T, U, B,::boost::detail::true_t >
struct	blank
class	boolean_archetype
struct	BoostRegexConcept
struct	both_sides
class	bounded_dump_manip
	Manipulator for printing binary representation of the data with a size limit. More...
class	boyer_myrvold_impl
class	broken_promise
class	bucket_sorter
class	buffer_archetype
struct	buffer_param_t
struct	c_regex_traits
struct	c_regex_traits< char >
struct	c_regex_traits< wchar_t >
class	c_storage_order
struct	caller_context_t
struct	char_architype
class	char_delimiters_separator
class	char_separator
struct	checked_array_deleter
struct	checked_deleter
struct	choose_edge_property_map_archetype
struct	choose_vertex_property_map_archetype
class	circle_topology
class	circular_buffer
	Circular buffer - a STL compliant container. More...
class	circular_buffer_space_optimized
	Space optimized circular buffer container adaptor. More...
struct	clique_visitor
	The default clique_visitor supplies an empty visitation function. More...
struct	closed_plus
struct	closeness_measure
struct	color_traits
struct	color_traits< color_value_archetype >
struct	color_traits< one_bit_color_type >
struct	color_traits< two_bit_color_type >
struct	color_value_archetype
struct	common_type
struct	common_type< chrono::duration< Rep1, Period1 >, chrono::duration< Rep2, Period2 > >
struct	common_type< chrono::time_point< Clock, Duration1 >, chrono::time_point< Clock, Duration2 > >
struct	common_type< T >
struct	common_type< T, U >
struct	common_type< T, U, V...>
class	comparable_archetype
class	completion_latch
class	component_index
class	compose_property_map
singleton	compressed_sparse_row_graph
	Compressed sparse row graph. More...
class	compressed_sparse_row_graph< bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >
class	compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >
class	compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >
struct	concept_check
struct	concept_check< void(*)(Model)>
struct	concept_check_
struct	concept_check_< void(*)(Model)>
class	condition_error
class	condition_variable
class	condition_variable_any
struct	conditional
struct	connects_predicate
class	const_array_view_gen
class	const_associative_property_map
class	const_mem_fun1_ref_t
class	const_mem_fun1_t
class	const_mem_fun_ref_t
class	const_mem_fun_t
class	const_multi_array_ref
class	const_strict_lock_ptr
	strict lock providing a const pointer access to the synchronized value type. More...
class	const_subarray_gen
class	const_unique_lock_ptr
	unique_lock providing a const pointer access to the synchronized value type. More...
struct	constant_property_map
	A constant property is one, that regardless of the edge or vertex given, will always return a constant value. More...
struct	constant_writable_property_map
	Same as above, but pretends to be writable as well. More...
struct	container_gen
struct	container_gen< hash_mapS, ValueType >
struct	container_gen< hash_multimapS, ValueType >
struct	container_gen< hash_multisetS, ValueType >
struct	container_gen< hash_setS, ValueType >
struct	container_gen< listS, ValueType >
struct	container_gen< mapS, ValueType >
struct	container_gen< multimapS, ValueType >
struct	container_gen< multisetS, ValueType >
struct	container_gen< setS, ValueType >
struct	container_gen< slistS, ValueType >
struct	container_gen< vecS, ValueType >
struct	container_property_map
struct	contains_fun
	The contains functor. More...
class	conversion_error
	Exception class that is used to indicate conversion errors. More...
class	convertible_from_archetype
class	convertible_to_archetype
class	convex_topology
struct	cooling_t
class	copy_constructible_archetype
class	core
	Logging library core class. More...
class	core_numbers_visitor
struct	CoreNumbersVisitorConcept
singleton	cpp_regex_traits
class	crc_basic
class	crc_optimal
class	csr_edge_global_map
struct	csr_property_map_helper
struct	csr_property_map_helper< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, Tag, edge_property_tag >
struct	csr_property_map_helper< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, Tag, graph_property_tag >
struct	csr_property_map_helper< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, Tag, vertex_property_tag >
class	csr_vertex_global_map
class	csr_vertex_local_map
class	csr_vertex_owner_map
class	cube_topology
struct	current_iteration
struct	cycle_visitor
	The default cycle visitor provides an empty visit function for cycle visitors. More...
struct	decay
struct	decrementable
struct	default_add_edge_visitor
struct	default_archetype_base
class	default_constructible_archetype
struct	default_property_traits
struct	default_r_c_shortest_paths_visitor
struct	default_writer
struct	defaultS
struct	defer_lock_t
struct	degree_centrality_measure
class	degree_property_map
class	degree_vertex_invariant
struct	dereferenceable
struct	detach
class	dfs_visitor
class	DFSVisitorConcept
struct	diameter_range_t
class	dijkstra_visitor
struct	DijkstraVisitorConcept
struct	directed_distributed_adj_list_tag
	Tag class for directed, distributed adjacency list. More...
class	directed_graph
	The directed_graph class template is a simplified version of the BGL adjacency list. More...
struct	directed_graph_error
struct	directed_graph_tag
struct	directed_tag
struct	directedS
struct	disable_if
struct	disable_if_c
struct	disable_if_c< true, T >
struct	disallow_parallel_edge_tag
class	disjoint_sets
class	disjoint_sets_with_storage
struct	distance_combine_t
struct	distance_compare_t
struct	distance_inf_t
struct	distance_recorder
struct	distance_zero_t
struct	distributed_csr_tag
struct	distributed_edge_list_graph_tag
struct	distributed_graph_tag
struct	distributed_vertex_list_graph_tag
struct	DistributedEdgeListGraphConcept
struct	distributedS
	Selector that specifies that the graph should be distributed among different processes organized based on the given process group. More...
struct	DistributedVertexListGraphConcept
struct	dividable
struct	dividable1
struct	dividable2
struct	dividable2_left
struct	dividable< T, T, B,::boost::detail::false_t >
struct	dividable< T, U, B,::boost::detail::true_t >
class	dividable_archetype
class	divide_op_first_archetype
class	divide_op_second_archetype
class	dummy_property_map
struct	dummyT
class	dump_manip
	Manipulator for printing binary representation of the data. More...
singleton	dynamic_bitset
struct	dynamic_const_put_error
struct	dynamic_get_failure
class	dynamic_graph_properties_writer
struct	dynamic_properties
class	dynamic_properties_writer
struct	dynamic_property_exception
class	dynamic_property_map
class	dynamic_type_dispatcher
	A dynamic type dispatcher. More...
class	dynamic_vertex_properties_writer
struct	edge_bundle_type
struct	edge_bundle_type< filtered_graph< Graph, EdgePredicate, VertexPredicate > >
struct	edge_bundle_type< reverse_graph< Graph, GraphRef > >
struct	edge_bundle_type< subgraph< Graph > >
struct	edge_compare_t
struct	edge_copy_t
struct	edge_index_update_visitor
struct	edge_length_t
class	edge_list
struct	edge_list_edge_property_selector
struct	edge_list_graph_tag
class	edge_list_impl
class	edge_list_impl_ra
struct	edge_list_ra_edge_property_selector
struct	edge_list_ra_tag
struct	edge_list_tag
struct	edge_predecessor_recorder
struct	edge_property
struct	edge_property_selector
struct	edge_property_selector< edge_list_ra_tag >
struct	edge_property_selector< edge_list_tag >
struct	edge_property_selector< graph_as_tree_tag >
struct	edge_property_selector< labeled_graph_class_tag >
struct	edge_property_selector< property_graph_archetype_tag >
struct	edge_property_selector< subgraph_tag >
struct	edge_property_tag
struct	edge_property_type
struct	edge_property_type< filtered_graph< Graph, EdgePredicate, VertexPredicate > >
struct	edge_property_type< reverse_graph< BidirectionalGraph, GraphRef > >
struct	edge_property_type< std::vector< EdgeList > >
struct	edge_storage
struct	edge_storage< Graph, true >
struct	EdgePrinter
struct	edges_equivalent_t
class	edmonds_augmenting_path_finder
class	el_edge_property_map
class	el_ra_edge_property_map
struct	empty_matching
struct	enable_if
struct	enable_if_c
struct	enable_if_c< false, T >
struct	enable_move_utility_emulation
	This trait's internal boolean value is false in compilers with rvalue references and true in compilers without rvalue references. More...
class	enable_shared_from_raw
singleton	enable_shared_from_this
struct	ends_with_fun
	The ends_with functor. More...
class	environment_iterator
class	eof_iterator
	The 'eof_iterator' class is useful for constructing forward iterators in cases where iterator extract data from some source and it's easy to detect 'eof' – i.e. More...
class	equal_op_first_archetype
class	equal_op_second_archetype
struct	equal_pointees_t
struct	equal_to
	Equality predicate. More...
struct	equality_comparable
struct	equality_comparable1
struct	equality_comparable2
class	equality_comparable2_first_archetype
class	equality_comparable2_second_archetype
struct	equality_comparable< T, T, B,::boost::detail::false_t >
struct	equality_comparable< T, U, B,::boost::detail::true_t >
class	equality_comparable_archetype
struct	equivalent
struct	equivalent1
struct	equivalent2
struct	equivalent< T, T, B,::boost::detail::false_t >
struct	equivalent< T, U, B,::boost::detail::true_t >
class	erdos_renyi_iterator
singleton	error_info
class	error_info< throw_file_, char const * >
class	error_info< throw_function_, char const * >
class	error_info< throw_line_, int >
struct	escaped_list_error
class	escaped_list_separator
struct	euclidean_ring_operators
struct	euclidean_ring_operators1
struct	euclidean_ring_operators2
struct	euclidean_ring_operators< T, T, B,::boost::detail::false_t >
struct	euclidean_ring_operators< T, U, B,::boost::detail::true_t >
struct	euclidian_ring_operators
struct	euclidian_ring_operators1
struct	euclidian_ring_operators2
struct	euclidian_ring_operators< T, T, B,::boost::detail::false_t >
struct	euclidian_ring_operators< T, U, B,::boost::detail::true_t >
class	exception
class	exception_handler
	An exception handler functional object. More...
struct	exceptional_ptr
struct	execution_aborted
class	execution_exception
class	execution_monitor
struct	extent
struct	exterior_edge_property
	Define a the container and property map types requried to create an exterior edge property for the given value type. More...
struct	exterior_property
	The exterior_property metafunction defines an appropriate set of types for creating an exterior property. More...
struct	exterior_vertex_property
	Define a the container and property map types requried to create an exterior vertex property for the given value type. More...
class	externally_locked
	externally_locked cloaks an object of type T, and actually provides full access to that object through the get and set member functions, provided you pass a reference to a strict lock object More...
class	externally_locked< T &, MutexType >
	externally_locked<T&,M> specialization for T& that cloaks an reference to an object of type T, and actually provides full access to that object through the get and set member functions, provided you pass a reference to a strict lock object. More...
class	externally_locked_stream
	externally_locked_stream cloaks a reference to an stream of type Stream, and actually provides full access to that object through the get and set member functions, provided you pass a reference to a strict lock object. More...
struct	extra_greedy_matching
class	face_iterator
class	face_iterator< Graph, FaceHandlesMap, ValueType, both_sides, VisitorType, Time >
class	factory
class	factory< Pointer, boost::none_t, AP >
struct	fallback_to_default
	The fallback_to_default policy results in a default value if the attribute value cannot be extracted. More...
struct	fallback_to_none
	The fallback_to_none policy results in returning an empty value reference if the attribute value cannot be extracted. More...
struct	fallback_to_throw
	The fallback_to_throw policy results in throwing an exception if the attribute value cannot be extracted. More...
singleton	fast_pool_allocator
	A C++ Standard Library conforming allocator geared towards allocating single chunks. More...
class	fast_pool_allocator< void, UserAllocator, Mutex, NextSize, MaxSize >
	Specialization of fast_pool_allocator<void>. More...
struct	fast_pool_allocator_tag
	Simple tag type used by fast_pool_allocator as a template parameter to the underlying singleton_pool. More...
class	fenced_priority_queue
class	fibonacci_heap
struct	field_operators
struct	field_operators1
struct	field_operators2
struct	field_operators< T, T, B,::boost::detail::false_t >
struct	field_operators< T, U, B,::boost::detail::true_t >
class	filter
	Log record filter function wrapper. More...
struct	filter_factory
	The interface class for all filter factories. More...
class	filtered_graph
struct	filtered_graph_base
struct	filtered_graph_tag
struct	find_with_full_path_compression
struct	find_with_path_halving
struct	first_side
struct	follow_visitor
struct	force_pairs_t
struct	formatter_factory
	Formatter factory base interface. More...
class	fortran_storage_order
class	forward_adapter
class	forward_adapter< Function &, Arity_Or_MinArity, MaxArity >
class	forward_adapter< Function const, Arity_Or_MinArity, MaxArity >
struct	forward_iteratable
class	forward_iterator_archetype
struct	forward_iterator_helper
struct	ForwardRangeConcept
	Check if a type T models the ForwardRange range concept. More...
class	front_move_insert_iterator
	A move insert iterator that move constructs elements int the front of a container. More...
singleton	function
singleton	function0
singleton	function1
singleton	function10
singleton	function2
singleton	function3
singleton	function4
singleton	function5
singleton	function6
singleton	function7
singleton	function8
singleton	function9
class	function_base
	The function_base class contains the basic elements needed for the function1, function2, function3, etc. More...
class	function_property_map
struct	function_reference_wrapper
	Reference wrapper for function objects. More...
struct	function_traits
struct	functor1
struct	functor1b
struct	functor2
struct	functor3
class	future_already_retrieved
class	future_error
class	future_uninitialized
class	general_storage_order
class	generator_archetype
class	get_owner_of_first_pair_element
class	get_owner_of_first_tuple_element
struct	get_param_type
class	get_type_name
struct	global_property
class	graph_as_tree
class	graph_as_tree_base
struct	graph_as_tree_tag
struct	graph_attributes_writer
struct	graph_bundle_type
struct	graph_bundle_type< filtered_graph< Graph, EdgePredicate, VertexPredicate > >
struct	graph_bundle_type< reverse_graph< Graph, GraphRef > >
struct	graph_bundle_type< subgraph< Graph > >
struct	graph_exception
struct	graph_has_add_edge
struct	graph_has_add_edge_with_property
struct	graph_has_add_vertex
struct	graph_has_add_vertex_with_property
struct	graph_has_remove_edge
struct	graph_has_remove_vertex
struct	graph_id_writer
struct	graph_mutability_traits
	The graph_mutability_traits provide methods for determining the interfaces supported by graph classes for adding and removing vertices and edges. More...
struct	graph_mutability_traits< adjacency_list< OEL, vecS, D, VP, EP, GP, EL > >
struct	graph_mutability_traits< adjacency_list< OEL, VL, D, VP, EP, GP, EL > >
struct	graph_mutability_traits< adjacency_matrix< D, VP, EP, GP, A > >
struct	graph_mutability_traits< directed_graph< VP, EP, GP > >
struct	graph_mutability_traits< subgraph< G > >
struct	graph_mutability_traits< undirected_graph< VP, EP, GP > >
class	graph_property
class	graph_property_iter_range
struct	graph_property_tag
struct	graph_property_type
struct	graph_property_type< filtered_graph< Graph, EdgePredicate, VertexPredicate > >
struct	graph_property_type< reverse_graph< BidirectionalGraph, GraphRef > >
struct	graph_property_type< std::vector< EdgeList > >
struct	graph_test
struct	graph_traits
struct	graph_traits< leda::graph >
struct	graph_traits< leda::GRAPH< vtype, etype > >
struct	graph_traits< mpi::graph_communicator >
	Traits structure that allows a communicator with graph topology to be view as a graph by the Boost Graph Library. More...
struct	graph_traits< sgb_const_graph_ptr >
struct	graph_traits< sgb_graph_ptr >
struct	graph_traits< std::vector< EdgeList > >
struct	GraphParser
struct	GraphPrinter
struct	GraphPrinter< Graph, no_property, E >
struct	graphviz_io_traits
struct	graphviz_io_traits< undirected_tag >
struct	greater
	Greater predicate. More...
struct	greater_equal
	Greater or equal predicate. More...
class	greater_equal_op_first_archetype
class	greater_equal_op_second_archetype
class	greater_than_op_first_archetype
class	greater_than_op_second_archetype
struct	greedy_matching
struct	grid_force_pairs
class	grid_graph
struct	grid_graph_index_map
struct	grid_graph_reverse_edge_map
struct	has_bundled_edge_property
struct	has_bundled_graph_property
struct	has_bundled_vertex_property
struct	has_edge_property
struct	has_graph_property
struct	has_move_emulation_enabled
	This trait yields to a compile-time true boolean if T was marked as BOOST_MOVABLE_BUT_NOT_COPYABLE or BOOST_COPYABLE_AND_MOVABLE and rvalue references are not available on the platform. More...
struct	has_nothrow_move
	By default this traits returns. More...
struct	has_property
struct	has_property< no_property >
struct	has_range_const_iterator
struct	has_range_iterator
struct	has_to_string
struct	has_trivial_constructor
struct	has_trivial_constructor< boost::interprocess::offset_ptr< T, P, O, A > >
	has_trivial_constructor<> == true_type specialization for optimizations More...
struct	has_trivial_constructor< gil::packed_pixel< P, C, L > >
struct	has_trivial_constructor< gil::pixel< ChannelValue, Layout > >
struct	has_trivial_destructor
struct	has_trivial_destructor< boost::interprocess::allocator< T, SegmentManager > >
struct	has_trivial_destructor< boost::interprocess::offset_ptr< T, P, O, A > >
	has_trivial_destructor<> == true_type specialization for optimizations More...
struct	has_trivial_destructor_after_move
	If this trait yields to true (has_trivial_destructor_after_move <T>::value == true) means that if T is used as argument of a move construction/assignment, there is no need to call T's destructor. More...
struct	has_trivial_destructor_after_move< boost::container::basic_string< C, T, Allocator > >
	has_trivial_destructor_after_move<> == true_type specialization for optimizations More...
struct	has_trivial_destructor_after_move< boost::container::deque< T, Allocator > >
	has_trivial_destructor_after_move<> == true_type specialization for optimizations More...
struct	has_trivial_destructor_after_move< boost::container::flat_map< K, T, C, Allocator > >
	has_trivial_destructor_after_move<> == true_type specialization for optimizations More...
struct	has_trivial_destructor_after_move< boost::container::flat_multimap< K, T, C, Allocator > >
	has_trivial_destructor_after_move<> == true_type specialization for optimizations More...
struct	has_trivial_destructor_after_move< boost::container::flat_multiset< Key, C, Allocator > >
	has_trivial_destructor_after_move<> == true_type specialization for optimizations More...
struct	has_trivial_destructor_after_move< boost::container::flat_set< Key, C, Allocator > >
	has_trivial_destructor_after_move<> == true_type specialization for optimizations More...
struct	has_trivial_destructor_after_move< boost::container::list< T, Allocator > >
	has_trivial_destructor_after_move<> == true_type specialization for optimizations More...
struct	has_trivial_destructor_after_move< boost::container::map< K, T, C, Allocator > >
	has_trivial_destructor_after_move<> == true_type specialization for optimizations More...
struct	has_trivial_destructor_after_move< boost::container::multimap< K, T, C, Allocator > >
	has_trivial_destructor_after_move<> == true_type specialization for optimizations More...
struct	has_trivial_destructor_after_move< boost::container::multiset< Key, C, Allocator, MultiSetOptions > >
	has_trivial_destructor_after_move<> == true_type specialization for optimizations More...
struct	has_trivial_destructor_after_move< boost::container::set< Key, C, Allocator, SetOptions > >
	has_trivial_destructor_after_move<> == true_type specialization for optimizations More...
struct	has_trivial_destructor_after_move< boost::container::slist< T, Allocator > >
	has_trivial_destructor_after_move<> == true_type specialization for optimizations More...
struct	has_vertex_property
struct	hash
struct	hash< bool >
struct	hash< boost::long_long_type >
struct	hash< boost::multi_index::composite_key_result< CompositeKey > >
struct	hash< boost::ulong_long_type >
struct	hash< char >
struct	hash< detail::parallel::edge_descriptor< Edge > >
struct	hash< detail::parallel::global_descriptor< LocalDescriptor > >
struct	hash< double >
struct	hash< float >
struct	hash< int >
struct	hash< long >
struct	hash< long double >
struct	hash< short >
struct	hash< signed char >
struct	hash< std::string >
struct	hash< std::type_index >
struct	hash< std::wstring >
struct	hash< T * >
struct	hash< unsigned char >
struct	hash< unsigned int >
struct	hash< unsigned long >
struct	hash< unsigned short >
struct	hash< wchar_t >
struct	hash_mapS
struct	hash_multimapS
struct	hash_multisetS
struct	hash_setS
struct	heap_clone_allocator
class	heart_topology
struct	high_bit_mask_t
class	hypercube_topology
class	icu_regex_traits
struct	in_parallel_t
class	in_place_factory_base
struct	in_range_fun
	The in_range functor. More...
struct	incidence_graph_archetype
struct	incidence_graph_tag
struct	incident_from_predicate
struct	incident_on_predicate
struct	incident_to_predicate
struct	incrementable
struct	index_in_heap_map_t
struct	index_to_vertex_func
class	index_to_vertex_iterator
struct	indexable
class	indirect_cmp
	category: functors component: type tparam: ReadablePropertyMap - a model of ReadablePropertyMap definition: functor.h More...
class	indirect_fun
class	indirect_pmap
struct	indirect_reference
struct	influence_measure
class	initialized
class	initialized_value_t
struct	input_iteratable
class	input_iterator_archetype
class	input_iterator_archetype_no_proxy
struct	input_iterator_helper
class	input_output_iterator_archetype
struct	int_fast_t
struct	int_max_value_t
struct	int_min_value_t
struct	int_t
struct	Integer< char >
struct	Integer< int >
struct	Integer< long >
struct	Integer< short >
struct	Integer< signed char >
struct	Integer< unsigned char >
struct	Integer< unsigned int >
struct	Integer< unsigned long >
struct	Integer< unsigned short >
struct	integer_arithmetic
struct	integer_arithmetic1
struct	integer_arithmetic2
struct	integer_arithmetic< T, T, B,::boost::detail::false_t >
struct	integer_arithmetic< T, U, B,::boost::detail::true_t >
struct	integer_multiplicative
struct	integer_multiplicative1
struct	integer_multiplicative2
struct	integer_multiplicative< T, T, B,::boost::detail::false_t >
struct	integer_multiplicative< T, U, B,::boost::detail::true_t >
class	integer_range
class	integer_traits
class	integer_traits< bool >
class	integer_traits< char >
class	integer_traits< int >
class	integer_traits< long >
class	integer_traits< short >
class	integer_traits< signed char >
class	integer_traits< unsigned char >
class	integer_traits< unsigned int >
class	integer_traits< unsigned long >
class	integer_traits< unsigned short >
class	integer_traits< wchar_t >
struct	integral_constant
struct	integral_constant< bool, false >
struct	integral_constant< bool, true >
class	intrusive_ptr
struct	inv_adjacency_iterator
class	inv_adjacency_iterator_generator
class	invalid_thread_argument
class	invalid_type
	Exception class that is used to indicate errors of incorrect type of an object. More...
class	invalid_value
	Exception class that is used to indicate errors of incorrect value of an object. More...
struct	is_add_only_property_graph
struct	is_adjacency_matrix
struct	is_bidirectional_graph
struct	is_bind_expression
struct	is_bind_expression< _bi::bind_t< R, F, L > >
struct	is_chained_base
struct	is_chained_base< ::boost::addable1< T, B > >
struct	is_chained_base< ::boost::addable2< T, U, B > >
struct	is_chained_base< ::boost::addable< T, U, B, O > >
struct	is_chained_base< ::boost::additive1< T, B > >
struct	is_chained_base< ::boost::additive2< T, U, B > >
struct	is_chained_base< ::boost::additive< T, U, B, O > >
struct	is_chained_base< ::boost::andable1< T, B > >
struct	is_chained_base< ::boost::andable2< T, U, B > >
struct	is_chained_base< ::boost::andable< T, U, B, O > >
struct	is_chained_base< ::boost::arithmetic1< T, B > >
struct	is_chained_base< ::boost::arithmetic2< T, U, B > >
struct	is_chained_base< ::boost::arithmetic< T, U, B, O > >
struct	is_chained_base< ::boost::bidirectional_iteratable< T, U, B > >
struct	is_chained_base< ::boost::bitwise1< T, B > >
struct	is_chained_base< ::boost::bitwise2< T, U, B > >
struct	is_chained_base< ::boost::bitwise< T, U, B, O > >
struct	is_chained_base< ::boost::decrementable< T, B > >
struct	is_chained_base< ::boost::dereferenceable< T, U, B > >
struct	is_chained_base< ::boost::dividable1< T, B > >
struct	is_chained_base< ::boost::dividable2< T, U, B > >
struct	is_chained_base< ::boost::dividable2_left< T, U, B > >
struct	is_chained_base< ::boost::dividable< T, U, B, O > >
struct	is_chained_base< ::boost::equality_comparable1< T, B > >
struct	is_chained_base< ::boost::equality_comparable2< T, U, B > >
struct	is_chained_base< ::boost::equality_comparable< T, U, B, O > >
struct	is_chained_base< ::boost::equivalent1< T, B > >
struct	is_chained_base< ::boost::equivalent2< T, U, B > >
struct	is_chained_base< ::boost::equivalent< T, U, B, O > >
struct	is_chained_base< ::boost::euclidean_ring_operators1< T, B > >
struct	is_chained_base< ::boost::euclidean_ring_operators2< T, U, B > >
struct	is_chained_base< ::boost::euclidean_ring_operators< T, U, B, O > >
struct	is_chained_base< ::boost::euclidian_ring_operators1< T, B > >
struct	is_chained_base< ::boost::euclidian_ring_operators2< T, U, B > >
struct	is_chained_base< ::boost::euclidian_ring_operators< T, U, B, O > >
struct	is_chained_base< ::boost::field_operators1< T, B > >
struct	is_chained_base< ::boost::field_operators2< T, U, B > >
struct	is_chained_base< ::boost::field_operators< T, U, B, O > >
struct	is_chained_base< ::boost::forward_iteratable< T, U, B > >
struct	is_chained_base< ::boost::incrementable< T, B > >
struct	is_chained_base< ::boost::indexable< T, U, V, B > >
struct	is_chained_base< ::boost::input_iteratable< T, U, B > >
struct	is_chained_base< ::boost::integer_arithmetic1< T, B > >
struct	is_chained_base< ::boost::integer_arithmetic2< T, U, B > >
struct	is_chained_base< ::boost::integer_arithmetic< T, U, B, O > >
struct	is_chained_base< ::boost::integer_multiplicative1< T, B > >
struct	is_chained_base< ::boost::integer_multiplicative2< T, U, B > >
struct	is_chained_base< ::boost::integer_multiplicative< T, U, B, O > >
struct	is_chained_base< ::boost::left_shiftable1< T, B > >
struct	is_chained_base< ::boost::left_shiftable2< T, U, B > >
struct	is_chained_base< ::boost::left_shiftable< T, U, B, O > >
struct	is_chained_base< ::boost::less_than_comparable1< T, B > >
struct	is_chained_base< ::boost::less_than_comparable2< T, U, B > >
struct	is_chained_base< ::boost::less_than_comparable< T, U, B, O > >
struct	is_chained_base< ::boost::modable1< T, B > >
struct	is_chained_base< ::boost::modable2< T, U, B > >
struct	is_chained_base< ::boost::modable2_left< T, U, B > >
struct	is_chained_base< ::boost::modable< T, U, B, O > >
struct	is_chained_base< ::boost::multipliable1< T, B > >
struct	is_chained_base< ::boost::multipliable2< T, U, B > >
struct	is_chained_base< ::boost::multipliable< T, U, B, O > >
struct	is_chained_base< ::boost::multiplicative1< T, B > >
struct	is_chained_base< ::boost::multiplicative2< T, U, B > >
struct	is_chained_base< ::boost::multiplicative< T, U, B, O > >
struct	is_chained_base< ::boost::orable1< T, B > >
struct	is_chained_base< ::boost::orable2< T, U, B > >
struct	is_chained_base< ::boost::orable< T, U, B, O > >
struct	is_chained_base< ::boost::ordered_euclidean_ring_operators1< T, B > >
struct	is_chained_base< ::boost::ordered_euclidean_ring_operators2< T, U, B > >
struct	is_chained_base< ::boost::ordered_euclidean_ring_operators< T, U, B, O > >
struct	is_chained_base< ::boost::ordered_euclidian_ring_operators1< T, B > >
struct	is_chained_base< ::boost::ordered_euclidian_ring_operators2< T, U, B > >
struct	is_chained_base< ::boost::ordered_euclidian_ring_operators< T, U, B, O > >
struct	is_chained_base< ::boost::ordered_field_operators1< T, B > >
struct	is_chained_base< ::boost::ordered_field_operators2< T, U, B > >
struct	is_chained_base< ::boost::ordered_field_operators< T, U, B, O > >
struct	is_chained_base< ::boost::ordered_ring_operators1< T, B > >
struct	is_chained_base< ::boost::ordered_ring_operators2< T, U, B > >
struct	is_chained_base< ::boost::ordered_ring_operators< T, U, B, O > >
struct	is_chained_base< ::boost::output_iteratable< T, B > >
struct	is_chained_base< ::boost::partially_ordered1< T, B > >
struct	is_chained_base< ::boost::partially_ordered2< T, U, B > >
struct	is_chained_base< ::boost::partially_ordered< T, U, B, O > >
struct	is_chained_base< ::boost::random_access_iteratable< T, U, V, W, B > >
struct	is_chained_base< ::boost::right_shiftable1< T, B > >
struct	is_chained_base< ::boost::right_shiftable2< T, U, B > >
struct	is_chained_base< ::boost::right_shiftable< T, U, B, O > >
struct	is_chained_base< ::boost::ring_operators1< T, B > >
struct	is_chained_base< ::boost::ring_operators2< T, U, B > >
struct	is_chained_base< ::boost::ring_operators< T, U, B, O > >
struct	is_chained_base< ::boost::shiftable1< T, B > >
struct	is_chained_base< ::boost::shiftable2< T, U, B > >
struct	is_chained_base< ::boost::shiftable< T, U, B, O > >
struct	is_chained_base< ::boost::subtractable1< T, B > >
struct	is_chained_base< ::boost::subtractable2< T, U, B > >
struct	is_chained_base< ::boost::subtractable2_left< T, U, B > >
struct	is_chained_base< ::boost::subtractable< T, U, B, O > >
struct	is_chained_base< ::boost::totally_ordered1< T, B > >
struct	is_chained_base< ::boost::totally_ordered2< T, U, B > >
struct	is_chained_base< ::boost::totally_ordered< T, U, B, O > >
struct	is_chained_base< ::boost::unit_steppable< T, B > >
struct	is_chained_base< ::boost::xorable1< T, B > >
struct	is_chained_base< ::boost::xorable2< T, U, B > >
struct	is_chained_base< ::boost::xorable< T, U, B, O > >
struct	is_convertible< long double, mpfr_class >
struct	is_convertible< long long, mpfr_class >
struct	is_convertible< use_default, To >
struct	is_directed_bidirectional_graph
struct	is_directed_graph
struct	is_directed_unidirectional_graph
struct	is_distributed_selector
struct	is_edge_list_graph
struct	is_empty< blank >
struct	is_future_type
struct	is_future_type< shared_future< T > >
struct	is_future_type< unique_future< T > >
struct	is_in_subset
struct	is_incidence_graph
struct	is_integral< gil::packed_channel_reference< BitField, FirstBit, NumBits, IsMutable > >
struct	is_integral< gil::packed_channel_value< NumBits > >
struct	is_integral< gil::packed_dynamic_channel_reference< BitField, NumBits, IsMutable > >
struct	is_integral< gil::scoped_channel_value< BaseChannelValue, MinVal, MaxVal > >
class	is_local_edge
class	is_local_vertex
struct	is_multigraph
	The is_multigraph metafunction returns true if the graph allows parallel edges. More...
struct	is_mutable_edge_graph
struct	is_mutable_edge_property_graph
struct	is_mutable_graph
struct	is_mutable_property_graph
struct	is_mutable_vertex_graph
struct	is_mutable_vertex_property_graph
struct	is_mutex_type
struct	is_mutex_type< boost::log::sources::multi_thread_model< T > >
struct	is_mutex_type< boost::log::sources::single_thread_model >
struct	is_not_in_subset
struct	is_nullable
struct	is_placeholder
struct	is_placeholder< arg< I > >
struct	is_placeholder< arg< I >(*)() >
struct	is_placeholder< phoenix::argument< I > >
struct	is_POD
struct	is_pod< ::boost::detail::lower_alignment< Align > >
struct	is_pod< blank >
struct	is_pod< uuids::uuid >
struct	is_property_map
struct	is_random
struct	is_random< std::random_access_iterator_tag >
struct	is_random_access_iterator
struct	is_reference_wrapper
	Determine if a type T is an instantiation of reference_wrapper. More...
struct	is_residual_edge
struct	is_reverse_graph
struct	is_reverse_graph< reverse_graph< G, R > >
struct	is_stateless< blank >
struct	is_strict_lock
struct	is_strict_lock_sur_parole
struct	is_strict_lock_sur_parole< nested_strict_lock< Lock > >
struct	is_strict_lock_sur_parole< stream_guard< Stream, RecursiveMutex > >
struct	is_strict_lock_sur_parole< strict_lock< Lockable > >
struct	is_strict_lock_sur_parolle
	An strict lock is a lock ensuring the mutex is locked on the scope of the lock There is no single way to define a strict lock as the strict_lock and nesteed_strict_lock shows. More...
struct	is_testable_lockable
struct	is_testable_lockable< testable_mutex< Lockable > >
struct	is_undirected_graph
struct	is_vertex_list_graph
struct	iterations_t
class	iterator_property_map
class	iterator_property_map< RandomAccessIterator, local_property_map< ProcessGroup, GlobalMap, StorageMap >, ValueType, Reference >
	Distributed iterator property map. More...
class	iterator_property_map< RandomAccessIterator, parallel::distributed_property_map< ProcessGroup, GlobalMap, StorageMap >, ValueType, Reference >
	Distributed iterator property map. More...
singleton	iterator_range
	iterator_range class More...
struct	join_if_joinable
struct	keep_all
class	label_writer
class	labeled_graph
	The labeled_graph class is a graph adaptor that maintains a mapping between vertex labels and vertex descriptors. More...
class	labeled_graph< Graph *, Label, Selector >
	The partial specialization over graph pointers allows the construction of temporary labeled graph objects. More...
struct	labeled_graph_class_tag
struct	labeled_graph_types
struct	last_value
struct	last_value< void >
class	latch
struct	layout_tolerance
	Determines when to terminate layout of a particular graph based on a given relative tolerance. More...
struct	lazy_disable_if
struct	lazy_disable_if_c
struct	lazy_disable_if_c< true, T >
struct	lazy_enable_if
struct	lazy_enable_if_c
struct	lazy_enable_if_c< false, T >
struct	lead_visitor
struct	learning_constant_range_t
class	leda_edge_property_map
class	leda_graph_data_map
class	leda_graph_id_map
struct	leda_graph_traversal_category
class	leda_node_property_map
struct	leda_property_map
struct	leda_property_map< edge_all_t >
struct	leda_property_map< edge_index_t >
struct	leda_property_map< vertex_all_t >
struct	leda_property_map< vertex_index_t >
struct	left_shiftable
struct	left_shiftable1
struct	left_shiftable2
struct	left_shiftable< T, T, B,::boost::detail::false_t >
struct	left_shiftable< T, U, B,::boost::detail::true_t >
struct	less
	Less predicate. More...
struct	less_equal
	Less or equal predicate. More...
class	less_equal_op_first_archetype
class	less_equal_op_second_archetype
struct	less_pointees_t
struct	less_than_comparable
struct	less_than_comparable1
struct	less_than_comparable2
struct	less_than_comparable< T, T, B,::boost::detail::false_t >
struct	less_than_comparable< T, U, B,::boost::detail::true_t >
class	less_than_comparable_archetype
class	less_than_op_first_archetype
class	less_than_op_second_archetype
class	lightweight_forward_adapter
class	lightweight_forward_adapter< Function &, Arity_Or_MinArity, MaxArity >
class	lightweight_forward_adapter< Function const, Arity_Or_MinArity, MaxArity >
class	limitation_error
	Exception class that is used to indicate library limitation. More...
struct	linear_cooling
struct	listS
struct	local_edge
struct	local_property
class	local_property_map
	Property map that accesses an underlying, local property map using a subset of the global keys. More...
class	local_subgraph
struct	local_vertex
struct	Lock
class	lock_error
class	lock_guard
struct	Lockable
	Lockable extends BasicLockable with try_lock functions. More...
class	lockable_adapter
class	logic_error
	Base class for logic exceptions from the logging library. More...
struct	lookahead_t
struct	lookup_named_param
struct	lookup_named_param< Tag, bgl_named_params< T, Tag, Base > >
struct	lookup_named_param< Tag1, bgl_named_params< T, Tag, Base > >
struct	lookup_named_param_def
struct	lookup_named_param_def< Tag, bgl_named_params< T, Tag, Base >, Def >
struct	lookup_named_param_def< Tag1, bgl_named_params< T, Tag, Base >, Def >
struct	lookup_one_property
struct	lookup_one_property< const T, Tag >
struct	lookup_one_property_internal
struct	lookup_one_property_internal< boost::property< Tag, T, Base >, PropName >
struct	lookup_one_property_internal< boost::property< Tag, T, Base >, Tag >
struct	lookup_one_property_internal< property< Tag, T, Base >, BOOST_JOIN(edge, _bundle_t)>
struct	lookup_one_property_internal< property< Tag, T, Base >, BOOST_JOIN(graph, _bundle_t)>
struct	lookup_one_property_internal< property< Tag, T, Base >, BOOST_JOIN(vertex, _bundle_t)>
struct	lookup_one_property_internal< property< Tag, T, Base >, edge_all_t >
struct	lookup_one_property_internal< property< Tag, T, Base >, graph_all_t >
struct	lookup_one_property_internal< property< Tag, T, Base >, vertex_all_t >
struct	lookup_one_property_internal< T, BOOST_JOIN(edge, _bundle_t)>
struct	lookup_one_property_internal< T, BOOST_JOIN(graph, _bundle_t)>
struct	lookup_one_property_internal< T, BOOST_JOIN(vertex, _bundle_t)>
struct	lookup_one_property_internal< T, edge_all_t >
struct	lookup_one_property_internal< T, graph_all_t >
struct	lookup_one_property_internal< T, R TMaybeBase::*, typename enable_if< is_base_of< TMaybeBase, T > >::type >
struct	lookup_one_property_internal< T, vertex_all_t >
struct	loop_erased_random_walk_stuck
struct	low_bits_mask_t
struct	low_bits_mask_t< std::numeric_limits< unsigned char >::digits >
struct	lvalue_property_map_archetype
struct	lvalue_property_map_tag
struct	LvaluePropertyMapConcept
struct	make_recursive_variant
struct	make_recursive_variant_over
struct	make_variant_over
struct	mapS
class	mas_visitor
struct	MASVisitorConcept
singleton	match_results
struct	matches_fun
	The regex matching functor. More...
class	matrix_adj_iterator
class	matrix_incidence_iterator
struct	matrix_property_map
struct	max_clique_visitor
	The max_clique_visitor records the size of the maximum clique (but not the clique itself). More...
struct	max_priority_queue_t
struct	maximum_cardinality_matching_verifier
struct	mcr_float
	The mcr_float is like numeric_limits, but only for floating point types and only defines infinity() and epsilon(). More...
struct	mean_geodesic_measure
struct	mean_graph_distance_measure
class	mem_fun1_ref_t
class	mem_fun1_t
class	mem_fun_ref_t
class	mem_fun_t
struct	membership_filtered_graph_traits
class	mesh_iterator
struct	min_max_cycle_visitor
	The min_max_cycle_visitor simultaneously records the minimum and maximum cycles in a graph. More...
class	missing_value
	Exception class that is used to indicate errors of missing values. More...
class	mod_op_first_archetype
class	mod_op_second_archetype
struct	modable
struct	modable1
struct	modable2
struct	modable2_left
struct	modable< T, T, B,::boost::detail::false_t >
struct	modable< T, U, B,::boost::detail::true_t >
class	modable_archetype
class	move_insert_iterator
class	move_iterator
	Class template move_iterator is an iterator adaptor with the same behavior as the underlying iterator except that its dereference operator implicitly converts the value returned by the underlying iterator's dereference operator to an rvalue reference. More...
class	multi_array
class	multi_array_ref
struct	multimapS
struct	multipliable
struct	multipliable1
struct	multipliable2
struct	multipliable< T, T, B,::boost::detail::false_t >
struct	multipliable< T, U, B,::boost::detail::true_t >
class	multipliable_archetype
struct	multiplicative
struct	multiplicative1
struct	multiplicative2
struct	multiplicative< T, T, B,::boost::detail::false_t >
struct	multiplicative< T, U, B,::boost::detail::true_t >
struct	multisetS
class	mutable_bidirectional_iterator_archetype
struct	mutable_edge_graph_tag
struct	mutable_edge_property_graph_tag
class	mutable_forward_iterator_archetype
struct	mutable_graph_tag
struct	mutable_lvalue_property_map_archetype
struct	Mutable_LvaluePropertyMapConcept
struct	mutable_property_graph_tag
class	mutable_queue
class	mutable_random_access_iterator_archetype
struct	mutable_vertex_graph_tag
struct	mutable_vertex_property_graph_tag
class	mutate_graph
class	mutate_graph_impl
class	mutex
struct	native_type
struct	negative_cycle
struct	negative_edge
class	neighbor_bfs_visitor
struct	NeighborBFSVisitorConcept
class	nested_strict_lock
	A nested strict lock is a scoped lock guard ensuring the mutex is locked on its scope, by taking ownership of an nesting lock, locking the mutex on construction if not already locked and restoring the ownership to the nesting lock on destruction. More...
struct	no_augmenting_path_finder
struct	no_block_tag
struct	no_kuratowski_subgraph_isolation
struct	no_matching_verifier
struct	no_planar_embedding
struct	no_property
struct	non_type
struct	nop
	The function object that does nothing. More...
struct	not_a_dag
struct	not_complete
struct	not_connected
class	not_equal_op_first_archetype
class	not_equal_op_second_archetype
struct	not_equal_to
	Inequality predicate. More...
class	nothrow_exception_handler
	A no-throw exception handler functional object. More...
class	null_archetype
struct	null_deleter
	A function object that does nothing and can be used as an empty deleter for shared_ptr. More...
class	null_mutex
	Implements a mutex that simulates a mutex without doing any operation and simulates a successful operation. More...
struct	null_property_map
struct	null_property_traits
struct	null_tree_visitor
struct	null_visitor
struct	nullable
struct	numeric_values
	This generic type reports various numeric values for some type. More...
struct	numeric_values< double >
struct	numeric_values< float >
struct	numeric_values< long double >
class	object_cache
singleton	object_pool
	A template class that can be used for fast and efficient memory allocation of objects. More...
class	odr_violation
	Exception class that is used to indicate ODR violation. More...
class	offset_separator
struct	on_back_edge
struct	on_black_target
struct	on_discover_vertex
struct	on_edge_minimized
struct	on_edge_not_minimized
struct	on_edge_not_relaxed
struct	on_edge_relaxed
struct	on_examine_edge
struct	on_examine_vertex
struct	on_finish_edge
struct	on_finish_vertex
struct	on_forward_or_cross_edge
struct	on_gray_target
struct	on_initialize_vertex
struct	on_no_event
struct	on_non_tree_edge
struct	on_start_vertex
struct	on_tree_edge
struct	once_block_flag
	A flag to detect if a code block has already been executed. More...
struct	once_flag
struct	one_bit_color_map
class	one_bit_color_map< local_property_map< ProcessGroup, GlobalMap, StorageMap > >
class	one_bit_color_map< parallel::distributed_property_map< ProcessGroup, GlobalMap, StorageMap > >
struct	operators
struct	operators2
struct	operators< T, T >
struct	optag1
struct	optag2
struct	optag3
singleton	optional
class	optional< T && >
struct	optional_swap_should_use_default_constructor
struct	orable
struct	orable1
struct	orable2
struct	orable< T, T, B,::boost::detail::false_t >
struct	orable< T, U, B,::boost::detail::true_t >
struct	ordered_euclidean_ring_operators
struct	ordered_euclidean_ring_operators1
struct	ordered_euclidean_ring_operators2
struct	ordered_euclidean_ring_operators< T, T, B,::boost::detail::false_t >
struct	ordered_euclidean_ring_operators< T, U, B,::boost::detail::true_t >
struct	ordered_euclidian_ring_operators
struct	ordered_euclidian_ring_operators1
struct	ordered_euclidian_ring_operators2
struct	ordered_euclidian_ring_operators< T, T, B,::boost::detail::false_t >
struct	ordered_euclidian_ring_operators< T, U, B,::boost::detail::true_t >
struct	ordered_field_operators
struct	ordered_field_operators1
struct	ordered_field_operators2
struct	ordered_field_operators< T, T, B,::boost::detail::false_t >
struct	ordered_field_operators< T, U, B,::boost::detail::true_t >
struct	ordered_ring_operators
struct	ordered_ring_operators1
struct	ordered_ring_operators2
struct	ordered_ring_operators< T, T, B,::boost::detail::false_t >
struct	ordered_ring_operators< T, U, B,::boost::detail::true_t >
struct	orig_to_copy_t
class	ostream_buffer
class	out_directed_plod_iterator
struct	output_fun
	The function object that outputs its second operand to the first one. More...
struct	output_iteratable
class	output_iterator_archetype
struct	output_iterator_helper
struct	output_proxy
struct	owner_less
struct	owner_less< shared_ptr< T > >
struct	owner_less< weak_ptr< T > >
class	packaged_task
struct	paint_by_number_writer
struct	parallel_edge_traits
struct	parallel_edge_traits< hash_mapS >
struct	parallel_edge_traits< hash_multimapS >
struct	parallel_edge_traits< hash_multisetS >
struct	parallel_edge_traits< hash_setS >
struct	parallel_edge_traits< listS >
struct	parallel_edge_traits< mapS >
struct	parallel_edge_traits< multisetS >
struct	parallel_edge_traits< setS >
struct	parallel_edge_traits< slistS >
struct	parallel_edge_traits< vecS >
struct	param_not_found
struct	parity_map_t
class	parse_error
	Exception class that is used to indicate parsing errors. More...
struct	partially_ordered
struct	partially_ordered1
struct	partially_ordered2
struct	partially_ordered< T, T, B,::boost::detail::false_t >
struct	partially_ordered< T, U, B,::boost::detail::true_t >
struct	planar_dfs_visitor
struct	planar_face_traversal_visitor
class	plod_iterator
class	plus_op_first_archetype
class	plus_op_second_archetype
struct	pointee
struct	pointee< ATL::CAdapt< T > >
struct	pointee< ATL::CAutoPtr< E > >
struct	pointee< ATL::CComPtr< T > >
struct	pointee< ATL::CComQIPtr< T, piid > >
struct	pointee< ATL::CHeapPtr< E, Allocator > >
class	pointer_to_binary_function
struct	pointer_to_other
struct	pointer_to_other< ::boost::interprocess::offset_ptr< PointedType, DifferenceType, OffsetType, OffsetAlignment >, U >
struct	pointer_to_other< Sp< T >, U >
struct	pointer_to_other< Sp< T, T2 >, U >
struct	pointer_to_other< Sp< T, T2, T3 >, U >
struct	pointer_to_other< T *, U >
class	pointer_to_unary_function
struct	polling_t
class	poly_basic_lockable_adapter
class	poly_lockable
class	poly_lockable_adapter
class	poly_shared_lockable_adapter
class	poly_timed_lockable_adapter
singleton	pool
singleton	pool_allocator
	A C++ Standard Library conforming allocator, based on an underlying pool. More...
class	pool_allocator< void, UserAllocator, Mutex, NextSize, MaxSize >
	Specialization of pool_allocator<void>. More...
struct	pool_allocator_tag
	Simple tag type used by pool_allocator as an argument to the underlying singleton_pool. More...
struct	predecessor_recorder
class	PreorderTraverser
struct	prestige_measure
struct	previous_iteration
class	progress_display
class	progress_timer
class	promise
class	promise< R & >
class	promise< void >
class	promise_already_satisfied
class	promise_moved
struct	property
struct	property_graph_archetype
struct	property_graph_archetype_tag
struct	property_kind
struct	property_kind< edge_all_t >
struct	property_kind< edge_bundle_t >
struct	property_kind< edge_capacity_t >
struct	property_kind< edge_centrality_t >
struct	property_kind< edge_color_t >
struct	property_kind< edge_discover_time_t >
struct	property_kind< edge_finished_t >
struct	property_kind< edge_flow_t >
struct	property_kind< edge_global_t >
struct	property_kind< edge_index_t >
struct	property_kind< edge_local_index_t >
struct	property_kind< edge_local_t >
struct	property_kind< edge_name_t >
struct	property_kind< edge_owner_t >
struct	property_kind< edge_residual_capacity_t >
struct	property_kind< edge_reverse_t >
struct	property_kind< edge_underlying_t >
struct	property_kind< edge_update_t >
struct	property_kind< edge_weight2_t >
struct	property_kind< edge_weight_t >
struct	property_kind< graph_all_t >
struct	property_kind< graph_bundle_t >
struct	property_kind< graph_name_t >
struct	property_kind< graph_visitor_t >
struct	property_kind< vertex_all_t >
struct	property_kind< vertex_bundle_t >
struct	property_kind< vertex_centrality_t >
struct	property_kind< vertex_color_t >
struct	property_kind< vertex_current_degree_t >
struct	property_kind< vertex_degree_t >
struct	property_kind< vertex_discover_time_t >
struct	property_kind< vertex_distance2_t >
struct	property_kind< vertex_distance_t >
struct	property_kind< vertex_finish_time_t >
struct	property_kind< vertex_global_t >
struct	property_kind< vertex_in_degree_t >
struct	property_kind< vertex_index1_t >
struct	property_kind< vertex_index2_t >
struct	property_kind< vertex_index_t >
struct	property_kind< vertex_local_index_t >
struct	property_kind< vertex_local_t >
struct	property_kind< vertex_lowpoint_t >
struct	property_kind< vertex_name_t >
struct	property_kind< vertex_out_degree_t >
struct	property_kind< vertex_owner_t >
struct	property_kind< vertex_potential_t >
struct	property_kind< vertex_predecessor_t >
struct	property_kind< vertex_priority_t >
struct	property_kind< vertex_rank_t >
struct	property_kind< vertex_root_t >
struct	property_kind< vertex_underlying_t >
struct	property_kind< vertex_update_t >
struct	property_map
struct	property_map< adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >, Property >
struct	property_map< adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >, T Bundle::* >
struct	property_map< adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >const, Property >
struct	property_map< adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >const, T Bundle::* >
struct	property_map< adjacency_matrix< D, VP, EP, GP, A >, Tag >
struct	property_map< adjacency_matrix< D, VP, EP, GP, A >, vertex_index_t >
struct	property_map< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, edge_all_t, typename disable_if< detail::is_distributed_selector< Vertex > >::type >
struct	property_map< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, edge_index_t, typename disable_if< detail::is_distributed_selector< Vertex > >::type >
struct	property_map< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, graph_all_t, typename disable_if< detail::is_distributed_selector< Vertex > >::type >
struct	property_map< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, Tag, typename disable_if< detail::is_distributed_selector< Vertex > >::type >
struct	property_map< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, vertex_all_t, typename disable_if< detail::is_distributed_selector< Vertex > >::type >
struct	property_map< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, vertex_index_t, typename disable_if< detail::is_distributed_selector< Vertex > >::type >
class	property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >, edge_global_t >
class	property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >, edge_index_t >
class	property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >, Tag >
class	property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >, vertex_global_t >
class	property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >, vertex_index_t >
class	property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >, vertex_local_index_t >
class	property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >, vertex_local_t >
class	property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >, vertex_owner_t >
class	property_map< const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >, Property >
struct	property_map< const reverse_graph< BidirGraph, GRef >, Property >
struct	property_map< directed_graph< VP, EP, GP >, edge_all_t >
struct	property_map< directed_graph< VP, EP, GP >, Property >
struct	property_map< directed_graph< VP, EP, GP >, vertex_all_t >
struct	property_map< filtered_graph< G, EP, VP >, Property >
struct	property_map< grid_graph< DimensionsT, VertexIndexT, EdgeIndexT >, edge_index_t >
struct	property_map< grid_graph< DimensionsT, VertexIndexT, EdgeIndexT >, edge_reverse_t >
struct	property_map< grid_graph< DimensionsT, VertexIndexT, EdgeIndexT >, vertex_index_t >
struct	property_map< leda::GRAPH< vtype, etype >, Tag >
class	property_map< local_subgraph< const DistributedGraph >, PropertyTag >
class	property_map< local_subgraph< DistributedGraph >, PropertyTag >
struct	property_map< mpi::graph_communicator, vertex_index_t >
	INTERNAL ONLY. More...
struct	property_map< reverse_graph< BidirGraph, GRef >, Property >
struct	property_map< reverse_graph< Graph, GRef >, edge_underlying_t >
struct	property_map< sgb_const_graph_ptr, edge_length_t >
struct	property_map< sgb_const_graph_ptr, PropertyTag >
struct	property_map< sgb_const_graph_ptr, vertex_index_t >
struct	property_map< sgb_const_graph_ptr, vertex_name_t >
struct	property_map< sgb_graph_ptr, edge_length_t >
struct	property_map< sgb_graph_ptr, PropertyTag >
struct	property_map< sgb_graph_ptr, vertex_index_t >
struct	property_map< sgb_graph_ptr, vertex_name_t >
struct	property_map< std::vector< EdgeList, Allocator >, vertex_index_t >
struct	property_map< undirected_graph< VP, EP, GP >, edge_all_t >
struct	property_map< undirected_graph< VP, EP, GP >, Property >
struct	property_map< undirected_graph< VP, EP, GP >, vertex_all_t >
class	property_map< vertex_index_t, const graph::vertex_list_adaptor< Graph, GlobalIndexMap > >
class	property_map< vertex_index_t, graph::vertex_list_adaptor< Graph, GlobalIndexMap > >
struct	property_map_equivalent
struct	property_map_filter
class	property_map_function
struct	property_map_iterator_generator
struct	property_map_tuple_adaptor
class	property_map_value
struct	property_not_found
struct	property_put
	Functor which just sets a given value to a vertex or edge in a property map. More...
struct	property_reduce
	Metafunction that produces a reduction operation for the given property. More...
struct	property_reduce< vertex_color_t >
	Reduction of vertex colors can only darken, not lighten, the color. More...
struct	property_reduce< vertex_distance_t >
	Reduction of a distance always takes the shorter distance. More...
struct	property_reduce< vertex_predecessor_t >
struct	property_traits
struct	property_traits< ::boost::bimaps::views::map_view< Tag, Bimap > >
struct	property_traits< ::boost::bimaps::views::unordered_map_view< Tag, Bimap > >
struct	property_traits< const T * >
struct	property_traits< detail::underlying_edge_desc_map_type< E > >
struct	property_traits< T * >
struct	property_value
struct	property_writer
struct	PropertyPrinter
struct	PropertyPrinter< Graph, no_property >
struct	PropertyPrinter< Graph, property< Tag, Value, Next > >
class	ptr_array
class	ptr_circular_buffer
class	ptr_deque
class	ptr_list
class	ptr_map
class	ptr_map_adapter
class	ptr_multimap
class	ptr_multimap_adapter
class	ptr_multiset
class	ptr_multiset_adapter
class	ptr_sequence_adapter
class	ptr_set
class	ptr_set_adapter
class	ptr_unordered_map
class	ptr_unordered_multimap
class	ptr_unordered_multiset
class	ptr_unordered_set
class	ptr_vector
struct	put_get_helper
class	queue
struct	r_c_shortest_paths_label
struct	random_access_iteratable
class	random_access_iterator_archetype
struct	random_access_iterator_helper
struct	RandomAccessRangeConcept
	Check if a type T models the RandomAccessRange range concept. More...
struct	range_category
struct	range_const_iterator
struct	range_const_iterator< boost::filesystem::directory_iterator >
struct	range_const_iterator< boost::filesystem::recursive_directory_iterator >
struct	range_const_iterator< boost::polygon::polygon_data< CoordinateType > >
struct	range_const_iterator< geometry::adapt::bp::holes_proxy< Polygon > >
struct	range_const_iterator< geometry::adapt::bp::ring_proxy< Polygon > >
struct	range_const_iterator< gsl_vector * >
struct	range_const_iterator< xpressive::sub_match< BidiIter > >
	INTERNAL ONLY. More...
struct	range_const_reverse_iterator
struct	range_difference
struct	range_iterator
struct	range_mutable_iterator
struct	range_mutable_iterator< boost::filesystem::directory_iterator >
struct	range_mutable_iterator< boost::filesystem::recursive_directory_iterator >
struct	range_mutable_iterator< boost::polygon::polygon_data< CoordinateType > >
struct	range_mutable_iterator< coroutines::pull_coroutine< R > >
struct	range_mutable_iterator< coroutines::push_coroutine< Arg > >
struct	range_mutable_iterator< geometry::adapt::bp::holes_proxy< Polygon > >
struct	range_mutable_iterator< geometry::adapt::bp::ring_proxy< Polygon > >
struct	range_mutable_iterator< gsl_vector * >
struct	range_mutable_iterator< xpressive::sub_match< BidiIter > >
	INTERNAL ONLY. More...
struct	range_pointer
struct	range_reference
struct	range_result_iterator
struct	range_reverse_iterator
struct	range_reverse_result_iterator
struct	range_size
struct	range_size< boost::polygon::polygon_data< CoordinateType > >
struct	range_size< const T >
struct	range_traversal
struct	range_value
struct	rank_comparison
singleton	ratio
struct	ratio_add
struct	ratio_divide
struct	ratio_equal
struct	ratio_gcd
struct	ratio_greater
struct	ratio_greater_equal
struct	ratio_less
struct	ratio_less_equal
struct	ratio_multiply
struct	ratio_not_equal
struct	ratio_string
struct	ratio_string< atto, char >
struct	ratio_string< atto, char16_t >
struct	ratio_string< atto, char32_t >
struct	ratio_string< atto, wchar_t >
struct	ratio_string< centi, char >
struct	ratio_string< centi, char16_t >
struct	ratio_string< centi, char32_t >
struct	ratio_string< centi, wchar_t >
struct	ratio_string< deca, char >
struct	ratio_string< deca, char16_t >
struct	ratio_string< deca, char32_t >
struct	ratio_string< deca, wchar_t >
struct	ratio_string< deci, char >
struct	ratio_string< deci, char16_t >
struct	ratio_string< deci, char32_t >
struct	ratio_string< deci, wchar_t >
struct	ratio_string< exa, char >
struct	ratio_string< exa, char16_t >
struct	ratio_string< exa, char32_t >
struct	ratio_string< exa, wchar_t >
struct	ratio_string< femto, char >
struct	ratio_string< femto, char16_t >
struct	ratio_string< femto, char32_t >
struct	ratio_string< femto, wchar_t >
struct	ratio_string< giga, char >
struct	ratio_string< giga, char16_t >
struct	ratio_string< giga, char32_t >
struct	ratio_string< giga, wchar_t >
struct	ratio_string< hecto, char >
struct	ratio_string< hecto, char16_t >
struct	ratio_string< hecto, char32_t >
struct	ratio_string< hecto, wchar_t >
struct	ratio_string< kilo, char >
struct	ratio_string< kilo, char16_t >
struct	ratio_string< kilo, char32_t >
struct	ratio_string< kilo, wchar_t >
struct	ratio_string< mega, char >
struct	ratio_string< mega, char16_t >
struct	ratio_string< mega, char32_t >
struct	ratio_string< mega, wchar_t >
struct	ratio_string< micro, char >
struct	ratio_string< micro, char16_t >
struct	ratio_string< micro, char32_t >
struct	ratio_string< micro, wchar_t >
struct	ratio_string< milli, char >
struct	ratio_string< milli, char16_t >
struct	ratio_string< milli, char32_t >
struct	ratio_string< milli, wchar_t >
struct	ratio_string< nano, char >
struct	ratio_string< nano, char16_t >
struct	ratio_string< nano, char32_t >
struct	ratio_string< nano, wchar_t >
struct	ratio_string< peta, char >
struct	ratio_string< peta, char16_t >
struct	ratio_string< peta, char32_t >
struct	ratio_string< peta, wchar_t >
struct	ratio_string< pico, char >
struct	ratio_string< pico, char16_t >
struct	ratio_string< pico, char32_t >
struct	ratio_string< pico, wchar_t >
struct	ratio_string< tera, char >
struct	ratio_string< tera, char16_t >
struct	ratio_string< tera, char32_t >
struct	ratio_string< tera, wchar_t >
struct	ratio_subtract
class	rational
struct	read_write_property_map_archetype
struct	read_write_property_map_tag
struct	readable_property_map_archetype
struct	readable_property_map_tag
struct	ReadablePropertyMapConcept
struct	ReadWritePropertyMapConcept
class	record
	Logging record class. More...
class	record_view
	Logging record view class. More...
class	rectangle_topology
class	recursive_mutex
class	recursive_timed_mutex
struct	recursive_variant_
singleton	recursive_wrapper
class	ref_property_map
singleton	reference_wrapper
	Contains a reference to an object of type T. More...
class	reg_expression
class	regbase
class	regex_error
class	regex_iterator
class	regex_iterator_implementation
class	regex_token_iterator
class	regex_token_iterator_implementation
struct	regex_traits
struct	regex_traits_architype
struct	regex_traits_computer
struct	regex_traits_computer< global_regex_namespace::basic_regex< charT, traits > >
struct	regex_traits_wrapper
struct	RegexConcept
struct	RegexTraitsConcept
class	relaxed_heap
struct	remove_edge_tag
struct	remove_nullable
struct	remove_vertex_tag
struct	repulsive_force_t
struct	Requires_
struct	requires_
struct	result_of
struct	result_of< proto::basic_default_domain(Expr)>
struct	result_of< proto::basic_default_generator(Expr)>
struct	result_of< proto::default_domain(Expr)>
struct	result_of< proto::default_generator(Expr)>
class	reverse_graph
struct	reverse_graph_tag
class	reverse_lock
struct	right_shiftable
struct	right_shiftable1
struct	right_shiftable2
struct	right_shiftable< T, T, B,::boost::detail::false_t >
struct	right_shiftable< T, U, B,::boost::detail::true_t >
struct	ring_operators
struct	ring_operators1
struct	ring_operators2
struct	ring_operators< T, T, B,::boost::detail::false_t >
struct	ring_operators< T, U, B,::boost::detail::true_t >
class	rmat_iterator
struct	root_vertex_t
class	runtime_error
	Base class for runtime exceptions from the logging library. More...
class	safe_iterator_property_map
class	safe_iterator_property_map< RandomAccessIterator, local_property_map< ProcessGroup, GlobalMap, StorageMap >, ValueType, Reference >
	Distributed safe iterator property map. More...
class	safe_iterator_property_map< RandomAccessIterator, parallel::distributed_property_map< ProcessGroup, GlobalMap, StorageMap >, ValueType, Reference >
	Distributed safe iterator property map. More...
struct	save_result_wrapper
	Function object wrapper for saving the adopted function object result. More...
class	scalable_rmat_iterator
class	scoped_array
class	scoped_ptr
class	scoped_static_mutex_lock
class	scoped_thread
	RAI thread wrapper adding a specific destroyer allowing to master what can be done at destruction time. More...
struct	second_side
struct	setS
class	setup_error
	Exception class that is used to indicate invalid library setup. More...
class	sgb_edge
class	sgb_edge_length_map
class	sgb_edge_util_map
struct	sgb_traversal_tag
class	sgb_vertex_id_map
class	sgb_vertex_name_map
class	sgb_vertex_util_map
class	sgi_assignable_archetype
class	shared_array
class	shared_array_property_map
class	shared_future
singleton	shared_lock
class	shared_lock_guard
class	shared_lockable_adapter
class	shared_mutex
class	shared_poly_lockable
singleton	shared_ptr
struct	SharedLock
struct	SharedLockable
	SharedLockable object extends TimedLockable with the lock_shared, lock_shared_until, lock_shared_for, try_lock_shared_until, try_lock_shared and unlock_shared functions. More...
struct	shiftable
struct	shiftable1
struct	shiftable2
struct	shiftable< T, T, B,::boost::detail::false_t >
struct	shiftable< T, U, B,::boost::detail::true_t >
struct	sig
class	signal
struct	SignedInteger< int >
struct	SignedInteger< long >
struct	SignedInteger< short >
struct	SignedInteger< signed char >
struct	simple_point
class	simple_segregated_storage
	Simple Segregated Storage is the simplest, and probably the fastest, memory allocation/deallocation algorithm. More...
struct	single_side
struct	SinglePassRangeConcept
	Check if a type T models the SinglePassRange range concept. More...
class	singleton_pool
	The singleton_pool class allows other pool interfaces for types of the same size to share the same pool. More...
struct	sink_factory
	Sink factory base interface. More...
struct	slistS
class	slot
class	small_world_iterator
struct	sort_pair
class	sorted_erdos_renyi_iterator
class	sorted_rmat_iterator
class	sorted_unique_rmat_iterator
class	sphere_topology
struct	square_distance_attractive_force
struct	square_distance_repulsive_force
class	square_topology
class	ssca_iterator
struct	static_log2
struct	static_log2< 0 >
class	static_mutex
class	static_object
class	static_property_map
struct	static_signed_max
struct	static_signed_min
class	static_type_dispatcher
	A static type dispatcher class. More...
struct	static_unsigned_max
struct	static_unsigned_min
class	static_visitor
class	stream_guard
class	strict_lock
class	strict_lock_ptr
	strict lock providing a pointer access to the synchronized value type. More...
class	strict_scoped_thread
	RAI thread wrapper adding a specific destroyer allowing to master what can be done at destruction time. More...
struct	strictest_lock
struct	strictest_lock< LeftLockT, RightLockT >
struct	strictest_lock< LeftLockT, RightLockT, LocksT... >
struct	strictest_lock< LockT >
struct	StrictLock
	An StrictLock is a scoped lock guard ensuring the mutex is locked on the scope of the lock, by locking the mutex on construction and unlocking it on destruction. More...
class	strided_integer_range
struct	sub_match
class	sub_range
class	subarray_gen
class	subgraph
class	subgraph_global_property_map
	The global property map returns the global properties associated with local descriptors. More...
class	subgraph_local_property_map
	The local property map returns the local property associated with the local descriptors. More...
struct	subgraph_tag
class	subtract_op_first_archetype
class	subtract_op_second_archetype
struct	subtractable
struct	subtractable1
struct	subtractable2
struct	subtractable2_left
struct	subtractable< T, T, B,::boost::detail::false_t >
struct	subtractable< T, U, B,::boost::detail::true_t >
class	subtractable_archetype
class	sync_bounded_queue
class	sync_queue
class	synchronized_value
	cloaks a value type and the mutex used to protect it together. More...
struct	synchronized_value_strict_lock_ptr
struct	synchronized_value_strict_lock_ptr< const SV >
struct	synchronized_value_unique_lock_ptr
struct	synchronized_value_unique_lock_ptr< const SV >
class	system_error
	Exception class that is used to indicate underlying OS API errors. More...
class	task_already_started
class	task_moved
class	testable_mutex
	Based on Associate Mutexes with Data to Prevent Races, By Herb Sutter, May 13, 2010 http://www.drdobbs.com/windows/associate-mutexes-with-data-to-prevent-r/224701827?pgno=3. More...
struct	thread_access_mode_of
	The trait allows to select an access mode by the lock type. More...
struct	thread_access_mode_of< boost::log::aux::exclusive_lock_guard< MutexT > >
struct	thread_access_mode_of< boost::log::aux::shared_lock_guard< MutexT > >
struct	thread_access_mode_of< lock_guard< MutexT > >
struct	thread_access_mode_of< no_lock< MutexT > >
struct	thread_access_mode_of< shared_lock< MutexT > >
struct	thread_access_mode_of< unique_lock< MutexT > >
struct	thread_access_mode_of< upgrade_lock< MutexT > >
class	thread_attributes
class	thread_exception
class	thread_guard
	Non-copyable RAII scoped thread guard joiner which join the thread if joinable when destroyed. More...
class	thread_permission_error
class	thread_resource_error
class	thread_specific_ptr
class	time_op_first_archetype
class	time_op_second_archetype
struct	time_stamper
class	timed_lockable_adapter
class	timed_mutex
class	timed_poly_lockable
struct	TimedLock
struct	TimedLockable
	TimedLockable object extends Lockable with timed lock functions: try_lock_until and try_lock_for and the exception based lock_until and lock_for. More...
class	timer
struct	to_log_fun
	The function object that outputs its second operand to the first one. More...
struct	to_log_fun< void >
	The function object that outputs its second operand to the first one. More...
class	to_log_manip
	Generic manipulator for customizing output to log. More...
class	token_iterator
class	token_iterator_generator
class	tokenizer
struct	topo_sort_visitor
struct	totally_ordered
struct	totally_ordered1
struct	totally_ordered2
struct	totally_ordered< T, T, B,::boost::detail::false_t >
struct	totally_ordered< T, U, B,::boost::detail::true_t >
struct	tr1_result_of
class	transform_value_property_map
struct	tree_collector
struct	tree_traits
struct	triangulation_visitor
struct	try_to_lock_t
class	tsp_tour_len_visitor
class	tsp_tour_visitor
struct	TSPVertexVisitorConcept
struct	two_bit_color_map
class	two_bit_color_map< local_property_map< ProcessGroup, GlobalMap, StorageMap > >
class	two_bit_color_map< parallel::distributed_property_map< ProcessGroup, GlobalMap, StorageMap > >
struct	type
class	type_dispatcher
	A type dispatcher interface. More...
class	type_info_wrapper
	A simple std::type_info wrapper that implements value semantic for type information objects. More...
class	type_with_alignment
struct	typed_identity_property_map
class	typed_in_place_factory_base
class	u16_to_u32_iterator
class	u32_to_u16_iterator
class	u32_to_u8_iterator
class	u32regex_iterator
class	u32regex_iterator_implementation
class	u32regex_token_iterator
class	u32regex_token_iterator_implementation
class	u8_to_u32_iterator
struct	u_property
struct	uint_t
struct	uint_value_t
class	unary_function_archetype
class	unary_negate
class	unary_predicate_archetype
struct	unary_traits
struct	unary_traits< R(*)(A)>
struct	underlying_type
	Meta-function to get the underlying type of a scoped enum. More...
struct	undirected_distributed_adj_list_tag
	Tag class for undirected, distributed adjacency list. More...
class	undirected_graph
	The undirected_graph class template is a simplified version of the BGL adjacency list. More...
struct	undirected_graph_error
struct	undirected_graph_tag
class	undirected_plod_iterator
struct	undirected_tag
struct	undirectedS
class	unexpected_call
	Exception class that is used to indicate invalid call sequence. More...
class	uniform_int
	The distribution function uniform_int models a . More...
class	uniform_real
	The distribution function uniform_real models a random distribution. More...
class	unique_future
class	unique_lock
class	unique_lock_ptr
	unique lock providing a pointer access to the synchronized value type. More...
class	unique_rmat_iterator
struct	UniqueLock
struct	unit_steppable
struct	unsafe_pair
struct	UnsignedInteger< unsigned char >
struct	UnsignedInteger< unsigned int >
struct	UnsignedInteger< unsigned long >
struct	UnsignedInteger< unsigned short >
class	unsupported_thread_option
class	unweighted_random_out_edge_gen
struct	unwrap_recursive< recursive_wrapper< T > >
struct	unwrap_reference
	Find the type in a reference_wrapper. More...
class	upgrade_lock
class	upgrade_lockable_adapter
class	upgrade_poly_lockable
class	upgrade_to_unique_lock
struct	UpgradeLock
struct	UpgradeLockable
	UpgradeLockable object extends SharedLockable with the lock_upgrade, lock_upgrade_until, unlock_upgrade_and_lock, unlock_and_lock_shared and unlock_upgrade_and_lock_shared functions. More...
class	user_scheduler
class	utf16_output_iterator
class	utf8_output_iterator
struct	v_property
singleton	value_extractor
	Generic attribute value extractor. More...
class	value_factory
class	value_initialized
singleton	value_ref
	Reference wrapper for a stored attribute value. More...
singleton	value_visitor_invoker
	Generic attribute value visitor invoker. More...
singleton	variant
class	variate_generator
	A random variate generator is used to join a random number generator together with a random number distribution. More...
struct	vecS
struct	vector_as_graph_traversal_tag
class	vector_property_map
class	vector_property_map< T, local_property_map< ProcessGroup, GlobalMap, StorageMap > >
	Distributed vector property map. More...
class	vector_property_map< T, parallel::distributed_property_map< ProcessGroup, GlobalMap, StorageMap > >
	Distributed vector property map. More...
struct	vertex_assignment_map_t
struct	vertex_bundle_type
struct	vertex_bundle_type< filtered_graph< Graph, EdgePredicate, VertexPredicate > >
struct	vertex_bundle_type< reverse_graph< Graph, GraphRef > >
struct	vertex_bundle_type< subgraph< Graph > >
struct	vertex_copy_t
struct	vertex_displacement_t
struct	vertex_invariant1_t
struct	vertex_invariant2_t
struct	vertex_invariant_t
struct	vertex_isomorphism_t
struct	vertex_list_graph_archetype
struct	vertex_list_graph_tag
struct	vertex_max_invariant_t
struct	vertex_property
struct	vertex_property_selector
struct	vertex_property_selector< graph_as_tree_tag >
struct	vertex_property_selector< labeled_graph_class_tag >
struct	vertex_property_selector< property_graph_archetype_tag >
struct	vertex_property_selector< subgraph_tag >
struct	vertex_property_tag
struct	vertex_property_type
struct	vertex_property_type< filtered_graph< Graph, EdgePredicate, VertexPredicate > >
struct	vertex_property_type< reverse_graph< BidirectionalGraph, GraphRef > >
struct	vertex_property_type< std::vector< EdgeList > >
struct	vertex_subset_complement_filter
struct	vertex_subset_compliment_filter
struct	vertex_subset_filter
struct	vertices_equivalent_t
struct	vf2_print_callback
struct	view_clone_allocator
class	visitation_result
	The class represents attribute value visitation result. More...
class	visitor_ptr_t
class	void_generator_archetype
class	void_ptr_indirect_fun
class	w32_regex_traits
struct	w_property
singleton	weak_ptr
class	weighted_random_out_edge_gen
struct	writable_property_map_archetype
struct	writable_property_map_tag
struct	WritablePropertyMapConcept
struct	WriteableBidirectionalRangeConcept
	Check if a type T models the WriteableBidirectionalRange range concept. More...
struct	WriteableForwardRangeConcept
	Check if a type T models the WriteableForwardRange range concept. More...
struct	WriteableRandomAccessRangeConcept
	Check if a type T models the WriteableRandomAccessRange range concept. More...
struct	WriteableRangeConcept
struct	x_property
struct	xorable
struct	xorable1
struct	xorable2
struct	xorable< T, T, B,::boost::detail::false_t >
struct	xorable< T, U, B,::boost::detail::true_t >
struct	y_property
struct	z_property

Typedefs
typedef noncopyable_::noncopyable	noncopyable
typedef crc_optimal< 16, 0x8005, 0, 0, true, true >	crc_16_type
typedef crc_optimal< 16, 0x1021, 0xFFFF, 0, false, false >	crc_ccitt_type
typedef crc_optimal< 16, 0x8408, 0, 0, true, true >	crc_xmodem_type
typedef crc_optimal< 32, 0x04C11DB7, 0xFFFFFFFF, 0xFFFFFFFF, true, true >	crc_32_type
typedef error_info< struct errinfo_api_function_, char const * >	errinfo_api_function
typedef error_info< struct errinfo_at_line_, int >	errinfo_at_line
typedef error_info< struct errinfo_errno_, int >	errinfo_errno
typedef error_info< struct errinfo_file_handle_, weak_ptr < FILE > >	errinfo_file_handle
typedef error_info< struct errinfo_file_name_, std::string >	errinfo_file_name
typedef error_info< struct errinfo_file_open_mode_, std::string >	errinfo_file_open_mode
typedef error_info< struct errinfo_nested_exception_, exception_ptr >	errinfo_nested_exception
typedef error_info< struct errinfo_type_info_name_, std::string >	errinfo_type_info_name
typedef error_info< struct throw_function_, char const * >	throw_function
typedef error_info< struct throw_file_, char const * >	throw_file
typedef error_info< struct throw_line_, int >	throw_line
typedef basic_format< char >	format
typedef basic_format< wchar_t >	wformat
typedef T	vtable_type
typedef void(dummy::*	safe_bool )()
typedef astar_visitor	default_astar_visitor
typedef bellman_visitor	default_bellman_visitor
typedef bfs_visitor	default_bfs_visitor
typedef core_numbers_visitor	default_core_numbers_visitor
typedef dfs_visitor	default_dfs_visitor
typedef dijkstra_visitor	default_dijkstra_visitor
typedef short	processor_id_type
	The type used to store an identifier that uniquely names a processor. More...
typedef boost::forward_traversal_tag	multi_pass_input_iterator_tag
typedef mas_visitor	default_mas_visitor
typedef bgl_named_params< char, detail::unused_tag_type >	no_named_parameters
typedef std::allocator< int >	default_r_c_shortest_paths_allocator
typedef Graph *	sgb_graph_ptr
typedef const Graph *	sgb_const_graph_ptr
typedef graph_traits< Graph > ::vertex_iterator	VertexIterator
typedef std::vector< Vertex > ::size_type	size_type
typedef GraphTraits::directed_category	directed_category
typedef GraphTraits::vertex_descriptor	vertex_descriptor
typedef GraphTraits::edge_descriptor	edge_descriptor
typedef GraphTraits::edges_size_type	edges_size_type
typedef GraphTraits::edge_iterator	edge_iterator
typedef Seq::value_type	seq_value_type
typedef Seq::size_type	seq_size_type
typedef Order::value_type	order_value_type
typedef Order::size_type	order_size_type
typedef bimaps::bimap < bimaps::set_of< int > , bimaps::set_of < order_value_type > >	bimap_type
typedef bimap_type::value_type	bimap_value
typedef boost::uintmax_t	static_min_max_unsigned_type
typedef boost::intmax_t	static_min_max_signed_type
typedef boost::uintmax_t	static_log2_argument_type
typedef int	static_log2_result_type
typedef aux::attribute_scope_guard const &	scoped_attribute
	Scoped attribute guard type. More...
typedef shared_ptr< core >	core_ptr
typedef error_info< struct type_info_info_tag, type_info_wrapper >	type_info_info
	Type info exception information. More...
typedef error_info< struct position_info_tag, unsigned int >	position_info
	Parse position exception information. More...
typedef error_info< struct current_scope_info_tag, attributes::named_scope_list >	current_scope_info
	Current scope exception information. More...
typedef boost::intrusive_ref_counter < aux::legacy_intrusive_ref_counter_root >	intrusive_ref_counter
typedef mpl::vector < posix_time::ptime, local_time::local_date_time >	boost_date_time_types
	An MPL-sequence of Boost date and time types of attributes. More...
typedef mpl::copy < boost_date_time_types, mpl::back_inserter < native_date_time_types > >::type	date_time_types
	An MPL-sequence with the complete list of the supported date and time types. More...
typedef native_date_time_types	native_date_types
	An MPL-sequence of natively supported date types of attributes. More...
typedef mpl::push_back < boost_date_time_types, gregorian::date >::type	boost_date_types
	An MPL-sequence of Boost date types of attributes. More...
typedef mpl::copy < boost_date_types, mpl::back_inserter < native_date_types >>::type	date_types
	An MPL-sequence with the complete list of the supported date types. More...
typedef native_date_time_types	native_time_types
	An MPL-sequence of natively supported time types. More...
typedef boost_date_time_types	boost_time_types
	An MPL-sequence of Boost time types. More...
typedef date_time_types	time_types
	An MPL-sequence with the complete list of the supported time types. More...
typedef mpl::vector< double >	native_time_duration_types
	An MPL-sequence of natively supported time duration types of attributes. More...
typedef mpl::vector < posix_time::time_duration, gregorian::date_duration >	boost_time_duration_types
	An MPL-sequence of Boost time duration types of attributes. More...
typedef mpl::copy < boost_time_duration_types, mpl::back_inserter < native_time_duration_types > >::type	time_duration_types
	An MPL-sequence with the complete list of the supported time duration types. More...
typedef mpl::vector < posix_time::time_period, local_time::local_time_period, gregorian::date_period >	boost_time_period_types
	An MPL-sequence of Boost time duration types of attributes. More...
typedef boost_time_period_types	time_period_types
	An MPL-sequence with the complete list of the supported time period types. More...
typedef mpl::vector< float, double, long double >	floating_point_types
	An MPL-sequence of FP types of attributes, supported by default. More...
typedef mpl::copy < floating_point_types, mpl::back_inserter < integral_types >>::type	numeric_types
	An MPL-sequence of all numeric types of attributes, supported by default. More...
typedef mpl::vector<>	string_types
	An MPL-sequence of string types of attributes, supported by default. More...
typedef mpl::copy < string_types, mpl::back_inserter < numeric_types >>::type	default_attribute_types
	An MPL-sequence of all attribute value types that are supported by the library by default. More...
typedef int detail::none_helper::*	none_t
typedef mpl::if_c<(sizeof(int)==sizeof(void *)), int, mpl::if_c<(sizeof(long)==sizeof(void *)), long, mpl::if_c<(sizeof(void *) <=sizeof(boost::intmax_t)), boost::intmax_t, void >::type > ::type >::type	ptr_serialize_type
typedef typed_identity_property_map < std::size_t >	identity_property_map
typedef ratio < BOOST_RATIO_INTMAX_C(1), BOOST_RATIO_INTMAX_C(1000000000000000000)>	atto
typedef ratio < BOOST_RATIO_INTMAX_C(1), BOOST_RATIO_INTMAX_C(1000000000000000)>	femto
typedef ratio < BOOST_RATIO_INTMAX_C(1), BOOST_RATIO_INTMAX_C(1000000000000)>	pico
typedef ratio < BOOST_RATIO_INTMAX_C(1), BOOST_RATIO_INTMAX_C(1000000000)>	nano
typedef ratio < BOOST_RATIO_INTMAX_C(1), BOOST_RATIO_INTMAX_C(1000000)>	micro
typedef ratio < BOOST_RATIO_INTMAX_C(1), BOOST_RATIO_INTMAX_C(1000)>	milli
typedef ratio < BOOST_RATIO_INTMAX_C(1), BOOST_RATIO_INTMAX_C(100)>	centi
typedef ratio < BOOST_RATIO_INTMAX_C(1), BOOST_RATIO_INTMAX_C(10)>	deci
typedef ratio < BOOST_RATIO_INTMAX_C(10), BOOST_RATIO_INTMAX_C(1)>	deca
typedef ratio < BOOST_RATIO_INTMAX_C(100), BOOST_RATIO_INTMAX_C(1)>	hecto
typedef ratio < BOOST_RATIO_INTMAX_C(1000), BOOST_RATIO_INTMAX_C(1)>	kilo
typedef ratio < BOOST_RATIO_INTMAX_C(1000000), BOOST_RATIO_INTMAX_C(1)>	mega
typedef ratio < BOOST_RATIO_INTMAX_C(1000000000), BOOST_RATIO_INTMAX_C(1)>	giga
typedef ratio < BOOST_RATIO_INTMAX_C(1000000000000), BOOST_RATIO_INTMAX_C(1)>	tera
typedef ratio < BOOST_RATIO_INTMAX_C(1000000000000000), BOOST_RATIO_INTMAX_C(1)>	peta
typedef ratio < BOOST_RATIO_INTMAX_C(1000000000000000000), BOOST_RATIO_INTMAX_C(1)>	exa
typedef std::bitset< 512 >	bitmask_archetype
typedef basic_regex< ::UChar32, icu_regex_traits >	u32regex
typedef match_results< const ::UChar32 * >	u32match
typedef match_results< const ::UChar * >	u16match
typedef basic_regex< TCHAR >	tregex
typedef match_results< TCHAR const * >	tmatch
typedef regex_iterator< TCHAR const * >	tregex_iterator
typedef regex_token_iterator < TCHAR const * >	tregex_token_iterator
typedef regex_error	bad_pattern
typedef regex_error	bad_expression
typedef basic_regex< char, regex_traits< char > >	regex
typedef basic_regex< wchar_t, regex_traits< wchar_t > >	wregex
typedef regex_iterator< const char * >	cregex_iterator
typedef regex_iterator < std::string::const_iterator >	sregex_iterator
typedef regex_iterator< const wchar_t * >	wcregex_iterator
typedef regex_iterator < std::wstring::const_iterator >	wsregex_iterator
typedef regex_token_iterator < const char * >	cregex_token_iterator
typedef regex_token_iterator < std::string::const_iterator >	sregex_token_iterator
typedef regex_token_iterator < const wchar_t * >	wcregex_token_iterator
typedef regex_token_iterator < std::wstring::const_iterator >	wsregex_token_iterator
typedef sub_match< const char * >	csub_match
typedef sub_match < std::string::const_iterator >	ssub_match
typedef sub_match< const wchar_t * >	wcsub_match
typedef sub_match < std::wstring::const_iterator >	wssub_match
typedef u32regex_iterator < const char * >	utf8regex_iterator
typedef u32regex_iterator < const UChar * >	utf16regex_iterator
typedef u32regex_iterator < const UChar32 * >	utf32regex_iterator
typedef u32regex_token_iterator< const char * >	utf8regex_token_iterator
typedef u32regex_token_iterator< const UChar * >	utf16regex_token_iterator
typedef u32regex_token_iterator< const UChar32 * >	utf32regex_token_iterator
typedef basic_nullbuf< char >	nullbuf
typedef basic_nullbuf< wchar_t >	wnullbuf
typedef basic_onullstream< char >	onullstream
typedef basic_onullstream < wchar_t >	wonullstream
typedef basic_wrap_stringstream< char >	wrap_stringstream
typedef basic_wrap_stringstream < wchar_t >	wrap_wstringstream
typedef mutex	try_mutex
typedef recursive_mutex	recursive_try_mutex
typedef shared_mutex	upgrade_mutex
typedef boost::posix_time::ptime	system_time
typedef thread_v2::upgrade_mutex	shared_mutex
typedef integral_constant < bool, true >	true_type
typedef integral_constant < bool, false >	false_type
typedef basic_string_ref< char, std::char_traits< char > >	string_ref
typedef basic_string_ref < wchar_t, std::char_traits < wchar_t > >	wstring_ref
typedef basic_string_ref < char16_t, std::char_traits < char16_t > >	u16string_ref
typedef basic_string_ref < char32_t, std::char_traits < char32_t > >	u32string_ref

Enumerations
enum	factory_alloc_propagation {   factory_alloc_for_pointee_and_deleter,   factory_passes_alloc_to_smart_pointer }
enum	GraphParserState {   PARSE_NUM_NODES,   PARSE_VERTEX,   PARSE_EDGE }
enum	edges_are_sorted_t { edges_are_sorted }
enum	edges_are_sorted_global_t { edges_are_sorted_global }
enum	edges_are_unsorted_t { edges_are_unsorted }
enum	edges_are_unsorted_multi_pass_t { edges_are_unsorted_multi_pass }
enum	edges_are_unsorted_multi_pass_global_t { edges_are_unsorted_multi_pass_global }
enum	construct_inplace_from_sources_and_targets_t { construct_inplace_from_sources_and_targets }
enum	construct_inplace_from_sources_and_targets_global_t { construct_inplace_from_sources_and_targets_global }
enum	edges_are_unsorted_global_t { edges_are_unsorted_global }
enum	edge_target_processor_id_t { edge_target_processor_id }
enum	edge_locally_owned_t { edge_locally_owned }
enum	vertex_in_edges_t { vertex_in_edges }
enum	distributed_construct_inplace_from_sources_and_targets_t { distributed_construct_inplace_from_sources_and_targets }
enum	edge_attribute_t { edge_attribute = 1111 }
enum	vertex_attribute_t { vertex_attribute = 2222 }
enum	graph_graph_attribute_t { graph_graph_attribute = 3333 }
enum	graph_vertex_attribute_t { graph_vertex_attribute = 4444 }
enum	graph_edge_attribute_t { graph_edge_attribute = 5555 }
enum	one_bit_color_type {   one_bit_white = 0,   one_bit_not_white = 1 }
enum	default_color_type {   white_color,   gray_color,   green_color,   red_color,   black_color }
enum	vertex_index_t { vertex_index }
enum	vertex_index1_t { vertex_index1 }
enum	vertex_index2_t { vertex_index2 }
enum	vertex_root_t { vertex_root }
enum	edge_index_t { edge_index }
enum	edge_name_t { edge_name }
enum	edge_weight_t { edge_weight }
enum	edge_weight2_t { edge_weight2 }
enum	edge_color_t { edge_color }
enum	vertex_name_t { vertex_name }
enum	graph_name_t { graph_name }
enum	vertex_distance_t { vertex_distance }
enum	vertex_distance2_t { vertex_distance2 }
enum	vertex_color_t { vertex_color }
enum	vertex_degree_t { vertex_degree }
enum	vertex_in_degree_t { vertex_in_degree }
enum	vertex_out_degree_t { vertex_out_degree }
enum	vertex_current_degree_t { vertex_current_degree }
enum	vertex_priority_t { vertex_priority }
enum	vertex_discover_time_t { vertex_discover_time }
enum	vertex_finish_time_t { vertex_finish_time }
enum	vertex_predecessor_t { vertex_predecessor }
enum	vertex_rank_t { vertex_rank }
enum	vertex_centrality_t { vertex_centrality }
enum	vertex_lowpoint_t { vertex_lowpoint }
enum	vertex_potential_t { vertex_potential }
enum	vertex_update_t { vertex_update }
enum	vertex_underlying_t { vertex_underlying }
enum	edge_reverse_t { edge_reverse }
enum	edge_capacity_t { edge_capacity }
enum	edge_flow_t { edge_flow }
enum	edge_residual_capacity_t { edge_residual_capacity }
enum	edge_centrality_t { edge_centrality }
enum	edge_discover_time_t { edge_discover_time }
enum	edge_update_t { edge_update }
enum	edge_finished_t { edge_finished }
enum	edge_underlying_t { edge_underlying }
enum	graph_visitor_t { graph_visitor }
enum	vertex_global_t { vertex_global }
enum	vertex_owner_t { vertex_owner }
enum	vertex_local_t { vertex_local }
enum	edge_global_t { edge_global }
enum	edge_owner_t { edge_owner }
enum	edge_local_t { edge_local }
enum	vertex_local_index_t { vertex_local_index }
enum	edge_local_index_t { edge_local_index }
enum	two_bit_color_type {   two_bit_white = 0,   two_bit_gray = 1,   two_bit_green = 2,   two_bit_black = 3 }
enum	lock_access_mode {   unlocked_access,   shared_access,   exclusive_access }
	Access modes for different types of locks. More...
enum	memory_order {   memory_order_relaxed = 0,   memory_order_consume = 1,   memory_order_acquire = 2,   memory_order_release = 4,   memory_order_acq_rel = 6,   memory_order_seq_cst = 14 }
enum	vertex_all_t { vertex_all }
enum	edge_all_t { edge_all }
enum	graph_all_t { graph_all }
enum	vertex_bundle_t { vertex_bundle }
enum	edge_bundle_t { edge_bundle }
enum	graph_bundle_t { graph_bundle }
enum	empty_token_policy {   drop_empty_tokens,   keep_empty_tokens }

Functions
template<typename T >
tuple< T const &, T const & >	minmax (T const &a, T const &b)
template<typename T , class BinaryPredicate >
tuple< T const &, T const & >	minmax (T const &a, T const &b, BinaryPredicate comp)
template<typename ForwardIter >
std::pair< ForwardIter, ForwardIter >	minmax_element (ForwardIter first, ForwardIter last)
template<typename ForwardIter , class BinaryPredicate >
std::pair< ForwardIter, ForwardIter >	minmax_element (ForwardIter first, ForwardIter last, BinaryPredicate comp)
template<typename ForwardIter >
ForwardIter	first_min_element (ForwardIter first, ForwardIter last)
template<typename ForwardIter , class BinaryPredicate >
ForwardIter	first_min_element (ForwardIter first, ForwardIter last, BinaryPredicate comp)
template<typename ForwardIter >
ForwardIter	last_min_element (ForwardIter first, ForwardIter last)
template<typename ForwardIter , class BinaryPredicate >
ForwardIter	last_min_element (ForwardIter first, ForwardIter last, BinaryPredicate comp)
template<typename ForwardIter >
ForwardIter	first_max_element (ForwardIter first, ForwardIter last)
template<typename ForwardIter , class BinaryPredicate >
ForwardIter	first_max_element (ForwardIter first, ForwardIter last, BinaryPredicate comp)
template<typename ForwardIter >
ForwardIter	last_max_element (ForwardIter first, ForwardIter last)
template<typename ForwardIter , class BinaryPredicate >
ForwardIter	last_max_element (ForwardIter first, ForwardIter last, BinaryPredicate comp)
template<typename ForwardIter >
std::pair< ForwardIter, ForwardIter >	first_min_first_max_element (ForwardIter first, ForwardIter last)
template<typename ForwardIter , class BinaryPredicate >
std::pair< ForwardIter, ForwardIter >	first_min_first_max_element (ForwardIter first, ForwardIter last, BinaryPredicate comp)
template<typename ForwardIter >
std::pair< ForwardIter, ForwardIter >	first_min_last_max_element (ForwardIter first, ForwardIter last)
template<typename ForwardIter , class BinaryPredicate >
std::pair< ForwardIter, ForwardIter >	first_min_last_max_element (ForwardIter first, ForwardIter last, BinaryPredicate comp)
template<typename ForwardIter >
std::pair< ForwardIter, ForwardIter >	last_min_first_max_element (ForwardIter first, ForwardIter last)
template<typename ForwardIter , class BinaryPredicate >
std::pair< ForwardIter, ForwardIter >	last_min_first_max_element (ForwardIter first, ForwardIter last, BinaryPredicate comp)
template<typename ForwardIter >
std::pair< ForwardIter, ForwardIter >	last_min_last_max_element (ForwardIter first, ForwardIter last)
template<typename ForwardIter , class BinaryPredicate >
std::pair< ForwardIter, ForwardIter >	last_min_last_max_element (ForwardIter first, ForwardIter last, BinaryPredicate comp)
template<std::size_t size_, std::size_t alignment_>
struct is_pod < ::boost::detail::aligned_storage::aligned_storage_imp < size_, alignment_ > >	BOOST_TT_AUX_BOOL_C_BASE (true)
void	swap (any &lhs, any &rhs) BOOST_NOEXCEPT
template<typename ValueType >
ValueType *	any_cast (any *operand) BOOST_NOEXCEPT
template<typename ValueType >
const ValueType *	any_cast (const any *operand) BOOST_NOEXCEPT
template<typename ValueType >
ValueType	any_cast (any &operand)
template<typename ValueType >
ValueType	any_cast (const any &operand)
template<typename ValueType >
ValueType	any_cast (any &&operand)
template<typename ValueType >
ValueType *	unsafe_any_cast (any *operand) BOOST_NOEXCEPT
template<typename ValueType >
const ValueType *	unsafe_any_cast (const any *operand) BOOST_NOEXCEPT
template<class T , std::size_t N>
bool	operator== (const array< T, N > &x, const array< T, N > &y)
template<class T , std::size_t N>
bool	operator< (const array< T, N > &x, const array< T, N > &y)
template<class T , std::size_t N>
bool	operator!= (const array< T, N > &x, const array< T, N > &y)
template<class T , std::size_t N>
bool	operator> (const array< T, N > &x, const array< T, N > &y)
template<class T , std::size_t N>
bool	operator<= (const array< T, N > &x, const array< T, N > &y)
template<class T , std::size_t N>
bool	operator>= (const array< T, N > &x, const array< T, N > &y)
template<class T , std::size_t N>
void	swap (array< T, N > &x, array< T, N > &y)
template<typename T , std::size_t N>
T(&	get_c_array (boost::array< T, N > &arg))[N]
template<typename T , std::size_t N>
const T(&	get_c_array (const boost::array< T, N > &arg))[N]
template<class T , std::size_t N>
std::size_t	hash_value (const array< T, N > &arr)
template<class Tag , class Bimap >
const BOOST_DEDUCED_TYPENAME::boost::bimaps::support::data_type_by < Tag, Bimap >::type &	get (const ::boost::bimaps::views::map_view< Tag, Bimap > &m, const BOOST_DEDUCED_TYPENAME::boost::bimaps::support::key_type_by< Tag, Bimap >::type &key)
template<class Tag , class Bimap >
const BOOST_DEDUCED_TYPENAME::boost::bimaps::support::data_type_by < Tag, Bimap >::type &	get (const ::boost::bimaps::views::unordered_map_view< Tag, Bimap > &m, const BOOST_DEDUCED_TYPENAME::boost::bimaps::support::key_type_by< Tag, Bimap >::type &key)
template<int I>
bool	operator== (arg< I > const &, arg< I > const &)
template<class R , class F >
_bi::bind_t< R, F, _bi::list0 >	bind (F f)
template<class R , class F , class A1 >
_bi::bind_t< R, F, typename _bi::list_av_1< A1 >::type >	bind (F f, A1 a1)
template<class R , class F , class A1 , class A2 >
_bi::bind_t< R, F, typename _bi::list_av_2< A1, A2 >::type >	bind (F f, A1 a1, A2 a2)
template<class R , class F , class A1 , class A2 , class A3 >
_bi::bind_t< R, F, typename _bi::list_av_3< A1, A2, A3 > ::type >	bind (F f, A1 a1, A2 a2, A3 a3)
template<class R , class F , class A1 , class A2 , class A3 , class A4 >
_bi::bind_t< R, F, typename _bi::list_av_4< A1, A2, A3, A4 > ::type >	bind (F f, A1 a1, A2 a2, A3 a3, A4 a4)
template<class R , class F , class A1 , class A2 , class A3 , class A4 , class A5 >
_bi::bind_t< R, F, typename _bi::list_av_5< A1, A2, A3, A4, A5 >::type >	bind (F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5)
template<class R , class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 >
_bi::bind_t< R, F, typename _bi::list_av_6< A1, A2, A3, A4, A5, A6 >::type >	bind (F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6)
template<class R , class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 , class A7 >
_bi::bind_t< R, F, typename _bi::list_av_7< A1, A2, A3, A4, A5, A6, A7 >::type >	bind (F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7)
template<class R , class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 , class A7 , class A8 >
_bi::bind_t< R, F, typename _bi::list_av_8< A1, A2, A3, A4, A5, A6, A7, A8 >::type >	bind (F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8)
template<class R , class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 , class A7 , class A8 , class A9 >
_bi::bind_t< R, F, typename _bi::list_av_9< A1, A2, A3, A4, A5, A6, A7, A8, A9 >::type >	bind (F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9)
template<class R , class F >
_bi::bind_t< R, F, _bi::list0 >	bind (boost::type< R >, F f)
template<class R , class F , class A1 >
_bi::bind_t< R, F, typename _bi::list_av_1< A1 >::type >	bind (boost::type< R >, F f, A1 a1)
template<class R , class F , class A1 , class A2 >
_bi::bind_t< R, F, typename _bi::list_av_2< A1, A2 >::type >	bind (boost::type< R >, F f, A1 a1, A2 a2)
template<class R , class F , class A1 , class A2 , class A3 >
_bi::bind_t< R, F, typename _bi::list_av_3< A1, A2, A3 > ::type >	bind (boost::type< R >, F f, A1 a1, A2 a2, A3 a3)
template<class R , class F , class A1 , class A2 , class A3 , class A4 >
_bi::bind_t< R, F, typename _bi::list_av_4< A1, A2, A3, A4 > ::type >	bind (boost::type< R >, F f, A1 a1, A2 a2, A3 a3, A4 a4)
template<class R , class F , class A1 , class A2 , class A3 , class A4 , class A5 >
_bi::bind_t< R, F, typename _bi::list_av_5< A1, A2, A3, A4, A5 >::type >	bind (boost::type< R >, F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5)
template<class R , class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 >
_bi::bind_t< R, F, typename _bi::list_av_6< A1, A2, A3, A4, A5, A6 >::type >	bind (boost::type< R >, F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6)
template<class R , class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 , class A7 >
_bi::bind_t< R, F, typename _bi::list_av_7< A1, A2, A3, A4, A5, A6, A7 >::type >	bind (boost::type< R >, F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7)
template<class R , class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 , class A7 , class A8 >
_bi::bind_t< R, F, typename _bi::list_av_8< A1, A2, A3, A4, A5, A6, A7, A8 >::type >	bind (boost::type< R >, F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8)
template<class R , class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 , class A7 , class A8 , class A9 >
_bi::bind_t< R, F, typename _bi::list_av_9< A1, A2, A3, A4, A5, A6, A7, A8, A9 >::type >	bind (boost::type< R >, F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9)
template<class F >
_bi::bind_t< _bi::unspecified, F, _bi::list0 >	bind (F f)
template<class F , class A1 >
_bi::bind_t< _bi::unspecified, F, typename _bi::list_av_1< A1 > ::type >	bind (F f, A1 a1)
template<class F , class A1 , class A2 >
_bi::bind_t< _bi::unspecified, F, typename _bi::list_av_2< A1, A2 >::type >	bind (F f, A1 a1, A2 a2)
template<class F , class A1 , class A2 , class A3 >
_bi::bind_t< _bi::unspecified, F, typename _bi::list_av_3< A1, A2, A3 >::type >	bind (F f, A1 a1, A2 a2, A3 a3)
template<class F , class A1 , class A2 , class A3 , class A4 >
_bi::bind_t< _bi::unspecified, F, typename _bi::list_av_4< A1, A2, A3, A4 >::type >	bind (F f, A1 a1, A2 a2, A3 a3, A4 a4)
template<class F , class A1 , class A2 , class A3 , class A4 , class A5 >
_bi::bind_t< _bi::unspecified, F, typename _bi::list_av_5< A1, A2, A3, A4, A5 >::type >	bind (F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5)
template<class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 >
_bi::bind_t< _bi::unspecified, F, typename _bi::list_av_6< A1, A2, A3, A4, A5, A6 >::type >	bind (F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6)
template<class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 , class A7 >
_bi::bind_t< _bi::unspecified, F, typename _bi::list_av_7< A1, A2, A3, A4, A5, A6, A7 >::type >	bind (F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7)
template<class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 , class A7 , class A8 >
_bi::bind_t< _bi::unspecified, F, typename _bi::list_av_8< A1, A2, A3, A4, A5, A6, A7, A8 > ::type >	bind (F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8)
template<class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 , class A7 , class A8 , class A9 >
_bi::bind_t< _bi::unspecified, F, typename _bi::list_av_9< A1, A2, A3, A4, A5, A6, A7, A8, A9 > ::type >	bind (F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9)
template<class A1 , class M , class T >
_bi::bind_t< typename _bi::dm_result< M T::*, A1 > ::type, _mfi::dm< M, T > , typename _bi::list_av_1< A1 > ::type >	bind (M T::*f, A1 a1)
template<class R , class F >
_bi::af0< R, F >	make_adaptable (F f)
template<class R , class A1 , class F >
_bi::af1< R, A1, F >	make_adaptable (F f)
template<class R , class A1 , class A2 , class F >
_bi::af2< R, A1, A2, F >	make_adaptable (F f)
template<class R , class A1 , class A2 , class A3 , class F >
_bi::af3< R, A1, A2, A3, F >	make_adaptable (F f)
template<class R , class A1 , class A2 , class A3 , class A4 , class F >
_bi::af4< R, A1, A2, A3, A4, F >	make_adaptable (F f)
template<class R , class T >
_mfi::dm< R, T >	mem_fn (R T::*f)
template<class F >
_bi::protected_bind_t< F >	protect (F f)
bool	operator== (const blank &, const blank &)
bool	operator<= (const blank &, const blank &)
bool	operator>= (const blank &, const blank &)
bool	operator!= (const blank &, const blank &)
bool	operator< (const blank &, const blank &)
bool	operator> (const blank &, const blank &)
	BOOST_TEMPLATED_STREAM (ostream, E, T)&operator<<(BOOST_TEMPLATED_STREAM(ostream
template<class T , class Alloc >
bool	operator== (const circular_buffer< T, Alloc > &lhs, const circular_buffer< T, Alloc > &rhs)
	Compare two circular_buffers element-by-element to determine if they are equal. More...
template<class T , class Alloc >
bool	operator< (const circular_buffer< T, Alloc > &lhs, const circular_buffer< T, Alloc > &rhs)
	Compare two circular_buffers element-by-element to determine if the left one is lesser than the right one. More...
template<class T , class Alloc >
bool	operator!= (const circular_buffer< T, Alloc > &lhs, const circular_buffer< T, Alloc > &rhs)
	Compare two circular_buffers element-by-element to determine if they are non-equal. More...
template<class T , class Alloc >
bool	operator> (const circular_buffer< T, Alloc > &lhs, const circular_buffer< T, Alloc > &rhs)
	Compare two circular_buffers element-by-element to determine if the left one is greater than the right one. More...
template<class T , class Alloc >
bool	operator<= (const circular_buffer< T, Alloc > &lhs, const circular_buffer< T, Alloc > &rhs)
	Compare two circular_buffers element-by-element to determine if the left one is lesser or equal to the right one. More...
template<class T , class Alloc >
bool	operator>= (const circular_buffer< T, Alloc > &lhs, const circular_buffer< T, Alloc > &rhs)
	Compare two circular_buffers element-by-element to determine if the left one is greater or equal to the right one. More...
template<class T , class Alloc >
void	swap (circular_buffer< T, Alloc > &lhs, circular_buffer< T, Alloc > &rhs) BOOST_NOEXCEPT
	Swap the contents of two circular_buffers. More...
template<class T , class Alloc >
bool	operator== (const circular_buffer_space_optimized< T, Alloc > &lhs, const circular_buffer_space_optimized< T, Alloc > &rhs)
	Test two space optimized circular buffers for equality. More...
template<class T , class Alloc >
bool	operator< (const circular_buffer_space_optimized< T, Alloc > &lhs, const circular_buffer_space_optimized< T, Alloc > &rhs)
	Lexicographical comparison. More...
template<class T , class Alloc >
bool	operator!= (const circular_buffer_space_optimized< T, Alloc > &lhs, const circular_buffer_space_optimized< T, Alloc > &rhs)
	Test two space optimized circular buffers for non-equality. More...
template<class T , class Alloc >
bool	operator> (const circular_buffer_space_optimized< T, Alloc > &lhs, const circular_buffer_space_optimized< T, Alloc > &rhs)
	Lexicographical comparison. More...
template<class T , class Alloc >
bool	operator<= (const circular_buffer_space_optimized< T, Alloc > &lhs, const circular_buffer_space_optimized< T, Alloc > &rhs)
	Lexicographical comparison. More...
template<class T , class Alloc >
bool	operator>= (const circular_buffer_space_optimized< T, Alloc > &lhs, const circular_buffer_space_optimized< T, Alloc > &rhs)
	Lexicographical comparison. More...
template<class T , class Alloc >
void	swap (circular_buffer_space_optimized< T, Alloc > &lhs, circular_buffer_space_optimized< T, Alloc > &rhs) BOOST_NOEXCEPT
	Swap the contents of two space optimized circular buffers. More...
template<class Base >
boolean_archetype	operator== (const equality_comparable_archetype< Base > &, const equality_comparable_archetype< Base > &)
template<class Base >
boolean_archetype	operator!= (const equality_comparable_archetype< Base > &, const equality_comparable_archetype< Base > &)
template<class Base1 , class Base2 >
boolean_archetype	operator== (const equality_comparable2_first_archetype< Base1 > &, const equality_comparable2_second_archetype< Base2 > &)
template<class Base1 , class Base2 >
boolean_archetype	operator!= (const equality_comparable2_first_archetype< Base1 > &, const equality_comparable2_second_archetype< Base2 > &)
template<class Base >
boolean_archetype	operator< (const less_than_comparable_archetype< Base > &, const less_than_comparable_archetype< Base > &)
template<class Base >
boolean_archetype	operator< (const comparable_archetype< Base > &, const comparable_archetype< Base > &)
template<class Base >
boolean_archetype	operator<= (const comparable_archetype< Base > &, const comparable_archetype< Base > &)
template<class Base >
boolean_archetype	operator> (const comparable_archetype< Base > &, const comparable_archetype< Base > &)
template<class Base >
boolean_archetype	operator>= (const comparable_archetype< Base > &, const comparable_archetype< Base > &)
template<class BaseFirst , class BaseSecond , class Tag >
boolean_archetype	operator== (const equal_op_first_archetype< BaseFirst, Tag > &, const equal_op_second_archetype< BaseSecond, Tag > &)
template<class BaseFirst , class BaseSecond , class Tag >
boolean_archetype	operator!= (const not_equal_op_first_archetype< BaseFirst, Tag > &, const not_equal_op_second_archetype< BaseSecond, Tag > &)
template<class BaseFirst , class BaseSecond , class Tag >
boolean_archetype	operator< (const less_than_op_first_archetype< BaseFirst, Tag > &, const less_than_op_second_archetype< BaseSecond, Tag > &)
template<class BaseFirst , class BaseSecond , class Tag >
boolean_archetype	operator<= (const less_equal_op_first_archetype< BaseFirst, Tag > &, const less_equal_op_second_archetype< BaseSecond, Tag > &)
template<class BaseFirst , class BaseSecond , class Tag >
boolean_archetype	operator> (const greater_than_op_first_archetype< BaseFirst, Tag > &, const greater_than_op_second_archetype< BaseSecond, Tag > &)
template<class BaseFirst , class BaseSecond , class Tag >
boolean_archetype	operator>= (const greater_equal_op_first_archetype< BaseFirst, Tag > &, const greater_equal_op_second_archetype< BaseSecond, Tag > &)
template<class Base >
addable_archetype< Base >	operator+ (const addable_archetype< Base > &, const addable_archetype< Base > &)
template<class Base >
subtractable_archetype< Base >	operator- (const subtractable_archetype< Base > &, const subtractable_archetype< Base > &)
template<class Base >
multipliable_archetype< Base >	operator* (const multipliable_archetype< Base > &, const multipliable_archetype< Base > &)
template<class Base >
dividable_archetype< Base >	operator/ (const dividable_archetype< Base > &, const dividable_archetype< Base > &)
template<class Base >
modable_archetype< Base >	operator% (const modable_archetype< Base > &, const modable_archetype< Base > &)
template<class Return , class BaseFirst , class BaseSecond >
Return	operator+ (const plus_op_first_archetype< Return, BaseFirst > &, const plus_op_second_archetype< Return, BaseSecond > &)
template<class Return , class BaseFirst , class BaseSecond >
Return	operator* (const time_op_first_archetype< Return, BaseFirst > &, const time_op_second_archetype< Return, BaseSecond > &)
template<class Return , class BaseFirst , class BaseSecond >
Return	operator/ (const divide_op_first_archetype< Return, BaseFirst > &, const divide_op_second_archetype< Return, BaseSecond > &)
template<class Return , class BaseFirst , class BaseSecond >
Return	operator- (const subtract_op_first_archetype< Return, BaseFirst > &, const subtract_op_second_archetype< Return, BaseSecond > &)
template<class Return , class BaseFirst , class BaseSecond >
Return	operator% (const mod_op_first_archetype< Return, BaseFirst > &, const mod_op_second_archetype< Return, BaseSecond > &)
template<class T >
random_access_iterator_archetype < T >	operator+ (typename random_access_iterator_archetype< T >::difference_type, const random_access_iterator_archetype< T > &x)
template<class T >
mutable_random_access_iterator_archetype < T >	operator+ (typename mutable_random_access_iterator_archetype< T >::difference_type, const mutable_random_access_iterator_archetype< T > &x)
template<class Model >
void	concept_check_failed ()
template<class Model >
concept_check< Model >	concept_check_ (void(*)(Model))
template<class Model >
void	function_requires (Model *=0)
template<class T >
void	ignore_unused_variable_warning (T const &)
	BOOST_concept (Integer,(T))
	BOOST_concept (SignedInteger,(T))
	BOOST_concept (UnsignedInteger,(T))
	BOOST_concept (DefaultConstructible,(TT))
	BOOST_concept (Assignable,(TT))
	BOOST_concept (CopyConstructible,(TT))
	BOOST_concept (SGIAssignable,(TT))
	BOOST_concept (Convertible,(X)(Y))
template<class TT >
void	require_boolean_expr (const TT &t)
	BOOST_concept (EqualityComparable,(TT))
	BOOST_concept (LessThanComparable,(TT))
	BOOST_concept (Comparable,(TT))
	BOOST_concept (EqualOp,(First)(Second))
	BOOST_concept (NotEqualOp,(First)(Second))
	BOOST_concept (LessThanOp,(First)(Second))
	BOOST_concept (LessEqualOp,(First)(Second))
	BOOST_concept (GreaterThanOp,(First)(Second))
	BOOST_concept (GreaterEqualOp,(First)(Second))
	BOOST_concept (PlusOp,(Ret)(First)(Second))
	BOOST_concept (TimesOp,(Ret)(First)(Second))
	BOOST_concept (DivideOp,(Ret)(First)(Second))
	BOOST_concept (SubtractOp,(Ret)(First)(Second))
	BOOST_concept (ModOp,(Ret)(First)(Second))
	BOOST_concept (Generator,(Func)(Return))
	BOOST_concept (UnaryFunction,(Func)(Return)(Arg))
	BOOST_concept (BinaryFunction,(Func)(Return)(First)(Second))
	BOOST_concept (UnaryPredicate,(Func)(Arg))
	BOOST_concept (BinaryPredicate,(Func)(First)(Second))
	BOOST_concept (Const_BinaryPredicate,(Func)(First)(Second))
	BOOST_concept (AdaptableGenerator,(Func)(Return))
	BOOST_concept (AdaptableUnaryFunction,(Func)(Return)(Arg))
	BOOST_concept (AdaptableBinaryFunction,(Func)(Return)(First)(Second))
	BOOST_concept (AdaptablePredicate,(Func)(Arg))
	BOOST_concept (AdaptableBinaryPredicate,(Func)(First)(Second))
	BOOST_concept (InputIterator,(TT))
	BOOST_concept (OutputIterator,(TT)(ValueT))
	BOOST_concept (ForwardIterator,(TT))
	BOOST_concept (Mutable_ForwardIterator,(TT))
	BOOST_concept (BidirectionalIterator,(TT))
	BOOST_concept (Mutable_BidirectionalIterator,(TT))
	BOOST_concept (RandomAccessIterator,(TT))
	BOOST_concept (Mutable_RandomAccessIterator,(TT))
	BOOST_concept (Container,(C))
	BOOST_concept (Mutable_Container,(C))
	BOOST_concept (ForwardContainer,(C))
	BOOST_concept (Mutable_ForwardContainer,(C))
	BOOST_concept (ReversibleContainer,(C))
	BOOST_concept (Mutable_ReversibleContainer,(C))
	BOOST_concept (RandomAccessContainer,(C))
	BOOST_concept (Mutable_RandomAccessContainer,(C))
	BOOST_concept (Sequence,(S))
	BOOST_concept (FrontInsertionSequence,(S))
	BOOST_concept (BackInsertionSequence,(S))
	BOOST_concept (AssociativeContainer,(C))
	BOOST_concept (UniqueAssociativeContainer,(C))
	BOOST_concept (MultipleAssociativeContainer,(C))
	BOOST_concept (SimpleAssociativeContainer,(C))
	BOOST_concept (PairAssociativeContainer,(C))
	BOOST_concept (SortedAssociativeContainer,(C))
	BOOST_concept (Collection,(C))
template<class T >
BOOST_FORCEINLINE T *	addressof (T &v)
template<class T >
void	checked_delete (T *x)
template<class T >
void	checked_array_delete (T *x)
template<typename... Ts>
void	ignore_unused (Ts const &...)
template<typename... Ts>
void	ignore_unused ()
int	report_errors ()
template<class T >
BOOST_FORCEINLINE reference_wrapper< T > BOOST_REF_CONST	ref (T &t)
template<class T >
BOOST_FORCEINLINE reference_wrapper< T const > BOOST_REF_CONST	cref (T const &t)
template<class T >
void	ref (T const &&) BOOST_REF_DELETE
template<class T >
void	cref (T const &&) BOOST_REF_DELETE
template<class T >
BOOST_FORCEINLINE unwrap_reference< T >::type &	unwrap_ref (T &t)
template<typename UnderlyingType , typename EnumType >
UnderlyingType	underlying_cast (EnumType v)
template<typename EnumType >
EnumType	native_value (EnumType e)
template<class T1 , class T2 >
BOOST_GPU_ENABLED void	swap (T1 &left, T2 &right)
template<std::size_t Bits, typename::boost::uint_t< Bits >::fast TruncPoly, typename::boost::uint_t< Bits >::fast InitRem, typename::boost::uint_t< Bits >::fast FinalXor, bool ReflectIn, bool ReflectRem>
uint_t< Bits >::fast	crc (void const *buffer, std::size_t byte_count)
template<std::size_t Bits, typename::boost::uint_t< Bits >::fast TruncPoly>
uint_t< Bits >::fast	augmented_crc (void const *buffer, std::size_t byte_count, typename uint_t< Bits >::fast initial_remainder)
template<std::size_t Bits, typename::boost::uint_t< Bits >::fast TruncPoly>
uint_t< Bits >::fast	augmented_crc (void const *buffer, std::size_t byte_count)
template<typename Block , typename Allocator >
bool	operator!= (const dynamic_bitset< Block, Allocator > &a, const dynamic_bitset< Block, Allocator > &b)
template<typename Block , typename Allocator >
bool	operator<= (const dynamic_bitset< Block, Allocator > &a, const dynamic_bitset< Block, Allocator > &b)
template<typename Block , typename Allocator >
bool	operator> (const dynamic_bitset< Block, Allocator > &a, const dynamic_bitset< Block, Allocator > &b)
template<typename Block , typename Allocator >
bool	operator>= (const dynamic_bitset< Block, Allocator > &a, const dynamic_bitset< Block, Allocator > &b)
template<typename CharT , typename Traits , typename Block , typename Allocator >
std::basic_ostream< CharT, Traits > &	operator<< (std::basic_ostream< CharT, Traits > &os, const dynamic_bitset< Block, Allocator > &b)
template<typename CharT , typename Traits , typename Block , typename Allocator >
std::basic_istream< CharT, Traits > &	operator>> (std::basic_istream< CharT, Traits > &is, dynamic_bitset< Block, Allocator > &b)
template<typename Block , typename Allocator >
dynamic_bitset< Block, Allocator >	operator& (const dynamic_bitset< Block, Allocator > &b1, const dynamic_bitset< Block, Allocator > &b2)
template<typename Block , typename Allocator >
dynamic_bitset< Block, Allocator >	operator| (const dynamic_bitset< Block, Allocator > &b1, const dynamic_bitset< Block, Allocator > &b2)
template<typename Block , typename Allocator >
dynamic_bitset< Block, Allocator >	operator^ (const dynamic_bitset< Block, Allocator > &b1, const dynamic_bitset< Block, Allocator > &b2)
template<typename Block , typename Allocator >
dynamic_bitset< Block, Allocator >	operator- (const dynamic_bitset< Block, Allocator > &b1, const dynamic_bitset< Block, Allocator > &b2)
template<typename Block , typename Allocator >
void	swap (dynamic_bitset< Block, Allocator > &b1, dynamic_bitset< Block, Allocator > &b2)
template<typename Block , typename Allocator , typename stringT >
void	to_string (const dynamic_bitset< Block, Allocator > &b, stringT &s)
template<typename Block , typename Allocator , typename BlockOutputIterator >
void	to_block_range (const dynamic_bitset< Block, Allocator > &b, BlockOutputIterator result)
template<typename BlockIterator , typename B , typename A >
void	from_block_range (BlockIterator first, BlockIterator last, dynamic_bitset< B, A > &result)
template<typename B , typename A , typename stringT >
void	to_string_helper (const dynamic_bitset< B, A > &b, stringT &s, bool dump_all)
template<typename B , typename A , typename stringT >
void	dump_to_string (const dynamic_bitset< B, A > &b, stringT &s)
template<typename Block , typename Allocator >
bool	operator== (const dynamic_bitset< Block, Allocator > &a, const dynamic_bitset< Block, Allocator > &b)
template<typename Block , typename Allocator >
bool	operator< (const dynamic_bitset< Block, Allocator > &a, const dynamic_bitset< Block, Allocator > &b)
template<typename Ch , typename Tr , typename Block , typename Alloc >
std::basic_ostream< Ch, Tr > &	operator<< (std::basic_ostream< Ch, Tr > &os, const dynamic_bitset< Block, Alloc > &b)
template<typename Ch , typename Tr , typename Block , typename Alloc >
std::basic_istream< Ch, Tr > &	operator>> (std::basic_istream< Ch, Tr > &is, dynamic_bitset< Block, Alloc > &b)
template<class E >
E *	current_exception_cast ()
std::string	current_exception_diagnostic_information (bool verbose=true)
template<class T >
std::string	diagnostic_information (T const &e, bool verbose=true)
char const *	diagnostic_information_what (exception const &e, bool verbose=true) throw ()
std::string	to_string (errinfo_errno const &e)
template<class T >
exception_detail::enable_error_info_return_type < T >::type	enable_error_info (T const &x)
template<class T >
exception_detail::clone_impl< T >	enable_current_exception (T const &x)
template<class ErrorInfo , class E >
exception_detail::get_error_info_return_type < E, typename ErrorInfo::value_type >::type	get_error_info (E &some_exception)
template<class Tag , class T >
std::string	error_info_name (error_info< Tag, T > const &x)
template<class Tag , class T >
std::string	to_string (error_info< Tag, T > const &x)
template<class E , class Tag , class T >
enable_if < exception_detail::derives_boost_exception < E >, E const & >::type	operator<< (E const &x, error_info< Tag, T > const &v)
template<class E >
E const &	operator<< (E const &x, tuple< > const &v)
template<class E , class Tag1 , class T1 >
E const &	operator<< (E const &x, tuple< error_info< Tag1, T1 > > const &v)
template<class E , class Tag1 , class T1 , class Tag2 , class T2 >
E const &	operator<< (E const &x, tuple< error_info< Tag1, T1 >, error_info< Tag2, T2 > > const &v)
template<class E , class Tag1 , class T1 , class Tag2 , class T2 , class Tag3 , class T3 >
E const &	operator<< (E const &x, tuple< error_info< Tag1, T1 >, error_info< Tag2, T2 >, error_info< Tag3, T3 > > const &v)
template<class E , class Tag1 , class T1 , class Tag2 , class T2 , class Tag3 , class T3 , class Tag4 , class T4 >
E const &	operator<< (E const &x, tuple< error_info< Tag1, T1 >, error_info< Tag2, T2 >, error_info< Tag3, T3 >, error_info< Tag4, T4 > > const &v)
template<class T , class U >
std::string	to_string (std::pair< T, U > const &)
std::string	to_string (std::exception const &)
template<class T >
enable_if < is_output_streamable< T > , std::string >::type	to_string (T const &x)
template<class T >
std::string	to_string_stub (T const &x)
template<class T , class Stub >
std::string	to_string_stub (T const &x, Stub s)
template<class T , class U , class Stub >
std::string	to_string_stub (std::pair< T, U > const &x, Stub s)
template<class Ch , class Tr , class Alloc >
std::basic_string< Ch, Tr, Alloc >	str (const basic_format< Ch, Tr, Alloc > &f)
template<class Ch , class Tr , class Alloc >
std::basic_ostream< Ch, Tr > &	operator<< (std::basic_ostream< Ch, Tr > &os, const basic_format< Ch, Tr, Alloc > &f)
bool	operator== (const function_base &f, detail::function::useless_clear_type *)
bool	operator!= (const function_base &f, detail::function::useless_clear_type *)
bool	operator== (detail::function::useless_clear_type *, const function_base &f)
bool	operator!= (detail::function::useless_clear_type *, const function_base &f)
template<typename Functor >
typename::boost::enable_if_c <(::boost::type_traits::ice_not < (::boost::is_integral < Functor >::value)>::value), bool >::type	operator== (const function_base &f, Functor g)
template<typename Functor >
typename::boost::enable_if_c <(::boost::type_traits::ice_not < (::boost::is_integral < Functor >::value)>::value), bool >::type	operator== (Functor g, const function_base &f)
template<typename Functor >
typename::boost::enable_if_c <(::boost::type_traits::ice_not < (::boost::is_integral < Functor >::value)>::value), bool >::type	operator!= (const function_base &f, Functor g)
template<typename Functor >
typename::boost::enable_if_c <(::boost::type_traits::ice_not < (::boost::is_integral < Functor >::value)>::value), bool >::type	operator!= (Functor g, const function_base &f)
template<typename Functor >
typename::boost::enable_if_c <(::boost::type_traits::ice_not < (::boost::is_integral < Functor >::value)>::value), bool >::type	operator== (const function_base &f, reference_wrapper< Functor > g)
template<typename Functor >
typename::boost::enable_if_c <(::boost::type_traits::ice_not < (::boost::is_integral < Functor >::value)>::value), bool >::type	operator== (reference_wrapper< Functor > g, const function_base &f)
template<typename Functor >
typename::boost::enable_if_c <(::boost::type_traits::ice_not < (::boost::is_integral < Functor >::value)>::value), bool >::type	operator!= (const function_base &f, reference_wrapper< Functor > g)
template<typename Functor >
typename::boost::enable_if_c <(::boost::type_traits::ice_not < (::boost::is_integral < Functor >::value)>::value), bool >::type	operator!= (reference_wrapper< Functor > g, const function_base &f)
template<typename Signature >
void	swap (function< Signature > &f1, function< Signature > &f2)
	BOOST_STATIC_CONSTANT (int, args=BOOST_FUNCTION_NUM_ARGS)
	BOOST_STATIC_CONSTANT (int, arity=BOOST_FUNCTION_NUM_ARGS)
	BOOST_PP_REPEAT (BOOST_FUNCTION_NUM_ARGS, BOOST_FUNCTION_ARG_TYPE, BOOST_PP_EMPTY) typedef BOOST_JOIN(function
	BOOST_JOIN (function, BOOST_FUNCTION_NUM_ARGS)()
template<typename Functor , typename Allocator >
void	assign (Functor BOOST_FUNCTION_TARGET_FIX(const &) f, Allocator a)
	operator safe_bool () const
bool	operator! () const
template<typename F , typename G >
bool	function_equal_impl (const F &f, const G &g, long)
template<typename F , typename G >
bool	function_equal (const F &f, const G &g)
template<class A , class B >
std::size_t	hash_value (std::pair< A, B > const &)
template<class T , class A >
std::size_t	hash_value (std::vector< T, A > const &)
template<class T , class A >
std::size_t	hash_value (std::list< T, A > const &v)
template<class T , class A >
std::size_t	hash_value (std::deque< T, A > const &v)
template<class K , class C , class A >
std::size_t	hash_value (std::set< K, C, A > const &v)
template<class K , class C , class A >
std::size_t	hash_value (std::multiset< K, C, A > const &v)
template<class K , class T , class C , class A >
std::size_t	hash_value (std::map< K, T, C, A > const &v)
template<class K , class T , class C , class A >
std::size_t	hash_value (std::multimap< K, T, C, A > const &v)
template<class T >
std::size_t	hash_value (std::complex< T > const &)
template<class T , std::size_t N>
std::size_t	hash_value (std::array< T, N > const &v)
template<typename... T>
std::size_t	hash_value (std::tuple< T...> const &v)
template<typename T >
std::size_t	hash_value (std::shared_ptr< T > const &x)
template<typename T , typename Deleter >
std::size_t	hash_value (std::unique_ptr< T, Deleter > const &x)
template<typename T >
boost::hash_detail::long_numbers < T >::type	hash_value (T)
template<typename T >
boost::hash_detail::ulong_numbers < T >::type	hash_value (T)
template<typename T >
boost::enable_if < boost::is_enum< T > , std::size_t >::type	hash_value (T)
template<class T >
std::size_t	hash_value (T *const &)
template<class T , unsigned N>
std::size_t	hash_value (const T(&x)[N])
template<class T , unsigned N>
std::size_t	hash_value (T(&x)[N])
template<class Ch , class A >
std::size_t	hash_value (std::basic_string< Ch, std::char_traits< Ch >, A > const &)
template<typename T >
boost::hash_detail::float_numbers < T >::type	hash_value (T)
std::size_t	hash_value (std::type_index)
template<typename T >
boost::hash_detail::basic_numbers < T >::type	hash_value (T v)
template<class T >
void	hash_combine (std::size_t &seed, T const &v)
template<class It >
std::size_t	hash_range (It first, It last)
template<class It >
void	hash_range (std::size_t &seed, It first, It last)
template<class Predicate >
unary_negate< Predicate >	not1 (const Predicate &pred)
template<class Predicate >
unary_negate< Predicate >	not1 (Predicate &pred)
template<class Predicate >
binary_negate< Predicate >	not2 (const Predicate &pred)
template<class Predicate >
binary_negate< Predicate >	not2 (Predicate &pred)
template<class Operation >
binder1st< Operation >	bind1st (const Operation &op, typename call_traits< typename binary_traits< Operation >::first_argument_type >::param_type x)
template<class Operation >
binder1st< Operation >	bind1st (Operation &op, typename call_traits< typename binary_traits< Operation >::first_argument_type >::param_type x)
template<class Operation >
binder2nd< Operation >	bind2nd (const Operation &op, typename call_traits< typename binary_traits< Operation >::second_argument_type >::param_type x)
template<class Operation >
binder2nd< Operation >	bind2nd (Operation &op, typename call_traits< typename binary_traits< Operation >::second_argument_type >::param_type x)
template<class S , class T >
mem_fun_t< S, T >	mem_fun (S(T::*f)())
template<class S , class T , class A >
mem_fun1_t< S, T, A >	mem_fun (S(T::*f)(A))
template<class S , class T >
const_mem_fun_t< S, T >	mem_fun (S(T::*f)() const)
template<class S , class T , class A >
const_mem_fun1_t< S, T, A >	mem_fun (S(T::*f)(A) const)
template<class S , class T >
mem_fun_ref_t< S, T >	mem_fun_ref (S(T::*f)())
template<class S , class T , class A >
mem_fun1_ref_t< S, T, A >	mem_fun_ref (S(T::*f)(A))
template<class S , class T >
const_mem_fun_ref_t< S, T >	mem_fun_ref (S(T::*f)() const)
template<class S , class T , class A >
const_mem_fun1_ref_t< S, T, A >	mem_fun_ref (S(T::*f)(A) const)
template<class Arg , class Result >
pointer_to_unary_function< Arg, Result >	ptr_fun (Result(*f)(Arg))
template<class Arg1 , class Arg2 , class Result >
pointer_to_binary_function < Arg1, Arg2, Result >	ptr_fun (Result(*f)(Arg1, Arg2))
template<class T >
T *	get_pointer (T *p)
template<class T >
T *	get_pointer (std::auto_ptr< T > const &p)
template<class T >
T *	get_pointer (std::unique_ptr< T > const &p)
template<class T >
T *	get_pointer (std::shared_ptr< T > const &p)
template<typename OEL , typename VL , typename D , typename VP , typename EP , typename GP , typename EL , typename Tag , typename Value >
void	set_property (adjacency_list< OEL, VL, D, VP, EP, GP, EL > &g, Tag tag, Value const &value)
template<typename OEL , typename VL , typename D , typename VP , typename EP , typename GP , typename EL , typename Tag >
graph_property< adjacency_list < OEL, VL, D, VP, EP, GP, EL > , Tag >::type &	get_property (adjacency_list< OEL, VL, D, VP, EP, GP, EL > &g, Tag tag)
template<typename OEL , typename VL , typename D , typename VP , typename EP , typename GP , typename EL , typename Tag >
graph_property< adjacency_list < OEL, VL, D, VP, EP, GP, EL > , Tag >::type const &	get_property (adjacency_list< OEL, VL, D, VP, EP, GP, EL > const &g, Tag tag)
template<class Directed , class Vertex , class OutEdgeListS , class VertexListS , class DirectedS , class VertexProperty , class EdgeProperty , class GraphProperty , class EdgeListS >
Vertex	source (const detail::edge_base< Directed, Vertex > &e, const adjacency_list< OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &)
template<class Directed , class Vertex , class OutEdgeListS , class VertexListS , class DirectedS , class VertexProperty , class EdgeProperty , class GraphProperty , class EdgeListS >
Vertex	target (const detail::edge_base< Directed, Vertex > &e, const adjacency_list< OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &)
template<class Tag , class Value , class Next >
std::istream &	operator>> (std::istream &in, property< Tag, Value, Next > &p)
template<class Tag , class Value >
std::istream &	operator>> (std::istream &in, property< Tag, Value, no_property > &p)
std::istream &	operator>> (std::istream &in, no_property &)
template<class Tag , class Value , class Next , class V , class Stag >
void	get (property< Tag, Value, Next > &p, const V &v, Stag s)
template<class Value , class Next , class V , class Stag >
void	get (property< Stag, Value, Next > &p, const V &v, Stag)
template<class Tag , class Value , class Next , class Stag , class Svalue , class Snext >
void	getSubset (property< Tag, Value, Next > &p, const property< Stag, Svalue, Snext > &s)
template<class Tag , class Value , class Next , class Stag , class Svalue >
void	getSubset (property< Tag, Value, Next > &p, const property< Stag, Svalue, no_property > &s)
void	getSubset (no_property &, const no_property &)
template<typename T , typename U >
void	getSubset (T &p, const U &s)
template<typename T >
void	getSubset (T &, const no_property &)
template<class Graph , class VP , class EP , class VPS , class EPS >
std::istream &	operator>> (std::istream &in, GraphParser< Graph, VP, EP, VPS, EPS > gp)
	input stream for reading a graph More...
template<class EL , class VL , class D , class VP , class EP , class GP , class VPS , class EPS >
GraphParser< adjacency_list < EL, VL, D, VP, EP, GP >, VP, EP, VPS, EPS >	read (adjacency_list< EL, VL, D, VP, EP, GP > &g, VPS vps, EPS eps)
	graph parser for given subsets of internal vertex and edge properties More...
template<class EL , class VL , class D , class VP , class EP , class GP >
GraphParser< adjacency_list < EL, VL, D, VP, EP, GP >, VP, EP, VP, EP >	read (adjacency_list< EL, VL, D, VP, EP, GP > &g)
	graph parser for all internal vertex and edge properties More...
template<class Graph , class VP , class EP >
std::ostream &	operator<< (std::ostream &out, const GraphPrinter< Graph, VP, EP > &gp)
	output stream for writing a graph More...
template<class EL , class VL , class D , class VP , class EP , class GP , class VPS , class EPS >
GraphPrinter< adjacency_list < EL, VL, D, VP, EP, GP >, VPS, EPS >	write (const adjacency_list< EL, VL, D, VP, EP, GP > &g, VPS, EPS)
	write the graph with given property subsets More...
template<class EL , class VL , class D , class VP , class EP , class GP >
GraphPrinter< adjacency_list < EL, VL, D, VP, EP, GP >, VP, EP >	write (const adjacency_list< EL, VL, D, VP, EP, GP > &g)
	write the graph with all internal vertex and edge properties More...
template<typename D , typename VP , typename EP , typename GP , typename A >
std::pair< typename adjacency_matrix< D, VP, EP, GP, A >::edge_descriptor, bool >	edge (typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor u, typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor v, const adjacency_matrix< D, VP, EP, GP, A > &g)
template<typename VP , typename EP , typename GP , typename A >
std::pair< typename adjacency_matrix< directedS, VP, EP, GP, A > ::out_edge_iterator, typename adjacency_matrix< directedS, VP, EP, GP, A > ::out_edge_iterator >	out_edges (typename adjacency_matrix< directedS, VP, EP, GP, A >::vertex_descriptor u, const adjacency_matrix< directedS, VP, EP, GP, A > &g_)
template<typename VP , typename EP , typename GP , typename A >
std::pair< typename adjacency_matrix< undirectedS, VP, EP, GP, A > ::out_edge_iterator, typename adjacency_matrix< undirectedS, VP, EP, GP, A > ::out_edge_iterator >	out_edges (typename adjacency_matrix< undirectedS, VP, EP, GP, A >::vertex_descriptor u, const adjacency_matrix< undirectedS, VP, EP, GP, A > &g_)
template<typename D , typename VP , typename EP , typename GP , typename A >
adjacency_matrix< D, VP, EP, GP, A >::degree_size_type	out_degree (typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor u, const adjacency_matrix< D, VP, EP, GP, A > &g)
template<typename D , typename VP , typename EP , typename GP , typename A , typename Dir , typename Vertex >
adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor	source (const detail::matrix_edge_desc_impl< Dir, Vertex > &e, const adjacency_matrix< D, VP, EP, GP, A > &)
template<typename D , typename VP , typename EP , typename GP , typename A , typename Dir , typename Vertex >
adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor	target (const detail::matrix_edge_desc_impl< Dir, Vertex > &e, const adjacency_matrix< D, VP, EP, GP, A > &)
template<typename VP , typename EP , typename GP , typename A >
std::pair< typename adjacency_matrix< directedS, VP, EP, GP, A > ::in_edge_iterator, typename adjacency_matrix< directedS, VP, EP, GP, A > ::in_edge_iterator >	in_edges (typename adjacency_matrix< directedS, VP, EP, GP, A >::vertex_descriptor u, const adjacency_matrix< directedS, VP, EP, GP, A > &g_)
template<typename VP , typename EP , typename GP , typename A >
std::pair< typename adjacency_matrix< undirectedS, VP, EP, GP, A > ::in_edge_iterator, typename adjacency_matrix< undirectedS, VP, EP, GP, A > ::in_edge_iterator >	in_edges (typename adjacency_matrix< undirectedS, VP, EP, GP, A >::vertex_descriptor u, const adjacency_matrix< undirectedS, VP, EP, GP, A > &g_)
template<typename D , typename VP , typename EP , typename GP , typename A >
adjacency_matrix< D, VP, EP, GP, A >::degree_size_type	in_degree (typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor u, const adjacency_matrix< D, VP, EP, GP, A > &g)
template<typename D , typename VP , typename EP , typename GP , typename A >
std::pair< typename adjacency_matrix< D, VP, EP, GP, A >::adjacency_iterator, typename adjacency_matrix< D, VP, EP, GP, A > ::adjacency_iterator >	adjacent_vertices (typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor u, const adjacency_matrix< D, VP, EP, GP, A > &g_)
template<typename D , typename VP , typename EP , typename GP , typename A >
std::pair< typename adjacency_matrix< D, VP, EP, GP, A >::vertex_iterator, typename adjacency_matrix< D, VP, EP, GP, A > ::vertex_iterator >	vertices (const adjacency_matrix< D, VP, EP, GP, A > &g_)
template<typename D , typename VP , typename EP , typename GP , typename A >
adjacency_matrix< D, VP, EP, GP, A >::vertices_size_type	num_vertices (const adjacency_matrix< D, VP, EP, GP, A > &g)
template<typename D , typename VP , typename EP , typename GP , typename A >
std::pair< typename adjacency_matrix< D, VP, EP, GP, A >::edge_iterator, typename adjacency_matrix< D, VP, EP, GP, A >::edge_iterator >	edges (const adjacency_matrix< D, VP, EP, GP, A > &g_)
template<typename D , typename VP , typename EP , typename GP , typename A >
adjacency_matrix< D, VP, EP, GP, A >::edges_size_type	num_edges (const adjacency_matrix< D, VP, EP, GP, A > &g)
template<typename D , typename VP , typename EP , typename GP , typename A , typename EP2 >
std::pair< typename adjacency_matrix< D, VP, EP, GP, A >::edge_descriptor, bool >	add_edge (typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor u, typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor v, const EP2 &ep, adjacency_matrix< D, VP, EP, GP, A > &g)
template<typename D , typename VP , typename EP , typename GP , typename A >
std::pair< typename adjacency_matrix< D, VP, EP, GP, A >::edge_descriptor, bool >	add_edge (typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor u, typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor v, adjacency_matrix< D, VP, EP, GP, A > &g)
template<typename D , typename VP , typename EP , typename GP , typename A >
void	remove_edge (typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor u, typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor v, adjacency_matrix< D, VP, EP, GP, A > &g)
template<typename D , typename VP , typename EP , typename GP , typename A >
void	remove_edge (typename adjacency_matrix< D, VP, EP, GP, A >::edge_descriptor e, adjacency_matrix< D, VP, EP, GP, A > &g)
template<typename D , typename VP , typename EP , typename GP , typename A >
adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor	add_vertex (adjacency_matrix< D, VP, EP, GP, A > &g)
template<typename D , typename VP , typename EP , typename GP , typename A , typename VP2 >
adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor	add_vertex (const VP2 &, adjacency_matrix< D, VP, EP, GP, A > &g)
template<typename D , typename VP , typename EP , typename GP , typename A >
void	remove_vertex (typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor, adjacency_matrix< D, VP, EP, GP, A > &)
template<typename VP , typename EP , typename GP , typename A >
void	clear_vertex (typename adjacency_matrix< directedS, VP, EP, GP, A >::vertex_descriptor u, adjacency_matrix< directedS, VP, EP, GP, A > &g)
template<typename VP , typename EP , typename GP , typename A >
void	clear_vertex (typename adjacency_matrix< undirectedS, VP, EP, GP, A >::vertex_descriptor u, adjacency_matrix< undirectedS, VP, EP, GP, A > &g)
template<typename D , typename VP , typename EP , typename GP , typename A , typename Tag >
property_map< adjacency_matrix < D, VP, EP, GP, A >, Tag > ::type	get (Tag tag, adjacency_matrix< D, VP, EP, GP, A > &g)
template<typename D , typename VP , typename EP , typename GP , typename A , typename Tag >
property_map< adjacency_matrix < D, VP, EP, GP, A >, Tag > ::const_type	get (Tag tag, const adjacency_matrix< D, VP, EP, GP, A > &g)
template<typename D , typename VP , typename EP , typename GP , typename A , typename Tag >
property_map< adjacency_matrix < D, VP, EP, GP, A >, Tag > ::single_nonconst_type	get (Tag tag, adjacency_matrix< D, VP, EP, GP, A > &g, typename property_map< adjacency_matrix< D, VP, EP, GP, A >, Tag >::arg_type a)
template<typename D , typename VP , typename EP , typename GP , typename A , typename Tag >
property_map< adjacency_matrix < D, VP, EP, GP, A >, Tag > ::single_const_type	get (Tag tag, const adjacency_matrix< D, VP, EP, GP, A > &g, typename property_map< adjacency_matrix< D, VP, EP, GP, A >, Tag >::arg_type a)
template<typename D , typename VP , typename EP , typename GP , typename A , typename Tag >
void	put (Tag tag, adjacency_matrix< D, VP, EP, GP, A > &g, typename property_map< adjacency_matrix< D, VP, EP, GP, A >, Tag >::arg_type a, typename property_map< adjacency_matrix< D, VP, EP, GP, A >, Tag >::single_const_type val)
template<typename D , typename VP , typename EP , typename GP , typename A , typename Tag , typename Value >
void	set_property (adjacency_matrix< D, VP, EP, GP, A > &g, Tag tag, const Value &value)
template<typename D , typename VP , typename EP , typename GP , typename A , typename Tag >
graph_property < adjacency_matrix< D, VP, EP, GP, A >, Tag >::type &	get_property (adjacency_matrix< D, VP, EP, GP, A > &g, Tag tag)
template<typename D , typename VP , typename EP , typename GP , typename A , typename Tag >
const graph_property < adjacency_matrix< D, VP, EP, GP, A >, Tag >::type &	get_property (const adjacency_matrix< D, VP, EP, GP, A > &g, Tag tag)
template<typename D , typename VP , typename EP , typename GP , typename A >
property_map< adjacency_matrix < D, VP, EP, GP, A > , vertex_index_t >::const_type	get (vertex_index_t, adjacency_matrix< D, VP, EP, GP, A > &)
template<typename D , typename VP , typename EP , typename GP , typename A >
adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor	get (vertex_index_t, adjacency_matrix< D, VP, EP, GP, A > &, typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor v)
template<typename D , typename VP , typename EP , typename GP , typename A >
property_map< adjacency_matrix < D, VP, EP, GP, A > , vertex_index_t >::const_type	get (vertex_index_t, const adjacency_matrix< D, VP, EP, GP, A > &)
template<typename D , typename VP , typename EP , typename GP , typename A >
adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor	get (vertex_index_t, const adjacency_matrix< D, VP, EP, GP, A > &, typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor v)
template<typename D , typename VP , typename EP , typename GP , typename A >
adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor	vertex (typename adjacency_matrix< D, VP, EP, GP, A >::vertices_size_type n, const adjacency_matrix< D, VP, EP, GP, A > &)
template<class Visitors >
astar_visitor< Visitors >	make_astar_visitor (Visitors vis)
template<typename VertexListGraph , typename AStarHeuristic , typename AStarVisitor , typename PredecessorMap , typename CostMap , typename DistanceMap , typename WeightMap , typename ColorMap , typename VertexIndexMap , typename CompareFunction , typename CombineFunction , typename CostInf , typename CostZero >
void	astar_search_no_init (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, AStarHeuristic h, AStarVisitor vis, PredecessorMap predecessor, CostMap cost, DistanceMap distance, WeightMap weight, ColorMap color, VertexIndexMap index_map, CompareFunction compare, CombineFunction combine, CostInf, CostZero zero)
template<typename VertexListGraph , typename AStarHeuristic , typename AStarVisitor , typename PredecessorMap , typename CostMap , typename DistanceMap , typename WeightMap , typename CompareFunction , typename CombineFunction , typename CostInf , typename CostZero >
void	astar_search_no_init_tree (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, AStarHeuristic h, AStarVisitor vis, PredecessorMap predecessor, CostMap cost, DistanceMap distance, WeightMap weight, CompareFunction compare, CombineFunction combine, CostInf, CostZero zero)
template<typename VertexListGraph , typename AStarHeuristic , typename AStarVisitor , typename PredecessorMap , typename CostMap , typename DistanceMap , typename WeightMap , typename VertexIndexMap , typename ColorMap , typename CompareFunction , typename CombineFunction , typename CostInf , typename CostZero >
void	astar_search (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, AStarHeuristic h, AStarVisitor vis, PredecessorMap predecessor, CostMap cost, DistanceMap distance, WeightMap weight, VertexIndexMap index_map, ColorMap color, CompareFunction compare, CombineFunction combine, CostInf inf, CostZero zero)
template<typename VertexListGraph , typename AStarHeuristic , typename AStarVisitor , typename PredecessorMap , typename CostMap , typename DistanceMap , typename WeightMap , typename CompareFunction , typename CombineFunction , typename CostInf , typename CostZero >
void	astar_search_tree (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, AStarHeuristic h, AStarVisitor vis, PredecessorMap predecessor, CostMap cost, DistanceMap distance, WeightMap weight, CompareFunction compare, CombineFunction combine, CostInf inf, CostZero zero)
template<typename VertexListGraph , typename AStarHeuristic , typename P , typename T , typename R >
void	astar_search (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, AStarHeuristic h, const bgl_named_params< P, T, R > &params)
template<typename VertexListGraph , typename AStarHeuristic , typename P , typename T , typename R >
void	astar_search_tree (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, AStarHeuristic h, const bgl_named_params< P, T, R > &params)
template<typename VertexListGraph , typename AStarHeuristic , typename P , typename T , typename R >
void	astar_search_no_init (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, AStarHeuristic h, const bgl_named_params< P, T, R > &params)
template<typename VertexListGraph , typename AStarHeuristic , typename P , typename T , typename R >
void	astar_search_no_init_tree (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, AStarHeuristic h, const bgl_named_params< P, T, R > &params)
template<typename Graph , typename VertexIndexMap >
graph_traits< Graph > ::vertices_size_type	ith_bandwidth (typename graph_traits< Graph >::vertex_descriptor i, const Graph &g, VertexIndexMap index)
template<typename Graph >
graph_traits< Graph > ::vertices_size_type	ith_bandwidth (typename graph_traits< Graph >::vertex_descriptor i, const Graph &g)
template<typename Graph , typename VertexIndexMap >
graph_traits< Graph > ::vertices_size_type	bandwidth (const Graph &g, VertexIndexMap index)
template<typename Graph >
graph_traits< Graph > ::vertices_size_type	bandwidth (const Graph &g)
template<typename Graph , typename VertexIndexMap >
graph_traits< Graph > ::vertices_size_type	edgesum (const Graph &g, VertexIndexMap index_map)
template<typename MutableGraph , typename Done , typename EdgeCentralityMap , typename VertexIndexMap >
void	betweenness_centrality_clustering (MutableGraph &g, Done done, EdgeCentralityMap edge_centrality, VertexIndexMap vertex_index)
	Graph clustering based on edge betweenness centrality. More...
template<typename MutableGraph , typename Done , typename EdgeCentralityMap >
void	betweenness_centrality_clustering (MutableGraph &g, Done done, EdgeCentralityMap edge_centrality)
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...
template<typename MutableGraph , typename Done >
void	betweenness_centrality_clustering (MutableGraph &g, Done done)
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...
template<class Visitors >
bellman_visitor< Visitors >	make_bellman_visitor (Visitors vis)
template<class EdgeListGraph , class Size , class WeightMap , class PredecessorMap , class DistanceMap , class BinaryFunction , class BinaryPredicate , class BellmanFordVisitor >
bool	bellman_ford_shortest_paths (EdgeListGraph &g, Size N, WeightMap weight, PredecessorMap pred, DistanceMap distance, BinaryFunction combine, BinaryPredicate compare, BellmanFordVisitor v)
template<class EdgeListGraph , class Size , class P , class T , class R >
bool	bellman_ford_shortest_paths (EdgeListGraph &g, Size N, const bgl_named_params< P, T, R > &params)
template<class EdgeListGraph , class Size >
bool	bellman_ford_shortest_paths (EdgeListGraph &g, Size N)
template<class VertexAndEdgeListGraph , class P , class T , class R >
bool	bellman_ford_shortest_paths (VertexAndEdgeListGraph &g, const bgl_named_params< P, T, R > &params)
template<typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename IncomingMap , typename DistanceMap , typename DependencyMap , typename PathCountMap , typename VertexIndexMap >
void	brandes_betweenness_centrality (const Graph &g, CentralityMap centrality, EdgeCentralityMap edge_centrality_map, IncomingMap incoming, DistanceMap distance, DependencyMap dependency, PathCountMap path_count, VertexIndexMap vertex_index BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename IncomingMap , typename DistanceMap , typename DependencyMap , typename PathCountMap , typename VertexIndexMap , typename WeightMap >
void	brandes_betweenness_centrality (const Graph &g, CentralityMap centrality, EdgeCentralityMap edge_centrality_map, IncomingMap incoming, DistanceMap distance, DependencyMap dependency, PathCountMap path_count, VertexIndexMap vertex_index, WeightMap weight_map BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<typename Graph , typename Param , typename Tag , typename Rest >
void	brandes_betweenness_centrality (const Graph &g, const bgl_named_params< Param, Tag, Rest > &params BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<typename Graph , typename CentralityMap >
disable_if < detail::graph::is_bgl_named_params < CentralityMap >, void > ::type	brandes_betweenness_centrality (const Graph &g, CentralityMap centrality BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<typename Graph , typename CentralityMap , typename EdgeCentralityMap >
void	brandes_betweenness_centrality (const Graph &g, CentralityMap centrality, EdgeCentralityMap edge_centrality_map BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<typename Graph , typename CentralityMap >
void	relative_betweenness_centrality (const Graph &g, CentralityMap centrality)
	Converts "absolute" betweenness centrality (as computed by the brandes_betweenness_centrality algorithm) in the centrality map into "relative" centrality. More...
template<typename Graph , typename CentralityMap >
property_traits< CentralityMap > ::value_type	central_point_dominance (const Graph &g, CentralityMap centrality BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<typename Graph , typename ComponentMap , typename OutputIterator , typename DiscoverTimeMap , typename LowPointMap >
std::pair< std::size_t, OutputIterator >	biconnected_components (const Graph &g, ComponentMap comp, OutputIterator out, DiscoverTimeMap dtm, LowPointMap lowpt)
template<typename Graph , typename ComponentMap , typename OutputIterator , typename P , typename T , typename R >
std::pair< std::size_t, OutputIterator >	biconnected_components (const Graph &g, ComponentMap comp, OutputIterator out, const bgl_named_params< P, T, R > &params)
template<typename Graph , typename ComponentMap , typename OutputIterator >
std::pair< std::size_t, OutputIterator >	biconnected_components (const Graph &g, ComponentMap comp, OutputIterator out)
template<typename Graph , typename ComponentMap , typename P , typename T , typename R >
std::size_t	biconnected_components (const Graph &g, ComponentMap comp, const bgl_named_params< P, T, R > &params)
template<typename Graph , typename ComponentMap >
std::size_t	biconnected_components (const Graph &g, ComponentMap comp)
template<typename Graph , typename OutputIterator , typename P , typename T , typename R >
OutputIterator	articulation_points (const Graph &g, OutputIterator out, const bgl_named_params< P, T, R > &params)
template<typename Graph , typename OutputIterator >
OutputIterator	articulation_points (const Graph &g, OutputIterator out)
template<typename Graph , typename IndexMap , typename PartitionMap >
bool	is_bipartite (const Graph &graph, const IndexMap index_map, PartitionMap partition_map)
	Checks a given graph for bipartiteness and fills the given color map with white and black according to the bipartition. More...
template<typename Graph , typename IndexMap >
bool	is_bipartite (const Graph &graph, const IndexMap index_map)
	Checks a given graph for bipartiteness. More...
template<typename Graph >
bool	is_bipartite (const Graph &graph)
	Checks a given graph for bipartiteness. More...
template<typename Graph , typename IndexMap , typename PartitionMap , typename OutputIterator >
OutputIterator	find_odd_cycle (const Graph &graph, const IndexMap index_map, PartitionMap partition_map, OutputIterator result)
	Checks a given graph for bipartiteness and fills a given color map with white and black according to the bipartition. More...
template<typename Graph , typename IndexMap , typename OutputIterator >
OutputIterator	find_odd_cycle (const Graph &graph, const IndexMap index_map, OutputIterator result)
	Checks a given graph for bipartiteness. More...
template<typename Graph , typename OutputIterator >
OutputIterator	find_odd_cycle (const Graph &graph, OutputIterator result)
	Checks a given graph for bipartiteness. More...
template<typename A0 >
bool	boyer_myrvold_planarity_test (A0 const &arg0)
template<typename A0 , typename A1 >
bool	boyer_myrvold_planarity_test (A0 const &arg0, A1 const &arg1)
template<typename A0 , typename A1 , typename A2 >
bool	boyer_myrvold_planarity_test (A0 const &arg0, A1 const &arg1, A2 const &arg2)
template<typename A0 , typename A1 , typename A2 , typename A3 >
bool	boyer_myrvold_planarity_test (A0 const &arg0, A1 const &arg1, A2 const &arg2, A3 const &arg3)
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 >
bool	boyer_myrvold_planarity_test (A0 const &arg0, A1 const &arg1, A2 const &arg2, A3 const &arg3, A4 const &arg4)
template<class Graph , class CapacityEdgeMap , class ResidualCapacityEdgeMap , class ReverseEdgeMap , class PredecessorMap , class ColorMap , class DistanceMap , class IndexMap >
property_traits < CapacityEdgeMap > ::value_type	boykov_kolmogorov_max_flow (Graph &g, CapacityEdgeMap cap, ResidualCapacityEdgeMap res_cap, ReverseEdgeMap rev_map, PredecessorMap pre_map, ColorMap color, DistanceMap dist, IndexMap idx, typename graph_traits< Graph >::vertex_descriptor src, typename graph_traits< Graph >::vertex_descriptor sink)
	non-named-parameter version, given everything this is the catch all version More...
template<class Graph , class CapacityEdgeMap , class ResidualCapacityEdgeMap , class ReverseEdgeMap , class IndexMap >
property_traits < CapacityEdgeMap > ::value_type	boykov_kolmogorov_max_flow (Graph &g, CapacityEdgeMap cap, ResidualCapacityEdgeMap res_cap, ReverseEdgeMap rev, IndexMap idx, typename graph_traits< Graph >::vertex_descriptor src, typename graph_traits< Graph >::vertex_descriptor sink)
	non-named-parameter version, given capacity, residucal_capacity, reverse_edges, and an index map. More...
template<class Graph , class CapacityEdgeMap , class ResidualCapacityEdgeMap , class ReverseEdgeMap , class ColorMap , class IndexMap >
property_traits < CapacityEdgeMap > ::value_type	boykov_kolmogorov_max_flow (Graph &g, CapacityEdgeMap cap, ResidualCapacityEdgeMap res_cap, ReverseEdgeMap rev, ColorMap color, IndexMap idx, typename graph_traits< Graph >::vertex_descriptor src, typename graph_traits< Graph >::vertex_descriptor sink)
	non-named-parameter version, some given: capacity, residual_capacity, reverse_edges, color_map and an index map. More...
template<class Graph , class P , class T , class R >
property_traits< typename property_map< Graph, edge_capacity_t >::const_type > ::value_type	boykov_kolmogorov_max_flow (Graph &g, typename graph_traits< Graph >::vertex_descriptor src, typename graph_traits< Graph >::vertex_descriptor sink, const bgl_named_params< P, T, R > &params)
	named-parameter version, some given More...
template<class Graph >
property_traits< typename property_map< Graph, edge_capacity_t >::const_type > ::value_type	boykov_kolmogorov_max_flow (Graph &g, typename graph_traits< Graph >::vertex_descriptor src, typename graph_traits< Graph >::vertex_descriptor sink)
	named-parameter version, none given More...
template<class IncidenceGraph , class Buffer , class BFSVisitor , class ColorMap , class SourceIterator >
void	breadth_first_visit (const IncidenceGraph &g, SourceIterator sources_begin, SourceIterator sources_end, Buffer &Q, BFSVisitor vis, ColorMap color)
template<class IncidenceGraph , class Buffer , class BFSVisitor , class ColorMap >
void	breadth_first_visit (const IncidenceGraph &g, typename graph_traits< IncidenceGraph >::vertex_descriptor s, Buffer &Q, BFSVisitor vis, ColorMap color)
template<class VertexListGraph , class SourceIterator , class Buffer , class BFSVisitor , class ColorMap >
void	breadth_first_search (const VertexListGraph &g, SourceIterator sources_begin, SourceIterator sources_end, Buffer &Q, BFSVisitor vis, ColorMap color)
template<class VertexListGraph , class Buffer , class BFSVisitor , class ColorMap >
void	breadth_first_search (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, Buffer &Q, BFSVisitor vis, ColorMap color)
template<class Visitors >
bfs_visitor< Visitors >	make_bfs_visitor (Visitors vis)
template<class VertexListGraph , class P , class T , class R >
void	breadth_first_search (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, const bgl_named_params< P, T, R > &params)
template<class IncidenceGraph , class P , class T , class R >
void	breadth_first_visit (const IncidenceGraph &g, typename graph_traits< IncidenceGraph >::vertex_descriptor s, const bgl_named_params< P, T, R > &params)
max_clique_visitor	find_max_clique (std::size_t &max)
template<typename Graph , typename Visitor >
void	bron_kerbosch_all_cliques (const Graph &g, Visitor vis, std::size_t min)
template<typename Graph , typename Visitor >
void	bron_kerbosch_all_cliques (const Graph &g, Visitor vis)
template<typename Graph >
std::size_t	bron_kerbosch_clique_number (const Graph &g)
	BOOST_concept (Buffer,(B))
	BOOST_concept (UpdatableQueue,(Q))
	BOOST_concept (KeyedUpdatableQueue,(Q))
template<typename Graph , typename PlanarEmbedding , typename ForwardIterator , typename GridPositionMap , typename VertexIndexMap >
void	chrobak_payne_straight_line_drawing (const Graph &g, PlanarEmbedding embedding, ForwardIterator ordering_begin, ForwardIterator ordering_end, GridPositionMap drawing, VertexIndexMap vm)
template<typename Graph , typename PlanarEmbedding , typename ForwardIterator , typename GridPositionMap >
void	chrobak_payne_straight_line_drawing (const Graph &g, PlanarEmbedding embedding, ForwardIterator ord_begin, ForwardIterator ord_end, GridPositionMap drawing)
template<typename VertexListGraph , typename PositionMap , typename Radius >
void	circle_graph_layout (const VertexListGraph &g, PositionMap position, Radius radius)
	Layout the graph with the vertices at the points of a regular n-polygon. More...
template<typename Graph , typename DistanceMap >
closeness_measure< Graph, typename property_traits < DistanceMap >::value_type, double, detail::reciprocal < double > >	measure_closeness (const Graph &, DistanceMap)
template<typename T , typename Graph , typename DistanceMap >
closeness_measure< Graph, typename property_traits < DistanceMap >::value_type, T, detail::reciprocal< T > >	measure_closeness (const Graph &, DistanceMap)
template<typename T , typename Graph , typename DistanceMap , typename Reciprocal >
closeness_measure< Graph, typename property_traits < DistanceMap >::value_type, T, Reciprocal >	measure_closeness (const Graph &, DistanceMap)
template<typename Graph , typename DistanceMap , typename Measure , typename Combinator >
Measure::result_type	closeness_centrality (const Graph &g, DistanceMap dist, Measure measure, Combinator combine)
template<typename Graph , typename DistanceMap , typename Measure >
Measure::result_type	closeness_centrality (const Graph &g, DistanceMap dist, Measure measure)
template<typename Graph , typename DistanceMap >
double	closeness_centrality (const Graph &g, DistanceMap dist)
template<typename T , typename Graph , typename DistanceMap >
T	closeness_centrality (const Graph &g, DistanceMap dist)
template<typename Graph , typename DistanceMatrixMap , typename CentralityMap , typename Measure >
void	all_closeness_centralities (const Graph &g, DistanceMatrixMap dist, CentralityMap cent, Measure measure)
template<typename Graph , typename DistanceMatrixMap , typename CentralityMap >
void	all_closeness_centralities (const Graph &g, DistanceMatrixMap dist, CentralityMap cent)
template<typename Graph , typename Vertex >
graph_traits< Graph > ::degree_size_type	num_paths_through_vertex (const Graph &g, Vertex v)
template<typename Graph , typename Vertex >
graph_traits< Graph > ::degree_size_type	num_triangles_on_vertex (const Graph &g, Vertex v)
template<typename T , typename Graph , typename Vertex >
T	clustering_coefficient (const Graph &g, Vertex v)
template<typename Graph , typename Vertex >
double	clustering_coefficient (const Graph &g, Vertex v)
template<typename Graph , typename ClusteringMap >
property_traits< ClusteringMap > ::value_type	all_clustering_coefficients (const Graph &g, ClusteringMap cm)
template<typename Graph , typename ClusteringMap >
property_traits< ClusteringMap > ::value_type	mean_clustering_coefficient (const Graph &g, ClusteringMap cm)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
Vertex	add_vertex (compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
Vertex	add_vertex (compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::vertex_bundled const &p)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
Vertex	add_vertex (compressed_sparse_row_graph< bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g, typename compressed_sparse_row_graph< bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::vertex_bundled const &p)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
Vertex	add_vertices (typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::vertices_size_type count, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename BidirectionalIteratorOrig , typename EPIterOrig >
void	add_edges_sorted (BidirectionalIteratorOrig first_sorted, BidirectionalIteratorOrig last_sorted, EPIterOrig ep_iter_sorted, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename BidirectionalIteratorOrig >
void	add_edges_sorted (BidirectionalIteratorOrig first_sorted, BidirectionalIteratorOrig last_sorted, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename BidirectionalIteratorOrig , typename EPIterOrig , typename GlobalToLocal >
void	add_edges_sorted_global (BidirectionalIteratorOrig first_sorted, BidirectionalIteratorOrig last_sorted, EPIterOrig ep_iter_sorted, const GlobalToLocal &global_to_local, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename BidirectionalIteratorOrig , typename GlobalToLocal >
void	add_edges_sorted_global (BidirectionalIteratorOrig first_sorted, BidirectionalIteratorOrig last_sorted, const GlobalToLocal &global_to_local, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename InputIterator , typename GlobalToLocal >
void	add_edges_global (InputIterator first, InputIterator last, const GlobalToLocal &global_to_local, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename InputIterator >
void	add_edges (InputIterator first, InputIterator last, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename InputIterator , typename EPIterator >
void	add_edges (InputIterator first, InputIterator last, EPIterator ep_iter, EPIterator ep_iter_end, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename InputIterator , typename EPIterator , typename GlobalToLocal >
void	add_edges_global (InputIterator first, InputIterator last, EPIterator ep_iter, EPIterator ep_iter_end, const GlobalToLocal &global_to_local, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
Vertex	num_vertices (const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
std::pair< counting_iterator < Vertex >, counting_iterator < Vertex > >	vertices (const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
Vertex	source (typename compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::edge_descriptor e, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
Vertex	target (typename compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::edge_descriptor e, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
std::pair< typename compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > ::out_edge_iterator, typename compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > ::out_edge_iterator >	out_edges (Vertex v, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
EdgeIndex	out_degree (Vertex v, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
std::pair< typename compressed_sparse_row_graph < bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::in_edge_iterator, typename compressed_sparse_row_graph < bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::in_edge_iterator >	in_edges (Vertex v, const compressed_sparse_row_graph< bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
EdgeIndex	in_degree (Vertex v, const compressed_sparse_row_graph< bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
std::pair< typename compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > ::adjacency_iterator, typename compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > ::adjacency_iterator >	adjacent_vertices (Vertex v, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
graph_traits < compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > >::vertex_descriptor	vertex (typename graph_traits< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > >::vertex_descriptor i, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
std::pair< typename compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > ::edge_descriptor, bool >	edge (Vertex i, Vertex j, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > ::edge_descriptor	edge_from_index (EdgeIndex idx, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
EdgeIndex	num_edges (const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
std::pair< typename compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > ::edge_iterator, typename compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > ::edge_iterator >	edges (const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , class Tag , class Value >
void	set_property (compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g, Tag tag, const Value &value)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , class Tag >
graph_property < compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, Tag > ::type &	get_property (compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g, Tag tag)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , class Tag >
const graph_property < compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, Tag > ::type &	get_property (const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g, Tag tag)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename Tag >
property_map < compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, Tag > ::type	get (Tag tag, compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename Tag >
property_map < compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, Tag > ::const_type	get (Tag tag, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename Tag >
property_traits< typename property_map < compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, Tag > ::type >::reference	get (Tag tag, compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g, typename property_map< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, Tag >::key_type k)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename Tag >
property_traits< typename property_map < compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, Tag > ::const_type >::reference	get (Tag tag, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g, typename property_map< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, Tag >::key_type k)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename Tag >
void	put (Tag tag, compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g, typename property_map< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, Tag >::key_type k, typename lookup_one_property< typename property_map< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, Tag >::plist_type, Tag >::type val)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
typed_identity_property_map < Vertex >	get (vertex_index_t, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
Vertex	get (vertex_index_t, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &, Vertex v)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
typed_identity_property_map < Vertex >	get (vertex_index_t, compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
Vertex	get (vertex_index_t, compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &, Vertex v)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
property_map < compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > , edge_index_t >::const_type	get (edge_index_t, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
EdgeIndex	get (edge_index_t, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &, typename compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::edge_descriptor e)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
property_map < compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > , edge_index_t >::const_type	get (edge_index_t, compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
EdgeIndex	get (edge_index_t, compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &, typename compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::edge_descriptor e)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
property_map < compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > , vertex_all_t >::type	get (vertex_all_t, compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
property_map < compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > , vertex_all_t >::const_type	get (vertex_all_t, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
VertexProperty &	get (vertex_all_t, compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g, Vertex v)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
const VertexProperty &	get (vertex_all_t, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g, Vertex v)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
void	put (vertex_all_t, compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g, Vertex v, const VertexProperty &val)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
property_map < compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > , edge_all_t >::type	get (edge_all_t, compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
property_map < compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > , edge_all_t >::const_type	get (edge_all_t, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
EdgeProperty &	get (edge_all_t, compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g, const typename compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::edge_descriptor &e)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
const EdgeProperty &	get (edge_all_t, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g, const typename compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::edge_descriptor &e)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
void	put (edge_all_t, compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g, const typename compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::edge_descriptor &e, const EdgeProperty &val)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
property_map < compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > , graph_all_t >::type	get (graph_all_t, compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
property_map < compressed_sparse_row_graph < Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > , graph_all_t >::const_type	get (graph_all_t, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
GraphProperty &	get (graph_all_t, compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g, compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > *)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
const GraphProperty &	get (graph_all_t, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g, compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > *)
template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >
void	put (graph_all_t, compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &g, compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > *, const GraphProperty &val)
template<class Graph , class ComponentMap , class P , class T , class R >
property_traits< ComponentMap > ::value_type	connected_components (const Graph &g, ComponentMap c, const bgl_named_params< P, T, R > &params BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<class Graph , class ComponentMap >
property_traits< ComponentMap > ::value_type	connected_components (const Graph &g, ComponentMap c BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<typename VertexListGraph , typename MutableGraph >
void	copy_graph (const VertexListGraph &g_in, MutableGraph &g_out)
template<typename VertexListGraph , typename MutableGraph , class P , class T , class R >
void	copy_graph (const VertexListGraph &g_in, MutableGraph &g_out, const bgl_named_params< P, T, R > &params)
template<typename IncidenceGraph , typename MutableGraph , typename P , typename T , typename R >
graph_traits< MutableGraph > ::vertex_descriptor	copy_component (IncidenceGraph &g_in, typename graph_traits< IncidenceGraph >::vertex_descriptor src, MutableGraph &g_out, const bgl_named_params< P, T, R > &params)
template<typename IncidenceGraph , typename MutableGraph >
graph_traits< MutableGraph > ::vertex_descriptor	copy_component (IncidenceGraph &g_in, typename graph_traits< IncidenceGraph >::vertex_descriptor src, MutableGraph &g_out)
template<class Visitors >
core_numbers_visitor< Visitors >	make_core_numbers_visitor (Visitors vis)
template<typename Graph , typename CoreMap , typename CoreNumVisitor >
property_traits< CoreMap > ::value_type	core_numbers (Graph &g, CoreMap c, CoreNumVisitor vis)
template<typename Graph , typename CoreMap >
property_traits< CoreMap > ::value_type	core_numbers (Graph &g, CoreMap c)
template<typename Graph , typename CoreMap , typename EdgeWeightMap , typename VertexIndexMap , typename CoreNumVisitor >
property_traits< CoreMap > ::value_type	core_numbers (Graph &g, CoreMap c, EdgeWeightMap wm, VertexIndexMap vim, CoreNumVisitor vis)
template<typename Graph , typename CoreMap >
property_traits< CoreMap > ::value_type	weighted_core_numbers (Graph &g, CoreMap c)
template<typename Graph , typename CoreMap , typename CoreNumVisitor >
property_traits< CoreMap > ::value_type	weighted_core_numbers (Graph &g, CoreMap c, CoreNumVisitor vis)
template<typename Graph , typename ComponentLists , typename ComponentNumberMap , typename CondensationGraph , typename EdgeMultiplicityMap >
void	create_condensation_graph (const Graph &g, const ComponentLists &components, ComponentNumberMap component_number, CondensationGraph &cg, EdgeMultiplicityMap edge_mult_map)
template<typename Graph , typename ComponentLists , typename ComponentNumberMap , typename CondensationGraph >
void	create_condensation_graph (const Graph &g, const ComponentLists &components, ComponentNumberMap component_number, CondensationGraph &cg)
template<class Graph , class OutputIterator , class ColorMap , class DegreeMap >
OutputIterator	cuthill_mckee_ordering (const Graph &g, std::deque< typename graph_traits< Graph >::vertex_descriptor > vertex_queue, OutputIterator permutation, ColorMap color, DegreeMap degree)
template<class Graph , class OutputIterator , class ColorMap , class DegreeMap >
OutputIterator	cuthill_mckee_ordering (const Graph &g, typename graph_traits< Graph >::vertex_descriptor s, OutputIterator permutation, ColorMap color, DegreeMap degree)
template<class Graph , class OutputIterator , class ColorMap , class DegreeMap >
OutputIterator	cuthill_mckee_ordering (const Graph &G, OutputIterator permutation, ColorMap color, DegreeMap degree)
template<typename Graph , typename OutputIterator , typename VertexIndexMap >
OutputIterator	cuthill_mckee_ordering (const Graph &G, OutputIterator permutation, VertexIndexMap index_map)
template<typename Graph , typename OutputIterator >
OutputIterator	cuthill_mckee_ordering (const Graph &G, OutputIterator permutation)
template<class Graph , class Pred , class Distance , class Reversed , class ResidualCapacity , class Weight >
void	cycle_canceling (const Graph &g, Weight weight, Reversed rev, ResidualCapacity residual_capacity, Pred pred, Distance distance)
template<class Graph , class P , class T , class R >
void	cycle_canceling (Graph &g, const bgl_named_params< P, T, R > &params)
template<class Graph >
void	cycle_canceling (Graph &g)
template<class VertexListGraph , class DijkstraVisitor , class DistanceMap , class WeightMap , class ColorMap , class PredecessorMap , class Compare , class Combine , class DistInf , class DistZero >
void	dag_shortest_paths (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, DistanceMap distance, WeightMap weight, ColorMap color, PredecessorMap pred, DijkstraVisitor vis, Compare compare, Combine combine, DistInf inf, DistZero zero)
template<class VertexListGraph , class Param , class Tag , class Rest >
void	dag_shortest_paths (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, const bgl_named_params< Param, Tag, Rest > &params)
template<typename Graph >
influence_measure< Graph >	measure_influence (const Graph &)
template<typename Graph >
prestige_measure< Graph >	measure_prestige (const Graph &)
template<typename Graph , typename Vertex , typename Measure >
Measure::degree_type	degree_centrality (const Graph &g, Vertex v, Measure measure)
template<typename Graph , typename Vertex >
graph_traits< Graph > ::degree_size_type	degree_centrality (const Graph &g, Vertex v)
template<typename Graph , typename Vertex >
graph_traits< Graph > ::degree_size_type	influence (const Graph &g, Vertex v)
template<typename Graph , typename Vertex >
graph_traits< Graph > ::degree_size_type	prestige (const Graph &g, Vertex v)
template<typename Graph , typename CentralityMap , typename Measure >
void	all_degree_centralities (const Graph &g, CentralityMap cent, Measure measure)
template<typename Graph , typename CentralityMap >
void	all_degree_centralities (const Graph &g, CentralityMap cent)
template<typename Graph , typename CentralityMap >
void	all_influence_values (const Graph &g, CentralityMap cent)
template<typename Graph , typename CentralityMap >
void	all_prestige_values (const Graph &g, CentralityMap cent)
template<class VertexListGraph , class DFSVisitor , class ColorMap >
void	depth_first_search (const VertexListGraph &g, DFSVisitor vis, ColorMap color, typename graph_traits< VertexListGraph >::vertex_descriptor start_vertex)
template<class VertexListGraph , class DFSVisitor , class ColorMap >
void	depth_first_search (const VertexListGraph &g, DFSVisitor vis, ColorMap color)
template<class Visitors >
dfs_visitor< Visitors >	make_dfs_visitor (Visitors vis)
template<class IncidenceGraph , class DFSVisitor , class ColorMap >
void	depth_first_visit (const IncidenceGraph &g, typename graph_traits< IncidenceGraph >::vertex_descriptor u, DFSVisitor vis, ColorMap color)
template<class IncidenceGraph , class DFSVisitor , class ColorMap , class TerminatorFunc >
void	depth_first_visit (const IncidenceGraph &g, typename graph_traits< IncidenceGraph >::vertex_descriptor u, DFSVisitor vis, ColorMap color, TerminatorFunc func=TerminatorFunc())
template<typename Buffer , typename Vertex , typename DistanceType >
void	dijkstra_queue_update (Buffer &Q, Vertex vertex, DistanceType old_distance)
	Updates a particular value in a queue used by Dijkstra's algorithm. More...
template<class Visitors >
dijkstra_visitor< Visitors >	make_dijkstra_visitor (Visitors vis)
template<class Graph , class SourceInputIter , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistZero >
void	dijkstra_shortest_paths_no_init (const Graph &g, SourceInputIter s_begin, SourceInputIter s_end, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, DistZero zero, DijkstraVisitor vis)
template<class Graph , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistZero >
void	dijkstra_shortest_paths_no_init (const Graph &g, typename graph_traits< Graph >::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, DistZero zero, DijkstraVisitor vis)
template<class Graph , class SourceInputIter , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistZero , class ColorMap >
void	dijkstra_shortest_paths_no_init (const Graph &g, SourceInputIter s_begin, SourceInputIter s_end, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, DistZero zero, DijkstraVisitor vis, ColorMap color)
template<class Graph , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistZero , class ColorMap >
void	dijkstra_shortest_paths_no_init (const Graph &g, typename graph_traits< Graph >::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, DistZero zero, DijkstraVisitor vis, ColorMap color)
template<class VertexListGraph , class SourceInputIter , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistInf , class DistZero , typename T , typename Tag , typename Base >
void	dijkstra_shortest_paths (const VertexListGraph &g, SourceInputIter s_begin, SourceInputIter s_end, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, DistInf inf, DistZero zero, DijkstraVisitor vis, const bgl_named_params< T, Tag, Base > &BOOST_GRAPH_ENABLE_IF_MODELS_PARM(VertexListGraph, vertex_list_graph_tag))
template<class VertexListGraph , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistInf , class DistZero , typename T , typename Tag , typename Base >
void	dijkstra_shortest_paths (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, DistInf inf, DistZero zero, DijkstraVisitor vis, const bgl_named_params< T, Tag, Base > &BOOST_GRAPH_ENABLE_IF_MODELS_PARM(VertexListGraph, vertex_list_graph_tag))
template<class VertexListGraph , class SourceInputIter , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistInf , class DistZero , class ColorMap >
void	dijkstra_shortest_paths (const VertexListGraph &g, SourceInputIter s_begin, SourceInputIter s_end, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, DistInf inf, DistZero zero, DijkstraVisitor vis, ColorMap color)
template<class VertexListGraph , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistInf , class DistZero , class ColorMap >
void	dijkstra_shortest_paths (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, DistInf inf, DistZero zero, DijkstraVisitor vis, ColorMap color)
template<class VertexListGraph , class SourceInputIter , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistInf , class DistZero >
void	dijkstra_shortest_paths (const VertexListGraph &g, SourceInputIter s_begin, SourceInputIter s_end, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, DistInf inf, DistZero zero, DijkstraVisitor vis)
template<class VertexListGraph , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistInf , class DistZero >
void	dijkstra_shortest_paths (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, DistInf inf, DistZero zero, DijkstraVisitor vis)
template<class VertexListGraph , class Param , class Tag , class Rest >
void	dijkstra_shortest_paths (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, const bgl_named_params< Param, Tag, Rest > &params)
template<typename Graph , typename DijkstraVisitor , typename PredecessorMap , typename DistanceMap , typename WeightMap , typename VertexIndexMap , typename DistanceCompare , typename DistanceWeightCombine , typename DistanceInfinity , typename DistanceZero >
void	dijkstra_shortest_paths_no_color_map_no_init (const Graph &graph, typename graph_traits< Graph >::vertex_descriptor start_vertex, PredecessorMap predecessor_map, DistanceMap distance_map, WeightMap weight_map, VertexIndexMap index_map, DistanceCompare distance_compare, DistanceWeightCombine distance_weight_combine, DistanceInfinity distance_infinity, DistanceZero distance_zero, DijkstraVisitor visitor)
template<typename Graph , typename DijkstraVisitor , typename PredecessorMap , typename DistanceMap , typename WeightMap , typename VertexIndexMap , typename DistanceCompare , typename DistanceWeightCombine , typename DistanceInfinity , typename DistanceZero >
void	dijkstra_shortest_paths_no_color_map (const Graph &graph, typename graph_traits< Graph >::vertex_descriptor start_vertex, PredecessorMap predecessor_map, DistanceMap distance_map, WeightMap weight_map, VertexIndexMap index_map, DistanceCompare distance_compare, DistanceWeightCombine distance_weight_combine, DistanceInfinity distance_infinity, DistanceZero distance_zero, DijkstraVisitor visitor)
template<typename Graph , typename Param , typename Tag , typename Rest >
void	dijkstra_shortest_paths_no_color_map (const Graph &graph, typename graph_traits< Graph >::vertex_descriptor start_vertex, const bgl_named_params< Param, Tag, Rest > &params)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::vertex_descriptor	source (typename directed_graph< VP, EP, GP >::edge_descriptor e, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::vertex_descriptor	target (typename directed_graph< VP, EP, GP >::edge_descriptor e, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::degree_size_type	out_degree (typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
std::pair< typename directed_graph< VP, EP, GP > ::out_edge_iterator, typename directed_graph< VP, EP, GP > ::out_edge_iterator >	out_edges (typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::degree_size_type	in_degree (typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
std::pair< typename directed_graph< VP, EP, GP > ::in_edge_iterator, typename directed_graph< VP, EP, GP > ::in_edge_iterator >	in_edges (typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::degree_size_type	degree (typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
std::pair< typename directed_graph< VP, EP, GP > ::adjacency_iterator, typename directed_graph< VP, EP, GP > ::adjacency_iterator >	adjacent_vertices (typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::vertex_descriptor	vertex (typename directed_graph< VP, EP, GP >::vertices_size_type n, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
std::pair< typename directed_graph< VP, EP, GP > ::edge_descriptor, bool >	edge (typename directed_graph< VP, EP, GP >::vertex_descriptor u, typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::vertices_size_type	num_vertices (directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
std::pair< typename directed_graph< VP, EP, GP > ::vertex_iterator, typename directed_graph< VP, EP, GP > ::vertex_iterator >	vertices (directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::edges_size_type	num_edges (directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
std::pair< typename directed_graph< VP, EP, GP > ::edge_iterator, typename directed_graph< VP, EP, GP > ::edge_iterator >	edges (directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::vertex_descriptor	add_vertex (directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::vertex_descriptor	add_vertex (typename directed_graph< VP, EP, GP >::vertex_property_type const &p, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	clear_vertex (typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	remove_vertex (typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
std::pair< typename directed_graph< VP, EP, GP > ::edge_descriptor, bool >	add_edge (typename directed_graph< VP, EP, GP >::vertex_descriptor u, typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
std::pair< typename directed_graph< VP, EP, GP > ::edge_descriptor, bool >	add_edge (typename directed_graph< VP, EP, GP >::vertex_descriptor u, typename directed_graph< VP, EP, GP >::vertex_descriptor v, typename directed_graph< VP, EP, GP >::edge_property_type const &p, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	remove_edge (typename directed_graph< VP, EP, GP >::vertex_descriptor u, typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	remove_edge (typename directed_graph< VP, EP, GP >::edge_descriptor e, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	remove_edge (typename directed_graph< VP, EP, GP >::edge_iterator i, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP , class Predicate >
void	remove_edge_if (Predicate pred, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP , class Predicate >
void	remove_out_edge_if (typename directed_graph< VP, EP, GP >::vertex_descriptor v, Predicate pred, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP , class Predicate >
void	remove_in_edge_if (typename directed_graph< VP, EP, GP >::vertex_descriptor v, Predicate pred, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP , typename Property >
property_map< directed_graph < VP, EP, GP >, Property > ::type	get (Property p, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP , typename Property >
property_map< directed_graph < VP, EP, GP >, Property > ::const_type	get (Property p, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
property_map< directed_graph < VP, EP, GP >, vertex_all_t > ::type	get (vertex_all_t, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
property_map< directed_graph < VP, EP, GP >, vertex_all_t > ::const_type	get (vertex_all_t, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
property_map< directed_graph < VP, EP, GP >, edge_all_t > ::type	get (edge_all_t, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
property_map< directed_graph < VP, EP, GP >, edge_all_t > ::const_type	get (edge_all_t, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP , typename Property , typename Key >
property_traits< typename property_map< typename directed_graph< VP, EP, GP > ::graph_type, Property > ::const_type >::value_type	get (Property p, directed_graph< VP, EP, GP > const &g, Key const &k)
template<typename VP , typename EP , typename GP , typename Key >
property_traits< typename property_map< typename directed_graph< VP, EP, GP > ::graph_type, vertex_all_t > ::const_type >::value_type	get (vertex_all_t, directed_graph< VP, EP, GP > const &g, Key const &k)
template<typename VP , typename EP , typename GP , typename Key >
property_traits< typename property_map< typename directed_graph< VP, EP, GP > ::graph_type, edge_all_t > ::const_type >::value_type	get (edge_all_t, directed_graph< VP, EP, GP > const &g, Key const &k)
template<typename VP , typename EP , typename GP , typename Property , typename Key , typename Value >
void	put (Property p, directed_graph< VP, EP, GP > &g, Key const &k, Value const &v)
template<typename VP , typename EP , typename GP , typename Key , typename Value >
void	put (vertex_all_t, directed_graph< VP, EP, GP > &g, Key const &k, Value const &v)
template<typename VP , typename EP , typename GP , typename Key , typename Value >
void	put (edge_all_t, directed_graph< VP, EP, GP > &g, Key const &k, Value const &v)
template<typename VP , typename EP , typename GP , class Property >
graph_property< directed_graph < VP, EP, GP >, Property > ::type &	get_property (directed_graph< VP, EP, GP > &g, Property p)
template<typename VP , typename EP , typename GP , class Property >
graph_property< directed_graph < VP, EP, GP >, Property > ::type const &	get_property (directed_graph< VP, EP, GP > const &g, Property p)
template<typename VP , typename EP , typename GP , class Property , class Value >
void	set_property (directed_graph< VP, EP, GP > &g, Property p, Value v)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::vertex_index_type	get_vertex_index (typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::vertex_index_type	max_vertex_index (directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
void	renumber_vertex_indices (directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	remove_vertex_and_renumber_indices (typename directed_graph< VP, EP, GP >::vertex_iterator i, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::edge_index_type	get_edge_index (typename directed_graph< VP, EP, GP >::edge_descriptor v, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::edge_index_type	max_edge_index (directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
void	renumber_edge_indices (directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	remove_edge_and_renumber_indices (typename directed_graph< VP, EP, GP >::edge_iterator i, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	renumber_indices (directed_graph< VP, EP, GP > &g)
	BOOST_INSTALL_PROPERTY (edge, target_processor_id)
	BOOST_INSTALL_PROPERTY (edge, locally_owned)
	BOOST_INSTALL_PROPERTY (vertex, in_edges)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
std::pair< typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_iterator, typename adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > ::vertex_iterator >	vertices (const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
	Returns the set of vertices local to this processor. More...
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > ::vertices_size_type	num_vertices (const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
	Returns the number of vertices local to this processor. More...
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename Edge >
adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	source (const detail::parallel::edge_descriptor< Edge > &e, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
	Returns the source of edge. More...
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename Edge >
adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	target (const detail::parallel::edge_descriptor< Edge > &e, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
	Returns the target of edge. More...
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
std::pair< typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::out_edge_iterator, typename adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > ::out_edge_iterator >	out_edges (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor v, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
	Return the set of edges outgoing from a particular vertex. More...
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::degree_size_type	out_degree (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor v, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
	Return the number of edges outgoing from a particular vertex. More...
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
std::pair< typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > ::in_edge_iterator, typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > ::in_edge_iterator >	in_edges (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor v, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
	Returns the set of edges incoming to a particular vertex. More...
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
std::pair< typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::in_edge_iterator, typename adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > ::in_edge_iterator >	in_edges (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor v, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > ::degree_size_type	in_degree (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor v, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
	Returns the number of edges incoming to a particular vertex. More...
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::degree_size_type	in_degree (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor v, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::degree_size_type	degree (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor v, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
	Returns the number of edges incident on the given vertex. More...
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > ::degree_size_type	degree (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor v, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::edges_size_type	num_edges (const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::edges_size_type	num_edges (const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
std::pair< typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::edge_iterator, typename adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > ::edge_iterator >	edges (const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
std::pair< typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::edge_iterator, typename adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > ::edge_iterator >	edges (const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	vertex (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertices_size_type n, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
std::pair< typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , directedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::edge_descriptor, bool >	edge (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, directedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor u, typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, directedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor v, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, directedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
std::pair< typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::edge_descriptor, bool >	edge (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor u, typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor v, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
std::pair< typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > ::adjacency_iterator, typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > ::adjacency_iterator >	adjacent_vertices (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor v, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::lazy_add_edge	add_edge (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor u, typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor v, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > ::lazy_add_edge_with_property	add_edge (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor u, typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor v, typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::edge_property_type const &p, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
void	remove_edge (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::edge_descriptor e, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
void	remove_edge (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor u, typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor v, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
void	remove_edge (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::out_edge_iterator ei, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
void	remove_edge (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, directedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::out_edge_iterator ei, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, directedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename Predicate >
void	remove_out_edge_if (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor u, Predicate predicate, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename Predicate >
void	remove_in_edge_if (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor u, Predicate predicate, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename Predicate >
void	remove_in_edge_if (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor u, Predicate predicate, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename Predicate >
void	remove_edge_if (Predicate predicate, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, directedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename Predicate >
void	remove_edge_if (Predicate predicate, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename Predicate >
void	remove_edge_if (Predicate predicate, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
void	clear_vertex (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor u, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
void	clear_vertex (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor u, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
void	clear_out_edges (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, directedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor u, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, directedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
void	clear_out_edges (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor u, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
void	clear_in_edges (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor u, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	add_vertex (adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > ::lazy_add_vertex_with_property	add_vertex (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_property_type const &p, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
void	remove_vertex (typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor u, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename Property , typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
property_map< adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > , Property >::type	get (Property p, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename Property , typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
property_map< adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > , Property >::const_type	get (Property p, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
property_map< adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > , vertex_local_index_t >::type	get (vertex_local_index_t, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
property_map< adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > , vertex_local_index_t > ::const_type	get (vertex_local_index_t, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
property_map< adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > , vertex_global_t > ::const_type	get (vertex_global_t, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
property_map< adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > , vertex_global_t > ::const_type	get (vertex_global_t, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
property_map< adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > , vertex_owner_t >::type	get (vertex_owner_t, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
	Retrieve a property map mapping from a vertex descriptor to its owner. More...
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
property_map< adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > , vertex_owner_t >::const_type	get (vertex_owner_t, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
	Retrieve a property map mapping from a vertex descriptor to its owner. More...
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
processor_id_type	get (vertex_owner_t, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &, typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor v)
	Retrieve the owner of a vertex. More...
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
processor_id_type	get (vertex_owner_t, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &, typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor v)
	Retrieve the owner of a vertex. More...
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
property_map< adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > , vertex_local_t >::type	get (vertex_local_t, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
	Retrieve a property map that maps from a vertex descriptor to its local descriptor. More...
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
property_map< adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > , vertex_local_t >::const_type	get (vertex_local_t, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
	Retrieve a property map that maps from a vertex descriptor to its local descriptor. More...
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > ::local_vertex_descriptor	get (vertex_local_t, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &, typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor v)
	Retrieve the local descriptor of a vertex. More...
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution > , DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > ::local_vertex_descriptor	get (vertex_local_t, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &, typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor v)
	Retrieve the local descriptor of a vertex. More...
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
property_map< adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > , edge_global_t >::const_type	get (edge_global_t, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
property_map< adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > , edge_global_t >::const_type	get (edge_global_t, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
property_map< adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > , edge_owner_t >::type	get (edge_owner_t, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
property_map< adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > , edge_owner_t >::const_type	get (edge_owner_t, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
property_map< adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > , edge_local_t >::type	get (edge_local_t, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
property_map< adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > , edge_local_t >::const_type	get (edge_local_t, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename Property , typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename Key >
property_traits< typename property_map< adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > , Property >::const_type > ::value_type	get (Property p, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g, const Key &key)
template<typename Property , typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename Key , typename Value >
void	put (Property p, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g, const Key &key, const Value &v)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
property_map< adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > , vertex_index_t >::type	get (vertex_index_t vi, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
property_map< adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > , vertex_index_t >::const_type	get (vertex_index_t vi, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename T , typename Bundle >
property_map< adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >, T Bundle::* >::type	get (T Bundle::*p, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename T , typename Bundle >
property_map< adjacency_list < OutEdgeListS, distributedS < ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >, T Bundle::* >::const_type	get (T Bundle::*p, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
void	synchronize (const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >
ProcessGroup	process_group (const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &g)
template<typename OwnerMap , typename Tuple >
get_owner_of_first_tuple_element < OwnerMap, Tuple > ::owner_type	get (get_owner_of_first_tuple_element< OwnerMap, Tuple > o, Tuple t)
template<typename OwnerMap , typename Vertex , typename T >
get_owner_of_first_pair_element < OwnerMap >::owner_type	get (get_owner_of_first_pair_element< OwnerMap > o, std::pair< Vertex, T > p)
template<typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename IncomingMap , typename DistanceMap , typename DependencyMap , typename PathCountMap , typename VertexIndexMap , typename Buffer >
void	brandes_betweenness_centrality (const Graph &g, CentralityMap centrality, EdgeCentralityMap edge_centrality_map, IncomingMap incoming, DistanceMap distance, DependencyMap dependency, PathCountMap path_count, VertexIndexMap vertex_index, Buffer sources, typename property_traits< DistanceMap >::value_type delta BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, distributed_graph_tag))
template<typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename IncomingMap , typename DistanceMap , typename DependencyMap , typename PathCountMap , typename VertexIndexMap , typename WeightMap , typename Buffer >
void	brandes_betweenness_centrality (const Graph &g, CentralityMap centrality, EdgeCentralityMap edge_centrality_map, IncomingMap incoming, DistanceMap distance, DependencyMap dependency, PathCountMap path_count, VertexIndexMap vertex_index, Buffer sources, typename property_traits< WeightMap >::value_type delta, WeightMap weight_map BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, distributed_graph_tag))
template<typename Graph , typename Param , typename Tag , typename Rest >
void	brandes_betweenness_centrality (const Graph &g, const bgl_named_params< Param, Tag, Rest > &params BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, distributed_graph_tag))
template<typename Graph , typename CentralityMap >
void	brandes_betweenness_centrality (const Graph &g, CentralityMap centrality BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, distributed_graph_tag))
template<typename Graph , typename CentralityMap , typename EdgeCentralityMap >
void	brandes_betweenness_centrality (const Graph &g, CentralityMap centrality, EdgeCentralityMap edge_centrality_map BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, distributed_graph_tag))
template<typename ProcessGroup , typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename IncomingMap , typename DistanceMap , typename DependencyMap , typename PathCountMap , typename VertexIndexMap , typename Buffer >
void	non_distributed_brandes_betweenness_centrality (const ProcessGroup &pg, const Graph &g, CentralityMap centrality, EdgeCentralityMap edge_centrality_map, IncomingMap incoming, DistanceMap distance, DependencyMap dependency, PathCountMap path_count, VertexIndexMap vertex_index, Buffer sources)
template<typename ProcessGroup , typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename IncomingMap , typename DistanceMap , typename DependencyMap , typename PathCountMap , typename VertexIndexMap , typename WeightMap , typename Buffer >
void	non_distributed_brandes_betweenness_centrality (const ProcessGroup &pg, const Graph &g, CentralityMap centrality, EdgeCentralityMap edge_centrality_map, IncomingMap incoming, DistanceMap distance, DependencyMap dependency, PathCountMap path_count, VertexIndexMap vertex_index, WeightMap weight_map, Buffer sources)
template<typename ProcessGroup , typename Graph , typename Param , typename Tag , typename Rest >
void	non_distributed_brandes_betweenness_centrality (const ProcessGroup &pg, const Graph &g, const bgl_named_params< Param, Tag, Rest > &params)
template<typename ProcessGroup , typename Graph , typename CentralityMap >
void	non_distributed_brandes_betweenness_centrality (const ProcessGroup &pg, const Graph &g, CentralityMap centrality)
template<typename ProcessGroup , typename Graph , typename CentralityMap , typename Buffer >
void	non_distributed_brandes_betweenness_centrality (const ProcessGroup &pg, const Graph &g, CentralityMap centrality, Buffer sources)
template<typename ProcessGroup , typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename Buffer >
void	non_distributed_brandes_betweenness_centrality (const ProcessGroup &pg, const Graph &g, CentralityMap centrality, EdgeCentralityMap edge_centrality_map, Buffer sources)
template<typename Graph , typename CentralityMap >
property_traits< CentralityMap > ::value_type	central_point_dominance (const Graph &g, CentralityMap centrality BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, distributed_graph_tag))
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::vertex_descriptor	source (typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::edge_descriptor e, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::vertex_descriptor	target (typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::edge_descriptor e, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
std::pair< typename compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::out_edge_iterator, typename compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::out_edge_iterator >	out_edges (typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor u, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::degree_size_type	out_degree (typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor u, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
void	synchronize (const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
ProcessGroup	process_group (const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
std::pair< typename compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::adjacency_iterator, typename compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::adjacency_iterator >	adjacent_vertices (typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor u, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::degree_size_type	num_vertices (const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
std::pair< typename compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::vertex_iterator, typename compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::vertex_iterator >	vertices (const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::edges_size_type	num_edges (const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
std::pair< typename compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex >::edge_iterator, typename compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex >::edge_iterator >	edges (const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename IndexIterator , typename Distribution , typename Graph >
boost::transform_iterator < index_to_vertex_func < Distribution, Graph > , IndexIterator >	make_index_to_vertex_iterator (IndexIterator it, const Distribution &dist, const Graph &g)
template<typename ProcessID , typename Key >
std::pair< ProcessID, Key >	get (csr_vertex_global_map< ProcessID, Key >, typename csr_vertex_global_map< ProcessID, Key >::key_type k)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
property_map < compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > , vertex_global_t >::type	get (vertex_global_t, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
std::pair< typename ProcessGroup::process_id_type, typename compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::vertex_descriptor >	get (vertex_global_t, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor k)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
property_map < compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > , vertex_global_t > ::const_type	get (vertex_global_t, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
std::pair< typename ProcessGroup::process_id_type, typename compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::vertex_descriptor >	get (vertex_global_t, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor k)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::vertex_descriptor	vertex (typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertices_size_type i, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
std::pair< typename compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::out_edge_iterator, typename compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::out_edge_iterator >	edge_range (typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor i, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor j, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
std::pair< typename compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::edge_descriptor, bool >	edge (typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor i, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor j, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename ProcessID , typename Key >
ProcessID	get (csr_vertex_owner_map< ProcessID, Key > pm, typename csr_vertex_owner_map< ProcessID, Key >::key_type k)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
property_map < compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > , vertex_owner_t >::type	get (vertex_owner_t, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
ProcessGroup::process_id_type	get (vertex_owner_t, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor k)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
property_map < compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > , vertex_owner_t >::const_type	get (vertex_owner_t, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
ProcessGroup::process_id_type	get (vertex_owner_t, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor k)
template<typename Key >
Key	get (csr_vertex_local_map< Key > pm, typename csr_vertex_local_map< Key >::key_type k)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
property_map < compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > , vertex_local_t >::type	get (vertex_local_t, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::vertex_descriptor	get (vertex_local_t, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor k)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
property_map < compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > , vertex_local_t >::const_type	get (vertex_local_t, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::vertex_descriptor	get (vertex_local_t, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor k)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
property_map < compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > , vertex_index_t >::type	get (vertex_index_t, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::vertices_size_type	get (vertex_index_t, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor k)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
property_map < compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > , vertex_index_t >::const_type	get (vertex_index_t, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::vertices_size_type	get (vertex_index_t, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor k)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
property_map < compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > , vertex_local_index_t >::type	get (vertex_local_index_t, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::vertices_size_type	get (vertex_local_index_t, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor k)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
property_map < compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > , vertex_local_index_t > ::const_type	get (vertex_local_index_t, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::vertices_size_type	get (vertex_local_index_t, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor k)
template<typename ProcessID , typename Vertex , typename EdgeIndex >
std::pair< ProcessID, detail::csr_edge_descriptor < Vertex, EdgeIndex > >	get (csr_edge_global_map< ProcessID, Vertex, EdgeIndex > pm, typename csr_edge_global_map< ProcessID, Vertex, EdgeIndex >::key_type k)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
property_map < compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex >, edge_global_t > ::type	get (edge_global_t, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
std::pair< typename ProcessGroup::process_id_type, typename compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::base_type::edge_descriptor >	get (edge_global_t, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::edge_descriptor k)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
property_map < compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex >, edge_global_t > ::const_type	get (edge_global_t, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
std::pair< typename ProcessGroup::process_id_type, typename compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::base_type::edge_descriptor >	get (edge_global_t, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::edge_descriptor k)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
property_map < compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex >, edge_index_t > ::type	get (edge_index_t, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::edges_size_type	get (edge_index_t, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::edge_descriptor k)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
property_map < compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex >, edge_index_t > ::const_type	get (edge_index_t, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >
compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex > ::edges_size_type	get (edge_index_t, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::edge_descriptor k)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex , typename Tag >
property_map < compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex >, Tag >::type	get (Tag tag, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex , typename Tag >
property_map < compressed_sparse_row_graph < directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution > , InEdgeIndex >, Tag > ::const_type	get (Tag tag, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &g)
template<typename DistributedGraph , typename DFSVisitor >
void	depth_first_visit (const DistributedGraph &g, typename graph_traits< DistributedGraph >::vertex_descriptor s, DFSVisitor vis)
template<typename DistributedGraph , typename DijkstraVisitor , typename PredecessorMap , typename DistanceMap , typename WeightMap , typename IndexMap , typename Compare , typename Combine , typename DistInf , typename DistZero , typename T , typename Tag , typename Base >
void	dijkstra_shortest_paths (const DistributedGraph &g, typename graph_traits< DistributedGraph >::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, DistInf inf, DistZero zero, DijkstraVisitor vis, const bgl_named_params< T, Tag, Base > &params BOOST_GRAPH_ENABLE_IF_MODELS_PARM(DistributedGraph, distributed_graph_tag))
	Dijkstra's single-source shortest paths algorithm for distributed graphs. More...
template<typename Graph , typename EdgePredicate , typename VertexPredicate >
graph::parallel::process_group_type < Graph >::type	process_group (filtered_graph< Graph, EdgePredicate, VertexPredicate > const &g)
	Retrieve the process group from a filtered graph. More...
template<typename Graph , typename EdgePredicate , typename VertexPredicate >
graph_traits< Graph > ::vertex_descriptor	vertex (typename graph_traits< Graph >::vertices_size_type i, filtered_graph< Graph, EdgePredicate, VertexPredicate > const &g)
	Forward vertex() to vertex() of the base graph. More...
template<typename NumberMap >
paint_by_number_writer< NumberMap >	paint_by_number (NumberMap number)
template<typename Graph , typename VertexPropertiesWriter , typename EdgePropertiesWriter , typename GraphPropertiesWriter >
void	write_graphviz (std::ostream &out, const Graph &g, VertexPropertiesWriter vpw, EdgePropertiesWriter epw, GraphPropertiesWriter gpw BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, distributed_graph_tag))
template<typename Graph , typename VertexPropertiesWriter , typename EdgePropertiesWriter >
void	write_graphviz (std::ostream &out, const Graph &g, VertexPropertiesWriter vpw, EdgePropertiesWriter epw BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, distributed_graph_tag))
template<typename Graph , typename VertexPropertiesWriter >
void	write_graphviz (std::ostream &out, const Graph &g, VertexPropertiesWriter vpw BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, distributed_graph_tag))
template<typename Graph >
void	write_graphviz (std::ostream &out, const Graph &g BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, distributed_graph_tag))
template<typename Graph , typename VertexPropertiesWriter , typename EdgePropertiesWriter , typename GraphPropertiesWriter >
void	write_graphviz (const std::string &filename, const Graph &g, VertexPropertiesWriter vpw, EdgePropertiesWriter epw, GraphPropertiesWriter gpw BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, distributed_graph_tag))
template<typename Graph , typename VertexPropertiesWriter , typename EdgePropertiesWriter >
void	write_graphviz (const std::string &filename, const Graph &g, VertexPropertiesWriter vpw, EdgePropertiesWriter epw BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, distributed_graph_tag))
template<typename Graph , typename VertexPropertiesWriter >
void	write_graphviz (const std::string &filename, const Graph &g, VertexPropertiesWriter vpw BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, distributed_graph_tag))
template<typename Graph >
void	write_graphviz (const std::string &filename, const Graph &g BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, distributed_graph_tag))
template<typename Graph >
void	write_graphviz (std::ostream &out, const Graph &g, const dynamic_properties &dp, const std::string &node_id="node_id"BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, distributed_graph_tag))
template<typename PropertyTag , typename DistributedGraph >
property_map< local_subgraph < DistributedGraph > , PropertyTag >::type	get (PropertyTag p, local_subgraph< DistributedGraph > &g)
template<typename PropertyTag , typename DistributedGraph >
property_map< local_subgraph < DistributedGraph > , PropertyTag >::const_type	get (PropertyTag p, const local_subgraph< DistributedGraph > &g)
template<typename DistributedGraph >
local_subgraph< DistributedGraph >	make_local_subgraph (DistributedGraph &g)
template<typename ProcessGroup , typename GlobalMap , typename StorageMap >
one_bit_color_type	get (one_bit_color_map< local_property_map< ProcessGroup, GlobalMap, StorageMap > > const &pm, typename property_traits< GlobalMap >::key_type key)
template<typename ProcessGroup , typename GlobalMap , typename StorageMap >
void	put (one_bit_color_map< local_property_map< ProcessGroup, GlobalMap, StorageMap > > const &pm, typename property_traits< GlobalMap >::key_type key, one_bit_color_type value)
template<typename ProcessGroup , typename GlobalMap , typename StorageMap >
one_bit_color_type	get (one_bit_color_map< parallel::distributed_property_map< ProcessGroup, GlobalMap, one_bit_color_map< StorageMap > > > const &pm, typename property_traits< GlobalMap >::key_type key)
template<typename ProcessGroup , typename GlobalMap , typename StorageMap >
void	put (one_bit_color_map< parallel::distributed_property_map< ProcessGroup, GlobalMap, one_bit_color_map< StorageMap > > > const &pm, typename property_traits< GlobalMap >::key_type key, one_bit_color_type value)
template<typename Graph , typename GraphRef >
graph::parallel::process_group_type < Graph >::type	process_group (reverse_graph< Graph, GraphRef > const &g)
	Retrieve the process group from a reverse graph. More...
template<class Graph , class ComponentMap , class P , class T , class R >
property_traits< ComponentMap > ::value_type	strong_components (const Graph &g, ComponentMap comp, const bgl_named_params< P, T, R > &BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, distributed_graph_tag))
template<class Graph , class ComponentMap >
property_traits< ComponentMap > ::value_type	strong_components (const Graph &g, ComponentMap comp BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, distributed_graph_tag))
template<typename ProcessGroup , typename GlobalMap , typename StorageMap >
two_bit_color_type	get (two_bit_color_map< local_property_map< ProcessGroup, GlobalMap, StorageMap > > const &pm, typename property_traits< GlobalMap >::key_type key)
template<typename ProcessGroup , typename GlobalMap , typename StorageMap >
void	put (two_bit_color_map< local_property_map< ProcessGroup, GlobalMap, StorageMap > > const &pm, typename property_traits< GlobalMap >::key_type key, two_bit_color_type value)
template<typename ProcessGroup , typename GlobalMap , typename StorageMap >
two_bit_color_type	get (two_bit_color_map< parallel::distributed_property_map< ProcessGroup, GlobalMap, two_bit_color_map< StorageMap > > > const &pm, typename property_traits< GlobalMap >::key_type key)
template<typename ProcessGroup , typename GlobalMap , typename StorageMap >
void	put (two_bit_color_map< parallel::distributed_property_map< ProcessGroup, GlobalMap, two_bit_color_map< StorageMap > > > const &pm, typename property_traits< GlobalMap >::key_type key, two_bit_color_type value)
template<class Graph , class IndexMap , class TimeMap , class PredMap , class VertexVector , class DomTreePredMap >
void	lengauer_tarjan_dominator_tree_without_dfs (const Graph &g, const typename graph_traits< Graph >::vertex_descriptor &entry, const IndexMap &, TimeMap dfnumMap, PredMap parentMap, VertexVector &verticesByDFNum, DomTreePredMap domTreePredMap)
	Build dominator tree using Lengauer-Tarjan algorithm. More...
template<class Graph , class IndexMap , class TimeMap , class PredMap , class VertexVector , class DomTreePredMap >
void	lengauer_tarjan_dominator_tree (const Graph &g, const typename graph_traits< Graph >::vertex_descriptor &entry, const IndexMap &indexMap, TimeMap dfnumMap, PredMap parentMap, VertexVector &verticesByDFNum, DomTreePredMap domTreePredMap)
	Unlike lengauer_tarjan_dominator_tree_without_dfs, dfs is run in this function and the result is written to dfnumMap, parentMap, vertices. More...
template<class Graph , class DomTreePredMap >
void	lengauer_tarjan_dominator_tree (const Graph &g, const typename graph_traits< Graph >::vertex_descriptor &entry, DomTreePredMap domTreePredMap)
	Use vertex_index as IndexMap and make dfnumMap, parentMap, verticesByDFNum internally. More...
template<class Graph , class IndexMap , class DomTreePredMap >
void	iterative_bit_vector_dominator_tree (const Graph &g, const typename graph_traits< Graph >::vertex_descriptor &entry, const IndexMap &indexMap, DomTreePredMap domTreePredMap)
	Muchnick. More...
template<class Graph , class DomTreePredMap >
void	iterative_bit_vector_dominator_tree (const Graph &g, const typename graph_traits< Graph >::vertex_descriptor &entry, DomTreePredMap domTreePredMap)
template<typename Graph , typename DistanceMap , typename Combinator >
property_traits< DistanceMap > ::value_type	eccentricity (const Graph &g, DistanceMap dist, Combinator combine)
template<typename Graph , typename DistanceMap >
property_traits< DistanceMap > ::value_type	eccentricity (const Graph &g, DistanceMap dist)
template<typename Graph , typename DistanceMatrix , typename EccentricityMap >
std::pair< typename property_traits < EccentricityMap > ::value_type, typename property_traits < EccentricityMap > ::value_type >	all_eccentricities (const Graph &g, const DistanceMatrix &dist, EccentricityMap ecc)
template<typename Graph , typename EccentricityMap >
std::pair< typename property_traits < EccentricityMap > ::value_type, typename property_traits < EccentricityMap > ::value_type >	radius_and_diameter (const Graph &g, EccentricityMap ecc)
template<typename Graph , typename EccentricityMap >
property_traits < EccentricityMap > ::value_type	radius (const Graph &g, EccentricityMap ecc)
template<typename Graph , typename EccentricityMap >
property_traits < EccentricityMap > ::value_type	diameter (const Graph &g, EccentricityMap ecc)
template<typename Graph , typename ColorMap >
boost::property_traits < ColorMap >::value_type	color_edge (const Graph &g, ColorMap color, typename boost::graph_traits< Graph >::edge_descriptor e)
template<typename Graph , typename ColorMap >
boost::property_traits < ColorMap >::value_type	edge_coloring (const Graph &g, ColorMap color)
template<class VertexListGraph , class OutputIterator >
graph_traits< VertexListGraph > ::degree_size_type	edge_connectivity (VertexListGraph &g, OutputIterator disconnecting_set)
template<class G , class EI , class T , class D >
std::pair< typename edge_list_impl< G, EI, T, D > ::edge_iterator, typename edge_list_impl< G, EI, T, D > ::edge_iterator >	edges (const edge_list_impl< G, EI, T, D > &g_)
template<class G , class EI , class T , class D >
edge_list_impl< G, EI, T, D > ::vertex_descriptor	source (typename edge_list_impl< G, EI, T, D >::edge_descriptor e, const edge_list_impl< G, EI, T, D > &)
template<class G , class EI , class T , class D >
edge_list_impl< G, EI, T, D > ::vertex_descriptor	target (typename edge_list_impl< G, EI, T, D >::edge_descriptor e, const edge_list_impl< G, EI, T, D > &)
template<class G , class EI , class T , class D >
property_map< edge_list_impl < G, EI, T, D >, edge_index_t > ::type	get (edge_index_t, const edge_list_impl< G, EI, T, D > &)
template<class G , class EI , class T , class D >
D	get (edge_index_t, const edge_list_impl< G, EI, T, D > &, typename edge_list_impl< G, EI, T, D >::edge_descriptor e)
template<class G , class EI , class T , class D >
std::pair< typename edge_list_impl_ra< G, EI, T, D > ::edge_iterator, typename edge_list_impl_ra< G, EI, T, D > ::edge_iterator >	edges (const edge_list_impl_ra< G, EI, T, D > &g_)
template<class G , class EI , class T , class D >
edge_list_impl_ra< G, EI, T, D > ::vertex_descriptor	source (typename edge_list_impl_ra< G, EI, T, D >::edge_descriptor e, const edge_list_impl_ra< G, EI, T, D > &g_)
template<class G , class EI , class T , class D >
edge_list_impl_ra< G, EI, T, D > ::vertex_descriptor	target (typename edge_list_impl_ra< G, EI, T, D >::edge_descriptor e, const edge_list_impl_ra< G, EI, T, D > &g_)
template<class G , class EI , class T , class D >
property_map < edge_list_impl_ra< G, EI, T, D >, edge_index_t >::type	get (edge_index_t, const edge_list_impl_ra< G, EI, T, D > &)
template<class G , class EI , class T , class D >
D	get (edge_index_t, const edge_list_impl_ra< G, EI, T, D > &, typename edge_list_impl_ra< G, EI, T, D >::edge_descriptor e)
template<class EdgeIter , class T , class D , class Cat >
std::size_t	num_edges (const edge_list< EdgeIter, T, D, Cat > &el)
template<class EdgeIter >
edge_list< EdgeIter >	make_edge_list (EdgeIter first, EdgeIter last)
template<class Graph , class CapacityEdgeMap , class ResidualCapacityEdgeMap , class ReverseEdgeMap , class ColorMap , class PredEdgeMap >
property_traits < CapacityEdgeMap > ::value_type	edmonds_karp_max_flow (Graph &g, typename graph_traits< Graph >::vertex_descriptor src, typename graph_traits< Graph >::vertex_descriptor sink, CapacityEdgeMap cap, ResidualCapacityEdgeMap res, ReverseEdgeMap rev, ColorMap color, PredEdgeMap pred)
template<class Graph , class P , class T , class R >
detail::edge_capacity_value < Graph, P, T, R >::type	edmonds_karp_max_flow (Graph &g, typename graph_traits< Graph >::vertex_descriptor src, typename graph_traits< Graph >::vertex_descriptor sink, const bgl_named_params< P, T, R > &params)
template<class Graph >
property_traits< typename property_map< Graph, edge_capacity_t >::const_type > ::value_type	edmonds_karp_max_flow (Graph &g, typename graph_traits< Graph >::vertex_descriptor src, typename graph_traits< Graph >::vertex_descriptor sink)
template<typename Graph , typename EdgePredicate >
filtered_graph< Graph, EdgePredicate >	make_filtered_graph (Graph &g, EdgePredicate ep)
template<typename Graph , typename EdgePredicate , typename VertexPredicate >
filtered_graph< Graph, EdgePredicate, VertexPredicate >	make_filtered_graph (Graph &g, EdgePredicate ep, VertexPredicate vp)
template<typename Graph , typename EdgePredicate >
filtered_graph< const Graph, EdgePredicate >	make_filtered_graph (const Graph &g, EdgePredicate ep)
template<typename Graph , typename EdgePredicate , typename VertexPredicate >
filtered_graph< const Graph, EdgePredicate, VertexPredicate >	make_filtered_graph (const Graph &g, EdgePredicate ep, VertexPredicate vp)
template<typename G , typename EP , typename VP >
std::pair< typename filtered_graph< G, EP, VP > ::vertex_iterator, typename filtered_graph< G, EP, VP > ::vertex_iterator >	vertices (const filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP >
std::pair< typename filtered_graph< G, EP, VP > ::edge_iterator, typename filtered_graph< G, EP, VP > ::edge_iterator >	edges (const filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP >
filtered_graph< G, EP, VP > ::vertices_size_type	num_vertices (const filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP >
filtered_graph< G, EP, VP > ::edges_size_type	num_edges (const filtered_graph< G, EP, VP > &g)
template<typename G >
filtered_graph_base< G > ::vertex_descriptor	source (typename filtered_graph_base< G >::edge_descriptor e, const filtered_graph_base< G > &g)
template<typename G >
filtered_graph_base< G > ::vertex_descriptor	target (typename filtered_graph_base< G >::edge_descriptor e, const filtered_graph_base< G > &g)
template<typename G , typename EP , typename VP >
std::pair< typename filtered_graph< G, EP, VP > ::out_edge_iterator, typename filtered_graph< G, EP, VP > ::out_edge_iterator >	out_edges (typename filtered_graph< G, EP, VP >::vertex_descriptor u, const filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP >
filtered_graph< G, EP, VP > ::degree_size_type	out_degree (typename filtered_graph< G, EP, VP >::vertex_descriptor u, const filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP >
std::pair< typename filtered_graph< G, EP, VP > ::adjacency_iterator, typename filtered_graph< G, EP, VP > ::adjacency_iterator >	adjacent_vertices (typename filtered_graph< G, EP, VP >::vertex_descriptor u, const filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP >
std::pair< typename filtered_graph< G, EP, VP > ::in_edge_iterator, typename filtered_graph< G, EP, VP > ::in_edge_iterator >	in_edges (typename filtered_graph< G, EP, VP >::vertex_descriptor u, const filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP >
filtered_graph< G, EP, VP > ::degree_size_type	in_degree (typename filtered_graph< G, EP, VP >::vertex_descriptor u, const filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP >
std::pair< typename filtered_graph< G, EP, VP > ::edge_descriptor, bool >	edge (typename filtered_graph< G, EP, VP >::vertex_descriptor u, typename filtered_graph< G, EP, VP >::vertex_descriptor v, const filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP >
std::pair< typename filtered_graph< G, EP, VP > ::out_edge_iterator, typename filtered_graph< G, EP, VP > ::out_edge_iterator >	edge_range (typename filtered_graph< G, EP, VP >::vertex_descriptor u, typename filtered_graph< G, EP, VP >::vertex_descriptor v, const filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP , typename Property >
property_map< G, Property >::type	get (Property p, filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP , typename Property >
property_map< G, Property > ::const_type	get (Property p, const filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP , typename Property , typename Key >
property_map_value< G, Property >::type	get (Property p, const filtered_graph< G, EP, VP > &g, const Key &k)
template<typename G , typename EP , typename VP , typename Property , typename Key , typename Value >
void	put (Property p, const filtered_graph< G, EP, VP > &g, const Key &k, const Value &val)
template<typename Graph , typename Set >
vertex_subset_filter< Graph, Set >::type	make_vertex_subset_filter (Graph &g, const Set &s)
template<typename Graph , typename Set >
vertex_subset_compliment_filter < Graph, Set >::type	make_vertex_subset_compliment_filter (Graph &g, const Set &s)
template<typename Graph , typename Set >
vertex_subset_complement_filter < Graph, Set >::type	make_vertex_subset_complement_filter (Graph &g, const Set &s)
template<class Graph , class Capacity , class ResidualCapacity , class Weight >
property_traits< typename property_map< Graph, edge_capacity_t >::type > ::value_type	find_flow_cost (const Graph &g, Capacity capacity, ResidualCapacity residual_capacity, Weight weight)
template<class Graph , class P , class T , class R >
property_traits< typename property_map< Graph, edge_capacity_t >::type > ::value_type	find_flow_cost (const Graph &g, const bgl_named_params< P, T, R > &params)
template<class Graph >
property_traits< typename property_map< Graph, edge_capacity_t >::type > ::value_type	find_flow_cost (const Graph &g)
template<typename VertexListGraph , typename DistanceMatrix , typename BinaryPredicate , typename BinaryFunction , typename Infinity , typename Zero >
bool	floyd_warshall_initialized_all_pairs_shortest_paths (const VertexListGraph &g, DistanceMatrix &d, const BinaryPredicate &compare, const BinaryFunction &combine, const Infinity &inf, const Zero &zero)
template<typename VertexAndEdgeListGraph , typename DistanceMatrix , typename WeightMap , typename BinaryPredicate , typename BinaryFunction , typename Infinity , typename Zero >
bool	floyd_warshall_all_pairs_shortest_paths (const VertexAndEdgeListGraph &g, DistanceMatrix &d, const WeightMap &w, const BinaryPredicate &compare, const BinaryFunction &combine, const Infinity &inf, const Zero &zero)
template<class VertexListGraph , class DistanceMatrix , class P , class T , class R >
bool	floyd_warshall_initialized_all_pairs_shortest_paths (const VertexListGraph &g, DistanceMatrix &d, const bgl_named_params< P, T, R > &params)
template<class VertexListGraph , class DistanceMatrix >
bool	floyd_warshall_initialized_all_pairs_shortest_paths (const VertexListGraph &g, DistanceMatrix &d)
template<class VertexAndEdgeListGraph , class DistanceMatrix , class P , class T , class R >
bool	floyd_warshall_all_pairs_shortest_paths (const VertexAndEdgeListGraph &g, DistanceMatrix &d, const bgl_named_params< P, T, R > &params)
template<class VertexAndEdgeListGraph , class DistanceMatrix >
bool	floyd_warshall_all_pairs_shortest_paths (const VertexAndEdgeListGraph &g, DistanceMatrix &d)
template<typename PositionMap , typename Topology , typename Graph >
grid_force_pairs< Topology, PositionMap >	make_grid_force_pairs (const Topology &topology, const PositionMap &position, const Graph &g)
template<typename Graph , typename PositionMap , typename Topology >
void	scale_graph (const Graph &g, PositionMap position, const Topology &topology, typename Topology::point_type upper_left, typename Topology::point_type lower_right)
template<typename Topology , typename Graph , typename PositionMap , typename AttractiveForce , typename RepulsiveForce , typename ForcePairs , typename Cooling , typename DisplacementMap >
void	fruchterman_reingold_force_directed_layout (const Graph &g, PositionMap position, const Topology &topology, AttractiveForce attractive_force, RepulsiveForce repulsive_force, ForcePairs force_pairs, Cooling cool, DisplacementMap displacement)
template<typename Topology , typename Graph , typename PositionMap , typename Param , typename Tag , typename Rest >
void	fruchterman_reingold_force_directed_layout (const Graph &g, PositionMap position, const Topology &topology, const bgl_named_params< Param, Tag, Rest > &params)
template<typename Topology , typename Graph , typename PositionMap >
void	fruchterman_reingold_force_directed_layout (const Graph &g, PositionMap position, const Topology &topology)
template<typename Graph , typename DistanceMap >
mean_geodesic_measure< Graph, typename property_traits < DistanceMap >::value_type, double >	measure_mean_geodesic (const Graph &, DistanceMap)
template<typename T , typename Graph , typename DistanceMap >
mean_geodesic_measure< Graph, typename property_traits < DistanceMap >::value_type, T >	measure_mean_geodesic (const Graph &, DistanceMap)
template<typename Graph , typename DistanceMap >
mean_graph_distance_measure < Graph, typename property_traits< DistanceMap > ::value_type >	measure_graph_mean_geodesic (const Graph &, DistanceMap)
template<typename Graph , typename DistanceMap , typename Measure , typename Combinator >
Measure::result_type	mean_geodesic (const Graph &g, DistanceMap dist, Measure measure, Combinator combine)
template<typename Graph , typename DistanceMap , typename Measure >
Measure::result_type	mean_geodesic (const Graph &g, DistanceMap dist, Measure measure)
template<typename Graph , typename DistanceMap >
double	mean_geodesic (const Graph &g, DistanceMap dist)
template<typename T , typename Graph , typename DistanceMap >
T	mean_geodesic (const Graph &g, DistanceMap dist)
template<typename Graph , typename DistanceMatrixMap , typename GeodesicMap , typename Measure >
property_traits< GeodesicMap > ::value_type	all_mean_geodesics (const Graph &g, DistanceMatrixMap dist, GeodesicMap geo, Measure measure)
template<typename Graph , typename DistanceMatrixMap , typename GeodesicMap >
property_traits< GeodesicMap > ::value_type	all_mean_geodesics (const Graph &g, DistanceMatrixMap dist, GeodesicMap geo)
template<typename Graph , typename GeodesicMap , typename Measure >
Measure::result_type	small_world_distance (const Graph &g, GeodesicMap geo, Measure measure)
template<typename Graph , typename GeodesicMap >
property_traits< GeodesicMap > ::value_type	small_world_distance (const Graph &g, GeodesicMap geo)
template<typename V , typename D , typename P , typename B >
V	source (const typename incidence_graph_archetype< V, D, P, B >::edge_descriptor &, const incidence_graph_archetype< V, D, P, B > &)
template<typename V , typename D , typename P , typename B >
V	target (const typename incidence_graph_archetype< V, D, P, B >::edge_descriptor &, const incidence_graph_archetype< V, D, P, B > &)
template<typename V , typename D , typename P , typename B >
std::pair< typename incidence_graph_archetype< V, D, P, B >::out_edge_iterator, typename incidence_graph_archetype< V, D, P, B >::out_edge_iterator >	out_edges (const V &, const incidence_graph_archetype< V, D, P, B > &)
template<typename V , typename D , typename P , typename B >
incidence_graph_archetype< V, D, P, B >::degree_size_type	out_degree (const V &, const incidence_graph_archetype< V, D, P, B > &)
template<typename V , typename D , typename P , typename B >
std::pair< typename adjacency_graph_archetype< V, D, P, B >::adjacency_iterator, typename adjacency_graph_archetype< V, D, P, B >::adjacency_iterator >	adjacent_vertices (const V &, const adjacency_graph_archetype< V, D, P, B > &)
template<typename V , typename D , typename P , typename B >
adjacency_graph_archetype< V, D, P, B >::degree_size_type	out_degree (const V &, const adjacency_graph_archetype< V, D, P, B > &)
template<typename V , typename D , typename P , typename B >
std::pair< typename vertex_list_graph_archetype< V, D, P, B >::vertex_iterator, typename vertex_list_graph_archetype< V, D, P, B >::vertex_iterator >	vertices (const vertex_list_graph_archetype< V, D, P, B > &)
template<typename V , typename D , typename P , typename B >
vertex_list_graph_archetype< V, D, P, B >::vertices_size_type	num_vertices (const vertex_list_graph_archetype< V, D, P, B > &)
template<typename V , typename D , typename P , typename B >
vertex_list_graph_archetype< V, D, P, B >::degree_size_type	out_degree (const V &, const vertex_list_graph_archetype< V, D, P, B > &)
template<typename G , typename P , typename V >
property_map < property_graph_archetype< G, P, V >, P >::type	get (P, property_graph_archetype< G, P, V > &)
template<typename G , typename P , typename V >
property_map < property_graph_archetype< G, P, V >, P >::const_type	get (P, const property_graph_archetype< G, P, V > &)
template<typename G , typename P , typename K , typename V >
property_traits< typename property_map < property_graph_archetype< G, P, V >, P >::const_type > ::value_type	get (P p, const property_graph_archetype< G, P, V > &g, K k)
template<typename G , typename P , typename V , typename Key >
void	put (P p, property_graph_archetype< G, P, V > &g, const Key &key, const V &value)
template<typename Graph , typename P , typename N , typename C , typename Property >
property_map< Graph, Property > ::type	get (Property p, graph_as_tree< Graph, P, N, C > &g)
template<typename Graph , typename P , typename N , typename C , typename Property >
property_map< Graph, Property > ::const_type	get (Property p, const graph_as_tree< Graph, P, N, C > &g)
template<typename Graph , typename P , typename N , typename C , typename Property , typename Key >
property_traits< typename property_map< Graph, Property > ::const_type >::value_type	get (Property p, const graph_as_tree< Graph, P, N, C > &g, const Key &k)
template<typename Graph , typename P , typename N , typename C , typename Property , typename Key , typename Value >
void	put (Property p, const graph_as_tree< Graph, P, N, C > &g, const Key &k, const Value &val)
template<class T >
T::ThereReallyIsNoMemberByThisNameInT	vertices (T const &)
template<typename Graph >
bool	is_directed (const Graph &)
	Return true if the given graph is directed. More...
template<typename Graph >
bool	is_undirected (const Graph &g)
	Return true if the given graph is undirected. More...
template<typename Graph >
bool	allows_parallel_edges (const Graph &)
template<class UndirectedGraph >
std::pair< typename graph_traits< UndirectedGraph > ::vertex_descriptor, typename graph_traits< UndirectedGraph > ::vertex_descriptor >	incident (typename graph_traits< UndirectedGraph >::edge_descriptor e, UndirectedGraph &g)
template<class Graph >
std::pair< typename graph_traits< Graph > ::out_edge_iterator, typename graph_traits< Graph > ::out_edge_iterator >	incident_edges (typename graph_traits< Graph >::vertex_descriptor u, Graph &g)
template<class Graph >
graph_traits< Graph > ::vertex_descriptor	opposite (typename graph_traits< Graph >::edge_descriptor e, typename graph_traits< Graph >::vertex_descriptor v, const Graph &g)
template<typename Vertex , typename Graph >
incident_from_predicate < Vertex, Graph >	incident_from (Vertex u, const Graph &g)
template<typename Vertex , typename Graph >
incident_to_predicate< Vertex, Graph >	incident_to (Vertex u, const Graph &g)
template<typename Vertex , typename Graph >
incident_on_predicate< Vertex, Graph >	incident_on (Vertex u, const Graph &g)
template<typename Vertex , typename Graph >
connects_predicate< Vertex, Graph >	connects (Vertex u, Vertex v, const Graph &g)
template<class IncidenceGraph , class Name >
void	print_in_edges (const IncidenceGraph &G, Name name)
template<class IncidenceGraph , class Name >
void	print_graph_dispatch (const IncidenceGraph &G, Name name, directed_tag)
template<class IncidenceGraph , class Name >
void	print_graph_dispatch (const IncidenceGraph &G, Name name, undirected_tag)
template<class IncidenceGraph , class Name >
void	print_graph (const IncidenceGraph &G, Name name)
template<class IncidenceGraph >
void	print_graph (const IncidenceGraph &G)
template<class EdgeListGraph , class Name >
void	print_edges (const EdgeListGraph &G, Name name)
template<class EdgeListGraph , class VertexName , class EdgeName >
void	print_edges2 (const EdgeListGraph &G, VertexName vname, EdgeName ename)
template<class VertexListGraph , class Name >
void	print_vertices (const VertexListGraph &G, Name name)
template<class Graph , class Vertex >
bool	is_adj_dispatch (Graph &g, Vertex a, Vertex b, bidirectional_tag)
template<class Graph , class Vertex >
bool	is_adj_dispatch (Graph &g, Vertex a, Vertex b, directed_tag)
template<class Graph , class Vertex >
bool	is_adj_dispatch (Graph &g, Vertex a, Vertex b, undirected_tag)
template<class Graph , class Vertex >
bool	is_adjacent (Graph &g, Vertex a, Vertex b)
template<class Graph , class Edge >
bool	in_edge_set (Graph &g, Edge e)
template<class Graph , class Vertex >
bool	in_vertex_set (Graph &g, Vertex v)
template<class Graph , class Vertex >
bool	in_edge_set (Graph &g, Vertex u, Vertex v)
template<typename ParentMap >
bool	is_descendant (typename property_traits< ParentMap >::value_type x, typename property_traits< ParentMap >::value_type y, ParentMap parent)
template<typename IncidenceGraph , typename VertexColorMap >
bool	is_reachable (typename graph_traits< IncidenceGraph >::vertex_descriptor x, typename graph_traits< IncidenceGraph >::vertex_descriptor y, const IncidenceGraph &g, VertexColorMap color)
template<typename VertexListGraph , typename VertexColorMap >
bool	is_connected (const VertexListGraph &g, VertexColorMap color)
template<typename Graph >
bool	is_self_loop (typename graph_traits< Graph >::edge_descriptor e, const Graph &g)
template<class T1 , class T2 >
std::pair< T1, T2 >	make_list (const T1 &t1, const T2 &t2)
template<class T1 , class T2 , class T3 >
std::pair< T1, std::pair< T2, T3 > >	make_list (const T1 &t1, const T2 &t2, const T3 &t3)
template<class T1 , class T2 , class T3 , class T4 >
std::pair< T1, std::pair< T2, std::pair< T3, T4 > > >	make_list (const T1 &t1, const T2 &t2, const T3 &t3, const T4 &t4)
template<class T1 , class T2 , class T3 , class T4 , class T5 >
std::pair< T1, std::pair< T2, std::pair< T3, std::pair< T4, T5 > > > >	make_list (const T1 &t1, const T2 &t2, const T3 &t3, const T4 &t4, const T5 &t5)
template<class PropertyIn , class PropertyOut , class Graph >
void	copy_vertex_property (PropertyIn p_in, PropertyOut p_out, Graph &g)
template<class PropertyIn , class PropertyOut , class Graph >
void	copy_edge_property (PropertyIn p_in, PropertyOut p_out, Graph &g)
template<typename PropertyMapFirst , typename PropertyMapSecond , typename Graph >
bool	are_property_maps_different (const PropertyMapFirst property_map1, const PropertyMapSecond property_map2, const Graph &graph)
void BOOST_GRAPH_DECL	read_graphml (std::istream &in, mutate_graph &g, size_t desired_idx)
template<typename MutableGraph >
void	read_graphml (std::istream &in, MutableGraph &g, dynamic_properties &dp, size_t desired_idx=0)
template<typename Graph , typename VertexIndexMap >
void	write_graphml (std::ostream &out, const Graph &g, VertexIndexMap vertex_index, const dynamic_properties &dp, bool ordered_vertices=false)
template<typename Graph >
void	write_graphml (std::ostream &out, const Graph &g, const dynamic_properties &dp, bool ordered_vertices=false)
template<typename T >
std::string	escape_dot_string (const T &obj)
template<class Name >
label_writer< Name >	make_label_writer (Name n)
	BOOST_INSTALL_PROPERTY (edge, attribute)
	BOOST_INSTALL_PROPERTY (vertex, attribute)
	BOOST_INSTALL_PROPERTY (graph, graph_attribute)
	BOOST_INSTALL_PROPERTY (graph, vertex_attribute)
	BOOST_INSTALL_PROPERTY (graph, edge_attribute)
template<class Attribute >
void	write_attributes (const Attribute &attr, std::ostream &out)
template<typename Attributes >
void	write_all_attributes (Attributes attributes, const std::string &name, std::ostream &out)
void	write_all_attributes (detail::error_property_not_found, const std::string &, std::ostream &)
template<typename GAttrMap , typename NAttrMap , typename EAttrMap >
graph_attributes_writer < GAttrMap, NAttrMap, EAttrMap >	make_graph_attributes_writer (const GAttrMap &g_attr, const NAttrMap &n_attr, const EAttrMap &e_attr)
template<typename Graph >
graph_attributes_writer < typename graph_property < Graph, graph_graph_attribute_t > ::type, typename graph_property< Graph, graph_vertex_attribute_t > ::type, typename graph_property< Graph, graph_edge_attribute_t >::type >	make_graph_attributes_writer (const Graph &g)
template<typename Graph >
attributes_writer< typename property_map< Graph, edge_attribute_t >::const_type >	make_edge_attributes_writer (const Graph &g)
template<typename Graph >
attributes_writer< typename property_map< Graph, vertex_attribute_t > ::const_type >	make_vertex_attributes_writer (const Graph &g)
template<typename Graph , typename VertexPropertiesWriter , typename EdgePropertiesWriter , typename GraphPropertiesWriter , typename VertexID >
void	write_graphviz (std::ostream &out, const Graph &g, VertexPropertiesWriter vpw, EdgePropertiesWriter epw, GraphPropertiesWriter gpw, VertexID vertex_id BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<typename Graph , typename VertexPropertiesWriter , typename EdgePropertiesWriter , typename GraphPropertiesWriter >
void	write_graphviz (std::ostream &out, const Graph &g, VertexPropertiesWriter vpw, EdgePropertiesWriter epw, GraphPropertiesWriter gpw BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<typename Graph >
void	write_graphviz (std::ostream &out, const Graph &g BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<typename Graph , typename VertexWriter >
void	write_graphviz (std::ostream &out, const Graph &g, VertexWriter vw BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<typename Graph , typename VertexWriter , typename EdgeWriter >
void	write_graphviz (std::ostream &out, const Graph &g, VertexWriter vw, EdgeWriter ew BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<typename Graph >
void	write_graphviz (std::ostream &out, const subgraph< Graph > &g)
template<typename Graph >
void	write_graphviz (const std::string &filename, const subgraph< Graph > &g)
template<typename Graph , typename VertexID >
void	write_graphviz (std::ostream &out, const subgraph< Graph > &g, VertexID vertex_id)
template<typename Graph , typename VertexID >
void	write_graphviz (const std::string &filename, const subgraph< Graph > &g, VertexID vertex_id)
template<typename Graph >
void	write_graphviz_dp (std::ostream &out, const Graph &g, const dynamic_properties &dp, const std::string &node_id="node_id"BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<typename Graph , typename VertexID >
void	write_graphviz_dp (std::ostream &out, const Graph &g, const dynamic_properties &dp, const std::string &node_id, VertexID id BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<typename MutableGraph >
bool	read_graphviz (const std::string &data, MutableGraph &graph, dynamic_properties &dp, std::string const &node_id="node_id")
template<typename InputIterator , typename MutableGraph >
bool	read_graphviz (InputIterator user_first, InputIterator user_last, MutableGraph &graph, dynamic_properties &dp, std::string const &node_id="node_id")
template<typename MutableGraph >
bool	read_graphviz (std::istream &in, MutableGraph &graph, dynamic_properties &dp, std::string const &node_id="node_id")
template<typename VertexListAndIncidenceGraph , typename Topology , typename PositionMap , typename Diameter , typename VertexIndexMap , typename EdgeWeightMap >
void	gursoy_atun_step (const VertexListAndIncidenceGraph &graph, const Topology &space, PositionMap position, Diameter diameter, double learning_constant, VertexIndexMap vertex_index_map, EdgeWeightMap weight)
template<typename VertexListAndIncidenceGraph , typename Topology , typename PositionMap , typename VertexIndexMap , typename EdgeWeightMap >
void	gursoy_atun_refine (const VertexListAndIncidenceGraph &graph, const Topology &space, PositionMap position, int nsteps, double diameter_initial, double diameter_final, double learning_constant_initial, double learning_constant_final, VertexIndexMap vertex_index_map, EdgeWeightMap weight)
template<typename VertexListAndIncidenceGraph , typename Topology , typename PositionMap , typename VertexIndexMap , typename EdgeWeightMap >
void	gursoy_atun_layout (const VertexListAndIncidenceGraph &graph, const Topology &space, PositionMap position, int nsteps, double diameter_initial, double diameter_final, double learning_constant_initial, double learning_constant_final, VertexIndexMap vertex_index_map, EdgeWeightMap weight)
template<typename VertexListAndIncidenceGraph , typename Topology , typename PositionMap , typename VertexIndexMap >
void	gursoy_atun_layout (const VertexListAndIncidenceGraph &graph, const Topology &space, PositionMap position, int nsteps, double diameter_initial, double diameter_final, double learning_constant_initial, double learning_constant_final, VertexIndexMap vertex_index_map)
template<typename VertexListAndIncidenceGraph , typename Topology , typename PositionMap >
void	gursoy_atun_layout (const VertexListAndIncidenceGraph &graph, const Topology &space, PositionMap position, int nsteps, double diameter_initial, double diameter_final=1.0, double learning_constant_initial=0.8, double learning_constant_final=0.2)
template<typename VertexListAndIncidenceGraph , typename Topology , typename PositionMap >
void	gursoy_atun_layout (const VertexListAndIncidenceGraph &graph, const Topology &space, PositionMap position, int nsteps)
template<typename VertexListAndIncidenceGraph , typename Topology , typename PositionMap >
void	gursoy_atun_layout (const VertexListAndIncidenceGraph &graph, const Topology &space, PositionMap position)
template<typename VertexListAndIncidenceGraph , typename Topology , typename PositionMap , typename P , typename T , typename R >
void	gursoy_atun_layout (const VertexListAndIncidenceGraph &graph, const Topology &space, PositionMap position, const bgl_named_params< P, T, R > &params)
template<typename Graph , typename Visitor , typename VertexIndexMap >
void	hawick_circuits (BOOST_FWD_REF(Graph) graph, BOOST_FWD_REF(Visitor) visitor, BOOST_FWD_REF(VertexIndexMap) vertex_index_map)
	Enumerate all the elementary circuits in a directed multigraph. More...
template<typename Graph , typename Visitor >
void	hawick_circuits (BOOST_FWD_REF(Graph) graph, BOOST_FWD_REF(Visitor) visitor)
template<typename Graph , typename Visitor , typename VertexIndexMap >
void	hawick_unique_circuits (BOOST_FWD_REF(Graph) graph, BOOST_FWD_REF(Visitor) visitor, BOOST_FWD_REF(VertexIndexMap) vertex_index_map)
	Same as boost::hawick_circuits, but duplicate circuits caused by parallel edges will not be considered. More...
template<typename Graph , typename Visitor >
void	hawick_unique_circuits (BOOST_FWD_REF(Graph) graph, BOOST_FWD_REF(Visitor) visitor)
template<typename FloatTraits , typename Graph , typename VertexIndexMap , typename EdgeWeight1Map , typename EdgeWeight2Map >
FloatTraits::value_type	maximum_cycle_ratio (const Graph &g, VertexIndexMap vim, EdgeWeight1Map ew1m, EdgeWeight2Map ew2m, std::vector< typename graph_traits< Graph >::edge_descriptor > *pcc=0, FloatTraits=FloatTraits())
template<typename Graph , typename VertexIndexMap , typename EdgeWeight1Map , typename EdgeWeight2Map >
double	maximum_cycle_ratio (const Graph &g, VertexIndexMap vim, EdgeWeight1Map ew1m, EdgeWeight2Map ew2m, std::vector< typename graph_traits< Graph >::edge_descriptor > *pcc=0)
template<typename FloatTraits , typename Graph , typename VertexIndexMap , typename EdgeWeight1Map , typename EdgeWeight2Map >
FloatTraits::value_type	minimum_cycle_ratio (const Graph &g, VertexIndexMap vim, EdgeWeight1Map ew1m, EdgeWeight2Map ew2m, std::vector< typename graph_traits< Graph >::edge_descriptor > *pcc=0, FloatTraits=FloatTraits())
template<typename Graph , typename VertexIndexMap , typename EdgeWeight1Map , typename EdgeWeight2Map >
double	minimum_cycle_ratio (const Graph &g, VertexIndexMap vim, EdgeWeight1Map ew1m, EdgeWeight2Map ew2m, std::vector< typename graph_traits< Graph >::edge_descriptor > *pcc=0)
template<typename FloatTraits , typename Graph , typename VertexIndexMap , typename EdgeWeightMap , typename EdgeIndexMap >
FloatTraits::value_type	maximum_cycle_mean (const Graph &g, VertexIndexMap vim, EdgeWeightMap ewm, EdgeIndexMap eim, std::vector< typename graph_traits< Graph >::edge_descriptor > *pcc=0, FloatTraits ft=FloatTraits())
template<typename Graph , typename VertexIndexMap , typename EdgeWeightMap , typename EdgeIndexMap >
double	maximum_cycle_mean (const Graph &g, VertexIndexMap vim, EdgeWeightMap ewm, EdgeIndexMap eim, std::vector< typename graph_traits< Graph >::edge_descriptor > *pcc=0)
template<typename FloatTraits , typename Graph , typename VertexIndexMap , typename EdgeWeightMap , typename EdgeIndexMap >
FloatTraits::value_type	minimum_cycle_mean (const Graph &g, VertexIndexMap vim, EdgeWeightMap ewm, EdgeIndexMap eim, std::vector< typename graph_traits< Graph >::edge_descriptor > *pcc=0, FloatTraits ft=FloatTraits())
template<typename Graph , typename VertexIndexMap , typename EdgeWeightMap , typename EdgeIndexMap >
double	minimum_cycle_mean (const Graph &g, VertexIndexMap vim, EdgeWeightMap ewm, EdgeIndexMap eim, std::vector< typename graph_traits< Graph >::edge_descriptor > *pcc=0)
template<class EdgeListGraph , class DisjointSets >
void	incremental_components (EdgeListGraph &g, DisjointSets &ds)
template<class ParentIterator >
void	compress_components (ParentIterator first, ParentIterator last)
template<class ParentIterator >
boost::detail::iterator_traits < ParentIterator > ::difference_type	component_count (ParentIterator first, ParentIterator last)
template<class ParentIterator >
void	normalize_components (ParentIterator first, ParentIterator last)
template<class VertexListGraph , class DisjointSets >
void	initialize_incremental_components (VertexListGraph &G, DisjointSets &ds)
template<class Vertex , class DisjointSet >
bool	same_component (Vertex u, Vertex v, DisjointSet &ds)
template<typename Graph , typename ForwardIterator , typename VertexIndexMap >
bool	is_kuratowski_subgraph (const Graph &g, ForwardIterator begin, ForwardIterator end, VertexIndexMap vm)
template<typename Graph , typename ForwardIterator >
bool	is_kuratowski_subgraph (const Graph &g, ForwardIterator begin, ForwardIterator end)
bool	intersects (double x1, double y1, double x2, double y2, double a1, double b1, double a2, double b2, double epsilon=0.000001)
template<typename Graph , typename GridPositionMap , typename VertexIndexMap >
bool	is_straight_line_drawing (const Graph &g, GridPositionMap drawing, VertexIndexMap)
template<typename Graph , typename GridPositionMap >
bool	is_straight_line_drawing (const Graph &g, GridPositionMap drawing)
template<typename Graph >
size_t	count_vertices (const Graph &g)
template<typename Graph1 , typename Graph2 , typename IsoMapping , typename Invariant1 , typename Invariant2 , typename IndexMap1 , typename IndexMap2 >
bool	isomorphism (const Graph1 &G1, const Graph2 &G2, IsoMapping f, Invariant1 invariant1, Invariant2 invariant2, std::size_t max_invariant, IndexMap1 index_map1, IndexMap2 index_map2)
template<typename Graph1 , typename Graph2 , typename IsoMap >
bool	verify_isomorphism (const Graph1 &g1, const Graph2 &g2, IsoMap iso_map)
template<class VertexAndEdgeListGraph , class DistanceMatrix , class VertexID , class Weight , typename BinaryPredicate , typename BinaryFunction , typename Infinity , class DistanceZero >
bool	johnson_all_pairs_shortest_paths (VertexAndEdgeListGraph &g1, DistanceMatrix &D, VertexID id1, Weight w1, const BinaryPredicate &compare, const BinaryFunction &combine, const Infinity &inf, DistanceZero zero)
template<class VertexAndEdgeListGraph , class DistanceMatrix , class VertexID , class Weight , class DistanceZero >
bool	johnson_all_pairs_shortest_paths (VertexAndEdgeListGraph &g1, DistanceMatrix &D, VertexID id1, Weight w1, DistanceZero zero)
template<class VertexAndEdgeListGraph , class DistanceMatrix , class P , class T , class R >
bool	johnson_all_pairs_shortest_paths (VertexAndEdgeListGraph &g, DistanceMatrix &D, const bgl_named_params< P, T, R > &params)
template<class VertexAndEdgeListGraph , class DistanceMatrix >
bool	johnson_all_pairs_shortest_paths (VertexAndEdgeListGraph &g, DistanceMatrix &D)
template<typename T >
detail::graph::edge_or_side < true, T >	edge_length (T x)
	States that the given quantity is an edge length. More...
template<typename T >
detail::graph::edge_or_side < false, T >	side_length (T x)
	States that the given quantity is a display area side length. More...
template<typename Topology , typename Graph , typename PositionMap , typename WeightMap , typename T , bool EdgeOrSideLength, typename Done , typename VertexIndexMap , typename DistanceMatrix , typename SpringStrengthMatrix , typename PartialDerivativeMap >
bool	kamada_kawai_spring_layout (const Graph &g, PositionMap position, WeightMap weight, const Topology &topology, detail::graph::edge_or_side< EdgeOrSideLength, T > edge_or_side_length, Done done, typename property_traits< WeightMap >::value_type spring_constant, VertexIndexMap index, DistanceMatrix distance, SpringStrengthMatrix spring_strength, PartialDerivativeMap partial_derivatives)
	Kamada-Kawai spring layout for undirected graphs. More...
template<typename Topology , typename Graph , typename PositionMap , typename WeightMap , typename T , bool EdgeOrSideLength, typename Done , typename VertexIndexMap >
bool	kamada_kawai_spring_layout (const Graph &g, PositionMap position, WeightMap weight, const Topology &topology, detail::graph::edge_or_side< EdgeOrSideLength, T > edge_or_side_length, Done done, typename property_traits< WeightMap >::value_type spring_constant, VertexIndexMap index)
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...
template<typename Topology , typename Graph , typename PositionMap , typename WeightMap , typename T , bool EdgeOrSideLength, typename Done >
bool	kamada_kawai_spring_layout (const Graph &g, PositionMap position, WeightMap weight, const Topology &topology, detail::graph::edge_or_side< EdgeOrSideLength, T > edge_or_side_length, Done done, typename property_traits< WeightMap >::value_type spring_constant)
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...
template<typename Topology , typename Graph , typename PositionMap , typename WeightMap , typename T , bool EdgeOrSideLength, typename Done >
bool	kamada_kawai_spring_layout (const Graph &g, PositionMap position, WeightMap weight, const Topology &topology, detail::graph::edge_or_side< EdgeOrSideLength, T > edge_or_side_length, Done done)
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...
template<typename Topology , typename Graph , typename PositionMap , typename WeightMap , typename T , bool EdgeOrSideLength>
bool	kamada_kawai_spring_layout (const Graph &g, PositionMap position, WeightMap weight, const Topology &topology, detail::graph::edge_or_side< EdgeOrSideLength, T > edge_or_side_length)
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...
template<class Graph , class OutputIterator , class ColorMap , class DegreeMap , typename VertexIndexMap >
OutputIterator	king_ordering (const Graph &g, std::deque< typename graph_traits< Graph >::vertex_descriptor > vertex_queue, OutputIterator permutation, ColorMap color, DegreeMap degree, VertexIndexMap index_map)
template<class Graph , class OutputIterator , class ColorMap , class DegreeMap , typename VertexIndexMap >
OutputIterator	king_ordering (const Graph &g, typename graph_traits< Graph >::vertex_descriptor s, OutputIterator permutation, ColorMap color, DegreeMap degree, VertexIndexMap index_map)
template<class Graph , class OutputIterator , class ColorMap , class DegreeMap , class VertexIndexMap >
OutputIterator	king_ordering (const Graph &G, OutputIterator permutation, ColorMap color, DegreeMap degree, VertexIndexMap index_map)
template<typename Graph , typename OutputIterator , typename VertexIndexMap >
OutputIterator	king_ordering (const Graph &G, OutputIterator permutation, VertexIndexMap index_map)
template<typename Graph , typename OutputIterator >
OutputIterator	king_ordering (const Graph &G, OutputIterator permutation)
template<class Graph , class OutputIterator >
void	kruskal_minimum_spanning_tree (const Graph &g, OutputIterator spanning_tree_edges)
template<class Graph , class OutputIterator , class P , class T , class R >
void	kruskal_minimum_spanning_tree (const Graph &g, OutputIterator spanning_tree_edges, const bgl_named_params< P, T, R > &params)
template<class vtype , class etype >
graph_traits< leda::GRAPH < vtype, etype > >::vertex_descriptor	source (typename graph_traits< leda::GRAPH< vtype, etype > >::edge_descriptor e, const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
graph_traits< leda::GRAPH < vtype, etype > >::vertex_descriptor	target (typename graph_traits< leda::GRAPH< vtype, etype > >::edge_descriptor e, const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
std::pair< typename graph_traits< leda::GRAPH < vtype, etype > >::vertex_iterator, typename graph_traits< leda::GRAPH < vtype, etype > >::vertex_iterator >	vertices (const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
std::pair< typename graph_traits< leda::GRAPH < vtype, etype > >::edge_iterator, typename graph_traits< leda::GRAPH < vtype, etype > >::edge_iterator >	edges (const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
std::pair< typename graph_traits< leda::GRAPH < vtype, etype > >::out_edge_iterator, typename graph_traits < leda::GRAPH< vtype, etype > >::out_edge_iterator >	out_edges (typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor u, const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
std::pair< typename graph_traits< leda::GRAPH < vtype, etype > >::in_edge_iterator, typename graph_traits< leda::GRAPH < vtype, etype > >::in_edge_iterator >	in_edges (typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor u, const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
std::pair< typename graph_traits< leda::GRAPH < vtype, etype > >::adjacency_iterator, typename graph_traits < leda::GRAPH< vtype, etype > >::adjacency_iterator >	adjacent_vertices (typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor u, const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
graph_traits< leda::GRAPH < vtype, etype > >::vertices_size_type	num_vertices (const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
graph_traits< leda::GRAPH < vtype, etype > >::edges_size_type	num_edges (const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
graph_traits< leda::GRAPH < vtype, etype > >::degree_size_type	out_degree (typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor u, const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
graph_traits< leda::GRAPH < vtype, etype > >::degree_size_type	in_degree (typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor u, const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
graph_traits< leda::GRAPH < vtype, etype > >::degree_size_type	degree (typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor u, const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
graph_traits< leda::GRAPH < vtype, etype > >::vertex_descriptor	add_vertex (leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
graph_traits< leda::GRAPH < vtype, etype > >::vertex_descriptor	add_vertex (const vtype &vp, leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
void	clear_vertex (typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor u, leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
void	remove_vertex (typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor u, leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
std::pair< typename graph_traits< leda::GRAPH < vtype, etype > >::edge_descriptor, bool >	add_edge (typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor u, typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor v, leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
std::pair< typename graph_traits< leda::GRAPH < vtype, etype > >::edge_descriptor, bool >	add_edge (typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor u, typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor v, const etype &et, leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
void	remove_edge (typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor u, typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor v, leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
void	remove_edge (typename graph_traits< leda::GRAPH< vtype, etype > >::edge_descriptor e, leda::GRAPH< vtype, etype > &g)
graph_traits< leda::graph > ::vertex_descriptor	source (graph_traits< leda::graph >::edge_descriptor e, const leda::graph &g)
graph_traits< leda::graph > ::vertex_descriptor	target (graph_traits< leda::graph >::edge_descriptor e, const leda::graph &g)
std::pair< graph_traits < leda::graph > ::vertex_iterator, graph_traits< leda::graph > ::vertex_iterator >	vertices (const leda::graph &g)
std::pair< graph_traits < leda::graph >::edge_iterator, graph_traits< leda::graph > ::edge_iterator >	edges (const leda::graph &g)
std::pair< graph_traits < leda::graph > ::out_edge_iterator, graph_traits< leda::graph > ::out_edge_iterator >	out_edges (graph_traits< leda::graph >::vertex_descriptor u, const leda::graph &g)
std::pair< graph_traits < leda::graph > ::in_edge_iterator, graph_traits< leda::graph > ::in_edge_iterator >	in_edges (graph_traits< leda::graph >::vertex_descriptor u, const leda::graph &g)
std::pair< graph_traits < leda::graph > ::adjacency_iterator, graph_traits< leda::graph > ::adjacency_iterator >	adjacent_vertices (graph_traits< leda::graph >::vertex_descriptor u, const leda::graph &g)
graph_traits< leda::graph > ::vertices_size_type	num_vertices (const leda::graph &g)
graph_traits< leda::graph > ::edges_size_type	num_edges (const leda::graph &g)
graph_traits< leda::graph > ::degree_size_type	out_degree (graph_traits< leda::graph >::vertex_descriptor u, const leda::graph &g)
graph_traits< leda::graph > ::degree_size_type	in_degree (graph_traits< leda::graph >::vertex_descriptor u, const leda::graph &g)
graph_traits< leda::graph > ::degree_size_type	degree (graph_traits< leda::graph >::vertex_descriptor u, const leda::graph &g)
graph_traits< leda::graph > ::vertex_descriptor	add_vertex (leda::graph &g)
void	remove_edge (graph_traits< leda::graph >::vertex_descriptor u, graph_traits< leda::graph >::vertex_descriptor v, leda::graph &g)
void	remove_edge (graph_traits< leda::graph >::edge_descriptor e, leda::graph &g)
void	clear_vertex (graph_traits< leda::graph >::vertex_descriptor u, leda::graph &g)
void	remove_vertex (graph_traits< leda::graph >::vertex_descriptor u, leda::graph &g)
std::pair< graph_traits < leda::graph > ::edge_descriptor, bool >	add_edge (graph_traits< leda::graph >::vertex_descriptor u, graph_traits< leda::graph >::vertex_descriptor v, leda::graph &g)
template<class vtype , class etype >
leda_graph_id_map	get (vertex_index_t, const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
leda_graph_id_map	get (edge_index_t, const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
property_map< leda::GRAPH < vtype, etype >, vertex_all_t > ::type	get (vertex_all_t, leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
property_map< leda::GRAPH < vtype, etype >, vertex_all_t > ::const_type	get (vertex_all_t, const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
property_map< leda::GRAPH < vtype, etype >, edge_all_t > ::type	get (edge_all_t, leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
property_map< leda::GRAPH < vtype, etype >, edge_all_t > ::const_type	get (edge_all_t, const leda::GRAPH< vtype, etype > &g)
template<class E >
leda_node_property_map< E, const E &, const leda::node_array< E > * >	make_leda_node_property_map (const leda::node_array< E > &a)
template<class E >
leda_node_property_map< E, E &, leda::node_array< E > * >	make_leda_node_property_map (leda::node_array< E > &a)
template<class E >
leda_node_property_map< E, const E &, const leda::node_map< E > * >	make_leda_node_property_map (const leda::node_map< E > &a)
template<class E >
leda_node_property_map< E, E &, leda::node_map< E > * >	make_leda_node_property_map (leda::node_map< E > &a)
template<class vtype , class etype , class PropertyTag , class Key >
boost::property_traits < typename boost::property_map < leda::GRAPH< vtype, etype > , PropertyTag >::const_type > ::value_type	get (PropertyTag p, const leda::GRAPH< vtype, etype > &g, const Key &key)
template<class vtype , class etype , class PropertyTag , class Key , class Value >
void	put (PropertyTag p, leda::GRAPH< vtype, etype > &g, const Key &key, const Value &value)
template<class E >
leda_edge_property_map< E, const E &, const leda::edge_array< E > * >	make_leda_node_property_map (const leda::node_array< E > &a)
template<class E >
leda_edge_property_map< E, E &, leda::edge_array< E > * >	make_leda_edge_property_map (leda::edge_array< E > &a)
template<class E >
leda_edge_property_map< E, const E &, const leda::edge_map< E > * >	make_leda_edge_property_map (const leda::edge_map< E > &a)
template<class E >
leda_edge_property_map< E, E &, leda::edge_map< E > * >	make_leda_edge_property_map (leda::edge_map< E > &a)
template<typename Graph >
std::pair< typename boost::graph_traits< Graph > ::edge_descriptor, bool >	lookup_edge (typename boost::graph_traits< Graph >::vertex_descriptor src, typename boost::graph_traits< Graph >::vertex_descriptor tgt, const Graph &g, typename boost::enable_if< is_adjacency_matrix< Graph >, int >::type=0)
template<typename Graph >
std::pair< typename boost::graph_traits< Graph > ::edge_descriptor, bool >	lookup_edge (typename boost::graph_traits< Graph >::vertex_descriptor src, typename boost::graph_traits< Graph >::vertex_descriptor tgt, const Graph &g, typename boost::disable_if< is_adjacency_matrix< Graph >, int >::type=0)
template<typename Graph , typename ColorMap , typename NextEdge >
void	loop_erased_random_walk (const Graph &g, typename boost::graph_traits< Graph >::vertex_descriptor s, NextEdge next_edge, ColorMap color, std::vector< typename boost::graph_traits< Graph >::vertex_descriptor > &path)
template<typename Graph , typename PlanarEmbedding , typename EdgeIndexMap , typename AddEdgeVisitor >
void	make_biconnected_planar (Graph &g, PlanarEmbedding embedding, EdgeIndexMap em, AddEdgeVisitor &vis)
template<typename Graph , typename PlanarEmbedding , typename EdgeIndexMap >
void	make_biconnected_planar (Graph &g, PlanarEmbedding embedding, EdgeIndexMap em)
template<typename Graph , typename PlanarEmbedding >
void	make_biconnected_planar (Graph &g, PlanarEmbedding embedding)
template<typename Graph , typename VertexIndexMap , typename AddEdgeVisitor >
void	make_connected (Graph &g, VertexIndexMap vm, AddEdgeVisitor &vis)
template<typename Graph , typename VertexIndexMap >
void	make_connected (Graph &g, VertexIndexMap vm)
template<typename Graph >
void	make_connected (Graph &g)
template<typename Graph , typename PlanarEmbedding , typename VertexIndexMap , typename EdgeIndexMap , typename AddEdgeVisitor >
void	make_maximal_planar (Graph &g, PlanarEmbedding embedding, VertexIndexMap vm, EdgeIndexMap em, AddEdgeVisitor &vis)
template<typename Graph , typename PlanarEmbedding , typename VertexIndexMap , typename EdgeIndexMap >
void	make_maximal_planar (Graph &g, PlanarEmbedding embedding, VertexIndexMap vm, EdgeIndexMap em)
template<typename Graph , typename PlanarEmbedding , typename VertexIndexMap >
void	make_maximal_planar (Graph &g, PlanarEmbedding embedding, VertexIndexMap vm)
template<typename Graph , typename PlanarEmbedding >
void	make_maximal_planar (Graph &g, PlanarEmbedding embedding)
template<typename Graph , typename MateMap , typename VertexIndexMap >
graph_traits< Graph > ::vertices_size_type	matching_size (const Graph &g, MateMap mate, VertexIndexMap vm)
template<typename Graph , typename MateMap >
graph_traits< Graph > ::vertices_size_type	matching_size (const Graph &g, MateMap mate)
template<typename Graph , typename MateMap , typename VertexIndexMap >
bool	is_a_matching (const Graph &g, MateMap mate, VertexIndexMap)
template<typename Graph , typename MateMap >
bool	is_a_matching (const Graph &g, MateMap mate)
template<typename Graph , typename MateMap , typename VertexIndexMap , template< typename, typename, typename > class AugmentingPathFinder, template< typename, typename > class InitialMatchingFinder, template< typename, typename, typename > class MatchingVerifier>
bool	matching (const Graph &g, MateMap mate, VertexIndexMap vm)
template<typename Graph , typename MateMap , typename VertexIndexMap >
bool	checked_edmonds_maximum_cardinality_matching (const Graph &g, MateMap mate, VertexIndexMap vm)
template<typename Graph , typename MateMap >
bool	checked_edmonds_maximum_cardinality_matching (const Graph &g, MateMap mate)
template<typename Graph , typename MateMap , typename VertexIndexMap >
void	edmonds_maximum_cardinality_matching (const Graph &g, MateMap mate, VertexIndexMap vm)
template<typename Graph , typename MateMap >
void	edmonds_maximum_cardinality_matching (const Graph &g, MateMap mate)
template<class Visitors >
mas_visitor< Visitors >	make_mas_visitor (Visitors vis)
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 Graph , typename P , typename T , typename R >
void	maximum_adjacency_search (const Graph &g, const bgl_named_params< P, T, R > &params)
template<typename PropertyMapFirst , typename PropertyMapSecond >
property_map_equivalent < PropertyMapFirst, PropertyMapSecond >	make_property_map_equivalent (const PropertyMapFirst property_map1, const PropertyMapSecond property_map2)
template<typename GraphFirst , typename GraphSecond , typename VertexIndexMapFirst , typename VertexIndexMapSecond , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename SubGraphCallback >
void	mcgregor_common_subgraphs (const GraphFirst &graph1, const GraphSecond &graph2, const VertexIndexMapFirst vindex_map1, const VertexIndexMapSecond vindex_map2, EdgeEquivalencePredicate edges_equivalent, VertexEquivalencePredicate vertices_equivalent, bool only_connected_subgraphs, SubGraphCallback user_callback)
template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback >
void	mcgregor_common_subgraphs (const GraphFirst &graph1, const GraphSecond &graph2, bool only_connected_subgraphs, SubGraphCallback user_callback)
template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback , typename Param , typename Tag , typename Rest >
void	mcgregor_common_subgraphs (const GraphFirst &graph1, const GraphSecond &graph2, bool only_connected_subgraphs, SubGraphCallback user_callback, const bgl_named_params< Param, Tag, Rest > &params)
template<typename GraphFirst , typename GraphSecond , typename VertexIndexMapFirst , typename VertexIndexMapSecond , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename SubGraphCallback >
void	mcgregor_common_subgraphs_unique (const GraphFirst &graph1, const GraphSecond &graph2, const VertexIndexMapFirst vindex_map1, const VertexIndexMapSecond vindex_map2, EdgeEquivalencePredicate edges_equivalent, VertexEquivalencePredicate vertices_equivalent, bool only_connected_subgraphs, SubGraphCallback user_callback)
template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback >
void	mcgregor_common_subgraphs_unique (const GraphFirst &graph1, const GraphSecond &graph2, bool only_connected_subgraphs, SubGraphCallback user_callback)
template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback , typename Param , typename Tag , typename Rest >
void	mcgregor_common_subgraphs_unique (const GraphFirst &graph1, const GraphSecond &graph2, bool only_connected_subgraphs, SubGraphCallback user_callback, const bgl_named_params< Param, Tag, Rest > &params)
template<typename GraphFirst , typename GraphSecond , typename VertexIndexMapFirst , typename VertexIndexMapSecond , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename SubGraphCallback >
void	mcgregor_common_subgraphs_maximum (const GraphFirst &graph1, const GraphSecond &graph2, const VertexIndexMapFirst vindex_map1, const VertexIndexMapSecond vindex_map2, EdgeEquivalencePredicate edges_equivalent, VertexEquivalencePredicate vertices_equivalent, bool only_connected_subgraphs, SubGraphCallback user_callback)
template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback >
void	mcgregor_common_subgraphs_maximum (const GraphFirst &graph1, const GraphSecond &graph2, bool only_connected_subgraphs, SubGraphCallback user_callback)
template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback , typename Param , typename Tag , typename Rest >
void	mcgregor_common_subgraphs_maximum (const GraphFirst &graph1, const GraphSecond &graph2, bool only_connected_subgraphs, SubGraphCallback user_callback, const bgl_named_params< Param, Tag, Rest > &params)
template<typename GraphFirst , typename GraphSecond , typename VertexIndexMapFirst , typename VertexIndexMapSecond , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename SubGraphCallback >
void	mcgregor_common_subgraphs_maximum_unique (const GraphFirst &graph1, const GraphSecond &graph2, const VertexIndexMapFirst vindex_map1, const VertexIndexMapSecond vindex_map2, EdgeEquivalencePredicate edges_equivalent, VertexEquivalencePredicate vertices_equivalent, bool only_connected_subgraphs, SubGraphCallback user_callback)
template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback >
void	mcgregor_common_subgraphs_maximum_unique (const GraphFirst &graph1, const GraphSecond &graph2, bool only_connected_subgraphs, SubGraphCallback user_callback)
template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback , typename Param , typename Tag , typename Rest >
void	mcgregor_common_subgraphs_maximum_unique (const GraphFirst &graph1, const GraphSecond &graph2, bool only_connected_subgraphs, SubGraphCallback user_callback, const bgl_named_params< Param, Tag, Rest > &params)
template<typename GraphSecond , typename GraphFirst , typename CorrespondenceMapFirstToSecond , typename MembershipMapFirst >
void	fill_membership_map (const GraphFirst &graph1, const CorrespondenceMapFirstToSecond correspondence_map_1_to_2, MembershipMapFirst membership_map1)
template<typename Graph , typename MembershipMap >
membership_filtered_graph_traits < Graph, MembershipMap > ::graph_type	make_membership_filtered_graph (const Graph &graph, MembershipMap &membership_map)
template<typename VertexListGraph , typename OutputIterator >
void	metric_tsp_approx_tour (VertexListGraph &g, OutputIterator o)
template<typename VertexListGraph , typename WeightMap , typename OutputIterator >
void	metric_tsp_approx_tour (VertexListGraph &g, WeightMap w, OutputIterator o)
template<typename VertexListGraph , typename OutputIterator >
void	metric_tsp_approx_tour_from_vertex (VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor start, OutputIterator o)
template<typename VertexListGraph , typename WeightMap , typename OutputIterator >
void	metric_tsp_approx_tour_from_vertex (VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor start, WeightMap w, OutputIterator o)
template<typename VertexListGraph , typename TSPVertexVisitor >
void	metric_tsp_approx (VertexListGraph &g, TSPVertexVisitor vis)
template<typename VertexListGraph , typename Weightmap , typename VertexIndexMap , typename TSPVertexVisitor >
void	metric_tsp_approx (VertexListGraph &g, Weightmap w, TSPVertexVisitor vis)
template<typename VertexListGraph , typename WeightMap , typename VertexIndexMap , typename TSPVertexVisitor >
void	metric_tsp_approx (VertexListGraph &g, WeightMap w, VertexIndexMap id, TSPVertexVisitor vis)
template<typename VertexListGraph , typename WeightMap , typename TSPVertexVisitor >
void	metric_tsp_approx_from_vertex (VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor start, WeightMap w, TSPVertexVisitor vis)
template<typename VertexListGraph , typename WeightMap , typename VertexIndexMap , typename TSPVertexVisitor >
void	metric_tsp_approx_from_vertex (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor start, WeightMap weightmap, VertexIndexMap indexmap, TSPVertexVisitor vis)
template<typename OutIter >
tsp_tour_visitor< OutIter >	make_tsp_tour_visitor (OutIter iter)
template<typename Graph , typename WeightMap , typename OutIter , typename Length >
tsp_tour_len_visitor< Graph, WeightMap, OutIter, Length >	make_tsp_tour_len_visitor (Graph const &g, OutIter iter, Length &l, WeightMap map)
template<class Graph , class DegreeMap , class InversePermutationMap , class PermutationMap , class SuperNodeMap , class VertexIndexMap >
void	minimum_degree_ordering (Graph &G, DegreeMap degree, InversePermutationMap inverse_perm, PermutationMap perm, SuperNodeMap supernode_size, int delta, VertexIndexMap vertex_index_map)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(edge_weight, _t)>	weight_map (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(edge_weight2, _t)>	weight_map2 (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(vertex_distance, _t)>	distance_map (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(vertex_distance2, _t)>	distance_map2 (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(vertex_predecessor, _t)>	predecessor_map (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(vertex_rank, _t)>	rank_map (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(vertex_root, _t)>	root_map (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(root_vertex, _t)>	root_vertex (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(edge_centrality, _t)>	edge_centrality_map (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(vertex_centrality, _t)>	centrality_map (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(parity_map, _t)>	parity_map (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(vertex_color, _t)>	color_map (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(edge_color, _t)>	edge_color_map (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(edge_capacity, _t)>	capacity_map (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(edge_residual_capacity, _t)>	residual_capacity_map (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(edge_reverse, _t)>	reverse_edge_map (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(vertex_discover_time, _t)>	discover_time_map (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(vertex_lowpoint, _t)>	lowpoint_map (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(vertex_index, _t)>	vertex_index_map (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(vertex_index1, _t)>	vertex_index1_map (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(vertex_index2, _t)>	vertex_index2_map (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(vertex_assignment_map, _t)>	vertex_assignment_map (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(graph_visitor, _t)>	visitor (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(distance_compare, _t)>	distance_compare (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(distance_combine, _t)>	distance_combine (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(distance_inf, _t)>	distance_inf (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(distance_zero, _t)>	distance_zero (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(edge_copy, _t)>	edge_copy (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(vertex_copy, _t)>	vertex_copy (const PType &p)
template<typename PType >
bgl_named_params < boost::reference_wrapper < PType >, BOOST_PP_CAT(buffer_param, _t)>	buffer (PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(orig_to_copy, _t)>	orig_to_copy (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(vertex_isomorphism, _t)>	isomorphism_map (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(vertex_invariant, _t)>	vertex_invariant (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(vertex_invariant1, _t)>	vertex_invariant1 (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(vertex_invariant2, _t)>	vertex_invariant2 (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(vertex_max_invariant, _t)>	vertex_max_invariant (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(polling, _t)>	polling (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(lookahead, _t)>	lookahead (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(in_parallel, _t)>	in_parallel (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(vertex_displacement, _t)>	displacement_map (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(attractive_force, _t)>	attractive_force (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(repulsive_force, _t)>	repulsive_force (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(force_pairs, _t)>	force_pairs (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(cooling, _t)>	cooling (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(iterations, _t)>	iterations (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(diameter_range, _t)>	diameter_range (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(learning_constant_range, _t)>	learning_constant_range (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(vertices_equivalent, _t)>	vertices_equivalent (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(edges_equivalent, _t)>	edges_equivalent (const PType &p)
template<typename PType >
bgl_named_params< PType, BOOST_PP_CAT(index_in_heap_map, _t)>	index_in_heap_map (const PType &p)
template<typename PType >
bgl_named_params < boost::reference_wrapper < PType >, BOOST_PP_CAT(max_priority_queue, _t)>	max_priority_queue (PType &p)
template<typename PType >
bgl_named_params< PType, vertex_color_t >	vertex_color_map (const PType &p)
template<class Tag , typename Args >
const lookup_named_param_def < Tag, Args, param_not_found > ::type &	get_param (const Args &p, Tag)
template<class P , class Default >
const P &	choose_param (const P &param, const Default &)
template<class Default >
Default	choose_param (const param_not_found &, const Default &d)
template<typename T >
bool	is_default_param (const T &)
bool	is_default_param (const param_not_found &)
template<typename Param , typename Graph , typename PropertyTag >
detail::choose_impl_result < boost::mpl::true_, Graph, Param, PropertyTag >::type	choose_const_pmap (const Param &p, const Graph &g, PropertyTag tag)
template<typename Param , typename Graph , typename PropertyTag >
detail::choose_impl_result < boost::mpl::false_, Graph, Param, PropertyTag >::type	choose_pmap (const Param &p, Graph &g, PropertyTag tag)
template<class Visitors >
neighbor_bfs_visitor< Visitors >	make_neighbor_bfs_visitor (Visitors vis)
template<class VertexListGraph , class P , class T , class R >
void	neighbor_breadth_first_search (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, const bgl_named_params< P, T, R > &params)
template<class IncidenceGraph , class P , class T , class R >
void	neighbor_breadth_first_visit (IncidenceGraph &g, typename graph_traits< IncidenceGraph >::vertex_descriptor s, const bgl_named_params< P, T, R > &params)
template<typename IndexMap >
one_bit_color_type	get (const one_bit_color_map< IndexMap > &pm, typename property_traits< IndexMap >::key_type key)
template<typename IndexMap >
void	put (const one_bit_color_map< IndexMap > &pm, typename property_traits< IndexMap >::key_type key, one_bit_color_type value)
template<typename IndexMap >
one_bit_color_map< IndexMap >	make_one_bit_color_map (std::size_t n, const IndexMap &index_map)
template<typename Property , typename PropertyMap >
void	set_property_map_role (Property p, PropertyMap pm)
template<typename Graph , typename PlanarEmbedding , typename OutputIterator , typename VertexIndexMap >
void	planar_canonical_ordering (const Graph &g, PlanarEmbedding embedding, OutputIterator ordering, VertexIndexMap vm)
template<typename Graph , typename PlanarEmbedding , typename OutputIterator >
void	planar_canonical_ordering (const Graph &g, PlanarEmbedding embedding, OutputIterator ordering)
template<typename ForwardIterator , typename ItemToRankMap , typename SizeType >
void	bucket_sort (ForwardIterator begin, ForwardIterator end, ItemToRankMap rank, SizeType range=0)
template<typename ForwardIterator , typename ItemToRankMap >
void	bucket_sort (ForwardIterator begin, ForwardIterator end, ItemToRankMap rank)
template<typename ForwardIterator >
void	bucket_sort (ForwardIterator begin, ForwardIterator end)
template<typename Graph , typename PlanarEmbedding , typename Visitor , typename EdgeIndexMap >
void	planar_face_traversal (const Graph &g, PlanarEmbedding embedding, Visitor &visitor, EdgeIndexMap em)
template<typename Graph , typename PlanarEmbedding , typename Visitor >
void	planar_face_traversal (const Graph &g, PlanarEmbedding embedding, Visitor &visitor)
template<class VertexListGraph , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap >
void	prim_minimum_spanning_tree (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, DijkstraVisitor vis)
template<class VertexListGraph , class PredecessorMap , class P , class T , class R >
void	prim_minimum_spanning_tree (const VertexListGraph &g, PredecessorMap p_map, const bgl_named_params< P, T, R > &params)
template<class VertexListGraph , class PredecessorMap >
void	prim_minimum_spanning_tree (const VertexListGraph &g, PredecessorMap p_map)
template<typename Graph , typename VertexIndexMap >
graph_traits< Graph > ::vertices_size_type	profile (const Graph &g, VertexIndexMap index)
template<typename Graph >
graph_traits< Graph > ::vertices_size_type	profile (const Graph &g)
default_color_type	white (default_color_type)
default_color_type	gray (default_color_type)
default_color_type	green (default_color_type)
default_color_type	red (default_color_type)
default_color_type	black (default_color_type)
template<typename Graph >
degree_property_map< Graph >	make_degree_map (const Graph &g)
template<class PropertyGraph , class RandomAccessIterator >
iterator_property_map < RandomAccessIterator, typename property_map < PropertyGraph, vertex_index_t >::type, typename std::iterator_traits < RandomAccessIterator > ::value_type, typename std::iterator_traits < RandomAccessIterator > ::reference >	make_iterator_vertex_map (RandomAccessIterator iter, const PropertyGraph &g)
template<class RandomAccessIterator >
iterator_property_map < RandomAccessIterator, identity_property_map, typename std::iterator_traits < RandomAccessIterator > ::value_type, typename std::iterator_traits < RandomAccessIterator > ::reference >	make_iterator_vertex_map (RandomAccessIterator iter)
template<class PropertyGraph , class RandomAccessContainer >
iterator_property_map < typename RandomAccessContainer::iterator, typename property_map < PropertyGraph, vertex_index_t >::type, typename RandomAccessContainer::value_type, typename RandomAccessContainer::reference >	make_container_vertex_map (RandomAccessContainer &c, const PropertyGraph &g)
template<class RandomAccessContainer >
iterator_property_map < typename RandomAccessContainer::iterator, identity_property_map, typename RandomAccessContainer::value_type, typename RandomAccessContainer::reference >	make_container_vertex_map (RandomAccessContainer &c)
template<typename Graph , typename Tag >
graph_property< Graph, graph_bundle_t >::type &	get_property (Graph &g, Tag)
template<typename Graph , typename Tag >
graph_property< Graph, graph_bundle_t >::type const &	get_property (Graph const &g, Tag)
template<typename Graph >
graph_property< Graph, graph_bundle_t >::type &	get_property (Graph &g)
template<typename Graph >
graph_property< Graph, graph_bundle_t >::type const &	get_property (const Graph &g)
template<class Graph , class Tag >
graph_property_iter_range < Graph, Tag >::type	get_property_iter_range (Graph &graph, const Tag &tag)
template<class Graph , class Tag >
graph_property_iter_range < Graph, Tag >::const_type	get_property_iter_range (const Graph &graph, const Tag &tag)
template<typename Key , typename Value >
constant_property_map< Key, Value >	make_constant_property (const Value &value)
template<typename Key , typename Value >
constant_writable_property_map < Key, Value >	make_constant_writable_property (const Value &value)
template<typename K , typename V >
void	put (null_property_map< K, V > &, const K &, const V &)
template<typename Key , typename Value >
null_property_map< Key, Value >	make_null_property ()
template<class Graph , class CapacityEdgeMap , class ResidualCapacityEdgeMap , class ReverseEdgeMap , class VertexIndexMap >
property_traits < CapacityEdgeMap > ::value_type	push_relabel_max_flow (Graph &g, typename graph_traits< Graph >::vertex_descriptor src, typename graph_traits< Graph >::vertex_descriptor sink, CapacityEdgeMap cap, ResidualCapacityEdgeMap res, ReverseEdgeMap rev, VertexIndexMap index_map)
template<class Graph , class P , class T , class R >
detail::edge_capacity_value < Graph, P, T, R >::type	push_relabel_max_flow (Graph &g, typename graph_traits< Graph >::vertex_descriptor src, typename graph_traits< Graph >::vertex_descriptor sink, const bgl_named_params< P, T, R > &params)
template<class Graph >
property_traits< typename property_map< Graph, edge_capacity_t >::const_type > ::value_type	push_relabel_max_flow (Graph &g, typename graph_traits< Graph >::vertex_descriptor src, typename graph_traits< Graph >::vertex_descriptor sink)
template<class Graph , class Resource_Container >
bool	operator== (const r_c_shortest_paths_label< Graph, Resource_Container > &l1, const r_c_shortest_paths_label< Graph, Resource_Container > &l2)
template<class Graph , class Resource_Container >
bool	operator!= (const r_c_shortest_paths_label< Graph, Resource_Container > &l1, const r_c_shortest_paths_label< Graph, Resource_Container > &l2)
template<class Graph , class Resource_Container >
bool	operator< (const r_c_shortest_paths_label< Graph, Resource_Container > &l1, const r_c_shortest_paths_label< Graph, Resource_Container > &l2)
template<class Graph , class Resource_Container >
bool	operator> (const r_c_shortest_paths_label< Graph, Resource_Container > &l1, const r_c_shortest_paths_label< Graph, Resource_Container > &l2)
template<class Graph , class Resource_Container >
bool	operator<= (const r_c_shortest_paths_label< Graph, Resource_Container > &l1, const r_c_shortest_paths_label< Graph, Resource_Container > &l2)
template<class Graph , class Resource_Container >
bool	operator>= (const r_c_shortest_paths_label< Graph, Resource_Container > &l1, const r_c_shortest_paths_label< Graph, Resource_Container > &l2)
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 (const Graph &g, const VertexIndexMap &vertex_index_map, const EdgeIndexMap &edge_index_map, 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, const Resource_Container &rc, const Resource_Extension_Function &ref, const Dominance_Function &dominance, Label_Allocator la, Visitor vis)
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 (const Graph &g, const VertexIndexMap &vertex_index_map, const EdgeIndexMap &edge_index_map, typename graph_traits< Graph >::vertex_descriptor s, typename graph_traits< Graph >::vertex_descriptor t, std::vector< typename graph_traits< Graph >::edge_descriptor > &pareto_optimal_solution, Resource_Container &pareto_optimal_resource_container, const Resource_Container &rc, const Resource_Extension_Function &ref, const Dominance_Function &dominance, Label_Allocator la, Visitor vis)
template<class Graph , class VertexIndexMap , class EdgeIndexMap , class Resource_Container , class Resource_Extension_Function , class Dominance_Function >
void	r_c_shortest_paths (const Graph &g, const VertexIndexMap &vertex_index_map, const EdgeIndexMap &edge_index_map, 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, const Resource_Container &rc, const Resource_Extension_Function &ref, const Dominance_Function &dominance)
template<class Graph , class VertexIndexMap , class EdgeIndexMap , class Resource_Container , class Resource_Extension_Function , class Dominance_Function >
void	r_c_shortest_paths (const Graph &g, const VertexIndexMap &vertex_index_map, const EdgeIndexMap &edge_index_map, typename graph_traits< Graph >::vertex_descriptor s, typename graph_traits< Graph >::vertex_descriptor t, std::vector< typename graph_traits< Graph >::edge_descriptor > &pareto_optimal_solution, Resource_Container &pareto_optimal_resource_container, const Resource_Container &rc, const Resource_Extension_Function &ref, const Dominance_Function &dominance)
template<class Graph , class Resource_Container , class Resource_Extension_Function >
void	check_r_c_path (const Graph &g, const std::vector< typename graph_traits< Graph >::edge_descriptor > &ed_vec_path, const Resource_Container &initial_resource_levels, bool b_result_must_be_equal_to_desired_final_resource_levels, const Resource_Container &desired_final_resource_levels, Resource_Container &actual_final_resource_levels, const Resource_Extension_Function &ref, bool &b_is_a_path_at_all, bool &b_feasible, bool &b_correctly_extended, typename graph_traits< Graph >::edge_descriptor &ed_last_extended_arc)
template<class Graph , class RandomNumGen >
graph_traits< Graph > ::vertex_descriptor	random_vertex (Graph &g, RandomNumGen &gen)
template<class Graph , class RandomNumGen >
graph_traits< Graph > ::edge_descriptor	random_edge (Graph &g, RandomNumGen &gen)
template<typename Graph , typename RandomNumGen >
graph_traits< Graph > ::edge_descriptor	random_out_edge (Graph &g, typename graph_traits< Graph >::vertex_descriptor src, RandomNumGen &gen)
template<typename Graph , typename WeightMap , typename RandomNumGen >
graph_traits< Graph > ::edge_descriptor	weighted_random_out_edge (Graph &g, typename graph_traits< Graph >::vertex_descriptor src, WeightMap weight, RandomNumGen &gen)
template<typename MutableGraph , class RandNumGen >
void	generate_random_graph1 (MutableGraph &g, typename graph_traits< MutableGraph >::vertices_size_type V, typename graph_traits< MutableGraph >::vertices_size_type E, RandNumGen &gen, bool allow_parallel=true, bool self_edges=false)
template<typename MutableGraph , class RandNumGen >
void	generate_random_graph (MutableGraph &g, typename graph_traits< MutableGraph >::vertices_size_type V, typename graph_traits< MutableGraph >::vertices_size_type E, RandNumGen &gen, bool allow_parallel=true, bool self_edges=false)
template<typename MutableGraph , typename RandNumGen , typename VertexOutputIterator , typename EdgeOutputIterator >
void	generate_random_graph (MutableGraph &g, typename graph_traits< MutableGraph >::vertices_size_type V, typename graph_traits< MutableGraph >::vertices_size_type E, RandNumGen &gen, VertexOutputIterator vertex_out, EdgeOutputIterator edge_out, bool self_edges=false)
template<class Property , class G , class RandomGenerator >
void	randomize_property (G &g, RandomGenerator &rg)
template<typename Topology , typename Graph , typename PositionMap >
void	random_graph_layout (const Graph &g, PositionMap position_map, const Topology &topology)
template<typename Graph , typename Gen , typename PredMap , typename ColorMap >
void	random_spanning_tree (const Graph &g, Gen &gen, typename graph_traits< Graph >::vertex_descriptor root, PredMap pred, static_property_map< double >, ColorMap color)
template<typename Graph , typename Gen , typename PredMap , typename WeightMap , typename ColorMap >
void	random_spanning_tree (const Graph &g, Gen &gen, typename graph_traits< Graph >::vertex_descriptor root, PredMap pred, WeightMap weight, ColorMap color)
template<typename Graph , typename Gen , typename P , typename T , typename R >
void	random_spanning_tree (const Graph &g, Gen &gen, const bgl_named_params< P, T, R > &params)
template<class Graph , class CapacityMap , class ReverseEdgeMap >
int	read_dimacs_max_flow (Graph &g, CapacityMap capacity, ReverseEdgeMap reverse_edge, typename graph_traits< Graph >::vertex_descriptor &src, typename graph_traits< Graph >::vertex_descriptor &sink, std::istream &in=std::cin)
template<class Graph , class CapacityMap , class ReverseEdgeMap >
int	read_dimacs_min_cut (Graph &g, CapacityMap capacity, ReverseEdgeMap reverse_edge, std::istream &in=std::cin)
template<class Graph , class WeightMap , class PredecessorMap , class DistanceMap , class BinaryFunction , class BinaryPredicate >
bool	relax (typename graph_traits< Graph >::edge_descriptor e, const Graph &g, const WeightMap &w, PredecessorMap &p, DistanceMap &d, const BinaryFunction &combine, const BinaryPredicate &compare)
template<class Graph , class WeightMap , class PredecessorMap , class DistanceMap >
bool	relax (typename graph_traits< Graph >::edge_descriptor e, const Graph &g, WeightMap w, PredecessorMap p, DistanceMap d)
template<class BidirectionalGraph >
reverse_graph< BidirectionalGraph >	make_reverse_graph (const BidirectionalGraph &g)
template<class BidirectionalGraph >
reverse_graph < BidirectionalGraph, BidirectionalGraph & >	make_reverse_graph (BidirectionalGraph &g)
template<class BidirectionalGraph , class GRef >
std::pair< typename reverse_graph < BidirectionalGraph > ::vertex_iterator, typename reverse_graph < BidirectionalGraph > ::vertex_iterator >	vertices (const reverse_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph , class GRef >
std::pair< typename reverse_graph < BidirectionalGraph > ::edge_iterator, typename reverse_graph < BidirectionalGraph > ::edge_iterator >	edges (const reverse_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph , class GRef >
std::pair< typename reverse_graph < BidirectionalGraph > ::out_edge_iterator, typename reverse_graph < BidirectionalGraph > ::out_edge_iterator >	out_edges (const typename graph_traits< BidirectionalGraph >::vertex_descriptor u, const reverse_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph , class GRef >
graph_traits < BidirectionalGraph > ::vertices_size_type	num_vertices (const reverse_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph , class GRef >
reverse_graph < BidirectionalGraph > ::edges_size_type	num_edges (const reverse_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph , class GRef >
graph_traits < BidirectionalGraph > ::degree_size_type	out_degree (const typename graph_traits< BidirectionalGraph >::vertex_descriptor u, const reverse_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph , class GRef >
graph_traits < BidirectionalGraph > ::vertex_descriptor	vertex (const typename graph_traits< BidirectionalGraph >::vertices_size_type v, const reverse_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph , class GRef >
std::pair< typename graph_traits< reverse_graph < BidirectionalGraph, GRef > >::edge_descriptor, bool >	edge (const typename graph_traits< BidirectionalGraph >::vertex_descriptor u, const typename graph_traits< BidirectionalGraph >::vertex_descriptor v, const reverse_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph , class GRef >
std::pair< typename reverse_graph < BidirectionalGraph > ::in_edge_iterator, typename reverse_graph < BidirectionalGraph > ::in_edge_iterator >	in_edges (const typename graph_traits< BidirectionalGraph >::vertex_descriptor u, const reverse_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph , class GRef >
std::pair< typename reverse_graph < BidirectionalGraph, GRef > ::adjacency_iterator, typename reverse_graph < BidirectionalGraph, GRef > ::adjacency_iterator >	adjacent_vertices (typename graph_traits< BidirectionalGraph >::vertex_descriptor u, const reverse_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph , class GRef >
graph_traits < BidirectionalGraph > ::degree_size_type	in_degree (const typename graph_traits< BidirectionalGraph >::vertex_descriptor u, const reverse_graph< BidirectionalGraph, GRef > &g)
template<class Edge , class BidirectionalGraph , class GRef >
graph_traits < BidirectionalGraph > ::vertex_descriptor	source (const detail::reverse_graph_edge_descriptor< Edge > &e, const reverse_graph< BidirectionalGraph, GRef > &g)
template<class Edge , class BidirectionalGraph , class GRef >
graph_traits < BidirectionalGraph > ::vertex_descriptor	target (const detail::reverse_graph_edge_descriptor< Edge > &e, const reverse_graph< BidirectionalGraph, GRef > &g)
template<class BidirGraph , class GRef , class Property >
disable_if< is_same< Property, edge_underlying_t >, typename property_map< reverse_graph < BidirGraph, GRef >, Property > ::type >::type	get (Property p, reverse_graph< BidirGraph, GRef > &g)
template<class BidirGraph , class GRef , class Property >
disable_if< is_same< Property, edge_underlying_t >, typename property_map< reverse_graph < BidirGraph, GRef >, Property > ::const_type >::type	get (Property p, const reverse_graph< BidirGraph, GRef > &g)
template<class BidirectionalGraph , class GRef , class Property , class Key >
disable_if< is_same< Property, edge_underlying_t >, typename property_traits< typename property_map< reverse_graph < BidirectionalGraph, GRef > , Property >::const_type > ::value_type >::type	get (Property p, const reverse_graph< BidirectionalGraph, GRef > &g, const Key &k)
template<class BidirectionalGraph , class GRef , class Property , class Key , class Value >
void	put (Property p, reverse_graph< BidirectionalGraph, GRef > &g, const Key &k, const Value &val)
template<class G >
enable_if< is_reverse_graph< G > , detail::underlying_edge_desc_map_type < typename graph_traits < typename G::base_type > ::edge_descriptor > >::type	get (edge_underlying_t, G &)
template<class G >
enable_if< is_reverse_graph< G > , typename graph_traits < typename G::base_type > ::edge_descriptor >::type	get (edge_underlying_t, G &, const typename graph_traits< G >::edge_descriptor &k)
template<class G >
enable_if< is_reverse_graph< G > , detail::underlying_edge_desc_map_type < typename graph_traits < typename G::base_type > ::edge_descriptor > >::type	get (edge_underlying_t, const G &)
template<class G >
enable_if< is_reverse_graph< G > , typename graph_traits < typename G::base_type > ::edge_descriptor >::type	get (edge_underlying_t, const G &, const typename graph_traits< G >::edge_descriptor &k)
template<typename BidirectionalGraph , typename GRef , typename Tag , typename Value >
void	set_property (const reverse_graph< BidirectionalGraph, GRef > &g, Tag tag, const Value &value)
template<typename BidirectionalGraph , typename GRef , typename Tag >
boost::mpl::if_ < boost::is_const< typename boost::remove_reference< GRef > ::type >, const typename graph_property < BidirectionalGraph, Tag > ::type &, typename graph_property < BidirectionalGraph, Tag > ::type & >::type	get_property (const reverse_graph< BidirectionalGraph, GRef > &g, Tag tag)
template<class VertexListGraph , class OrderPA , class ColorMap >
property_traits< ColorMap > ::value_type	sequential_vertex_coloring (const VertexListGraph &G, OrderPA order, ColorMap color)
template<class VertexListGraph , class ColorMap >
property_traits< ColorMap > ::value_type	sequential_vertex_coloring (const VertexListGraph &G, ColorMap color)
template<class Distance >
Distance::value_type	RLS_depth (Distance &d)
template<class Distance , class my_int >
Distance::value_type	RLS_max_width (Distance &d, my_int depth)
template<class Graph , class ColorMap , class DegreeMap >
graph_traits< Graph > ::vertex_descriptor	sloan_start_end_vertices (Graph &G, typename graph_traits< Graph >::vertex_descriptor &s, ColorMap color, DegreeMap degree)
template<class Graph , class OutputIterator , class ColorMap , class DegreeMap , class PriorityMap , class Weight >
OutputIterator	sloan_ordering (Graph &g, typename graph_traits< Graph >::vertex_descriptor s, typename graph_traits< Graph >::vertex_descriptor e, OutputIterator permutation, ColorMap color, DegreeMap degree, PriorityMap priority, Weight W1, Weight W2)
template<class Graph , class OutputIterator , class ColorMap , class DegreeMap , class PriorityMap >
OutputIterator	sloan_ordering (Graph &g, typename graph_traits< Graph >::vertex_descriptor s, typename graph_traits< Graph >::vertex_descriptor e, OutputIterator permutation, ColorMap color, DegreeMap degree, PriorityMap priority)
template<class Graph , class OutputIterator , class Color , class Degree , class Priority , class Weight >
OutputIterator	sloan_ordering (Graph &G, OutputIterator permutation, Color color, Degree degree, Priority priority, Weight W1, Weight W2)
template<class Graph , class OutputIterator , class Color , class Degree , class Priority >
OutputIterator	sloan_ordering (Graph &G, OutputIterator permutation, Color color, Degree degree, Priority priority)
template<class VertexListGraph , class Order , class Degree , class Marker >
void	smallest_last_vertex_ordering (const VertexListGraph &G, Order order, Degree degree, Marker marker)
template<class VertexListGraph , class Order , class Degree , class Marker , class BucketSorter >
void	smallest_last_vertex_ordering (const VertexListGraph &G, Order order, Degree degree, Marker marker, BucketSorter &degree_buckets)
template<class VertexListGraph , class Order >
void	smallest_last_vertex_ordering (const VertexListGraph &G, Order order)
template<class VertexListGraph >
std::vector< typename graph_traits< VertexListGraph > ::vertex_descriptor >	smallest_last_vertex_ordering (const VertexListGraph &G)
std::pair< sgb_vertex_iterator, sgb_vertex_iterator >	vertices (sgb_const_graph_ptr g)
std::pair < sgb_out_edge_iterator, sgb_out_edge_iterator >	out_edges (Vertex *u, sgb_const_graph_ptr)
boost::graph_traits < sgb_graph_ptr > ::degree_size_type	out_degree (Vertex *u, sgb_const_graph_ptr g)
std::pair< sgb_adj_iterator, sgb_adj_iterator >	adjacent_vertices (Vertex *u, sgb_const_graph_ptr)
long	num_vertices (sgb_const_graph_ptr g)
long	num_edges (sgb_const_graph_ptr g)
Vertex *	vertex (long v, sgb_const_graph_ptr g)
sgb_vertex_id_map	get (vertex_index_t, sgb_graph_ptr g)
sgb_vertex_name_map	get (vertex_name_t, sgb_graph_ptr)
Vertex *&	get_util (util &u, Vertex *)
Arc *&	get_util (util &u, Arc *)
sgb_graph_ptr &	get_util (util &u, sgb_graph_ptr)
char *&	get_util (util &u, char *)
long &	get_util (util &u, long)
template<class T >
T &	get_util_field (Vertex *k, u_property< T >)
template<class T >
T &	get_util_field (Vertex *k, v_property< T >)
template<class T >
T &	get_util_field (Vertex *k, w_property< T >)
template<class T >
T &	get_util_field (Vertex *k, x_property< T >)
template<class T >
T &	get_util_field (Vertex *k, y_property< T >)
template<class T >
T &	get_util_field (Vertex *k, z_property< T >)
template<class T >
T &	get_util_field (Arc *k, a_property< T >)
template<class T >
T &	get_util_field (Arc *k, b_property< T >)
template<class Tag >
sgb_vertex_util_map< Tag, const typename Tag::type & >	get_property_map (Tag, const sgb_graph_ptr &g, vertex_property_tag)
template<class Tag >
sgb_vertex_util_map< Tag, typename Tag::type & >	get_property_map (Tag, sgb_graph_ptr &g, vertex_property_tag)
template<class Tag >
sgb_edge_util_map< Tag, const typename Tag::type & >	get_property_map (Tag, const sgb_graph_ptr &g, edge_property_tag)
template<class Tag >
sgb_edge_util_map< Tag, typename Tag::type & >	get_property_map (Tag, sgb_graph_ptr &g, edge_property_tag)
sgb_edge_length_map< const long & >	get (edge_length_t, const sgb_graph_ptr &)
sgb_edge_length_map< const long & >	get (edge_length_t, const sgb_const_graph_ptr &)
sgb_edge_length_map< long & >	get (edge_length_t, sgb_graph_ptr &)
long	get (edge_length_t, const sgb_graph_ptr &, const sgb_edge &key)
long	get (edge_length_t, const sgb_const_graph_ptr &, const sgb_edge &key)
void	put (edge_length_t, sgb_graph_ptr &, const sgb_edge &key, long value)
template<class T >
sgb_vertex_util_map < u_property< T >, T & >	get (u_property< T >, sgb_graph_ptr &)
template<class T >
sgb_vertex_util_map < u_property< T >, const T & >	get (u_property< T >, const sgb_graph_ptr &)
template<class T >
sgb_vertex_util_map < u_property< T >, const T & >	get (u_property< T >, const sgb_const_graph_ptr &)
template<class T , class Key >
sgb_vertex_util_map < u_property< T >, const T & > ::value_type	get (u_property< T >, const sgb_graph_ptr &, const Key &key)
template<class T , class Key >
sgb_vertex_util_map < u_property< T >, const T & > ::value_type	get (u_property< T >, const sgb_const_graph_ptr &, const Key &key)
template<class T , class Key , class Value >
void	put (u_property< T >, sgb_graph_ptr &, const Key &key, const Value &value)
template<class T >
sgb_vertex_util_map < v_property< T >, T & >	get (v_property< T >, sgb_graph_ptr &)
template<class T >
sgb_vertex_util_map < v_property< T >, const T & >	get (v_property< T >, const sgb_graph_ptr &)
template<class T >
sgb_vertex_util_map < v_property< T >, const T & >	get (v_property< T >, const sgb_const_graph_ptr &)
template<class T , class Key >
sgb_vertex_util_map < v_property< T >, const T & > ::value_type	get (v_property< T >, const sgb_graph_ptr &, const Key &key)
template<class T , class Key >
sgb_vertex_util_map < v_property< T >, const T & > ::value_type	get (v_property< T >, const sgb_const_graph_ptr &, const Key &key)
template<class T , class Key , class Value >
void	put (v_property< T >, sgb_graph_ptr &, const Key &key, const Value &value)
template<class T >
sgb_vertex_util_map < w_property< T >, T & >	get (w_property< T >, sgb_graph_ptr &)
template<class T >
sgb_vertex_util_map < w_property< T >, const T & >	get (w_property< T >, const sgb_graph_ptr &)
template<class T >
sgb_vertex_util_map < w_property< T >, const T & >	get (w_property< T >, const sgb_const_graph_ptr &)
template<class T , class Key >
sgb_vertex_util_map < w_property< T >, const T & > ::value_type	get (w_property< T >, const sgb_graph_ptr &, const Key &key)
template<class T , class Key >
sgb_vertex_util_map < w_property< T >, const T & > ::value_type	get (w_property< T >, const sgb_const_graph_ptr &, const Key &key)
template<class T , class Key , class Value >
void	put (w_property< T >, sgb_graph_ptr &, const Key &key, const Value &value)
template<class T >
sgb_vertex_util_map < x_property< T >, T & >	get (x_property< T >, sgb_graph_ptr &)
template<class T >
sgb_vertex_util_map < x_property< T >, const T & >	get (x_property< T >, const sgb_graph_ptr &)
template<class T >
sgb_vertex_util_map < x_property< T >, const T & >	get (x_property< T >, const sgb_const_graph_ptr &)
template<class T , class Key >
sgb_vertex_util_map < x_property< T >, const T & > ::value_type	get (x_property< T >, const sgb_graph_ptr &, const Key &key)
template<class T , class Key >
sgb_vertex_util_map < x_property< T >, const T & > ::value_type	get (x_property< T >, const sgb_const_graph_ptr &, const Key &key)
template<class T , class Key , class Value >
void	put (x_property< T >, sgb_graph_ptr &, const Key &key, const Value &value)
template<class T >
sgb_vertex_util_map < y_property< T >, T & >	get (y_property< T >, sgb_graph_ptr &)
template<class T >
sgb_vertex_util_map < y_property< T >, const T & >	get (y_property< T >, const sgb_graph_ptr &)
template<class T >
sgb_vertex_util_map < y_property< T >, const T & >	get (y_property< T >, const sgb_const_graph_ptr &)
template<class T , class Key >
sgb_vertex_util_map < y_property< T >, const T & > ::value_type	get (y_property< T >, const sgb_graph_ptr &, const Key &key)
template<class T , class Key >
sgb_vertex_util_map < y_property< T >, const T & > ::value_type	get (y_property< T >, const sgb_const_graph_ptr &, const Key &key)
template<class T , class Key , class Value >
void	put (y_property< T >, sgb_graph_ptr &, const Key &key, const Value &value)
template<class T >
sgb_vertex_util_map < z_property< T >, T & >	get (z_property< T >, sgb_graph_ptr &)
template<class T >
sgb_vertex_util_map < z_property< T >, const T & >	get (z_property< T >, const sgb_graph_ptr &)
template<class T >
sgb_vertex_util_map < z_property< T >, const T & >	get (z_property< T >, const sgb_const_graph_ptr &)
template<class T , class Key >
sgb_vertex_util_map < z_property< T >, const T & > ::value_type	get (z_property< T >, const sgb_graph_ptr &, const Key &key)
template<class T , class Key >
sgb_vertex_util_map < z_property< T >, const T & > ::value_type	get (z_property< T >, const sgb_const_graph_ptr &, const Key &key)
template<class T , class Key , class Value >
void	put (z_property< T >, sgb_graph_ptr &, const Key &key, const Value &value)
template<class T >
sgb_edge_util_map< a_property < T >, T & >	get (a_property< T >, sgb_graph_ptr &)
template<class T >
sgb_edge_util_map< a_property < T >, const T & >	get (a_property< T >, const sgb_graph_ptr &)
template<class T >
sgb_edge_util_map< a_property < T >, const T & >	get (a_property< T >, const sgb_const_graph_ptr &)
template<class T , class Key >
sgb_edge_util_map< a_property < T >, const T & >::value_type	get (a_property< T >, const sgb_graph_ptr &, const Key &key)
template<class T , class Key >
sgb_edge_util_map< a_property < T >, const T & >::value_type	get (a_property< T >, const sgb_const_graph_ptr &, const Key &key)
template<class T , class Key , class Value >
void	put (a_property< T >, sgb_graph_ptr &, const Key &key, const Value &value)
template<class T >
sgb_edge_util_map< b_property < T >, T & >	get (b_property< T >, sgb_graph_ptr &)
template<class T >
sgb_edge_util_map< b_property < T >, const T & >	get (b_property< T >, const sgb_graph_ptr &)
template<class T >
sgb_edge_util_map< b_property < T >, const T & >	get (b_property< T >, const sgb_const_graph_ptr &)
template<class T , class Key >
sgb_edge_util_map< b_property < T >, const T & >::value_type	get (b_property< T >, const sgb_graph_ptr &, const Key &key)
template<class T , class Key >
sgb_edge_util_map< b_property < T >, const T & >::value_type	get (b_property< T >, const sgb_const_graph_ptr &, const Key &key)
template<class T , class Key , class Value >
void	put (b_property< T >, sgb_graph_ptr &, const Key &key, const Value &value)
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)
template<class Graph , class ComponentMap , class P , class T , class R >
property_traits< ComponentMap > ::value_type	strong_components (const Graph &g, ComponentMap comp, const bgl_named_params< P, T, R > &params BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<class Graph , class ComponentMap >
property_traits< ComponentMap > ::value_type	strong_components (const Graph &g, ComponentMap comp BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<typename Graph , typename ComponentMap , typename ComponentLists >
void	build_component_lists (const Graph &g, typename graph_traits< Graph >::vertices_size_type num_scc, ComponentMap component_number, ComponentLists &components)
template<class Graph , class DFSVisitor , class ComponentsMap , class DiscoverTime , class FinishTime , class ColorMap >
property_traits< ComponentsMap > ::value_type	kosaraju_strong_components (Graph &G, ComponentsMap c, FinishTime finish_time, ColorMap color)
template<typename G >
subgraph< G >::vertex_descriptor	add_vertex (typename subgraph< G >::vertex_descriptor u_global, subgraph< G > &g)
template<typename G >
std::pair< typename graph_traits< G > ::out_edge_iterator, typename graph_traits< G > ::out_edge_iterator >	out_edges (typename graph_traits< G >::vertex_descriptor v, const subgraph< G > &g)
template<typename G >
graph_traits< G >::degree_size_type	out_degree (typename graph_traits< G >::vertex_descriptor v, const subgraph< G > &g)
template<typename G >
graph_traits< G > ::vertex_descriptor	source (typename graph_traits< G >::edge_descriptor e, const subgraph< G > &g)
template<typename G >
graph_traits< G > ::vertex_descriptor	target (typename graph_traits< G >::edge_descriptor e, const subgraph< G > &g)
template<typename G >
std::pair< typename graph_traits< G > ::in_edge_iterator, typename graph_traits< G > ::in_edge_iterator >	in_edges (typename graph_traits< G >::vertex_descriptor v, const subgraph< G > &g)
template<typename G >
graph_traits< G >::degree_size_type	in_degree (typename graph_traits< G >::vertex_descriptor v, const subgraph< G > &g)
template<typename G >
graph_traits< G >::degree_size_type	degree (typename graph_traits< G >::vertex_descriptor v, const subgraph< G > &g)
template<typename G >
std::pair< typename subgraph < G >::adjacency_iterator, typename subgraph< G > ::adjacency_iterator >	adjacent_vertices (typename subgraph< G >::vertex_descriptor v, const subgraph< G > &g)
template<typename G >
std::pair< typename subgraph < G >::vertex_iterator, typename subgraph< G > ::vertex_iterator >	vertices (const subgraph< G > &g)
template<typename G >
subgraph< G >::vertices_size_type	num_vertices (const subgraph< G > &g)
template<typename G >
std::pair< typename subgraph < G >::edge_iterator, typename subgraph< G >::edge_iterator >	edges (const subgraph< G > &g)
template<typename G >
subgraph< G >::edges_size_type	num_edges (const subgraph< G > &g)
template<typename G >
std::pair< typename subgraph < G >::edge_descriptor, bool >	edge (typename subgraph< G >::vertex_descriptor u, typename subgraph< G >::vertex_descriptor v, const subgraph< G > &g)
template<typename G >
std::pair< typename subgraph < G >::edge_descriptor, bool >	add_edge (typename subgraph< G >::vertex_descriptor u, typename subgraph< G >::vertex_descriptor v, const typename G::edge_property_type &ep, subgraph< G > &g)
template<typename G >
std::pair< typename subgraph < G >::edge_descriptor, bool >	add_edge (typename subgraph< G >::vertex_descriptor u, typename subgraph< G >::vertex_descriptor v, subgraph< G > &g)
template<typename G >
void	remove_edge (typename subgraph< G >::vertex_descriptor u, typename subgraph< G >::vertex_descriptor v, subgraph< G > &g)
template<typename G >
void	remove_edge (typename subgraph< G >::edge_descriptor e, subgraph< G > &g)
template<typename Predicate , typename G >
void	remove_edge_if (Predicate p, subgraph< G > &g)
template<typename G >
void	clear_vertex (typename subgraph< G >::vertex_descriptor v, subgraph< G > &g)
template<typename G >
subgraph< G >::vertex_descriptor	add_vertex (subgraph< G > &g)
template<typename G , typename Property >
property_map< subgraph< G > , Property >::type	get (Property p, subgraph< G > &g)
template<typename G , typename Property >
property_map< subgraph< G > , Property >::const_type	get (Property p, const subgraph< G > &g)
template<typename G , typename Property , typename Key >
property_traits< typename property_map< subgraph< G > , Property >::const_type > ::value_type	get (Property p, const subgraph< G > &g, const Key &k)
template<typename G , typename Property , typename Key , typename Value >
void	put (Property p, subgraph< G > &g, const Key &k, const Value &val)
template<typename G , typename Property >
property_map< subgraph< G > , global_property< Property > >::type	get (global_property< Property > p, subgraph< G > &g)
template<typename G , typename Property >
property_map< subgraph< G > , global_property< Property > >::const_type	get (global_property< Property > p, const subgraph< G > &g)
template<typename G , typename Property >
property_map< subgraph< G > , local_property< Property > >::type	get (local_property< Property > p, subgraph< G > &g)
template<typename G , typename Property >
property_map< subgraph< G > , local_property< Property > >::const_type	get (local_property< Property > p, const subgraph< G > &g)
template<typename G , typename Tag >
graph_property< G, Tag >::type &	get_property (subgraph< G > &g, Tag tag)
template<typename G , typename Tag >
const graph_property< G, Tag > ::type &	get_property (const subgraph< G > &g, Tag tag)
template<typename G >
subgraph< G >::vertex_descriptor	vertex (typename subgraph< G >::vertices_size_type n, const subgraph< G > &g)
template<class Graph , class Capacity , class ResidualCapacity , class Reversed , class Pred , class Weight , class Distance , class Distance2 , class VertexIndex >
void	successive_shortest_path_nonnegative_weights (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 distance, Distance2 distance_prev)
template<class Graph , class P , class T , class R >
void	successive_shortest_path_nonnegative_weights (Graph &g, typename graph_traits< Graph >::vertex_descriptor s, typename graph_traits< Graph >::vertex_descriptor t, const bgl_named_params< P, T, R > &params)
template<class Graph >
void	successive_shortest_path_nonnegative_weights (Graph &g, typename graph_traits< Graph >::vertex_descriptor s, typename graph_traits< Graph >::vertex_descriptor t)
min_max_cycle_visitor	find_min_max_cycle (std::size_t &min_, std::size_t &max_)
template<typename Graph , typename Visitor >
void	tiernan_all_cycles (const Graph &g, Visitor vis, std::size_t minlen, std::size_t maxlen)
template<typename Graph , typename Visitor >
void	tiernan_all_cycles (const Graph &g, Visitor vis, std::size_t maxlen)
template<typename Graph , typename Visitor >
void	tiernan_all_cycles (const Graph &g, Visitor vis)
template<typename Graph >
std::pair< std::size_t, std::size_t >	tiernan_girth_and_circumference (const Graph &g)
template<typename Graph >
std::size_t	tiernan_girth (const Graph &g)
template<typename Graph >
std::size_t	tiernan_circumference (const Graph &g)
template<typename VertexListGraph , typename OutputIterator , typename P , typename T , typename R >
void	topological_sort (VertexListGraph &g, OutputIterator result, const bgl_named_params< P, T, R > &params)
template<typename VertexListGraph , typename OutputIterator >
void	topological_sort (VertexListGraph &g, OutputIterator result)
template<typename Graph , typename GraphTC , typename G_to_TC_VertexMap , typename VertexIndexMap >
void	transitive_closure (const Graph &g, GraphTC &tc, G_to_TC_VertexMap g_to_tc_map, VertexIndexMap index_map)
template<typename Graph , typename GraphTC >
void	transitive_closure (const Graph &g, GraphTC &tc)
template<typename Graph , typename GraphTC , typename P , typename T , typename R >
void	transitive_closure (const Graph &g, GraphTC &tc, const bgl_named_params< P, T, R > &params)
template<typename G >
void	warshall_transitive_closure (G &g)
template<typename G >
void	warren_transitive_closure (G &g)
template<typename Graph , typename GraphTR , typename G_to_TR_VertexMap , typename VertexIndexMap >
	BOOST_CONCEPT_REQUIRES (((VertexListGraphConcept< Graph >))((IncidenceGraphConcept< Graph >))((MutableGraphConcept< GraphTR >))((ReadablePropertyMapConcept< VertexIndexMap, typename graph_traits< Graph >::vertex_descriptor >))((Integer< typenameproperty_traits< VertexIndexMap >::value_type >))((LvaluePropertyMapConcept< G_to_TR_VertexMap, typename graph_traits< Graph >::vertex_descriptor >)),(void)) transitive_reduction(const Graph &g
	topological_sort (g, std::back_inserter(topo_order))
std::vector< size_type >	topo_number_storage (num_vertices(g))
	for (;it!=topo_order.rend();++it,++n)
std::vector< std::vector< bool > >	edge_in_closure (num_vertices(g), std::vector< bool >(num_vertices(g), false))
	for (;it!=topo_order.rend();++it)
template<class VertexListGraph , class MutableGraph >
void	transpose_graph (const VertexListGraph &G, MutableGraph &G_T)
template<class VertexListGraph , class MutableGraph , class P , class T , class R >
void	transpose_graph (const VertexListGraph &G, MutableGraph &G_T, const bgl_named_params< P, T, R > &params)
template<class Tree , class TreeVisitor >
void	traverse_tree (typename tree_traits< Tree >::node_descriptor v, Tree &t, TreeVisitor visitor)
template<typename IndexMap >
two_bit_color_type	get (const two_bit_color_map< IndexMap > &pm, typename property_traits< IndexMap >::key_type key)
template<typename IndexMap >
void	put (const two_bit_color_map< IndexMap > &pm, typename property_traits< IndexMap >::key_type key, two_bit_color_type value)
template<typename IndexMap >
two_bit_color_map< IndexMap >	make_two_bit_color_map (std::size_t n, const IndexMap &index_map)
template<typename Graph , typename Order , typename Func , typename Seq >
	BOOST_CONCEPT_REQUIRES (((RandomAccessContainer< Order >))((IncidenceGraphConcept< Graph >))((UnaryFunction< Func, void, Seq >))((Mutable_RandomAccessContainer< Seq >))((VertexAndEdgeListGraphConcept< Graph >)),(void)) two_graphs_common_spanning_trees(const Graph &iG
	BOOST_STATIC_ASSERT ((is_same< order_value_type, edge_descriptor >::value))
	BOOST_CONCEPT_ASSERT ((Convertible< order_size_type, edges_size_type >))
	BOOST_CONCEPT_ASSERT ((Convertible< seq_size_type, edges_size_type >))
	BOOST_STATIC_ASSERT ((is_same< seq_value_type, bool >::value))
	BOOST_STATIC_ASSERT ((is_same< directed_category, undirected_tag >::value))
	if (num_vertices(iG)!=num_vertices(vG)) return
	if (inL.size()!=num_edges(iG)||inL.size()!=num_edges(vG)) return
	if (iG_map.size()!=num_edges(iG)||vG_map.size()!=num_edges(vG)) return
	for (order_size_type i=0;i< iG_map.size();++i) iG_bimap.insert(bimap_value(i
	for (;current!=last;++current) if(iG_bimap.right.find(*current)
	undirected_dfs (iG, iG_vis, associative_property_map< std::map< vertex_descriptor, default_color_type > >(vertex_color), associative_property_map< std::map< edge_descriptor, default_color_type > >(edge_color))
	undirected_dfs (vG, vG_vis, associative_property_map< std::map< vertex_descriptor, default_color_type > >(vertex_color), associative_property_map< std::map< edge_descriptor, default_color_type > >(edge_color))
	while (!iG_buf.empty())
	while (!vG_buf.empty())
	undirected_dfs (make_filtered_graph(iG, detail::inL_edge_status< associative_property_map< std::map< edge_descriptor, bool > > >(aiG_inL)), make_dfs_visitor(detail::cycle_finder< std::stack< edge_descriptor > >(&iG_buf)), associative_property_map< std::map< vertex_descriptor, default_color_type > >(vertex_color), associative_property_map< std::map< edge_descriptor, default_color_type > >(edge_color))
	undirected_dfs (make_filtered_graph(vG, detail::inL_edge_status< associative_property_map< std::map< edge_descriptor, bool > > >(avG_inL)), make_dfs_visitor(detail::cycle_finder< std::stack< edge_descriptor > >(&vG_buf)), associative_property_map< std::map< vertex_descriptor, default_color_type > >(vertex_color), associative_property_map< std::map< edge_descriptor, default_color_type > >(edge_color))
	if (iG_buf.empty()&&vG_buf.empty())
template<typename Graph , typename Func , typename Seq >
	BOOST_CONCEPT_REQUIRES (((IncidenceGraphConcept< Graph >))((EdgeListGraphConcept< Graph >)),(void)) two_graphs_common_spanning_trees(const Graph &iG
	for (;curr!=last;++curr) iGO.push_back(*curr)
	two_graphs_common_spanning_trees (iG, iGO, vG, vGO, func, inL)
template<typename Graph , typename DFSVisitor , typename VertexColorMap , typename EdgeColorMap , typename Vertex >
void	undirected_dfs (const Graph &g, DFSVisitor vis, VertexColorMap vertex_color, EdgeColorMap edge_color, Vertex start_vertex)
template<typename Graph , typename DFSVisitor , typename VertexColorMap , typename EdgeColorMap >
void	undirected_dfs (const Graph &g, DFSVisitor vis, VertexColorMap vertex_color, EdgeColorMap edge_color)
template<typename Graph , typename P , typename T , typename R >
void	undirected_dfs (const Graph &g, const bgl_named_params< P, T, R > &params)
template<typename IncidenceGraph , typename DFSVisitor , typename VertexColorMap , typename EdgeColorMap >
void	undirected_depth_first_visit (const IncidenceGraph &g, typename graph_traits< IncidenceGraph >::vertex_descriptor u, DFSVisitor vis, VertexColorMap vertex_color, EdgeColorMap edge_color)
template<typename VP , typename EP , typename GP >
undirected_graph< VP, EP, GP > ::vertex_descriptor	source (typename undirected_graph< VP, EP, GP >::edge_descriptor e, undirected_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
undirected_graph< VP, EP, GP > ::vertex_descriptor	target (typename undirected_graph< VP, EP, GP >::edge_descriptor e, undirected_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
undirected_graph< VP, EP, GP > ::degree_size_type	out_degree (typename undirected_graph< VP, EP, GP >::vertex_descriptor v, undirected_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
std::pair< typename undirected_graph< VP, EP, GP > ::out_edge_iterator, typename undirected_graph< VP, EP, GP > ::out_edge_iterator >	out_edges (typename undirected_graph< VP, EP, GP >::vertex_descriptor v, undirected_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
undirected_graph< VP, EP, GP > ::degree_size_type	in_degree (typename undirected_graph< VP, EP, GP >::vertex_descriptor v, undirected_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
std::pair< typename undirected_graph< VP, EP, GP > ::in_edge_iterator, typename undirected_graph< VP, EP, GP > ::in_edge_iterator >	in_edges (typename undirected_graph< VP, EP, GP >::vertex_descriptor v, undirected_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
std::pair< typename undirected_graph< VP, EP, GP > ::out_edge_iterator, typename undirected_graph< VP, EP, GP > ::out_edge_iterator >	incident_edges (typename undirected_graph< VP, EP, GP >::vertex_descriptor v, undirected_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
undirected_graph< VP, EP, GP > ::degree_size_type	degree (typename undirected_graph< VP, EP, GP >::vertex_descriptor v, undirected_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
std::pair< typename undirected_graph< VP, EP, GP > ::adjacency_iterator, typename undirected_graph< VP, EP, GP > ::adjacency_iterator >	adjacent_vertices (typename undirected_graph< VP, EP, GP >::vertex_descriptor v, undirected_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
undirected_graph< VP, EP, GP > ::vertex_descriptor	vertex (typename undirected_graph< VP, EP, GP >::vertices_size_type n, undirected_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
std::pair< typename undirected_graph< VP, EP, GP > ::edge_descriptor, bool >	edge (typename undirected_graph< VP, EP, GP >::vertex_descriptor u, typename undirected_graph< VP, EP, GP >::vertex_descriptor v, undirected_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
undirected_graph< VP, EP, GP > ::vertices_size_type	num_vertices (undirected_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
std::pair< typename undirected_graph< VP, EP, GP > ::vertex_iterator, typename undirected_graph< VP, EP, GP > ::vertex_iterator >	vertices (undirected_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
undirected_graph< VP, EP, GP > ::edges_size_type	num_edges (undirected_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
std::pair< typename undirected_graph< VP, EP, GP > ::edge_iterator, typename undirected_graph< VP, EP, GP > ::edge_iterator >	edges (undirected_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
undirected_graph< VP, EP, GP > ::vertex_descriptor	add_vertex (undirected_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
undirected_graph< VP, EP, GP > ::vertex_descriptor	add_vertex (typename undirected_graph< VP, EP, GP >::vertex_property_type const &p, undirected_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	clear_vertex (typename undirected_graph< VP, EP, GP >::vertex_descriptor v, undirected_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	remove_vertex (typename undirected_graph< VP, EP, GP >::vertex_descriptor v, undirected_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
std::pair< typename undirected_graph< VP, EP, GP > ::edge_descriptor, bool >	add_edge (typename undirected_graph< VP, EP, GP >::vertex_descriptor u, typename undirected_graph< VP, EP, GP >::vertex_descriptor v, undirected_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
std::pair< typename undirected_graph< VP, EP, GP > ::edge_descriptor, bool >	add_edge (typename undirected_graph< VP, EP, GP >::vertex_descriptor u, typename undirected_graph< VP, EP, GP >::vertex_descriptor v, typename undirected_graph< VP, EP, GP >::edge_property_type const &p, undirected_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	remove_edge (typename undirected_graph< VP, EP, GP >::vertex_descriptor u, typename undirected_graph< VP, EP, GP >::vertex_descriptor v, undirected_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	remove_edge (typename undirected_graph< VP, EP, GP >::edge_descriptor e, undirected_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	remove_edge (typename undirected_graph< VP, EP, GP >::edge_iterator i, undirected_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP , class Predicate >
void	remove_edge_if (Predicate pred, undirected_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP , class Predicate >
void	remove_incident_edge_if (typename undirected_graph< VP, EP, GP >::vertex_descriptor v, Predicate pred, undirected_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP , class Predicate >
void	remove_out_edge_if (typename undirected_graph< VP, EP, GP >::vertex_descriptor v, Predicate pred, undirected_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP , class Predicate >
void	remove_in_edge_if (typename undirected_graph< VP, EP, GP >::vertex_descriptor v, Predicate pred, undirected_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP , typename Property >
property_map< undirected_graph < VP, EP, GP >, Property > ::type	get (Property p, undirected_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP , typename Property >
property_map< undirected_graph < VP, EP, GP >, Property > ::const_type	get (Property p, undirected_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
property_map< undirected_graph < VP, EP, GP >, vertex_all_t > ::type	get (vertex_all_t, undirected_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
property_map< undirected_graph < VP, EP, GP >, vertex_all_t > ::const_type	get (vertex_all_t, undirected_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
property_map< undirected_graph < VP, EP, GP >, edge_all_t > ::type	get (edge_all_t, undirected_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
property_map< undirected_graph < VP, EP, GP >, edge_all_t > ::const_type	get (edge_all_t, undirected_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP , typename Property , typename Key >
property_traits< typename property_map< typename undirected_graph< VP, EP, GP > ::graph_type, Property > ::const_type >::value_type	get (Property p, undirected_graph< VP, EP, GP > const &g, Key const &k)
template<typename VP , typename EP , typename GP , typename Key >
property_traits< typename property_map< typename undirected_graph< VP, EP, GP > ::graph_type, vertex_all_t > ::const_type >::value_type	get (vertex_all_t, undirected_graph< VP, EP, GP > const &g, Key const &k)
template<typename VP , typename EP , typename GP , typename Key >
property_traits< typename property_map< typename undirected_graph< VP, EP, GP > ::graph_type, edge_all_t > ::const_type >::value_type	get (edge_all_t, undirected_graph< VP, EP, GP > const &g, Key const &k)
template<typename VP , typename EP , typename GP , typename Property , typename Key , typename Value >
void	put (Property p, undirected_graph< VP, EP, GP > &g, Key const &k, Value const &v)
template<typename VP , typename EP , typename GP , typename Key , typename Value >
void	put (vertex_all_t, undirected_graph< VP, EP, GP > &g, Key const &k, Value const &v)
template<typename VP , typename EP , typename GP , typename Key , typename Value >
void	put (edge_all_t, undirected_graph< VP, EP, GP > &g, Key const &k, Value const &v)
template<typename VP , typename EP , typename GP , class Property >
graph_property < undirected_graph< VP, EP, GP > , Property >::type &	get_property (undirected_graph< VP, EP, GP > &g, Property p)
template<typename VP , typename EP , typename GP , class Property >
graph_property < undirected_graph< VP, EP, GP > , Property >::type const &	get_property (undirected_graph< VP, EP, GP > const &g, Property p)
template<typename VP , typename EP , typename GP , class Property , class Value >
void	set_property (undirected_graph< VP, EP, GP > &g, Property p, Value v)
template<typename VP , typename EP , typename GP >
undirected_graph< VP, EP, GP > ::vertex_index_type	get_vertex_index (typename undirected_graph< VP, EP, GP >::vertex_descriptor v, undirected_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
undirected_graph< VP, EP, GP > ::vertex_index_type	max_vertex_index (undirected_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
void	renumber_vertex_indices (undirected_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	remove_vertex_and_renumber_indices (typename undirected_graph< VP, EP, GP >::vertex_iterator i, undirected_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
undirected_graph< VP, EP, GP > ::edge_index_type	get_edge_index (typename undirected_graph< VP, EP, GP >::edge_descriptor v, undirected_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
undirected_graph< VP, EP, GP > ::edge_index_type	max_edge_index (undirected_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
void	renumber_edge_indices (undirected_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	remove_edge_and_renumber_indices (typename undirected_graph< VP, EP, GP >::edge_iterator i, undirected_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	renumber_indices (undirected_graph< VP, EP, GP > &g)
template<class EdgeList , class Alloc >
detail::val_out_edge_ret < EdgeList >::type	out_edges (typename EdgeList::value_type v, const std::vector< EdgeList, Alloc > &g)
template<class EdgeList , class Alloc >
EdgeList::size_type	out_degree (typename EdgeList::value_type v, const std::vector< EdgeList, Alloc > &g)
template<class EdgeList , class Alloc >
std::pair< typename EdgeList::const_iterator, typename EdgeList::const_iterator >	adjacent_vertices (typename EdgeList::value_type v, const std::vector< EdgeList, Alloc > &g)
template<class EdgeList , class Alloc >
std::pair < boost::counting_iterator < typename EdgeList::value_type > , boost::counting_iterator < typename EdgeList::value_type > >	vertices (const std::vector< EdgeList, Alloc > &v)
template<class EdgeList , class Alloc >
std::vector< EdgeList, Alloc > ::size_type	num_vertices (const std::vector< EdgeList, Alloc > &v)
template<class EdgeList , class Allocator >
std::pair< typename detail::val_edge< EdgeList > ::type, bool >	add_edge (typename EdgeList::value_type u, typename EdgeList::value_type v, std::vector< EdgeList, Allocator > &g)
template<class EdgeList , class Allocator >
std::pair< typename detail::val_edge< EdgeList > ::type, bool >	edge (typename EdgeList::value_type u, typename EdgeList::value_type v, std::vector< EdgeList, Allocator > &g)
template<class EdgeList , class Allocator >
void	remove_edge (typename EdgeList::value_type u, typename EdgeList::value_type v, std::vector< EdgeList, Allocator > &g)
template<class EdgeList , class Allocator >
void	remove_edge (typename detail::val_edge< EdgeList >::type e, std::vector< EdgeList, Allocator > &g)
template<class EdgeList , class Allocator , class Predicate >
void	remove_edge_if (Predicate p, std::vector< EdgeList, Allocator > &g)
template<class EdgeList , class Allocator >
EdgeList::value_type	add_vertex (std::vector< EdgeList, Allocator > &g)
template<class EdgeList , class Allocator >
void	clear_vertex (typename EdgeList::value_type u, std::vector< EdgeList, Allocator > &g)
template<class EdgeList , class Allocator >
void	remove_vertex (typename EdgeList::value_type u, std::vector< EdgeList, Allocator > &g)
template<typename EdgeList , typename Allocator >
identity_property_map	get (vertex_index_t, const std::vector< EdgeList, Allocator > &)
template<typename EdgeList , typename Allocator >
identity_property_map	get (vertex_index_t, std::vector< EdgeList, Allocator > &)
template<typename Graph >
std::vector< typename graph_traits< Graph > ::vertex_descriptor >	vertex_order_by_mult (const Graph &graph)
template<typename GraphSmall , typename GraphLarge , typename IndexMapSmall , typename IndexMapLarge , typename VertexOrderSmall , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename SubGraphIsoMapCallback >
bool	vf2_subgraph_mono (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<typename GraphSmall , typename GraphLarge , typename SubGraphIsoMapCallback >
bool	vf2_subgraph_mono (const GraphSmall &graph_small, const GraphLarge &graph_large, SubGraphIsoMapCallback user_callback)
template<typename GraphSmall , typename GraphLarge , typename VertexOrderSmall , typename SubGraphIsoMapCallback , typename Param , typename Tag , typename Rest >
bool	vf2_subgraph_mono (const GraphSmall &graph_small, const GraphLarge &graph_large, SubGraphIsoMapCallback user_callback, const VertexOrderSmall &vertex_order_small, const bgl_named_params< Param, Tag, Rest > &params)
template<typename GraphSmall , typename GraphLarge , typename IndexMapSmall , typename IndexMapLarge , typename VertexOrderSmall , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename SubGraphIsoMapCallback >
bool	vf2_subgraph_iso (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<typename GraphSmall , typename GraphLarge , typename SubGraphIsoMapCallback >
bool	vf2_subgraph_iso (const GraphSmall &graph_small, const GraphLarge &graph_large, SubGraphIsoMapCallback user_callback)
template<typename GraphSmall , typename GraphLarge , typename VertexOrderSmall , typename SubGraphIsoMapCallback , typename Param , typename Tag , typename Rest >
bool	vf2_subgraph_iso (const GraphSmall &graph_small, const GraphLarge &graph_large, SubGraphIsoMapCallback user_callback, const VertexOrderSmall &vertex_order_small, const bgl_named_params< Param, Tag, Rest > &params)
template<typename Graph1 , typename Graph2 , typename IndexMap1 , typename IndexMap2 , typename VertexOrder1 , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename GraphIsoMapCallback >
bool	vf2_graph_iso (const Graph1 &graph1, const Graph2 &graph2, GraphIsoMapCallback user_callback, IndexMap1 index_map1, IndexMap2 index_map2, const VertexOrder1 &vertex_order1, EdgeEquivalencePredicate edge_comp, VertexEquivalencePredicate vertex_comp)
template<typename Graph1 , typename Graph2 , typename GraphIsoMapCallback >
bool	vf2_graph_iso (const Graph1 &graph1, const Graph2 &graph2, GraphIsoMapCallback user_callback)
template<typename Graph1 , typename Graph2 , typename VertexOrder1 , typename GraphIsoMapCallback , typename Param , typename Tag , typename Rest >
bool	vf2_graph_iso (const Graph1 &graph1, const Graph2 &graph2, GraphIsoMapCallback user_callback, const VertexOrder1 &vertex_order1, const bgl_named_params< Param, Tag, Rest > &params)
template<typename Graph1 , typename Graph2 , typename CorresponenceMap1To2 , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate >
bool	verify_vf2_subgraph_iso (const Graph1 &graph1, const Graph2 &graph2, const CorresponenceMap1To2 f, EdgeEquivalencePredicate edge_comp, VertexEquivalencePredicate vertex_comp)
template<typename Graph1 , typename Graph2 , typename CorresponenceMap1To2 >
bool	verify_vf2_subgraph_iso (const Graph1 &graph1, const Graph2 &graph2, const CorresponenceMap1To2 f)
template<class T >
T	numeric_limits_max (T)
template<class Visitor , class Rest , class T , class Graph , class Tag >
void	invoke_visitors (std::pair< Visitor, Rest > &vlist, T x, Graph &g, Tag tag)
template<class Visitor , class T , class Graph , class Tag >
void	invoke_visitors (Visitor &v, T x, Graph &g, Tag)
template<class PredecessorMap , class Tag >
predecessor_recorder < PredecessorMap, Tag >	record_predecessors (PredecessorMap pa, Tag)
template<class PredEdgeMap , class Tag >
edge_predecessor_recorder < PredEdgeMap, Tag >	record_edge_predecessors (PredEdgeMap pa, Tag)
template<class DistanceMap , class Tag >
distance_recorder< DistanceMap, Tag >	record_distances (DistanceMap pa, Tag)
template<class TimeMap , class TimeT , class Tag >
time_stamper< TimeMap, TimeT, Tag >	stamp_times (TimeMap pa, TimeT &time_counter, Tag)
template<class PA , class OutputIterator , class Tag >
property_writer< PA, OutputIterator, Tag >	write_property (PA pa, OutputIterator out, Tag)
template<typename PropertyMap , typename EventTag >
property_put< PropertyMap, EventTag >	put_property (PropertyMap property_map, typename property_traits< PropertyMap >::value_type value, EventTag)
	Creates a property_put functor which just sets a given value to a vertex or edge. More...
template<typename Graph , typename VertexIndexMap >
graph_traits< Graph > ::vertices_size_type	ith_wavefront (typename graph_traits< Graph >::vertex_descriptor i, const Graph &g, VertexIndexMap index)
template<typename Graph >
graph_traits< Graph > ::vertices_size_type	ith_wavefront (typename graph_traits< Graph >::vertex_descriptor i, const Graph &g)
template<typename Graph , typename VertexIndexMap >
graph_traits< Graph > ::vertices_size_type	max_wavefront (const Graph &g, VertexIndexMap index)
template<typename Graph >
graph_traits< Graph > ::vertices_size_type	max_wavefront (const Graph &g)
template<typename Graph , typename VertexIndexMap >
double	aver_wavefront (const Graph &g, VertexIndexMap index)
template<typename Graph >
double	aver_wavefront (const Graph &g)
template<typename Graph , typename VertexIndexMap >
double	rms_wavefront (const Graph &g, VertexIndexMap index)
template<typename Graph >
double	rms_wavefront (const Graph &g)
template<class Graph , class CapacityMap , class IndexMap >
void	write_dimacs_max_flow (const Graph &g, CapacityMap capacity, IndexMap idx, typename graph_traits< Graph >::vertex_descriptor src, typename graph_traits< Graph >::vertex_descriptor sink, std::ostream &out)
template<typename T >
T	implicit_cast (typename boost::detail::icast_identity< T >::type x)
template<typename T >
int	integer_log2 (T x)
template<class Iterator , class T >
void	readable_iterator_traversal_test (Iterator i1, T v, mpl::true_)
template<class Iterator , class T >
void	readable_iterator_traversal_test (const Iterator i1, T v, mpl::false_)
template<class Iterator , class T >
void	writable_iterator_traversal_test (Iterator i1, T v, mpl::true_)
template<class Iterator , class T >
void	writable_iterator_traversal_test (const Iterator i1, T v, mpl::false_)
template<class Iterator , class T >
void	readable_iterator_test (const Iterator i1, T v)
template<class Iterator , class T >
void	writable_iterator_test (Iterator i, T v, T v2)
template<class Iterator >
void	swappable_iterator_test (Iterator i, Iterator j)
template<class Iterator , class T >
void	constant_lvalue_iterator_test (Iterator i, T v1)
template<class Iterator , class T >
void	non_const_lvalue_iterator_test (Iterator i, T v1, T v2)
template<class Iterator , class T >
void	forward_readable_iterator_test (Iterator i, Iterator j, T val1, T val2)
template<class Iterator , class T >
void	forward_swappable_iterator_test (Iterator i, Iterator j, T val1, T val2)
template<class Iterator , class T >
void	bidirectional_readable_iterator_test (Iterator i, T v1, T v2)
template<class Iterator , class TrueVals >
void	random_access_readable_iterator_test (Iterator i, int N, TrueVals vals)
template<typename Target , typename Source >
Target	lexical_cast (Source arg)
template<typename Target , typename Source >
Target	lexical_cast (const Source &arg)
template<typename Target >
Target	lexical_cast (const char *chars, std::size_t count)
template<typename Target >
Target	lexical_cast (const unsigned char *chars, std::size_t count)
template<typename Target >
Target	lexical_cast (const signed char *chars, std::size_t count)
template<typename Target >
Target	lexical_cast (const wchar_t *chars, std::size_t count)
template<typename Target >
Target	lexical_cast (const char16_t *chars, std::size_t count)
template<typename Target >
Target	lexical_cast (const char32_t *chars, std::size_t count)
void	swap (attribute &left, attribute &right) BOOST_NOEXCEPT
	The function swaps two attribute value factories. More...
template<typename T >
T	attribute_cast (attribute const &attr)
	The function casts one attribute factory to another. More...
template<typename CharT , typename TraitsT >
BOOST_LOG_API std::basic_ostream< CharT, TraitsT > &	operator<< (std::basic_ostream< CharT, TraitsT > &strm, attribute_name const &name)
void	swap (attribute_set &left, attribute_set &right) BOOST_NOEXCEPT
	Free swap overload. More...
void	swap (attribute_value &left, attribute_value &right) BOOST_NOEXCEPT
	The function swaps two attribute values. More...
void	swap (attribute_value_set &left, attribute_value_set &right) BOOST_NOEXCEPT
	Free swap overload. More...
template<typename LoggerT >
BOOST_FORCEINLINE aux::scoped_logger_attribute < LoggerT >	add_scoped_logger_attribute (LoggerT &l, attribute_name const &name, attribute const &attr)
	Registers an attribute in the logger. More...
BOOST_FORCEINLINE aux::scoped_thread_attribute	add_scoped_thread_attribute (attribute_name const &name, attribute const &attr)
	Registers a thread-specific attribute. More...
template<typename T , typename TagT = void>
result_of::extract< T, TagT >::type	extract (attribute_name const &name, attribute_value_set const &attrs)
	The function extracts an attribute value from the view. More...
template<typename T , typename TagT = void>
result_of::extract< T, TagT >::type	extract (attribute_name const &name, record const &rec)
	The function extracts an attribute value from the view. More...
template<typename T , typename TagT = void>
result_of::extract< T, TagT >::type	extract (attribute_name const &name, record_view const &rec)
	The function extracts an attribute value from the view. More...
template<typename T , typename TagT = void>
result_of::extract< T, TagT >::type	extract (attribute_value const &value)
	The function extracts an attribute value from the view. More...
template<typename T , typename TagT = void>
result_of::extract_or_throw< T, TagT >::type	extract_or_throw (attribute_name const &name, attribute_value_set const &attrs)
	The function extracts an attribute value from the view. More...
template<typename T , typename TagT = void>
result_of::extract_or_throw< T, TagT >::type	extract_or_throw (attribute_name const &name, record const &rec)
	The function extracts an attribute value from the view. More...
template<typename T , typename TagT = void>
result_of::extract_or_throw< T, TagT >::type	extract_or_throw (attribute_name const &name, record_view const &rec)
	The function extracts an attribute value from the view. More...
template<typename T , typename TagT = void>
result_of::extract_or_throw< T, TagT >::type	extract_or_throw (attribute_value const &value)
	The function extracts an attribute value from the view. More...
template<typename T , typename TagT = void, typename DefaultT >
result_of::extract_or_default < T, DefaultT, TagT >::type	extract_or_default (attribute_name const &name, attribute_value_set const &attrs, DefaultT const &def_val)
	The function extracts an attribute value from the view. More...
template<typename T , typename TagT = void, typename DefaultT >
result_of::extract_or_default < T, DefaultT, TagT >::type	extract_or_default (attribute_name const &name, record const &rec, DefaultT const &def_val)
	The function extracts an attribute value from the view. More...
template<typename T , typename TagT = void, typename DefaultT >
result_of::extract_or_default < T, DefaultT, TagT >::type	extract_or_default (attribute_name const &name, record_view const &rec, DefaultT const &def_val)
	The function extracts an attribute value from the view. More...
template<typename T , typename TagT = void, typename DefaultT >
result_of::extract_or_default < T, DefaultT, TagT >::type	extract_or_default (attribute_value const &value, DefaultT const &def_val)
	The function extracts an attribute value from the view. More...
template<typename DescriptorT , template< typename > class ActorT>
result_of::extract< typename DescriptorT::value_type, DescriptorT >::type	extract (expressions::attribute_keyword< DescriptorT, ActorT > const &keyword, attribute_value_set const &attrs)
	The function extracts an attribute value from the view. More...
template<typename DescriptorT , template< typename > class ActorT>
result_of::extract< typename DescriptorT::value_type, DescriptorT >::type	extract (expressions::attribute_keyword< DescriptorT, ActorT > const &keyword, record const &rec)
	The function extracts an attribute value from the view. More...
template<typename DescriptorT , template< typename > class ActorT>
result_of::extract< typename DescriptorT::value_type, DescriptorT >::type	extract (expressions::attribute_keyword< DescriptorT, ActorT > const &keyword, record_view const &rec)
	The function extracts an attribute value from the view. More...
template<typename DescriptorT , template< typename > class ActorT>
result_of::extract_or_throw < typename DescriptorT::value_type, DescriptorT >::type	extract_or_throw (expressions::attribute_keyword< DescriptorT, ActorT > const &keyword, attribute_value_set const &attrs)
	The function extracts an attribute value from the view. More...
template<typename DescriptorT , template< typename > class ActorT>
result_of::extract_or_throw < typename DescriptorT::value_type, DescriptorT >::type	extract_or_throw (expressions::attribute_keyword< DescriptorT, ActorT > const &keyword, record const &rec)
	The function extracts an attribute value from the view. More...
template<typename DescriptorT , template< typename > class ActorT>
result_of::extract_or_throw < typename DescriptorT::value_type, DescriptorT >::type	extract_or_throw (expressions::attribute_keyword< DescriptorT, ActorT > const &keyword, record_view const &rec)
	The function extracts an attribute value from the view. More...
template<typename DescriptorT , template< typename > class ActorT, typename DefaultT >
result_of::extract_or_default < typename DescriptorT::value_type, DefaultT, DescriptorT >::type	extract_or_default (expressions::attribute_keyword< DescriptorT, ActorT > const &keyword, attribute_value_set const &attrs, DefaultT const &def_val)
	The function extracts an attribute value from the view. More...
template<typename DescriptorT , template< typename > class ActorT, typename DefaultT >
result_of::extract_or_default < typename DescriptorT::value_type, DefaultT, DescriptorT >::type	extract_or_default (expressions::attribute_keyword< DescriptorT, ActorT > const &keyword, record const &rec, DefaultT const &def_val)
	The function extracts an attribute value from the view. More...
template<typename DescriptorT , template< typename > class ActorT, typename DefaultT >
result_of::extract_or_default < typename DescriptorT::value_type, DefaultT, DescriptorT >::type	extract_or_default (expressions::attribute_keyword< DescriptorT, ActorT > const &keyword, record_view const &rec, DefaultT const &def_val)
	The function extracts an attribute value from the view. More...
template<typename T , typename VisitorT >
visitation_result	visit (attribute_name const &name, attribute_value_set const &attrs, VisitorT visitor)
	The function applies a visitor to an attribute value from the view. More...
template<typename T , typename VisitorT >
visitation_result	visit (attribute_name const &name, record const &rec, VisitorT visitor)
	The function applies a visitor to an attribute value from the view. More...
template<typename T , typename VisitorT >
visitation_result	visit (attribute_name const &name, record_view const &rec, VisitorT visitor)
	The function applies a visitor to an attribute value from the view. More...
template<typename T , typename VisitorT >
visitation_result	visit (attribute_value const &value, VisitorT visitor)
	The function applies a visitor to an attribute value. More...
template<typename DescriptorT , template< typename > class ActorT, typename VisitorT >
visitation_result	visit (expressions::attribute_keyword< DescriptorT, ActorT > const &keyword, attribute_value_set const &attrs, VisitorT visitor)
	The function applies a visitor to an attribute value from the view. More...
template<typename DescriptorT , template< typename > class ActorT, typename VisitorT >
visitation_result	visit (expressions::attribute_keyword< DescriptorT, ActorT > const &keyword, record const &rec, VisitorT visitor)
	The function applies a visitor to an attribute value from the view. More...
template<typename DescriptorT , template< typename > class ActorT, typename VisitorT >
visitation_result	visit (expressions::attribute_keyword< DescriptorT, ActorT > const &keyword, record_view const &rec, VisitorT visitor)
	The function applies a visitor to an attribute value from the view. More...
void	swap (record &left, record &right) BOOST_NOEXCEPT
	A free-standing swap function overload for record. More...
void	swap (record_view &left, record_view &right) BOOST_NOEXCEPT
	A free-standing swap function overload for record_view. More...
void	swap (filter &left, filter &right) BOOST_NOEXCEPT
template<typename CharT >
void	swap (basic_formatter< CharT > &left, basic_formatter< CharT > &right) BOOST_NOEXCEPT
current_scope_info	current_scope ()
	The function returns an error information object that contains current stack of scopes. More...
nop	make_exception_suppressor ()
	The function creates an empty exception handler that effectively suppresses any exception. More...
template<typename HandlerT >
lazy_enable_if < aux::has_exception_types < HandlerT > , aux::make_self_contained_exception_handler < exception_handler, HandlerT > >::type	make_exception_handler (HandlerT const &handler)
template<typename HandlerT >
lazy_enable_if < aux::has_exception_types < HandlerT > , aux::make_self_contained_exception_handler < nothrow_exception_handler, HandlerT >>::type	make_exception_handler (HandlerT const &handler, std::nothrow_t const &)
template<typename CharT , typename TraitsT , typename AllocatorT , typename T >
basic_formatting_ostream < CharT, TraitsT, AllocatorT > &	operator<< (basic_formatting_ostream< CharT, TraitsT, AllocatorT > &strm, T const &value)
template<typename CharT , typename TraitsT , typename AllocatorT , typename T >
basic_formatting_ostream < CharT, TraitsT, AllocatorT > &	operator<< (basic_formatting_ostream< CharT, TraitsT, AllocatorT > &strm, T &value)
template<typename CharT , typename TraitsT , typename AllocatorT , typename T >
basic_formatting_ostream < CharT, TraitsT, AllocatorT > &	operator<< (basic_formatting_ostream< CharT, TraitsT, AllocatorT > &&strm, T const &value)
template<typename CharT , typename TraitsT , typename AllocatorT , typename T >
basic_formatting_ostream < CharT, TraitsT, AllocatorT > &	operator<< (basic_formatting_ostream< CharT, TraitsT, AllocatorT > &&strm, T &value)
template<typename FunT >
BOOST_FORCEINLINE as_action_adapter< FunT >	as_action (FunT const &fun)
template<typename FunT , typename FirstArgT >
BOOST_FORCEINLINE binder1st < FunT, FirstArgT >	bind1st (FunT fun, FirstArgT const &arg)
template<typename FunT , typename FirstArgT >
BOOST_FORCEINLINE binder1st < FunT, FirstArgT >	bind1st (FunT fun, FirstArgT &arg)
template<typename FunT , typename SecondArgT >
BOOST_FORCEINLINE binder2nd < FunT, SecondArgT >	bind2nd (FunT fun, SecondArgT const &arg)
template<typename FunT , typename SecondArgT >
BOOST_FORCEINLINE binder2nd < FunT, SecondArgT >	bind2nd (FunT fun, SecondArgT &arg)
template<typename FunT , typename ThirdArgT >
BOOST_FORCEINLINE binder3rd < FunT, ThirdArgT >	bind3rd (FunT fun, ThirdArgT const &arg)
template<typename FunT , typename ThirdArgT >
BOOST_FORCEINLINE binder3rd < FunT, ThirdArgT >	bind3rd (FunT fun, ThirdArgT &arg)
template<typename AssigneeT >
BOOST_FORCEINLINE binder1st < assign_fun, AssigneeT & >	bind_assign (AssigneeT &assignee)
template<typename StreamT >
BOOST_FORCEINLINE binder1st < output_fun, StreamT & >	bind_output (StreamT &strm)
template<typename StreamT >
BOOST_FORCEINLINE binder1st < to_log_fun< >, StreamT & >	bind_to_log (StreamT &strm)
template<typename TagT , typename StreamT >
BOOST_FORCEINLINE binder1st < to_log_fun< TagT >, StreamT & >	bind_to_log (StreamT &strm)
template<typename FunT >
BOOST_FORCEINLINE function_reference_wrapper < FunT >	fun_ref (FunT &fun)
template<typename FunT , typename AssigneeT >
BOOST_FORCEINLINE save_result_wrapper< FunT, AssigneeT >	save_result (FunT const &fun, AssigneeT &assignee)
template<typename CharT , typename RefT >
basic_record_ostream< CharT > &	operator<< (basic_record_ostream< CharT > &strm, add_value_manip< RefT > const &manip)
	The operator attaches an attribute value to the log record. More...
template<typename T >
add_value_manip< T && >	add_value (attribute_name const &name, T &&value)
	The function creates a manipulator that attaches an attribute value to a log record. More...
template<typename DescriptorT , template< typename > class ActorT>
add_value_manip< typename DescriptorT::value_type && >	add_value (expressions::attribute_keyword< DescriptorT, ActorT > const &, typename DescriptorT::value_type &&value)
template<typename DescriptorT , template< typename > class ActorT>
add_value_manip< typename DescriptorT::value_type & >	add_value (expressions::attribute_keyword< DescriptorT, ActorT > const &, typename DescriptorT::value_type &value)
template<typename DescriptorT , template< typename > class ActorT>
add_value_manip< typename DescriptorT::value_type const & >	add_value (expressions::attribute_keyword< DescriptorT, ActorT > const &, typename DescriptorT::value_type const &value)
template<typename CharT , typename TraitsT >
std::basic_ostream< CharT, TraitsT > &	operator<< (std::basic_ostream< CharT, TraitsT > &strm, dump_manip const &manip)
	The operator outputs binary data to a stream. More...
template<typename CharT , typename TraitsT >
std::basic_ostream< CharT, TraitsT > &	operator<< (std::basic_ostream< CharT, TraitsT > &strm, bounded_dump_manip const &manip)
	The operator outputs binary data to a stream. More...
template<typename T >
aux::enable_dump< T, dump_manip >::type	dump (T *data, std::size_t size) BOOST_NOEXCEPT
	Creates a stream manipulator that will output contents of a memory region in hexadecimal form. More...
template<typename T >
dump_manip	dump_elements (T *data, std::size_t count) BOOST_NOEXCEPT
	Creates a stream manipulator that will dump elements of an array in hexadecimal form. More...
template<typename T >
aux::enable_dump< T, bounded_dump_manip >::type	dump (T *data, std::size_t size, std::size_t max_size) BOOST_NOEXCEPT
	Creates a stream manipulator that will output contents of a memory region in hexadecimal form. More...
template<typename T >
bounded_dump_manip	dump_elements (T *data, std::size_t count, std::size_t max_count) BOOST_NOEXCEPT
	Creates a stream manipulator that will dump elements of an array in hexadecimal form. More...
template<typename CharT , typename TraitsT , typename T , typename TagT >
std::basic_ostream< CharT, TraitsT > &	operator<< (std::basic_ostream< CharT, TraitsT > &strm, to_log_manip< T, TagT > manip)
template<typename CharT , typename TraitsT , typename AllocatorT , typename T , typename TagT >
basic_formatting_ostream < CharT, TraitsT, AllocatorT > &	operator<< (basic_formatting_ostream< CharT, TraitsT, AllocatorT > &strm, to_log_manip< T, TagT > manip)
template<typename T >
to_log_manip< T >	to_log (T const &value)
template<typename TagT , typename T >
to_log_manip< T, TagT >	to_log (T const &value)
template<typename ValueT , typename FunT >
attribute_value_ordering < ValueT, FunT >	make_attr_ordering (attribute_name const &name, FunT const &fun)
	The function constructs a log record ordering predicate. More...
template<typename FunT >
aux::make_attr_ordering_type < FunT >::type	make_attr_ordering (attribute_name const &name, FunT const &fun)
	The function constructs a log record ordering predicate. More...
BOOST_LOG_OPEN_NAMESPACE void	add_common_attributes ()
	Simple attribute initialization routine. More...
template<typename CharT >
shared_ptr < sinks::synchronous_sink < sinks::basic_text_ostream_backend < CharT > >>	add_console_log ()
template<typename CharT >
shared_ptr < sinks::synchronous_sink < sinks::basic_text_ostream_backend < CharT > >>	add_console_log (std::basic_ostream< CharT > &strm)
template<typename CharT , typename ArgT1 >
shared_ptr < sinks::synchronous_sink < sinks::basic_text_ostream_backend < CharT > >>	add_console_log (std::basic_ostream< CharT > &strm, ArgT1 const &arg1)
template<typename CharT , typename ArgT1 , typename ArgT2 >
shared_ptr < sinks::synchronous_sink < sinks::basic_text_ostream_backend < CharT > >>	add_console_log (std::basic_ostream< CharT > &strm, ArgT1 const &arg1, ArgT2 const &arg2)
template<typename CharT , typename ArgT1 , typename ArgT2 , typename ArgT3 >
shared_ptr < sinks::synchronous_sink < sinks::basic_text_ostream_backend < CharT > >>	add_console_log (std::basic_ostream< CharT > &strm, ArgT1 const &arg1, ArgT2 const &arg2, ArgT3 const &arg3)
template<typename CharT >
BOOST_LOG_SETUP_API void	register_filter_factory (attribute_name const &name, shared_ptr< filter_factory< CharT > > const &factory)
	The function registers a filter factory object for the specified attribute name. More...
template<typename FactoryT >
enable_if< is_base_and_derived < filter_factory< typename FactoryT::char_type > , FactoryT >>::type	register_filter_factory (attribute_name const &name, shared_ptr< FactoryT > const &factory)
	The function registers a filter factory object for the specified attribute name. More...
template<typename AttributeValueT , typename CharT >
void	register_simple_filter_factory (attribute_name const &name)
	The function registers a simple filter factory object for the specified attribute name. More...
template<typename AttributeValueT >
void	register_simple_filter_factory (attribute_name const &name)
	The function registers a simple filter factory object for the specified attribute name. More...
template<typename CharT , typename DescriptorT , template< typename > class ActorT>
void	register_simple_filter_factory (expressions::attribute_keyword< DescriptorT, ActorT > const &keyword)
	The function registers a simple filter factory object for the specified attribute keyword. More...
template<typename CharT >
BOOST_LOG_SETUP_API filter	parse_filter (const CharT *begin, const CharT *end)
	The function parses a filter from the sequence of characters. More...
template<typename CharT , typename TraitsT , typename AllocatorT >
filter	parse_filter (std::basic_string< CharT, TraitsT, AllocatorT > const &str)
	The function parses a filter from the string. More...
template<typename CharT >
filter	parse_filter (const CharT *str)
	The function parses a filter from the string. More...
template<typename CharT >
BOOST_LOG_SETUP_API void	register_formatter_factory (attribute_name const &attr_name, shared_ptr< formatter_factory< CharT > > const &factory)
	The function registers a user-defined formatter factory. More...
template<typename FactoryT >
enable_if< is_base_and_derived < formatter_factory< typename FactoryT::char_type > , FactoryT >>::type	register_formatter_factory (attribute_name const &attr_name, shared_ptr< FactoryT > const &factory)
	The function registers a user-defined formatter factory. More...
template<typename AttributeValueT , typename CharT >
void	register_simple_formatter_factory (attribute_name const &attr_name)
	The function registers a simple formatter factory. More...
template<typename CharT >
BOOST_LOG_SETUP_API basic_formatter< CharT >	parse_formatter (const CharT *begin, const CharT *end)
	The function parses a formatter from the sequence of characters. More...
template<typename CharT , typename TraitsT , typename AllocatorT >
basic_formatter< CharT >	parse_formatter (std::basic_string< CharT, TraitsT, AllocatorT > const &str)
	The function parses a formatter from the string. More...
template<typename CharT >
basic_formatter< CharT >	parse_formatter (const CharT *str)
	The function parses a formatter from the string. More...
template<typename CharT >
BOOST_LOG_OPEN_NAMESPACE BOOST_LOG_SETUP_API void	init_from_settings (basic_settings_section< CharT > const &setts)
	The function initializes the logging library from a settings container. More...
template<typename CharT >
BOOST_LOG_SETUP_API void	register_sink_factory (const char *sink_name, shared_ptr< sink_factory< CharT > > const &factory)
	The function registers a factory for a custom sink. More...
template<typename CharT >
void	register_sink_factory (std::string const &sink_name, shared_ptr< sink_factory< CharT > > const &factory)
	The function registers a factory for a custom sink. More...
template<typename FactoryT >
enable_if< is_base_and_derived < sink_factory< typename FactoryT::char_type > , FactoryT >>::type	register_sink_factory (const char *sink_name, shared_ptr< FactoryT > const &factory)
	The function registers a factory for a custom sink. More...
template<typename FactoryT >
enable_if< is_base_and_derived < sink_factory< typename FactoryT::char_type > , FactoryT >>::type	register_sink_factory (std::string const &sink_name, shared_ptr< FactoryT > const &factory)
	The function registers a factory for a custom sink. More...
template<typename CharT >
BOOST_LOG_OPEN_NAMESPACE BOOST_LOG_SETUP_API void	init_from_stream (std::basic_istream< CharT > &strm)
	The function initializes the logging library from a stream containing logging settings. More...
template<typename CharT >
void	swap (basic_settings_section< CharT > &left, basic_settings_section< CharT > &right)
template<typename CharT >
BOOST_LOG_OPEN_NAMESPACE BOOST_LOG_SETUP_API basic_settings< CharT >	parse_settings (std::basic_istream< CharT > &strm)
	The function parses library settings from an input stream. More...
template<typename CharT , typename StrmTraitsT , typename LitTraitsT >
std::basic_ostream< CharT, StrmTraitsT > &	operator<< (std::basic_ostream< CharT, StrmTraitsT > &strm, basic_string_literal< CharT, LitTraitsT > const &lit)
	Output operator. More...
template<typename CharT , typename TraitsT >
void	swap (basic_string_literal< CharT, TraitsT > &left, basic_string_literal< CharT, TraitsT > &right) BOOST_NOEXCEPT
	External swap. More...
bool	operator!= (type_info_wrapper const &left, type_info_wrapper const &right) BOOST_NOEXCEPT
	Inequality operator. More...
bool	operator<= (type_info_wrapper const &left, type_info_wrapper const &right) BOOST_NOEXCEPT
	Ordering operator. More...
bool	operator> (type_info_wrapper const &left, type_info_wrapper const &right) BOOST_NOEXCEPT
	Ordering operator. More...
bool	operator>= (type_info_wrapper const &left, type_info_wrapper const &right) BOOST_NOEXCEPT
	Ordering operator. More...
void	swap (type_info_wrapper &left, type_info_wrapper &right) BOOST_NOEXCEPT
	Free swap for type info wrapper. More...
std::string	to_string (type_info_wrapper const &ti)
	The function for exception serialization to string. More...
template<typename T , typename TagT >
void	swap (value_ref< T, TagT > &left, value_ref< T, TagT > &right)
	Free swap function. More...
template<typename CharT , typename TraitsT , typename T , typename TagT >
std::basic_ostream< CharT, TraitsT > &	operator<< (std::basic_ostream< CharT, TraitsT > &strm, value_ref< T, TagT > const &val)
	Stream output operator. More...
template<typename CharT , typename TraitsT , typename AllocatorT , typename T , typename TagT >
basic_formatting_ostream < CharT, TraitsT, AllocatorT > &	operator<< (basic_formatting_ostream< CharT, TraitsT, AllocatorT > &strm, value_ref< T, TagT > const &val)
	Log formatting operator. More...
template<typename T , typename TagT , typename U >
bool	operator== (value_ref< T, TagT > const &left, U const &right)
template<typename U , typename T , typename TagT >
bool	operator== (U const &left, value_ref< T, TagT > const &right)
template<typename T1 , typename TagT1 , typename T2 , typename TagT2 >
bool	operator== (value_ref< T1, TagT1 > const &left, value_ref< T2, TagT2 > const &right)
template<typename T , typename TagT , typename U >
bool	operator!= (value_ref< T, TagT > const &left, U const &right)
template<typename U , typename T , typename TagT >
bool	operator!= (U const &left, value_ref< T, TagT > const &right)
template<typename T1 , typename TagT1 , typename T2 , typename TagT2 >
bool	operator!= (value_ref< T1, TagT1 > const &left, value_ref< T2, TagT2 > const &right)
template<typename T , typename TagT , typename U >
bool	operator< (value_ref< T, TagT > const &left, U const &right)
template<typename U , typename T , typename TagT >
bool	operator< (U const &left, value_ref< T, TagT > const &right)
template<typename T1 , typename TagT1 , typename T2 , typename TagT2 >
bool	operator< (value_ref< T1, TagT1 > const &left, value_ref< T2, TagT2 > const &right)
template<typename T , typename TagT , typename U >
bool	operator> (value_ref< T, TagT > const &left, U const &right)
template<typename U , typename T , typename TagT >
bool	operator> (U const &left, value_ref< T, TagT > const &right)
template<typename T1 , typename TagT1 , typename T2 , typename TagT2 >
bool	operator> (value_ref< T1, TagT1 > const &left, value_ref< T2, TagT2 > const &right)
template<typename T , typename TagT , typename U >
bool	operator<= (value_ref< T, TagT > const &left, U const &right)
template<typename U , typename T , typename TagT >
bool	operator<= (U const &left, value_ref< T, TagT > const &right)
template<typename T1 , typename TagT1 , typename T2 , typename TagT2 >
bool	operator<= (value_ref< T1, TagT1 > const &left, value_ref< T2, TagT2 > const &right)
template<typename T , typename TagT , typename U >
bool	operator>= (value_ref< T, TagT > const &left, U const &right)
template<typename U , typename T , typename TagT >
bool	operator>= (U const &left, value_ref< T, TagT > const &right)
template<typename T1 , typename TagT1 , typename T2 , typename TagT2 >
bool	operator>= (value_ref< T1, TagT1 > const &left, value_ref< T2, TagT2 > const &right)
template<typename I , typename O >
O	move (I f, I l, O result)
	Effects: Moves elements in the range [first,last) into the range [result,result + (last - first)) starting from first and proceeding to last. More...
template<typename I , typename O >
O	move_backward (I f, I l, O result)
	Effects: Moves elements in the range [first,last) into the range [result - (last-first),result) starting from last - 1 and proceeding to first. More...
template<typename I , typename F >
F	uninitialized_move (I f, I l, F r)
	defined(BOOST_MOVE_USE_STANDARD_LIBRARY_MOVE) More...
template<typename I , typename F >
F	uninitialized_copy_or_move (I f, I l, F r)
	Effects: More...
template<typename I , typename F >
F	copy_or_move (I f, I l, F r)
	Effects: More...
template<class It >
move_iterator< It >	make_move_iterator (const It &it)
	Returns: move_iterator<It>(i). More...
template<typename C >
back_move_insert_iterator< C >	back_move_inserter (C &x)
	Returns: back_move_insert_iterator<C>(x). More...
template<typename C >
front_move_insert_iterator< C >	front_move_inserter (C &x)
	Returns: front_move_insert_iterator<C>(x). More...
template<typename C >
move_insert_iterator< C >	move_inserter (C &x, typename C::iterator it)
	Returns: move_insert_iterator<C>(x, it). More...
template<class T >
typename::boost::move_detail::enable_if_c < ::boost::move_detail::is_nothrow_move_constructible_or_uncopyable < T >::value, T && >::type	move_if_noexcept (T &x) BOOST_NOEXCEPT
template<class T >
typename::boost::move_detail::enable_if_c < !::boost::move_detail::is_nothrow_move_constructible_or_uncopyable < T >::value, const T & > ::type	move_if_noexcept (T &x) BOOST_NOEXCEPT
template<class T >
typename::boost::move_detail::remove_reference < T >::type &&	move (T &&t) BOOST_NOEXCEPT
template<class T >
T &&	forward (typename::boost::move_detail::remove_reference< T >::type &t) BOOST_NOEXCEPT
template<class T >
T &&	forward (typename::boost::move_detail::remove_reference< T >::type &&t) BOOST_NOEXCEPT
template<class T >
T &&	move_if_not_lvalue_reference (typename::boost::move_detail::remove_reference< T >::type &t) BOOST_NOEXCEPT
template<class T >
T &&	move_if_not_lvalue_reference (typename::boost::move_detail::remove_reference< T >::type &&t) BOOST_NOEXCEPT
template<class Backend , multiprecision::expression_template_option ExpressionTemplates>
std::istream &	operator>> (std::istream &is, rational< multiprecision::number< Backend, ExpressionTemplates > > &r)
template<class T , multiprecision::expression_template_option ExpressionTemplates, class Arithmetic >
boost::enable_if < boost::is_arithmetic < Arithmetic >, bool >::type	operator== (const rational< multiprecision::number< T, ExpressionTemplates > > &a, const Arithmetic &b)
template<class T , multiprecision::expression_template_option ExpressionTemplates, class Arithmetic >
boost::enable_if < boost::is_arithmetic < Arithmetic >, bool >::type	operator== (const Arithmetic &b, const rational< multiprecision::number< T, ExpressionTemplates > > &a)
template<class T , multiprecision::expression_template_option ExpressionTemplates, class Arithmetic >
boost::enable_if < boost::is_arithmetic < Arithmetic >, bool >::type	operator!= (const rational< multiprecision::number< T, ExpressionTemplates > > &a, const Arithmetic &b)
template<class T , multiprecision::expression_template_option ExpressionTemplates, class Arithmetic >
boost::enable_if < boost::is_arithmetic < Arithmetic >, bool >::type	operator!= (const Arithmetic &b, const rational< multiprecision::number< T, ExpressionTemplates > > &a)
template<class T , multiprecision::expression_template_option ExpressionTemplates>
multiprecision::number< T, ExpressionTemplates >	numerator (const rational< multiprecision::number< T, ExpressionTemplates > > &a)
template<class T , multiprecision::expression_template_option ExpressionTemplates>
multiprecision::number< T, ExpressionTemplates >	denominator (const rational< multiprecision::number< T, ExpressionTemplates > > &a)
template<class T >
T	next (T x)
template<class T , class Distance >
T	next (T x, Distance n)
template<class T >
T	prior (T x)
template<class T , class Distance >
T	prior (T x, Distance n)
template<typename Target , typename Source >
Target	numeric_cast (Source arg)
template<class T >
void	swap (optional< T > &x, optional< T > &y)
template<class T >
optional< T >	make_optional (T const &v)
template<class T >
optional< T >	make_optional (bool cond, T const &v)
template<class T >
BOOST_DEDUCED_TYPENAME optional< T > ::reference_const_type	get (optional< T > const &opt)
template<class T >
BOOST_DEDUCED_TYPENAME optional< T >::reference_type	get (optional< T > &opt)
template<class T >
BOOST_DEDUCED_TYPENAME optional< T > ::pointer_const_type	get (optional< T > const *opt)
template<class T >
BOOST_DEDUCED_TYPENAME optional< T >::pointer_type	get (optional< T > *opt)
template<class T >
BOOST_DEDUCED_TYPENAME optional< T > ::reference_const_type	get_optional_value_or (optional< T > const &opt, BOOST_DEDUCED_TYPENAME optional< T >::reference_const_type v)
template<class T >
BOOST_DEDUCED_TYPENAME optional< T >::reference_type	get_optional_value_or (optional< T > &opt, BOOST_DEDUCED_TYPENAME optional< T >::reference_type v)
template<class T >
BOOST_DEDUCED_TYPENAME optional< T > ::pointer_const_type	get_pointer (optional< T > const &opt)
template<class T >
BOOST_DEDUCED_TYPENAME optional< T >::pointer_type	get_pointer (optional< T > &opt)
template<class CharType , class CharTrait , class T >
std::basic_ostream< CharType, CharTrait > &	operator<< (std::basic_ostream< CharType, CharTrait > &out, optional< T > const &v)
template<class T >
bool	operator== (optional< T > const &x, optional< T > const &y)
template<class T >
bool	operator< (optional< T > const &x, optional< T > const &y)
template<class T >
bool	operator!= (optional< T > const &x, optional< T > const &y)
template<class T >
bool	operator> (optional< T > const &x, optional< T > const &y)
template<class T >
bool	operator<= (optional< T > const &x, optional< T > const &y)
template<class T >
bool	operator>= (optional< T > const &x, optional< T > const &y)
template<class T >
bool	operator== (optional< T > const &x, T const &y)
template<class T >
bool	operator< (optional< T > const &x, T const &y)
template<class T >
bool	operator!= (optional< T > const &x, T const &y)
template<class T >
bool	operator> (optional< T > const &x, T const &y)
template<class T >
bool	operator<= (optional< T > const &x, T const &y)
template<class T >
bool	operator>= (optional< T > const &x, T const &y)
template<class T >
bool	operator== (T const &x, optional< T > const &y)
template<class T >
bool	operator< (T const &x, optional< T > const &y)
template<class T >
bool	operator!= (T const &x, optional< T > const &y)
template<class T >
bool	operator> (T const &x, optional< T > const &y)
template<class T >
bool	operator<= (T const &x, optional< T > const &y)
template<class T >
bool	operator>= (T const &x, optional< T > const &y)
template<class T >
bool	operator== (optional< T > const &x, none_t) BOOST_NOEXCEPT
template<class T >
bool	operator< (optional< T > const &x, none_t)
template<class T >
bool	operator!= (optional< T > const &x, none_t) BOOST_NOEXCEPT
template<class T >
bool	operator> (optional< T > const &x, none_t y)
template<class T >
bool	operator<= (optional< T > const &x, none_t y)
template<class T >
bool	operator>= (optional< T > const &x, none_t y)
template<class T >
bool	operator== (none_t, optional< T > const &y) BOOST_NOEXCEPT
template<class T >
bool	operator< (none_t, optional< T > const &y)
template<class T >
bool	operator!= (none_t, optional< T > const &y) BOOST_NOEXCEPT
template<class T >
bool	operator> (none_t x, optional< T > const &y)
template<class T >
bool	operator<= (none_t x, optional< T > const &y)
template<class T >
bool	operator>= (none_t x, optional< T > const &y)
template<class CharType , class CharTrait , class T >
std::basic_istream< CharType, CharTrait > &	operator>> (std::basic_istream< CharType, CharTrait > &in, optional< T > &v)
template<typename Compare , typename ReadablePropertyMap >
indirect_cmp < ReadablePropertyMap, Compare >	make_indirect_cmp (const Compare &cmp, ReadablePropertyMap pmap)
template<typename ReadablePropertyMap >
indirect_pmap < ReadablePropertyMap >	make_indirect_pmap (ReadablePropertyMap pmap)
template<typename T >
int	lowest_bit (T x)
template<class TreeNode , class Compare , class ExternalData >
TreeNode	up_heap (TreeNode x, const Compare &comp, ExternalData &edata)
template<class TreeNode , class Compare , class ExternalData >
TreeNode	down_heap (TreeNode x, const Compare &comp, ExternalData &edata)
template<class TreeNode , class Compare , class ExternalData >
void	update_heap (TreeNode x, const Compare &comp, ExternalData &edata)
template<class PropertyList , class Tag >
lookup_one_property < PropertyList, Tag >::type &	get_property_value (PropertyList &p, Tag tag)
template<class PropertyList , class Tag >
const lookup_one_property < PropertyList, Tag >::type &	get_property_value (const PropertyList &p, Tag tag)
template<class Archive >
void	serialize (Archive &, no_property &, const unsigned int)
template<class Archive , class Tag , class T , class Base >
void	serialize (Archive &ar, property< Tag, T, Base > &prop, const unsigned int)
template<class _Tp , class _Seq >
bool	operator== (const queue< _Tp, _Seq > &, const queue< _Tp, _Seq > &)
template<class _Tp , class _Seq >
bool	operator< (const queue< _Tp, _Seq > &, const queue< _Tp, _Seq > &)
template<class _Tp , class _Sequence >
bool	operator== (const queue< _Tp, _Sequence > &__x, const queue< _Tp, _Sequence > &__y)
template<class _Tp , class _Sequence >
bool	operator< (const queue< _Tp, _Sequence > &__x, const queue< _Tp, _Sequence > &__y)
template<class _Tp , class _Sequence >
bool	operator!= (const queue< _Tp, _Sequence > &__x, const queue< _Tp, _Sequence > &__y)
template<class _Tp , class _Sequence >
bool	operator> (const queue< _Tp, _Sequence > &__x, const queue< _Tp, _Sequence > &__y)
template<class _Tp , class _Sequence >
bool	operator<= (const queue< _Tp, _Sequence > &__x, const queue< _Tp, _Sequence > &__y)
template<class _Tp , class _Sequence >
bool	operator>= (const queue< _Tp, _Sequence > &__x, const queue< _Tp, _Sequence > &__y)
template<class _Tp , class _Sequence >
void	swap (queue< _Tp, _Sequence > &__x, queue< _Tp, _Sequence > &__y)
template<typename Container >
void	stringtok (Container &l, std::string const &s, char const *const ws=" \t\n")
template<class T , class U >
T *	static_pointer_cast (U *ptr)
template<class T , class U >
T *	dynamic_pointer_cast (U *ptr)
template<class T , class U >
T *	const_pointer_cast (U *ptr)
template<class T , class U >
T *	reinterpret_pointer_cast (U *ptr)
template<class Target , class Source >
Target	polymorphic_cast (Source *x)
template<class Target , class Source >
Target	polymorphic_downcast (Source *x)
template<class FPMap , class GPMap >
compose_property_map< FPMap, GPMap >	make_compose_property_map (const FPMap &f, const GPMap &g)
template<typename Key , typename Value >
bool	put (const std::string &name, dynamic_properties &dp, const Key &key, const Value &value)
template<typename Value , typename Key >
Value	get (const std::string &name, const dynamic_properties &dp, const Key &key)
template<typename Value , typename Key >
Value	get (const std::string &name, const dynamic_properties &dp, const Key &key, type< Value >)
template<typename Key >
std::string	get (const std::string &name, const dynamic_properties &dp, const Key &key)
boost::shared_ptr < boost::dynamic_property_map >	ignore_other_properties (const std::string &, const boost::any &, const boost::any &)
template<typename Key , typename Func >
function_property_map< Func, Key >	make_function_property_map (const Func &f)
template<typename Key , typename Ret , typename Func >
function_property_map< Func, Key, Ret >	make_function_property_map (const Func &f)
template<typename Key , typename Value >
void	local_put (dummy_property_map, const Key &, const Value &)
template<typename ProcessGroup , typename GlobalMap , typename StorageMap >
local_property_map < ProcessGroup, GlobalMap, StorageMap >::reference	get (const local_property_map< ProcessGroup, GlobalMap, StorageMap > &pm, typename local_property_map< ProcessGroup, GlobalMap, StorageMap >::key_type const &key)
template<typename ProcessGroup , typename GlobalMap , typename StorageMap >
void	put (const local_property_map< ProcessGroup, GlobalMap, StorageMap > &pm, typename local_property_map< ProcessGroup, GlobalMap, StorageMap >::key_type const &key, typename local_property_map< ProcessGroup, GlobalMap, StorageMap >::value_type const &v)
	BOOST_STATIC_ASSERT ((!boost::is_void< ptr_serialize_type >::value))
template<typename T >
T &	unsafe_serialize (T &x)
ptr_serialize_type &	unsafe_serialize (void *&x)
template<typename T , typename U >
bool	operator< (unsafe_pair< T, U > const &x, unsafe_pair< T, U > const &y)
template<typename K , typename V >
const readable_property_map_archetype < K, V >::reference &	get (const readable_property_map_archetype< K, V > &, const typename readable_property_map_archetype< K, V >::key_type &)
template<typename K , typename V >
void	put (const writable_property_map_archetype< K, V > &, const typename writable_property_map_archetype< K, V >::key_type &, const typename writable_property_map_archetype< K, V >::value_type &)
template<class PropertyMap , class Reference , class K >
Reference	get (const put_get_helper< Reference, PropertyMap > &pa, const K &k)
template<class PropertyMap , class Reference , class K , class V >
void	put (const put_get_helper< Reference, PropertyMap > &pa, K k, const V &v)
template<class RAIter , class ID >
iterator_property_map< RAIter, ID, typename std::iterator_traits< RAIter > ::value_type, typename std::iterator_traits< RAIter > ::reference >	make_iterator_property_map (RAIter iter, ID id)
template<class RAIter , class Value , class ID >
iterator_property_map< RAIter, ID, Value, Value & >	make_iterator_property_map (RAIter iter, ID id, Value)
template<class RAIter , class ID >
safe_iterator_property_map < RAIter, ID, typename boost::detail::iterator_traits < RAIter >::value_type, typename boost::detail::iterator_traits < RAIter >::reference >	make_safe_iterator_property_map (RAIter iter, std::size_t n, ID id)
template<class RAIter , class Value , class ID >
safe_iterator_property_map < RAIter, ID, Value, Value & >	make_safe_iterator_property_map (RAIter iter, std::size_t n, ID id, Value)
template<class UniquePairAssociativeContainer >
associative_property_map < UniquePairAssociativeContainer >	make_assoc_property_map (UniquePairAssociativeContainer &c)
template<class UniquePairAssociativeContainer >
const_associative_property_map < UniquePairAssociativeContainer >	make_assoc_property_map (const UniquePairAssociativeContainer &c)
template<typename KeyType , typename ValueType >
static_property_map< ValueType, KeyType >	make_static_property_map (const ValueType &v)
template<typename PropMap >
property_map_function< PropMap >	make_property_map_function (const PropMap &pm)
template<class PropertyMap , class Iterator >
property_map_iterator_generator < PropertyMap, Iterator > ::type	make_property_map_iterator (PropertyMap pmap, Iterator iter)
template<class T , class IndexMap >
shared_array_property_map< T, IndexMap >	make_shared_array_property_map (size_t n, const T &, const IndexMap &index)
template<typename PM , typename Func >
transform_value_property_map < Func, PM >	make_transform_value_property_map (const Func &f, const PM &pm)
template<typename Ret , typename PM , typename Func >
transform_value_property_map < Func, PM, Ret >	make_transform_value_property_map (const Func &f, const PM &pm)
template<typename T , typename IndexMap >
vector_property_map< T, IndexMap >	make_vector_property_map (IndexMap index)
template<class T >
T *	new_clone (const T &r)
template<class T >
T *	new_clone (const T *r)
template<class T >
void	delete_clone (const T *r)
template<class Fun >
indirect_fun< Fun >	make_indirect_fun (Fun f)
template<class Arg , class Fun >
void_ptr_indirect_fun< Fun, Arg >	make_void_ptr_indirect_fun (Fun f)
template<typename T , size_t size, typename CA >
ptr_array< T, size, CA > *	new_clone (const ptr_array< T, size, CA > &r)
template<typename T , size_t size, typename CA >
void	swap (ptr_array< T, size, CA > &l, ptr_array< T, size, CA > &r)
template<typename T , typename CA , typename A >
ptr_circular_buffer< T, CA, A > *	new_clone (const ptr_circular_buffer< T, CA, A > &r)
template<typename T , typename CA , typename A >
void	swap (ptr_circular_buffer< T, CA, A > &l, ptr_circular_buffer< T, CA, A > &r)
template<typename T , typename CA , typename A >
ptr_deque< T, CA, A > *	new_clone (const ptr_deque< T, CA, A > &r)
template<typename T , typename CA , typename A >
void	swap (ptr_deque< T, CA, A > &l, ptr_deque< T, CA, A > &r)
template<typename T , typename CA , typename A >
ptr_list< T, CA, A > *	new_clone (const ptr_list< T, CA, A > &r)
template<typename T , typename CA , typename A >
void	swap (ptr_list< T, CA, A > &l, ptr_list< T, CA, A > &r)
template<class K , class T , class C , class CA , class A >
ptr_map< K, T, C, CA, A > *	new_clone (const ptr_map< K, T, C, CA, A > &r)
template<class K , class T , class C , class CA , class A >
ptr_multimap< K, T, C, CA, A > *	new_clone (const ptr_multimap< K, T, C, CA, A > &r)
template<typename K , typename T , typename C , typename CA , typename A >
void	swap (ptr_map< K, T, C, CA, A > &l, ptr_map< K, T, C, CA, A > &r)
template<typename K , typename T , typename C , typename CA , typename A >
void	swap (ptr_multimap< K, T, C, CA, A > &l, ptr_multimap< K, T, C, CA, A > &r)
template<class I , class F , class S >
bool	is_null (const ptr_map_iterator< I, F, S > &i)
template<class Iterator , class T >
bool	is_null (void_ptr_iterator< Iterator, T > i)
template<typename K , typename C , typename CA , typename A >
ptr_set< K, C, CA, A > *	new_clone (const ptr_set< K, C, CA, A > &r)
template<typename K , typename C , typename CA , typename A >
ptr_multiset< K, C, CA, A > *	new_clone (const ptr_multiset< K, C, CA, A > &r)
template<typename K , typename C , typename CA , typename A >
void	swap (ptr_set< K, C, CA, A > &l, ptr_set< K, C, CA, A > &r)
template<typename K , typename C , typename CA , typename A >
void	swap (ptr_multiset< K, C, CA, A > &l, ptr_multiset< K, C, CA, A > &r)
template<class K , class T , class H , class P , class CA , class A >
ptr_unordered_map< K, T, H, P, CA, A > *	new_clone (const ptr_unordered_map< K, T, H, P, CA, A > &r)
template<class K , class T , class H , class P , class CA , class A >
ptr_unordered_multimap< K, T, H, P, CA, A > *	new_clone (const ptr_unordered_multimap< K, T, H, P, CA, A > &r)
template<class K , class T , class H , class P , class CA , class A >
void	swap (ptr_unordered_map< K, T, H, P, CA, A > &l, ptr_unordered_map< K, T, H, P, CA, A > &r)
template<class K , class T , class H , class P , class CA , class A >
void	swap (ptr_unordered_multimap< K, T, H, P, CA, A > &l, ptr_unordered_multimap< K, T, H, P, CA, A > &r)
template<typename K , typename H , typename P , typename CA , typename A >
ptr_unordered_set< K, H, P, CA, A > *	new_clone (const ptr_unordered_set< K, H, P, CA, A > &r)
template<typename K , typename H , typename P , typename CA , typename A >
ptr_unordered_multiset< K, H, P, CA, A > *	new_clone (const ptr_unordered_multiset< K, H, P, CA, A > &r)
template<typename K , typename H , typename P , typename CA , typename A >
void	swap (ptr_unordered_set< K, H, P, CA, A > &l, ptr_unordered_set< K, H, P, CA, A > &r)
template<typename K , typename H , typename P , typename CA , typename A >
void	swap (ptr_unordered_multiset< K, H, P, CA, A > &l, ptr_unordered_multiset< K, H, P, CA, A > &r)
template<typename T , typename CA , typename A >
ptr_vector< T, CA, A > *	new_clone (const ptr_vector< T, CA, A > &r)
template<typename T , typename CA , typename A >
void	swap (ptr_vector< T, CA, A > &l, ptr_vector< T, CA, A > &r)
template<class SinglePassRange , class OutputIterator , class Predicate >
OutputIterator	remove_copy_if (const SinglePassRange &rng, OutputIterator out_it, Predicate pred)
	template function remove_copy_if More...
template<class R >
iterator_range < BOOST_DEDUCED_TYPENAME range_iterator< R >::type >	as_array (R &r)
template<class Range >
boost::iterator_range < BOOST_DEDUCED_TYPENAME range_iterator< const Range > ::type >	as_array (const Range &r)
template<class Range >
iterator_range < BOOST_DEDUCED_TYPENAME range_iterator< Range >::type >	as_literal (Range &r)
template<class Range >
iterator_range < BOOST_DEDUCED_TYPENAME range_iterator< const Range > ::type >	as_literal (const Range &r)
template<class Char , std::size_t sz>
iterator_range< Char * >	as_literal (Char(&arr)[sz])
template<class Char , std::size_t sz>
iterator_range< const Char * >	as_literal (const Char(&arr)[sz])
template<class Value >
iterator_range < counting_iterator< Value > >	counting_range (Value first, Value last)
template<class Range >
iterator_range < counting_iterator < BOOST_DEDUCED_TYPENAME range_iterator< const Range > ::type > >	counting_range (const Range &rng)
template<class Range >
iterator_range < counting_iterator < BOOST_DEDUCED_TYPENAME range_iterator< Range >::type > >	counting_range (Range &rng)
template<class T >
BOOST_DEDUCED_TYPENAME range_difference< T >::type	distance (const T &r)
template<class T >
bool	empty (const T &r)
template<typename Integer >
integer_range< Integer >	irange (Integer first, Integer last)
template<typename Integer , typename StepSize >
strided_integer_range< Integer >	irange (Integer first, Integer last, StepSize step_size)
template<class IteratorT , class ForwardRange >
BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_ < is_base_and_derived < iterator_range_detail::iterator_range_tag, ForwardRange > >, bool >::type	operator== (const ForwardRange &l, const iterator_range< IteratorT > &r)
template<class IteratorT , class ForwardRange >
BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_ < boost::is_base_and_derived < iterator_range_detail::iterator_range_tag, ForwardRange > >, bool >::type	operator!= (const ForwardRange &l, const iterator_range< IteratorT > &r)
template<class IteratorT , class ForwardRange >
BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_ < boost::is_base_and_derived < iterator_range_detail::iterator_range_tag, ForwardRange > >, bool >::type	operator< (const ForwardRange &l, const iterator_range< IteratorT > &r)
template<class IteratorT , class ForwardRange >
BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_ < boost::is_base_and_derived < iterator_range_detail::iterator_range_tag, ForwardRange > >, bool >::type	operator<= (const ForwardRange &l, const iterator_range< IteratorT > &r)
template<class IteratorT , class ForwardRange >
BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_ < boost::is_base_and_derived < iterator_range_detail::iterator_range_tag, ForwardRange > >, bool >::type	operator> (const ForwardRange &l, const iterator_range< IteratorT > &r)
template<class IteratorT , class ForwardRange >
BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_ < boost::is_base_and_derived < iterator_range_detail::iterator_range_tag, ForwardRange > >, bool >::type	operator>= (const ForwardRange &l, const iterator_range< IteratorT > &r)
template<class Iterator1T , class Iterator2T >
bool	operator== (const iterator_range< Iterator1T > &l, const iterator_range< Iterator2T > &r)
template<class IteratorT , class ForwardRange >
BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_ < boost::is_base_and_derived < iterator_range_detail::iterator_range_tag, ForwardRange > >, bool >::type	operator== (const iterator_range< IteratorT > &l, const ForwardRange &r)
template<class Iterator1T , class Iterator2T >
bool	operator!= (const iterator_range< Iterator1T > &l, const iterator_range< Iterator2T > &r)
template<class IteratorT , class ForwardRange >
BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_ < boost::is_base_and_derived < iterator_range_detail::iterator_range_tag, ForwardRange > >, bool >::type	operator!= (const iterator_range< IteratorT > &l, const ForwardRange &r)
template<class Iterator1T , class Iterator2T >
bool	operator< (const iterator_range< Iterator1T > &l, const iterator_range< Iterator2T > &r)
template<class IteratorT , class ForwardRange >
BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_ < boost::is_base_and_derived < iterator_range_detail::iterator_range_tag, ForwardRange > >, bool >::type	operator< (const iterator_range< IteratorT > &l, const ForwardRange &r)
template<class Iterator1T , class Iterator2T >
bool	operator<= (const iterator_range< Iterator1T > &l, const iterator_range< Iterator2T > &r)
template<class IteratorT , class ForwardRange >
BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_ < boost::is_base_and_derived < iterator_range_detail::iterator_range_tag, ForwardRange > >, bool >::type	operator<= (const iterator_range< IteratorT > &l, const ForwardRange &r)
template<class Iterator1T , class Iterator2T >
bool	operator> (const iterator_range< Iterator1T > &l, const iterator_range< Iterator2T > &r)
template<class IteratorT , class ForwardRange >
BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_ < boost::is_base_and_derived < iterator_range_detail::iterator_range_tag, ForwardRange > >, bool >::type	operator> (const iterator_range< IteratorT > &l, const ForwardRange &r)
template<class Iterator1T , class Iterator2T >
bool	operator>= (const iterator_range< Iterator1T > &l, const iterator_range< Iterator2T > &r)
template<class IteratorT , class ForwardRange >
BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_ < boost::is_base_and_derived < iterator_range_detail::iterator_range_tag, ForwardRange > >, bool >::type	operator>= (const iterator_range< IteratorT > &l, const ForwardRange &r)
template<typename IteratorT >
iterator_range< IteratorT >	make_iterator_range (IteratorT Begin, IteratorT End)
	iterator_range construct helper More...
template<typename IteratorT , typename IntegerT >
iterator_range< IteratorT >	make_iterator_range_n (IteratorT first, IntegerT n)
template<class ForwardRange >
iterator_range < BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange > ::type >	make_iterator_range (ForwardRange &r)
	iterator_range construct helper More...
template<class ForwardRange >
iterator_range < BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange >::type >	make_iterator_range (const ForwardRange &r)
template<class Range >
iterator_range < BOOST_DEDUCED_TYPENAME range_iterator< Range >::type >	make_iterator_range (Range &r, BOOST_DEDUCED_TYPENAME range_difference< Range >::type advance_begin, BOOST_DEDUCED_TYPENAME range_difference< Range >::type advance_end)
template<class Range >
iterator_range < BOOST_DEDUCED_TYPENAME range_iterator< const Range > ::type >	make_iterator_range (const Range &r, BOOST_DEDUCED_TYPENAME range_difference< Range >::type advance_begin, BOOST_DEDUCED_TYPENAME range_difference< Range >::type advance_end)
template<typename SeqT , typename Range >
SeqT	copy_range (const Range &r)
	copy a range into a sequence More...
template<class T >
std::size_t	hash_value (const iterator_range< T > &rng)
template<typename IteratorT , typename Elem , typename Traits >
std::basic_ostream< Elem, Traits > &	operator<< (std::basic_ostream< Elem, Traits > &Os, const iterator_range< IteratorT > &r)
	iterator_range output operator More...
template<class SinglePassRange , class Value >
Value	accumulate (const SinglePassRange &rng, Value init)
template<class SinglePassRange , class Value , class BinaryOperation >
Value	accumulate (const SinglePassRange &rng, Value init, BinaryOperation op)
template<class SinglePassRange1 , class SinglePassRange2 , class Value >
Value	inner_product (const SinglePassRange1 &rng1, const SinglePassRange2 &rng2, Value init)
template<class SinglePassRange1 , class SinglePassRange2 , class Value , class BinaryOperation1 , class BinaryOperation2 >
Value	inner_product (const SinglePassRange1 &rng1, const SinglePassRange2 &rng2, Value init, BinaryOperation1 op1, BinaryOperation2 op2)
template<class SinglePassRange , class OutputIterator >
OutputIterator	partial_sum (const SinglePassRange &rng, OutputIterator result)
template<class SinglePassRange , class OutputIterator , class BinaryOperation >
OutputIterator	partial_sum (const SinglePassRange &rng, OutputIterator result, BinaryOperation op)
template<class SinglePassRange , class OutputIterator >
OutputIterator	adjacent_difference (const SinglePassRange &rng, OutputIterator result)
template<class SinglePassRange , class OutputIterator , class BinaryOperation >
OutputIterator	adjacent_difference (const SinglePassRange &rng, OutputIterator result, BinaryOperation op)
template<class C >
BOOST_DEDUCED_TYPENAME range_reverse_iterator< C > ::type	rbegin (C &c)
template<class C >
BOOST_DEDUCED_TYPENAME range_reverse_iterator< const C >::type	rbegin (const C &c)
template<class T >
BOOST_DEDUCED_TYPENAME range_reverse_iterator< const T >::type	const_rbegin (const T &r)
template<class C >
BOOST_DEDUCED_TYPENAME range_reverse_iterator< C > ::type	rend (C &c)
template<class C >
BOOST_DEDUCED_TYPENAME range_reverse_iterator< const C >::type	rend (const C &c)
template<class T >
BOOST_DEDUCED_TYPENAME range_reverse_iterator< const T >::type	const_rend (const T &r)
template<class SinglePassRange >
range_size< const SinglePassRange >::type	size (const SinglePassRange &rng)
template<typename IntType >
IntType	gcd (IntType n, IntType m)
template<typename IntType >
IntType	lcm (IntType n, IntType m)
template<typename IntType >
rational< IntType >	abs (const rational< IntType > &r)
template<typename IntType >
rational< IntType >	operator+ (const rational< IntType > &r)
template<typename IntType >
rational< IntType >	operator- (const rational< IntType > &r)
template<typename IntType >
std::istream &	operator>> (std::istream &is, rational< IntType > &r)
template<typename IntType >
std::ostream &	operator<< (std::ostream &os, const rational< IntType > &r)
template<typename T , typename IntType >
T	rational_cast (const rational< IntType > &src BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(T))
long	hash_value (char_architype val)
template<class InputIterator >
u32regex	make_u32regex (InputIterator i, InputIterator j, boost::regex_constants::syntax_option_type opt)
u32regex	make_u32regex (const char *p, boost::regex_constants::syntax_option_type opt=boost::regex_constants::perl)
u32regex	make_u32regex (const unsigned char *p, boost::regex_constants::syntax_option_type opt=boost::regex_constants::perl)
u32regex	make_u32regex (const wchar_t *p, boost::regex_constants::syntax_option_type opt=boost::regex_constants::perl)
u32regex	make_u32regex (const UChar *p, boost::regex_constants::syntax_option_type opt=boost::regex_constants::perl)
template<class C , class T , class A >
u32regex	make_u32regex (const std::basic_string< C, T, A > &s, boost::regex_constants::syntax_option_type opt=boost::regex_constants::perl)
u32regex	make_u32regex (const U_NAMESPACE_QUALIFIER UnicodeString &s, boost::regex_constants::syntax_option_type opt=boost::regex_constants::perl)
template<class BidiIterator , class Allocator >
bool	u32regex_match (BidiIterator first, BidiIterator last, match_results< BidiIterator, Allocator > &m, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_match (const UChar *p, match_results< const UChar * > &m, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_match (const wchar_t *p, match_results< const wchar_t * > &m, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_match (const char *p, match_results< const char * > &m, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_match (const unsigned char *p, match_results< const unsigned char * > &m, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_match (const std::string &s, match_results< std::string::const_iterator > &m, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_match (const std::wstring &s, match_results< std::wstring::const_iterator > &m, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_match (const U_NAMESPACE_QUALIFIER UnicodeString &s, match_results< const UChar * > &m, const u32regex &e, match_flag_type flags=match_default)
template<class BidiIterator >
bool	u32regex_match (BidiIterator first, BidiIterator last, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_match (const UChar *p, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_match (const wchar_t *p, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_match (const char *p, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_match (const unsigned char *p, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_match (const std::string &s, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_match (const std::wstring &s, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_match (const U_NAMESPACE_QUALIFIER UnicodeString &s, const u32regex &e, match_flag_type flags=match_default)
template<class BidiIterator , class Allocator >
bool	u32regex_search (BidiIterator first, BidiIterator last, match_results< BidiIterator, Allocator > &m, const u32regex &e, match_flag_type flags=match_default)
template<class BidiIterator , class Allocator >
bool	u32regex_search (BidiIterator first, BidiIterator last, match_results< BidiIterator, Allocator > &m, const u32regex &e, match_flag_type flags, BidiIterator base)
bool	u32regex_search (const UChar *p, match_results< const UChar * > &m, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_search (const wchar_t *p, match_results< const wchar_t * > &m, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_search (const char *p, match_results< const char * > &m, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_search (const unsigned char *p, match_results< const unsigned char * > &m, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_search (const std::string &s, match_results< std::string::const_iterator > &m, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_search (const std::wstring &s, match_results< std::wstring::const_iterator > &m, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_search (const U_NAMESPACE_QUALIFIER UnicodeString &s, match_results< const UChar * > &m, const u32regex &e, match_flag_type flags=match_default)
template<class BidiIterator >
bool	u32regex_search (BidiIterator first, BidiIterator last, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_search (const UChar *p, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_search (const wchar_t *p, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_search (const char *p, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_search (const unsigned char *p, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_search (const std::string &s, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_search (const std::wstring &s, const u32regex &e, match_flag_type flags=match_default)
bool	u32regex_search (const U_NAMESPACE_QUALIFIER UnicodeString &s, const u32regex &e, match_flag_type flags=match_default)
template<class OutputIterator , class BidirectionalIterator , class charT >
OutputIterator	u32regex_replace (OutputIterator out, BidirectionalIterator first, BidirectionalIterator last, const u32regex &e, const charT *fmt, match_flag_type flags=match_default)
template<class OutputIterator , class Iterator , class charT >
OutputIterator	u32regex_replace (OutputIterator out, Iterator first, Iterator last, const u32regex &e, const std::basic_string< charT > &fmt, match_flag_type flags=match_default)
template<class OutputIterator , class Iterator >
OutputIterator	u32regex_replace (OutputIterator out, Iterator first, Iterator last, const u32regex &e, const U_NAMESPACE_QUALIFIER UnicodeString &fmt, match_flag_type flags=match_default)
template<class charT >
std::basic_string< charT >	u32regex_replace (const std::basic_string< charT > &s, const u32regex &e, const charT *fmt, match_flag_type flags=match_default)
template<class charT >
std::basic_string< charT >	u32regex_replace (const std::basic_string< charT > &s, const u32regex &e, const std::basic_string< charT > &fmt, match_flag_type flags=match_default)
U_NAMESPACE_QUALIFIER UnicodeString	u32regex_replace (const U_NAMESPACE_QUALIFIER UnicodeString &s, const u32regex &e, const UChar *fmt, match_flag_type flags=match_default)
U_NAMESPACE_QUALIFIER UnicodeString	u32regex_replace (const U_NAMESPACE_QUALIFIER UnicodeString &s, const u32regex &e, const U_NAMESPACE_QUALIFIER UnicodeString &fmt, match_flag_type flags=match_default)
template<class B , bool b>
basic_regex< B >	make_regex (const ATL::CSimpleStringT< B, b > &s,::boost::regex_constants::syntax_option_type f=boost::regex_constants::normal)
template<class B , bool b, class A , class T >
bool	regex_match (const ATL::CSimpleStringT< B, b > &s, match_results< const B *, A > &what, const basic_regex< B, T > &e, boost::regex_constants::match_flag_type f=boost::regex_constants::match_default)
template<class B , bool b, class T >
bool	regex_match (const ATL::CSimpleStringT< B, b > &s, const basic_regex< B, T > &e, boost::regex_constants::match_flag_type f=boost::regex_constants::match_default)
template<class B , bool b, class A , class T >
bool	regex_search (const ATL::CSimpleStringT< B, b > &s, match_results< const B *, A > &what, const basic_regex< B, T > &e, boost::regex_constants::match_flag_type f=boost::regex_constants::match_default)
template<class B , bool b, class T >
bool	regex_search (const ATL::CSimpleStringT< B, b > &s, const basic_regex< B, T > &e, boost::regex_constants::match_flag_type f=boost::regex_constants::match_default)
template<class B , bool b>
regex_iterator< B const * >	make_regex_iterator (const ATL::CSimpleStringT< B, b > &s, const basic_regex< B > &e,::boost::regex_constants::match_flag_type f=boost::regex_constants::match_default)
template<class B , bool b>
regex_token_iterator< B const * >	make_regex_token_iterator (const ATL::CSimpleStringT< B, b > &s, const basic_regex< B > &e, int sub=0,::boost::regex_constants::match_flag_type f=boost::regex_constants::match_default)
template<class B , bool b>
regex_token_iterator< B const * >	make_regex_token_iterator (const ATL::CSimpleStringT< B, b > &s, const basic_regex< B > &e, const std::vector< int > &subs,::boost::regex_constants::match_flag_type f=boost::regex_constants::match_default)
template<class B , bool b, std::size_t N>
regex_token_iterator< B const * >	make_regex_token_iterator (const ATL::CSimpleStringT< B, b > &s, const basic_regex< B > &e, const int(&subs)[N],::boost::regex_constants::match_flag_type f=boost::regex_constants::match_default)
template<class OutputIterator , class BidirectionalIterator , class traits , class B , bool b>
OutputIterator	regex_replace (OutputIterator out, BidirectionalIterator first, BidirectionalIterator last, const basic_regex< B, traits > &e, const ATL::CSimpleStringT< B, b > &fmt, match_flag_type flags=match_default)
template<class traits , class B , bool b>
ATL::CSimpleStringT< B, b >	regex_replace (const ATL::CSimpleStringT< B, b > &s, const basic_regex< B, traits > &e, const ATL::CSimpleStringT< B, b > &fmt, match_flag_type flags=match_default)
BOOST_REGEX_DECL void	boost_regex_free_static_mutex ()
template<class charT , class traits >
void	swap (basic_regex< charT, traits > &e1, basic_regex< charT, traits > &e2)
template<class charT , class traits , class traits2 >
std::basic_ostream< charT, traits > &	operator<< (std::basic_ostream< charT, traits > &os, const basic_regex< charT, traits2 > &e)
template<class BidiIterator , class Allocator >
void	swap (match_results< BidiIterator, Allocator > &a, match_results< BidiIterator, Allocator > &b)
template<class charT , class traits , class BidiIterator , class Allocator >
std::basic_ostream< charT, traits > &	operator<< (std::basic_ostream< charT, traits > &os, const match_results< BidiIterator, Allocator > &s)
template<class OutputIterator , class Iterator , class Allocator , class Functor >
OutputIterator	regex_format (OutputIterator out, const match_results< Iterator, Allocator > &m, Functor fmt, match_flag_type flags=format_all)
template<class Iterator , class Allocator , class Functor >
std::basic_string< typename match_results< Iterator, Allocator >::char_type >	regex_format (const match_results< Iterator, Allocator > &m, Functor fmt, match_flag_type flags=format_all)
template<class Predicate , class BidiIterator , class charT , class traits >
unsigned int	regex_grep (Predicate foo, BidiIterator first, BidiIterator last, const basic_regex< charT, traits > &e, match_flag_type flags=match_default)
template<class Predicate , class charT , class traits >
unsigned int	regex_grep (Predicate foo, const charT *str, const basic_regex< charT, traits > &e, match_flag_type flags=match_default)
template<class Predicate , class ST , class SA , class charT , class traits >
unsigned int	regex_grep (Predicate foo, const std::basic_string< charT, ST, SA > &s, const basic_regex< charT, traits > &e, match_flag_type flags=match_default)
template<class charT , class traits >
regex_iterator< const charT *, charT, traits >	make_regex_iterator (const charT *p, const basic_regex< charT, traits > &e, regex_constants::match_flag_type m=regex_constants::match_default)
template<class charT , class traits , class ST , class SA >
regex_iterator< typename std::basic_string< charT, ST, SA >::const_iterator, charT, traits >	make_regex_iterator (const std::basic_string< charT, ST, SA > &p, const basic_regex< charT, traits > &e, regex_constants::match_flag_type m=regex_constants::match_default)
template<class BidiIterator , class Allocator , class charT , class traits >
bool	regex_match (BidiIterator first, BidiIterator last, match_results< BidiIterator, Allocator > &m, const basic_regex< charT, traits > &e, match_flag_type flags=match_default)
template<class iterator , class charT , class traits >
bool	regex_match (iterator first, iterator last, const basic_regex< charT, traits > &e, match_flag_type flags=match_default)
template<class charT , class Allocator , class traits >
bool	regex_match (const charT *str, match_results< const charT *, Allocator > &m, const basic_regex< charT, traits > &e, match_flag_type flags=match_default)
template<class ST , class SA , class Allocator , class charT , class traits >
bool	regex_match (const std::basic_string< charT, ST, SA > &s, match_results< typename std::basic_string< charT, ST, SA >::const_iterator, Allocator > &m, const basic_regex< charT, traits > &e, match_flag_type flags=match_default)
template<class charT , class traits >
bool	regex_match (const charT *str, const basic_regex< charT, traits > &e, match_flag_type flags=match_default)
template<class ST , class SA , class charT , class traits >
bool	regex_match (const std::basic_string< charT, ST, SA > &s, const basic_regex< charT, traits > &e, match_flag_type flags=match_default)
template<class OutputIterator , class Iterator , class traits , class charT >
OutputIterator	regex_merge (OutputIterator out, Iterator first, Iterator last, const basic_regex< charT, traits > &e, const charT *fmt, match_flag_type flags=match_default)
template<class OutputIterator , class Iterator , class traits , class charT >
OutputIterator	regex_merge (OutputIterator out, Iterator first, Iterator last, const basic_regex< charT, traits > &e, const std::basic_string< charT > &fmt, match_flag_type flags=match_default)
template<class traits , class charT >
std::basic_string< charT >	regex_merge (const std::basic_string< charT > &s, const basic_regex< charT, traits > &e, const charT *fmt, match_flag_type flags=match_default)
template<class traits , class charT >
std::basic_string< charT >	regex_merge (const std::basic_string< charT > &s, const basic_regex< charT, traits > &e, const std::basic_string< charT > &fmt, match_flag_type flags=match_default)
template<class OutputIterator , class BidirectionalIterator , class traits , class charT , class Formatter >
OutputIterator	regex_replace (OutputIterator out, BidirectionalIterator first, BidirectionalIterator last, const basic_regex< charT, traits > &e, Formatter fmt, match_flag_type flags=match_default)
template<class traits , class charT , class Formatter >
std::basic_string< charT >	regex_replace (const std::basic_string< charT > &s, const basic_regex< charT, traits > &e, Formatter fmt, match_flag_type flags=match_default)
template<class BidiIterator , class Allocator , class charT , class traits >
bool	regex_search (BidiIterator first, BidiIterator last, match_results< BidiIterator, Allocator > &m, const basic_regex< charT, traits > &e, match_flag_type flags=match_default)
template<class BidiIterator , class Allocator , class charT , class traits >
bool	regex_search (BidiIterator first, BidiIterator last, match_results< BidiIterator, Allocator > &m, const basic_regex< charT, traits > &e, match_flag_type flags, BidiIterator base)
template<class charT , class Allocator , class traits >
bool	regex_search (const charT *str, match_results< const charT *, Allocator > &m, const basic_regex< charT, traits > &e, match_flag_type flags=match_default)
template<class ST , class SA , class Allocator , class charT , class traits >
bool	regex_search (const std::basic_string< charT, ST, SA > &s, match_results< typename std::basic_string< charT, ST, SA >::const_iterator, Allocator > &m, const basic_regex< charT, traits > &e, match_flag_type flags=match_default)
template<class BidiIterator , class charT , class traits >
bool	regex_search (BidiIterator first, BidiIterator last, const basic_regex< charT, traits > &e, match_flag_type flags=match_default)
template<class charT , class traits >
bool	regex_search (const charT *str, const basic_regex< charT, traits > &e, match_flag_type flags=match_default)
template<class ST , class SA , class charT , class traits >
bool	regex_search (const std::basic_string< charT, ST, SA > &s, const basic_regex< charT, traits > &e, match_flag_type flags=match_default)
template<class OutputIterator , class charT , class Traits1 , class Alloc1 , class Traits2 >
std::size_t	regex_split (OutputIterator out, std::basic_string< charT, Traits1, Alloc1 > &s, const basic_regex< charT, Traits2 > &e, match_flag_type flags, std::size_t max_split)
template<class OutputIterator , class charT , class Traits1 , class Alloc1 , class Traits2 >
std::size_t	regex_split (OutputIterator out, std::basic_string< charT, Traits1, Alloc1 > &s, const basic_regex< charT, Traits2 > &e, match_flag_type flags=match_default)
template<class OutputIterator , class charT , class Traits1 , class Alloc1 >
std::size_t	regex_split (OutputIterator out, std::basic_string< charT, Traits1, Alloc1 > &s)
template<class charT , class traits >
regex_token_iterator< const charT *, charT, traits >	make_regex_token_iterator (const charT *p, const basic_regex< charT, traits > &e, int submatch=0, regex_constants::match_flag_type m=regex_constants::match_default)
template<class charT , class traits , class ST , class SA >
regex_token_iterator< typename std::basic_string< charT, ST, SA >::const_iterator, charT, traits >	make_regex_token_iterator (const std::basic_string< charT, ST, SA > &p, const basic_regex< charT, traits > &e, int submatch=0, regex_constants::match_flag_type m=regex_constants::match_default)
template<class charT , class traits , std::size_t N>
regex_token_iterator< const charT *, charT, traits >	make_regex_token_iterator (const charT *p, const basic_regex< charT, traits > &e, const int(&submatch)[N], regex_constants::match_flag_type m=regex_constants::match_default)
template<class charT , class traits , class ST , class SA , std::size_t N>
regex_token_iterator< typename std::basic_string< charT, ST, SA >::const_iterator, charT, traits >	make_regex_token_iterator (const std::basic_string< charT, ST, SA > &p, const basic_regex< charT, traits > &e, const int(&submatch)[N], regex_constants::match_flag_type m=regex_constants::match_default)
template<class charT , class traits >
regex_token_iterator< const charT *, charT, traits >	make_regex_token_iterator (const charT *p, const basic_regex< charT, traits > &e, const std::vector< int > &submatch, regex_constants::match_flag_type m=regex_constants::match_default)
template<class charT , class traits , class ST , class SA >
regex_token_iterator< typename std::basic_string< charT, ST, SA >::const_iterator, charT, traits >	make_regex_token_iterator (const std::basic_string< charT, ST, SA > &p, const basic_regex< charT, traits > &e, const std::vector< int > &submatch, regex_constants::match_flag_type m=regex_constants::match_default)
template<class RandomAccessIterator , class traits , class Allocator >
bool	operator== (const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &s, const sub_match< RandomAccessIterator > &m)
template<class RandomAccessIterator , class traits , class Allocator >
bool	operator!= (const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &s, const sub_match< RandomAccessIterator > &m)
template<class RandomAccessIterator , class traits , class Allocator >
bool	operator< (const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &s, const sub_match< RandomAccessIterator > &m)
template<class RandomAccessIterator , class traits , class Allocator >
bool	operator<= (const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &s, const sub_match< RandomAccessIterator > &m)
template<class RandomAccessIterator , class traits , class Allocator >
bool	operator>= (const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &s, const sub_match< RandomAccessIterator > &m)
template<class RandomAccessIterator , class traits , class Allocator >
bool	operator> (const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &s, const sub_match< RandomAccessIterator > &m)
template<class RandomAccessIterator , class traits , class Allocator >
bool	operator== (const sub_match< RandomAccessIterator > &m, const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &s)
template<class RandomAccessIterator , class traits , class Allocator >
bool	operator!= (const sub_match< RandomAccessIterator > &m, const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &s)
template<class RandomAccessIterator , class traits , class Allocator >
bool	operator< (const sub_match< RandomAccessIterator > &m, const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &s)
template<class RandomAccessIterator , class traits , class Allocator >
bool	operator> (const sub_match< RandomAccessIterator > &m, const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &s)
template<class RandomAccessIterator , class traits , class Allocator >
bool	operator<= (const sub_match< RandomAccessIterator > &m, const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &s)
template<class RandomAccessIterator , class traits , class Allocator >
bool	operator>= (const sub_match< RandomAccessIterator > &m, const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &s)
template<class RandomAccessIterator >
bool	operator== (const sub_match< RandomAccessIterator > &m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *s)
template<class RandomAccessIterator >
bool	operator!= (const sub_match< RandomAccessIterator > &m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *s)
template<class RandomAccessIterator >
bool	operator> (const sub_match< RandomAccessIterator > &m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *s)
template<class RandomAccessIterator >
bool	operator< (const sub_match< RandomAccessIterator > &m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *s)
template<class RandomAccessIterator >
bool	operator>= (const sub_match< RandomAccessIterator > &m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *s)
template<class RandomAccessIterator >
bool	operator<= (const sub_match< RandomAccessIterator > &m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *s)
template<class RandomAccessIterator >
bool	operator== (typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *s, const sub_match< RandomAccessIterator > &m)
template<class RandomAccessIterator >
bool	operator!= (typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *s, const sub_match< RandomAccessIterator > &m)
template<class RandomAccessIterator >
bool	operator< (typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *s, const sub_match< RandomAccessIterator > &m)
template<class RandomAccessIterator >
bool	operator> (typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *s, const sub_match< RandomAccessIterator > &m)
template<class RandomAccessIterator >
bool	operator<= (typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *s, const sub_match< RandomAccessIterator > &m)
template<class RandomAccessIterator >
bool	operator>= (typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *s, const sub_match< RandomAccessIterator > &m)
template<class RandomAccessIterator >
bool	operator== (const sub_match< RandomAccessIterator > &m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &s)
template<class RandomAccessIterator >
bool	operator!= (const sub_match< RandomAccessIterator > &m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &s)
template<class RandomAccessIterator >
bool	operator> (const sub_match< RandomAccessIterator > &m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &s)
template<class RandomAccessIterator >
bool	operator< (const sub_match< RandomAccessIterator > &m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &s)
template<class RandomAccessIterator >
bool	operator>= (const sub_match< RandomAccessIterator > &m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &s)
template<class RandomAccessIterator >
bool	operator<= (const sub_match< RandomAccessIterator > &m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &s)
template<class RandomAccessIterator >
bool	operator== (typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &s, const sub_match< RandomAccessIterator > &m)
template<class RandomAccessIterator >
bool	operator!= (typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &s, const sub_match< RandomAccessIterator > &m)
template<class RandomAccessIterator >
bool	operator< (typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &s, const sub_match< RandomAccessIterator > &m)
template<class RandomAccessIterator >
bool	operator> (typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &s, const sub_match< RandomAccessIterator > &m)
template<class RandomAccessIterator >
bool	operator<= (typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &s, const sub_match< RandomAccessIterator > &m)
template<class RandomAccessIterator >
bool	operator>= (typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &s, const sub_match< RandomAccessIterator > &m)
template<class RandomAccessIterator , class traits , class Allocator >
std::basic_string< typename re_detail::regex_iterator_traits < RandomAccessIterator > ::value_type, traits, Allocator >	operator+ (const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &s, const sub_match< RandomAccessIterator > &m)
template<class RandomAccessIterator , class traits , class Allocator >
std::basic_string< typename re_detail::regex_iterator_traits < RandomAccessIterator > ::value_type, traits, Allocator >	operator+ (const sub_match< RandomAccessIterator > &m, const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &s)
template<class RandomAccessIterator >
std::basic_string< typename re_detail::regex_iterator_traits < RandomAccessIterator > ::value_type >	operator+ (typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *s, const sub_match< RandomAccessIterator > &m)
template<class RandomAccessIterator >
std::basic_string< typename re_detail::regex_iterator_traits < RandomAccessIterator > ::value_type >	operator+ (const sub_match< RandomAccessIterator > &m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *s)
template<class RandomAccessIterator >
std::basic_string< typename re_detail::regex_iterator_traits < RandomAccessIterator > ::value_type >	operator+ (typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &s, const sub_match< RandomAccessIterator > &m)
template<class RandomAccessIterator >
std::basic_string< typename re_detail::regex_iterator_traits < RandomAccessIterator > ::value_type >	operator+ (const sub_match< RandomAccessIterator > &m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &s)
template<class RandomAccessIterator >
std::basic_string< typename re_detail::regex_iterator_traits < RandomAccessIterator > ::value_type >	operator+ (const sub_match< RandomAccessIterator > &m1, const sub_match< RandomAccessIterator > &m2)
template<class charT , class traits , class RandomAccessIterator >
std::basic_ostream< charT, traits > &	operator<< (std::basic_ostream< charT, traits > &os, const sub_match< RandomAccessIterator > &s)
u32regex_iterator< const char * >	make_u32regex_iterator (const char *p, const u32regex &e, regex_constants::match_flag_type m=regex_constants::match_default)
u32regex_iterator< const wchar_t * >	make_u32regex_iterator (const wchar_t *p, const u32regex &e, regex_constants::match_flag_type m=regex_constants::match_default)
u32regex_iterator< const UChar * >	make_u32regex_iterator (const UChar *p, const u32regex &e, regex_constants::match_flag_type m=regex_constants::match_default)
template<class charT , class Traits , class Alloc >
u32regex_iterator< typename std::basic_string< charT, Traits, Alloc > ::const_iterator >	make_u32regex_iterator (const std::basic_string< charT, Traits, Alloc > &p, const u32regex &e, regex_constants::match_flag_type m=regex_constants::match_default)
u32regex_iterator< const UChar * >	make_u32regex_iterator (const U_NAMESPACE_QUALIFIER UnicodeString &s, const u32regex &e, regex_constants::match_flag_type m=regex_constants::match_default)
u32regex_token_iterator< const char * >	make_u32regex_token_iterator (const char *p, const u32regex &e, int submatch=0, regex_constants::match_flag_type m=regex_constants::match_default)
u32regex_token_iterator< const wchar_t * >	make_u32regex_token_iterator (const wchar_t *p, const u32regex &e, int submatch=0, regex_constants::match_flag_type m=regex_constants::match_default)
u32regex_token_iterator< const UChar * >	make_u32regex_token_iterator (const UChar *p, const u32regex &e, int submatch=0, regex_constants::match_flag_type m=regex_constants::match_default)
template<class charT , class Traits , class Alloc >
u32regex_token_iterator < typename std::basic_string < charT, Traits, Alloc > ::const_iterator >	make_u32regex_token_iterator (const std::basic_string< charT, Traits, Alloc > &p, const u32regex &e, int submatch=0, regex_constants::match_flag_type m=regex_constants::match_default)
u32regex_token_iterator< const UChar * >	make_u32regex_token_iterator (const U_NAMESPACE_QUALIFIER UnicodeString &s, const u32regex &e, int submatch=0, regex_constants::match_flag_type m=regex_constants::match_default)
template<std::size_t N>
u32regex_token_iterator< const char * >	make_u32regex_token_iterator (const char *p, const u32regex &e, const int(&submatch)[N], regex_constants::match_flag_type m=regex_constants::match_default)
template<std::size_t N>
u32regex_token_iterator< const wchar_t * >	make_u32regex_token_iterator (const wchar_t *p, const u32regex &e, const int(&submatch)[N], regex_constants::match_flag_type m=regex_constants::match_default)
template<std::size_t N>
u32regex_token_iterator< const UChar * >	make_u32regex_token_iterator (const UChar *p, const u32regex &e, const int(&submatch)[N], regex_constants::match_flag_type m=regex_constants::match_default)
template<class charT , class Traits , class Alloc , std::size_t N>
u32regex_token_iterator < typename std::basic_string < charT, Traits, Alloc > ::const_iterator >	make_u32regex_token_iterator (const std::basic_string< charT, Traits, Alloc > &p, const u32regex &e, const int(&submatch)[N], regex_constants::match_flag_type m=regex_constants::match_default)
template<std::size_t N>
u32regex_token_iterator< const UChar * >	make_u32regex_token_iterator (const U_NAMESPACE_QUALIFIER UnicodeString &s, const u32regex &e, const int(&submatch)[N], regex_constants::match_flag_type m=regex_constants::match_default)
u32regex_token_iterator< const char * >	make_u32regex_token_iterator (const char *p, const u32regex &e, const std::vector< int > &submatch, regex_constants::match_flag_type m=regex_constants::match_default)
u32regex_token_iterator< const wchar_t * >	make_u32regex_token_iterator (const wchar_t *p, const u32regex &e, const std::vector< int > &submatch, regex_constants::match_flag_type m=regex_constants::match_default)
u32regex_token_iterator< const UChar * >	make_u32regex_token_iterator (const UChar *p, const u32regex &e, const std::vector< int > &submatch, regex_constants::match_flag_type m=regex_constants::match_default)
template<class charT , class Traits , class Alloc >
u32regex_token_iterator < typename std::basic_string < charT, Traits, Alloc > ::const_iterator >	make_u32regex_token_iterator (const std::basic_string< charT, Traits, Alloc > &p, const u32regex &e, const std::vector< int > &submatch, regex_constants::match_flag_type m=regex_constants::match_default)
u32regex_token_iterator< const UChar * >	make_u32regex_token_iterator (const U_NAMESPACE_QUALIFIER UnicodeString &s, const u32regex &e, const std::vector< int > &submatch, regex_constants::match_flag_type m=regex_constants::match_default)
template<typename R , BOOST_SIGNALS_TEMPLATE_PARMS typename Combiner = last_value<R>, typename Group = int, typename GroupCompare = std::less<Group>, typename SlotFunction = BOOST_JOIN(function,BOOST_SIGNALS_NUM_ARGS)< R BOOST_SIGNALS_TEMPLATE_ARGS>>
class	BOOST_JOIN (signal, BOOST_SIGNALS_NUM_ARGS)
template<typename R , BOOST_SIGNALS_TEMPLATE_PARMS typename Combiner, typename Group , typename GroupCompare , typename SlotFunction >
BOOST_SIGNALS_NAMESPACE::connection	BOOST_JOIN (signal, BOOST_SIGNALS_NUM_ARGS)< R
template<typename R , BOOST_SIGNALS_TEMPLATE_PARMS typename Combiner, typename Group , typename GroupCompare , typename SlotFunction >
	BOOST_JOIN (signal, BOOST_SIGNALS_NUM_ARGS)< R
template<class T , class A >
boost::detail::sp_if_array< T > ::type	allocate_shared (const A &allocator, std::size_t size)
template<class T , class A >
boost::detail::sp_if_size_array < T >::type	allocate_shared (const A &allocator)
template<class T , class A >
boost::detail::sp_if_array< T > ::type	allocate_shared (const A &allocator, std::size_t size, const typename boost::detail::array_inner< T >::type &value)
template<class T , class A >
boost::detail::sp_if_size_array < T >::type	allocate_shared (const A &allocator, const typename boost::detail::array_inner< T >::type &value)
template<class T , class A >
boost::detail::sp_if_array< T > ::type	allocate_shared_noinit (const A &allocator, std::size_t size)
template<class T , class A >
boost::detail::sp_if_size_array < T >::type	allocate_shared_noinit (const A &allocator)
template<typename T >
boost::shared_ptr< T >	shared_from_raw (T *)
template<typename T >
boost::weak_ptr< T >	weak_from_raw (T *)
template<class T , class U >
bool	operator== (intrusive_ptr< T > const &a, intrusive_ptr< U > const &b)
template<class T , class U >
bool	operator!= (intrusive_ptr< T > const &a, intrusive_ptr< U > const &b)
template<class T , class U >
bool	operator== (intrusive_ptr< T > const &a, U *b)
template<class T , class U >
bool	operator!= (intrusive_ptr< T > const &a, U *b)
template<class T , class U >
bool	operator== (T *a, intrusive_ptr< U > const &b)
template<class T , class U >
bool	operator!= (T *a, intrusive_ptr< U > const &b)
template<class T >
bool	operator== (intrusive_ptr< T > const &p, boost::detail::sp_nullptr_t) BOOST_NOEXCEPT
template<class T >
bool	operator== (boost::detail::sp_nullptr_t, intrusive_ptr< T > const &p) BOOST_NOEXCEPT
template<class T >
bool	operator!= (intrusive_ptr< T > const &p, boost::detail::sp_nullptr_t) BOOST_NOEXCEPT
template<class T >
bool	operator!= (boost::detail::sp_nullptr_t, intrusive_ptr< T > const &p) BOOST_NOEXCEPT
template<class T >
bool	operator< (intrusive_ptr< T > const &a, intrusive_ptr< T > const &b)
template<class T >
void	swap (intrusive_ptr< T > &lhs, intrusive_ptr< T > &rhs)
template<class T >
T *	get_pointer (intrusive_ptr< T > const &p)
template<class T , class U >
intrusive_ptr< T >	static_pointer_cast (intrusive_ptr< U > const &p)
template<class T , class U >
intrusive_ptr< T >	const_pointer_cast (intrusive_ptr< U > const &p)
template<class T , class U >
intrusive_ptr< T >	dynamic_pointer_cast (intrusive_ptr< U > const &p)
template<class E , class T , class Y >
std::basic_ostream< E, T > &	operator<< (std::basic_ostream< E, T > &os, intrusive_ptr< Y > const &p)
template<class T >
std::size_t	hash_value (boost::intrusive_ptr< T > const &p)
template<class T >
boost::detail::sp_if_array< T > ::type	make_shared (std::size_t size)
template<class T >
boost::detail::sp_if_size_array < T >::type	make_shared ()
template<class T >
boost::detail::sp_if_array< T > ::type	make_shared (std::size_t size, const typename boost::detail::array_inner< T >::type &value)
template<class T >
boost::detail::sp_if_size_array < T >::type	make_shared (const typename boost::detail::array_inner< T >::type &value)
template<class T >
boost::detail::sp_if_array< T > ::type	make_shared_noinit (std::size_t size)
template<class T >
boost::detail::sp_if_size_array < T >::type	make_shared_noinit ()
template<class T >
boost::detail::sp_if_not_array < T >::type	make_shared_noinit ()
template<class T , class A >
boost::detail::sp_if_not_array < T >::type	allocate_shared_noinit (A const &a)
template<class T , class... Args>
boost::detail::sp_if_not_array < T >::type	make_shared (Args &&...args)
template<class T , class A , class... Args>
boost::detail::sp_if_not_array < T >::type	allocate_shared (A const &a, Args &&...args)
template<class T >
boost::detail::up_if_array< T > ::type	make_unique (std::size_t size)
template<class T >
boost::detail::up_if_array< T > ::type	make_unique_noinit (std::size_t size)
template<class T >
boost::detail::up_if_not_array < T >::type	make_unique ()
template<class T , class... Args>
boost::detail::up_if_not_array < T >::type	make_unique (Args &&...args)
template<class T >
boost::detail::up_if_not_array < T >::type	make_unique (typename add_rvalue_reference< T >::type value)
template<class T >
boost::detail::up_if_not_array < T >::type	make_unique_noinit ()
template<class T >
bool	operator== (scoped_array< T > const &p, boost::detail::sp_nullptr_t) BOOST_NOEXCEPT
template<class T >
bool	operator== (boost::detail::sp_nullptr_t, scoped_array< T > const &p) BOOST_NOEXCEPT
template<class T >
bool	operator!= (scoped_array< T > const &p, boost::detail::sp_nullptr_t) BOOST_NOEXCEPT
template<class T >
bool	operator!= (boost::detail::sp_nullptr_t, scoped_array< T > const &p) BOOST_NOEXCEPT
template<class T >
void	swap (scoped_array< T > &a, scoped_array< T > &b) BOOST_NOEXCEPT
template<class T >
bool	operator== (scoped_ptr< T > const &p, boost::detail::sp_nullptr_t) BOOST_NOEXCEPT
template<class T >
bool	operator== (boost::detail::sp_nullptr_t, scoped_ptr< T > const &p) BOOST_NOEXCEPT
template<class T >
bool	operator!= (scoped_ptr< T > const &p, boost::detail::sp_nullptr_t) BOOST_NOEXCEPT
template<class T >
bool	operator!= (boost::detail::sp_nullptr_t, scoped_ptr< T > const &p) BOOST_NOEXCEPT
template<class T >
void	swap (scoped_ptr< T > &a, scoped_ptr< T > &b) BOOST_NOEXCEPT
template<class T >
T *	get_pointer (scoped_ptr< T > const &p) BOOST_NOEXCEPT
template<class T >
bool	operator== (shared_array< T > const &a, shared_array< T > const &b) BOOST_NOEXCEPT
template<class T >
bool	operator!= (shared_array< T > const &a, shared_array< T > const &b) BOOST_NOEXCEPT
template<class T >
bool	operator== (shared_array< T > const &p, boost::detail::sp_nullptr_t) BOOST_NOEXCEPT
template<class T >
bool	operator== (boost::detail::sp_nullptr_t, shared_array< T > const &p) BOOST_NOEXCEPT
template<class T >
bool	operator!= (shared_array< T > const &p, boost::detail::sp_nullptr_t) BOOST_NOEXCEPT
template<class T >
bool	operator!= (boost::detail::sp_nullptr_t, shared_array< T > const &p) BOOST_NOEXCEPT
template<class T >
bool	operator< (shared_array< T > const &a, shared_array< T > const &b) BOOST_NOEXCEPT
template<class T >
void	swap (shared_array< T > &a, shared_array< T > &b) BOOST_NOEXCEPT
template<class D , class T >
D *	get_deleter (shared_array< T > const &p)
template<class T , class U >
bool	operator== (shared_ptr< T > const &a, shared_ptr< U > const &b) BOOST_NOEXCEPT
template<class T , class U >
bool	operator!= (shared_ptr< T > const &a, shared_ptr< U > const &b) BOOST_NOEXCEPT
template<class T >
bool	operator== (shared_ptr< T > const &p, boost::detail::sp_nullptr_t) BOOST_NOEXCEPT
template<class T >
bool	operator== (boost::detail::sp_nullptr_t, shared_ptr< T > const &p) BOOST_NOEXCEPT
template<class T >
bool	operator!= (shared_ptr< T > const &p, boost::detail::sp_nullptr_t) BOOST_NOEXCEPT
template<class T >
bool	operator!= (boost::detail::sp_nullptr_t, shared_ptr< T > const &p) BOOST_NOEXCEPT
template<class T , class U >
bool	operator< (shared_ptr< T > const &a, shared_ptr< U > const &b) BOOST_NOEXCEPT
template<class T >
void	swap (shared_ptr< T > &a, shared_ptr< T > &b) BOOST_NOEXCEPT
template<class T , class U >
shared_ptr< T >	static_pointer_cast (shared_ptr< U > const &r) BOOST_NOEXCEPT
template<class T , class U >
shared_ptr< T >	const_pointer_cast (shared_ptr< U > const &r) BOOST_NOEXCEPT
template<class T , class U >
shared_ptr< T >	dynamic_pointer_cast (shared_ptr< U > const &r) BOOST_NOEXCEPT
template<class T , class U >
shared_ptr< T >	reinterpret_pointer_cast (shared_ptr< U > const &r) BOOST_NOEXCEPT
template<class T >
shared_ptr< T >::element_type *	get_pointer (shared_ptr< T > const &p) BOOST_NOEXCEPT
template<class E , class T , class Y >
std::basic_ostream< E, T > &	operator<< (std::basic_ostream< E, T > &os, shared_ptr< Y > const &p)
template<class D , class T >
D *	get_deleter (shared_ptr< T > const &p) BOOST_NOEXCEPT
template<class T >
bool	atomic_is_lock_free (shared_ptr< T > const *) BOOST_NOEXCEPT
template<class T >
shared_ptr< T >	atomic_load (shared_ptr< T > const *p)
template<class T >
shared_ptr< T >	atomic_load_explicit (shared_ptr< T > const *p, int)
template<class T >
void	atomic_store (shared_ptr< T > *p, shared_ptr< T > r)
template<class T >
void	atomic_store_explicit (shared_ptr< T > *p, shared_ptr< T > r, int)
template<class T >
shared_ptr< T >	atomic_exchange (shared_ptr< T > *p, shared_ptr< T > r)
template<class T >
shared_ptr< T >	atomic_exchange_explicit (shared_ptr< T > *p, shared_ptr< T > r, int)
template<class T >
bool	atomic_compare_exchange (shared_ptr< T > *p, shared_ptr< T > *v, shared_ptr< T > w)
template<class T >
bool	atomic_compare_exchange_explicit (shared_ptr< T > *p, shared_ptr< T > *v, shared_ptr< T > w, int, int)
template<class T >
std::size_t	hash_value (boost::shared_ptr< T > const &p) BOOST_NOEXCEPT
template<class T , class U >
bool	operator< (weak_ptr< T > const &a, weak_ptr< U > const &b) BOOST_NOEXCEPT
template<class T >
void	swap (weak_ptr< T > &a, weak_ptr< T > &b) BOOST_NOEXCEPT
template<typename T , BOOST_PP_ENUM_PARAMS(BOOST_MPL_LIMIT_LIST_SIZE,typename T) >
T const &	get (boost::spirit::extended_variant< BOOST_PP_ENUM_PARAMS(BOOST_MPL_LIMIT_LIST_SIZE, T)> const &x)
template<typename T , BOOST_PP_ENUM_PARAMS(BOOST_MPL_LIMIT_LIST_SIZE,typename T) >
T &	get (boost::spirit::extended_variant< BOOST_PP_ENUM_PARAMS(BOOST_MPL_LIMIT_LIST_SIZE, T)> &x)
template<typename T , BOOST_PP_ENUM_PARAMS(BOOST_MPL_LIMIT_LIST_SIZE,typename T) >
T const *	get (boost::spirit::extended_variant< BOOST_PP_ENUM_PARAMS(BOOST_MPL_LIMIT_LIST_SIZE, T)> const *x)
template<typename T , BOOST_PP_ENUM_PARAMS(BOOST_MPL_LIMIT_LIST_SIZE,typename T) >
T *	get (boost::spirit::extended_variant< BOOST_PP_ENUM_PARAMS(BOOST_MPL_LIMIT_LIST_SIZE, T)> *x)
template<typename T >
T	get (boost::spirit::utree const &x)
template<typename T , typename... Types>
T const &	get (boost::spirit::x3::variant< Types...> const &x)
template<typename T , typename... Types>
T &	get (boost::spirit::x3::variant< Types...> &x)
template<typename T , typename... Types>
T const *	get (boost::spirit::x3::variant< Types...> const *x)
template<typename T , typename... Types>
T *	get (boost::spirit::x3::variant< Types...> *x)
system::error_code &	throws ()
int BOOST_TEST_DECL	prg_exec_monitor_main (int(*cpp_main)(int argc, char *argv[]), int argc, char *argv[])
template<typename CharT , typename T >
basic_wrap_stringstream< CharT > &	operator<< (basic_wrap_stringstream< CharT > &targ, T const &t)
template<typename CharT >
basic_wrap_stringstream< CharT > &	operator<< (basic_wrap_stringstream< CharT > &targ, basic_wrap_stringstream< CharT > &src)
template<typename OStream >
OStream &	operator<< (OStream &os, caller_context_t const &ctx)
	BOOST_SCOPED_ENUM_DECLARE_BEGIN (cv_status)
template<class E >
exceptional_ptr	make_exceptional (BOOST_FWD_REF(E) ex)
exceptional_ptr	make_exceptional (exception_ptr ex)
exceptional_ptr	make_exceptional ()
template<typename T , typename MutexType >
void	swap (externally_locked< T, MutexType > &lhs, externally_locked< T, MutexType > &rhs)
template<typename Stream , typename RecursiveMutex , typename T >
const stream_guard< Stream, RecursiveMutex > &	operator<< (const stream_guard< Stream, RecursiveMutex > &lck, T arg)
template<typename Stream , typename RecursiveMutex >
const stream_guard< Stream, RecursiveMutex > &	operator<< (const stream_guard< Stream, RecursiveMutex > &lck, Stream &(*arg)(Stream &))
template<typename Stream , typename RecursiveMutex , typename T >
const stream_guard< Stream, RecursiveMutex > &	operator>> (const stream_guard< Stream, RecursiveMutex > &lck, T &arg)
template<typename Stream , typename RecursiveMutex , typename T >
stream_guard< Stream, RecursiveMutex >	operator<< (externally_locked_stream< Stream, RecursiveMutex > &mtx, T arg)
template<typename Stream , typename RecursiveMutex >
stream_guard< Stream, RecursiveMutex >	operator<< (externally_locked_stream< Stream, RecursiveMutex > &mtx, Stream &(*arg)(Stream &))
template<typename Stream , typename RecursiveMutex , typename T >
stream_guard< Stream, RecursiveMutex >	operator>> (externally_locked_stream< Stream, RecursiveMutex > &mtx, T &arg)
	BOOST_SCOPED_ENUM_DECLARE_BEGIN (launch)
	BOOST_SCOPED_ENUM_DECLARE_BEGIN (future_status)
template<typename Iterator >
boost::disable_if < is_future_type< Iterator > , void >::type	wait_for_all (Iterator begin, Iterator end)
template<typename F1 , typename... Fs>
void	wait_for_all (F1 &f1, Fs &...fs)
template<typename Iterator >
boost::disable_if < is_future_type< Iterator > , Iterator >::type	wait_for_any (Iterator begin, Iterator end)
template<typename F1 , typename... Fs>
boost::enable_if < is_future_type< F1 > , unsigned >::type	wait_for_any (F1 &f1, Fs &...fs)
template<class Rp , class Fp >
BOOST_THREAD_DCL_MOVABLE_BEG(R) detail unique_future< Rp >	make_future_deferred_shared_state (BOOST_THREAD_FWD_REF(Fp) f)
	BOOST_THREAD_DCL_MOVABLE_BEG (T) unique_future< T > BOOST_THREAD_DCL_MOVABLE_END template< typename R2 > class unique_future< unique_future< R2 > >
template<class F >
unique_future< typename boost::result_of< typename decay< F >::type()>::type >	async (launch policy, BOOST_THREAD_FWD_REF(F) f)
template<class F >
unique_future< typename boost::result_of< F()>::type >	async (BOOST_THREAD_FWD_REF(F) f)
template<typename T >
unique_future< typename decay < T >::type >	make_future (BOOST_THREAD_FWD_REF(T) value)
template<typename T >
unique_future< typename decay < T >::type >	make_ready_future (BOOST_THREAD_FWD_REF(T) value)
template<typename T , typename T1 >
unique_future< T >	make_ready_no_decay_future (T1 value)
template<typename T >
unique_future< T >	make_ready_future (exception_ptr ex)
template<typename T >
unique_future< T >	make_exceptional_future (exception_ptr ex)
template<typename T , typename E >
unique_future< T >	make_exceptional_future (E ex)
template<typename T >
unique_future< T >	make_exceptional_future ()
template<typename T >
unique_future< T >	make_exceptional_future_if_invalid (BOOST_THREAD_FWD_REF(unique_future< T >) fut)
template<typename T >
shared_future< T >	make_exceptional_future_if_invalid (shared_future< T > fut)
template<typename T >
shared_future< typename decay < T >::type >	make_shared_future (BOOST_THREAD_FWD_REF(T) value)
shared_future< void >	make_shared_future ()
	BOOST_SCOPED_ENUM_DECLARE_BEGIN (future_errc)
BOOST_THREAD_DECL const system::error_category &	future_category () BOOST_NOEXCEPT
template<typename Lockable >
bool	is_locked_by_this_thread (testable_mutex< Lockable > const &mtx)
	Overloaded function used to check if the mutex is locked when it is testable and do nothing otherwise. More...
template<typename Lockable >
bool	is_locked_by_this_thread (Lockable const &)
template<typename MutexType1 , typename MutexType2 >
void	lock (MutexType1 &m1, MutexType2 &m2)
template<typename MutexType1 , typename MutexType2 >
void	lock (const MutexType1 &m1, MutexType2 &m2)
template<typename MutexType1 , typename MutexType2 >
void	lock (MutexType1 &m1, const MutexType2 &m2)
template<typename MutexType1 , typename MutexType2 >
void	lock (const MutexType1 &m1, const MutexType2 &m2)
template<typename MutexType1 , typename MutexType2 , typename MutexType3 >
void	lock (MutexType1 &m1, MutexType2 &m2, MutexType3 &m3)
template<typename MutexType1 , typename MutexType2 , typename MutexType3 , typename MutexType4 >
void	lock (MutexType1 &m1, MutexType2 &m2, MutexType3 &m3, MutexType4 &m4)
template<typename MutexType1 , typename MutexType2 , typename MutexType3 , typename MutexType4 , typename MutexType5 >
void	lock (MutexType1 &m1, MutexType2 &m2, MutexType3 &m3, MutexType4 &m4, MutexType5 &m5)
template<typename MutexType1 , typename MutexType2 >
detail::try_lock_impl_return < MutexType1 >::type	try_lock (MutexType1 &m1, MutexType2 &m2)
template<typename MutexType1 , typename MutexType2 >
detail::try_lock_impl_return < MutexType1 >::type	try_lock (const MutexType1 &m1, MutexType2 &m2)
template<typename MutexType1 , typename MutexType2 >
detail::try_lock_impl_return < MutexType1 >::type	try_lock (MutexType1 &m1, const MutexType2 &m2)
template<typename MutexType1 , typename MutexType2 >
detail::try_lock_impl_return < MutexType1 >::type	try_lock (const MutexType1 &m1, const MutexType2 &m2)
template<typename MutexType1 , typename MutexType2 , typename MutexType3 >
int	try_lock (MutexType1 &m1, MutexType2 &m2, MutexType3 &m3)
template<typename MutexType1 , typename MutexType2 , typename MutexType3 , typename MutexType4 >
int	try_lock (MutexType1 &m1, MutexType2 &m2, MutexType3 &m3, MutexType4 &m4)
template<typename MutexType1 , typename MutexType2 , typename MutexType3 , typename MutexType4 , typename MutexType5 >
int	try_lock (MutexType1 &m1, MutexType2 &m2, MutexType3 &m3, MutexType4 &m4, MutexType5 &m5)
template<typename Lockable >
unique_lock< Lockable >	make_unique_lock (Lockable &mtx)
template<typename Lockable >
unique_lock< Lockable >	make_unique_lock (Lockable &mtx, adopt_lock_t)
template<typename Lockable >
unique_lock< Lockable >	make_unique_lock (Lockable &mtx, defer_lock_t)
template<typename Lockable >
unique_lock< Lockable >	make_unique_lock (Lockable &mtx, try_to_lock_t)
template<typename... Lockable>
std::tuple< unique_lock < Lockable >...>	make_unique_locks (Lockable &...mtx)
template<typename Lockable >
lock_guard< Lockable >	make_lock_guard (Lockable &mtx)
template<typename Lockable >
lock_guard< Lockable >	make_lock_guard (Lockable &mtx, adopt_lock_t)
template<typename Mutex >
void	swap (unique_lock< Mutex > &lhs, unique_lock< Mutex > &rhs) BOOST_NOEXCEPT
	BOOST_THREAD_DCL_MOVABLE_BEG (Mutex) unique_lock< Mutex > BOOST_THREAD_DCL_MOVABLE_END template< typename Mutex > class shared_lock
template<typename Mutex >
void	swap (upgrade_lock< Mutex > &lhs, upgrade_lock< Mutex > &rhs) BOOST_NOEXCEPT
template<typename Function >
void	call_once (Function func, once_flag &flag)
BOOST_THREAD_DECL void	notify_all_at_thread_exit (condition_variable &cond, unique_lock< mutex > lk)
template<typename Function , class... ArgTypes>
void	call_once (once_flag &flag, BOOST_THREAD_RV_REF(Function) f, BOOST_THREAD_RV_REF(ArgTypes)...args)
template<class Destroyer >
void	swap (scoped_thread< Destroyer > &lhs, scoped_thread< Destroyer > &rhs) BOOST_NOEXCEPT
	Effects: swaps the contents of two scoped threads. More...
template<typename Lockable >
strict_lock< Lockable >	make_strict_lock (Lockable &mtx)
template<typename Lock >
nested_strict_lock< Lock >	make_nested_strict_lock (Lock &lk)
template<typename ValueType >
sync_bounded_queue< ValueType > &	operator<< (sync_bounded_queue< ValueType > &sbq, BOOST_THREAD_RV_REF(ValueType) elem)
template<typename ValueType >
sync_bounded_queue< ValueType > &	operator<< (sync_bounded_queue< ValueType > &sbq, ValueType const &elem)
template<typename ValueType >
sync_bounded_queue< ValueType > &	operator>> (sync_bounded_queue< ValueType > &sbq, ValueType &elem)
template<typename ValueType >
sync_queue< ValueType > &	operator<< (sync_queue< ValueType > &sbq, BOOST_THREAD_RV_REF(ValueType) elem)
template<typename ValueType >
sync_queue< ValueType > &	operator<< (sync_queue< ValueType > &sbq, ValueType const &elem)
template<typename ValueType >
sync_queue< ValueType > &	operator>> (sync_queue< ValueType > &sbq, ValueType &elem)
template<typename T , typename L >
void	swap (synchronized_value< T, L > &lhs, synchronized_value< T, L > &rhs)
template<typename T , typename L >
void	swap (synchronized_value< T, L > &lhs, T &rhs)
template<typename T , typename L >
void	swap (T &lhs, synchronized_value< T, L > &rhs)
template<typename T , typename L >
bool	operator!= (synchronized_value< T, L > const &lhs, synchronized_value< T, L > const &rhs)
template<typename T , typename L >
bool	operator== (T const &lhs, synchronized_value< T, L > const &rhs)
template<typename T , typename L >
bool	operator!= (T const &lhs, synchronized_value< T, L > const &rhs)
template<typename T , typename L >
bool	operator< (T const &lhs, synchronized_value< T, L > const &rhs)
template<typename T , typename L >
bool	operator<= (T const &lhs, synchronized_value< T, L > const &rhs)
template<typename T , typename L >
bool	operator> (T const &lhs, synchronized_value< T, L > const &rhs)
template<typename T , typename L >
bool	operator>= (T const &lhs, synchronized_value< T, L > const &rhs)
template<typename OStream , typename T , typename L >
OStream &	operator<< (OStream &os, synchronized_value< T, L > const &rhs)
template<typename IStream , typename T , typename L >
IStream &	operator>> (IStream &is, synchronized_value< T, L > const &rhs)
template<typename... SV>
std::tuple< typename synchronized_value_strict_lock_ptr < SV >::type...>	synchronize (SV &...sv)
system_time	get_system_time ()
void	call_once (once_flag &flag, void(*f)())
template<typename Function >
void	call_once (once_flag &flag, BOOST_THREAD_RV_REF(Function) f)
template<typename Function , class A , class... ArgTypes>
void	call_once (once_flag &flag, BOOST_THREAD_RV_REF(Function) f, BOOST_THREAD_RV_REF(A) a, BOOST_THREAD_RV_REF(ArgTypes)...args)
template<class Lockable , class Function , class... Args>
boost::result_of< Function(Args...)> ::type	with_lock_guard (Lockable &m, BOOST_FWD_REF(Function) func, BOOST_FWD_REF(Args)...args)
	Utility to run functions in scope protected by mutex. More...
void	throw_exception_assert_compatibility (std::exception const &)
template<class E >
BOOST_NORETURN void	throw_exception (E const &e)
template<class Type , class Iterator , class TokenizerFunc >
token_iterator_generator < TokenizerFunc, Iterator, Type >::type	make_token_iterator (Iterator begin, Iterator end, const TokenizerFunc &fun)
template<class OptionalPointee >
bool	equal_pointees (OptionalPointee const &x, OptionalPointee const &y)
template<class OptionalPointee >
bool	less_pointees (OptionalPointee const &x, OptionalPointee const &y)
template<typename T >
add_rvalue_reference< T >::type	declval () BOOST_NOEXCEPT
template<typename charT , typename traits >
bool	operator== (basic_string_ref< charT, traits > x, basic_string_ref< charT, traits > y)
template<typename charT , typename traits , typename Allocator >
bool	operator== (basic_string_ref< charT, traits > x, const std::basic_string< charT, traits, Allocator > &y)
template<typename charT , typename traits , typename Allocator >
bool	operator== (const std::basic_string< charT, traits, Allocator > &x, basic_string_ref< charT, traits > y)
template<typename charT , typename traits >
bool	operator== (basic_string_ref< charT, traits > x, const charT *y)
template<typename charT , typename traits >
bool	operator== (const charT *x, basic_string_ref< charT, traits > y)
template<typename charT , typename traits >
bool	operator!= (basic_string_ref< charT, traits > x, basic_string_ref< charT, traits > y)
template<typename charT , typename traits , typename Allocator >
bool	operator!= (basic_string_ref< charT, traits > x, const std::basic_string< charT, traits, Allocator > &y)
template<typename charT , typename traits , typename Allocator >
bool	operator!= (const std::basic_string< charT, traits, Allocator > &x, basic_string_ref< charT, traits > y)
template<typename charT , typename traits >
bool	operator!= (basic_string_ref< charT, traits > x, const charT *y)
template<typename charT , typename traits >
bool	operator!= (const charT *x, basic_string_ref< charT, traits > y)
template<typename charT , typename traits >
bool	operator< (basic_string_ref< charT, traits > x, basic_string_ref< charT, traits > y)
template<typename charT , typename traits , typename Allocator >
bool	operator< (basic_string_ref< charT, traits > x, const std::basic_string< charT, traits, Allocator > &y)
template<typename charT , typename traits , typename Allocator >
bool	operator< (const std::basic_string< charT, traits, Allocator > &x, basic_string_ref< charT, traits > y)
template<typename charT , typename traits >
bool	operator< (basic_string_ref< charT, traits > x, const charT *y)
template<typename charT , typename traits >
bool	operator< (const charT *x, basic_string_ref< charT, traits > y)
template<typename charT , typename traits >
bool	operator> (basic_string_ref< charT, traits > x, basic_string_ref< charT, traits > y)
template<typename charT , typename traits , typename Allocator >
bool	operator> (basic_string_ref< charT, traits > x, const std::basic_string< charT, traits, Allocator > &y)
template<typename charT , typename traits , typename Allocator >
bool	operator> (const std::basic_string< charT, traits, Allocator > &x, basic_string_ref< charT, traits > y)
template<typename charT , typename traits >
bool	operator> (basic_string_ref< charT, traits > x, const charT *y)
template<typename charT , typename traits >
bool	operator> (const charT *x, basic_string_ref< charT, traits > y)
template<typename charT , typename traits >
bool	operator<= (basic_string_ref< charT, traits > x, basic_string_ref< charT, traits > y)
template<typename charT , typename traits , typename Allocator >
bool	operator<= (basic_string_ref< charT, traits > x, const std::basic_string< charT, traits, Allocator > &y)
template<typename charT , typename traits , typename Allocator >
bool	operator<= (const std::basic_string< charT, traits, Allocator > &x, basic_string_ref< charT, traits > y)
template<typename charT , typename traits >
bool	operator<= (basic_string_ref< charT, traits > x, const charT *y)
template<typename charT , typename traits >
bool	operator<= (const charT *x, basic_string_ref< charT, traits > y)
template<typename charT , typename traits >
bool	operator>= (basic_string_ref< charT, traits > x, basic_string_ref< charT, traits > y)
template<typename charT , typename traits , typename Allocator >
bool	operator>= (basic_string_ref< charT, traits > x, const std::basic_string< charT, traits, Allocator > &y)
template<typename charT , typename traits , typename Allocator >
bool	operator>= (const std::basic_string< charT, traits, Allocator > &x, basic_string_ref< charT, traits > y)
template<typename charT , typename traits >
bool	operator>= (basic_string_ref< charT, traits > x, const charT *y)
template<typename charT , typename traits >
bool	operator>= (const charT *x, basic_string_ref< charT, traits > y)
template<class charT , class traits >
std::basic_ostream< charT, traits > &	operator<< (std::basic_ostream< charT, traits > &os, const basic_string_ref< charT, traits > &str)
template<class T >
BOOST_GPU_ENABLED T const &	get (initialized< T > const &x)
template<class T >
BOOST_GPU_ENABLED T &	get (initialized< T > &x)
template<class T >
BOOST_GPU_ENABLED void	swap (initialized< T > &lhs, initialized< T > &rhs)
template<class T >
BOOST_GPU_ENABLED T const &	get (value_initialized< T > const &x)
template<class T >
BOOST_GPU_ENABLED T &	get (value_initialized< T > &x)
template<class T >
BOOST_GPU_ENABLED void	swap (value_initialized< T > &lhs, value_initialized< T > &rhs)
template<typename U , BOOST_VARIANT_ENUM_PARAMS(typename T) >
add_pointer< U >::type	get (boost::variant< BOOST_VARIANT_ENUM_PARAMS(T) > *operand) BOOST_NOEXCEPT
template<typename U , BOOST_VARIANT_ENUM_PARAMS(typename T) >
add_pointer< const U >::type	get (const boost::variant< BOOST_VARIANT_ENUM_PARAMS(T) > *operand) BOOST_NOEXCEPT
template<typename U , BOOST_VARIANT_ENUM_PARAMS(typename T) >
add_reference< U >::type	get (boost::variant< BOOST_VARIANT_ENUM_PARAMS(T) > &operand)
template<typename U , BOOST_VARIANT_ENUM_PARAMS(typename T) >
add_reference< const U >::type	get (const boost::variant< BOOST_VARIANT_ENUM_PARAMS(T) > &operand)
template<typename U , BOOST_VARIANT_ENUM_PARAMS(typename T) >
add_pointer< U >::type	polymorphic_get (boost::variant< BOOST_VARIANT_ENUM_PARAMS(T) > *operand) BOOST_NOEXCEPT
template<typename U , BOOST_VARIANT_ENUM_PARAMS(typename T) >
add_pointer< const U >::type	polymorphic_get (const boost::variant< BOOST_VARIANT_ENUM_PARAMS(T) > *operand) BOOST_NOEXCEPT
template<typename U , BOOST_VARIANT_ENUM_PARAMS(typename T) >
add_reference< U >::type	polymorphic_get (boost::variant< BOOST_VARIANT_ENUM_PARAMS(T) > &operand)
template<typename U , BOOST_VARIANT_ENUM_PARAMS(typename T) >
add_reference< const U >::type	polymorphic_get (const boost::variant< BOOST_VARIANT_ENUM_PARAMS(T) > &operand)
template<typename T >
void	swap (recursive_wrapper< T > &lhs, recursive_wrapper< T > &rhs) BOOST_NOEXCEPT
	BOOST_TT_AUX_BOOL_TRAIT_DEF1 (is_recursive_wrapper, T,(::boost::detail::is_recursive_wrapper_impl< T >::value)) template< typename T > struct unwrap_recursive
template<BOOST_VARIANT_ENUM_PARAMS(typename T) >
void	swap (variant< BOOST_VARIANT_ENUM_PARAMS(T) > &lhs, variant< BOOST_VARIANT_ENUM_PARAMS(T) > &rhs)
template<typename R , typename T >
visitor_ptr_t< T, R >	visitor_ptr (R(*visitor)(T))
template<typename Visitor , typename T >
void	visit_each (Visitor &visitor, const T &t, long)
template<typename Visitor , typename T >
void	visit_each (Visitor &visitor, const T &t)
Labeled Graph
template<typename G , typename L , typename S >
bool	label_vertex (typename labeled_graph< G, L, S >::vertex_descriptor v, typename labeled_graph< G, L, S >::label_type const l, labeled_graph< G, L, S > &g)
template<typename G , typename L , typename S >
labeled_graph< G, L, S > ::vertex_descriptor	vertex_by_label (typename labeled_graph< G, L, S >::label_type const l, labeled_graph< G, L, S > &g)
Graph
template<typename G , typename L , typename S >
std::pair< typename labeled_graph< G, L, S > ::edge_descriptor, bool >	edge (typename labeled_graph< G, L, S >::vertex_descriptor const &u, typename labeled_graph< G, L, S >::vertex_descriptor const &v, labeled_graph< G, L, S > const &g)
template<typename G , typename L , typename S >
std::pair< typename labeled_graph< G, L, S > ::edge_descriptor, bool >	edge_by_label (typename labeled_graph< G, L, S >::label_type const &u, typename labeled_graph< G, L, S >::label_type const &v, labeled_graph< G, L, S > const &g)
Incidence Graph
template<typename G , typename L , typename S >
std::pair< typename labeled_graph< G, L, S > ::out_edge_iterator, typename labeled_graph< G, L, S > ::out_edge_iterator >	out_edges (typename labeled_graph< G, L, S >::vertex_descriptor v, labeled_graph< G, L, S > const &g)
template<typename G , typename L , typename S >
labeled_graph< G, L, S > ::degree_size_type	out_degree (typename labeled_graph< G, L, S >::vertex_descriptor v, labeled_graph< G, L, S > const &g)
template<typename G , typename L , typename S >
labeled_graph< G, L, S > ::vertex_descriptor	source (typename labeled_graph< G, L, S >::edge_descriptor e, labeled_graph< G, L, S > const &g)
template<typename G , typename L , typename S >
labeled_graph< G, L, S > ::vertex_descriptor	target (typename labeled_graph< G, L, S >::edge_descriptor e, labeled_graph< G, L, S > const &g)
Bidirectional Graph
template<typename G , typename L , typename S >
std::pair< typename labeled_graph< G, L, S > ::in_edge_iterator, typename labeled_graph< G, L, S > ::in_edge_iterator >	in_edges (typename labeled_graph< G, L, S >::vertex_descriptor v, labeled_graph< G, L, S > const &g)
template<typename G , typename L , typename S >
labeled_graph< G, L, S > ::degree_size_type	in_degree (typename labeled_graph< G, L, S >::vertex_descriptor v, labeled_graph< G, L, S > const &g)
template<typename G , typename L , typename S >
labeled_graph< G, L, S > ::degree_size_type	degree (typename labeled_graph< G, L, S >::vertex_descriptor v, labeled_graph< G, L, S > const &g)
Adjacency Graph
template<typename G , typename L , typename S >
std::pair< typename labeled_graph< G, L, S > ::adjacency_iterator, typename labeled_graph< G, L, S > ::adjacency_iterator >	adjacenct_vertices (typename labeled_graph< G, L, S >::vertex_descriptor v, labeled_graph< G, L, S > const &g)
VertexListGraph
template<typename G , typename L , typename S >
std::pair< typename labeled_graph< G, L, S > ::vertex_iterator, typename labeled_graph< G, L, S > ::vertex_iterator >	vertices (labeled_graph< G, L, S > const &g)
template<typename G , typename L , typename S >
labeled_graph< G, L, S > ::vertices_size_type	num_vertices (labeled_graph< G, L, S > const &g)
EdgeListGraph
template<typename G , typename L , typename S >
std::pair< typename labeled_graph< G, L, S > ::edge_iterator, typename labeled_graph< G, L, S > ::edge_iterator >	edges (labeled_graph< G, L, S > const &g)
template<typename G , typename L , typename S >
labeled_graph< G, L, S > ::edges_size_type	num_edges (labeled_graph< G, L, S > const &g)
Property Graph
template<typename G , typename L , typename S , typename Prop >
property_map< labeled_graph< G, L, S >, Prop >::type	get (Prop p, labeled_graph< G, L, S > &g)
template<typename G , typename L , typename S , typename Prop >
property_map< labeled_graph< G, L, S >, Prop >::const_type	get (Prop p, labeled_graph< G, L, S > const &g)
template<typename G , typename L , typename S , typename Prop , typename Key >
property_traits< typename property_map< typename labeled_graph< G, L, S > ::graph_type, Prop > ::const_type >::value_type	get (Prop p, labeled_graph< G, L, S > const &g, const Key &k)
template<typename G , typename L , typename S , typename Prop , typename Key , typename Value >
void	put (Prop p, labeled_graph< G, L, S > &g, Key const &k, Value const &v)
Mutable Graph
template<typename G , typename L , typename S >
std::pair< typename labeled_graph< G, L, S > ::edge_descriptor, bool >	add_edge (typename labeled_graph< G, L, S >::vertex_descriptor const &u, typename labeled_graph< G, L, S >::vertex_descriptor const &v, labeled_graph< G, L, S > &g)
template<typename G , typename L , typename S >
std::pair< typename labeled_graph< G, L, S > ::edge_descriptor, bool >	add_edge (typename labeled_graph< G, L, S >::vertex_descriptor const &u, typename labeled_graph< G, L, S >::vertex_descriptor const &v, typename labeled_graph< G, L, S >::edge_property_type const &p, labeled_graph< G, L, S > &g)
template<typename G , typename L , typename S >
void	clear_vertex (typename labeled_graph< G, L, S >::vertex_descriptor v, labeled_graph< G, L, S > &g)
template<typename G , typename L , typename S >
void	remove_edge (typename labeled_graph< G, L, S >::edge_descriptor e, labeled_graph< G, L, S > &g)
template<typename G , typename L , typename S >
void	remove_edge (typename labeled_graph< G, L, S >::vertex_descriptor u, typename labeled_graph< G, L, S >::vertex_descriptor v, labeled_graph< G, L, S > &g)
template<typename G , typename L , typename S >
std::pair< typename labeled_graph< G, L, S > ::edge_descriptor, bool >	add_edge_by_label (typename labeled_graph< G, L, S >::label_type const &u, typename labeled_graph< G, L, S >::label_type const &v, labeled_graph< G, L, S > &g)
template<typename G , typename L , typename S >
std::pair< typename labeled_graph< G, L, S > ::edge_descriptor, bool >	add_edge_by_label (typename labeled_graph< G, L, S >::label_type const &u, typename labeled_graph< G, L, S >::label_type const &v, typename labeled_graph< G, L, S >::edge_property_type const &p, labeled_graph< G, L, S > &g)
template<typename G , typename L , typename S >
void	clear_vertex_by_label (typename labeled_graph< G, L, S >::label_type const &l, labeled_graph< G, L, S > &g)
template<typename G , typename L , typename S >
void	remove_edge_by_label (typename labeled_graph< G, L, S >::label_type const &u, typename labeled_graph< G, L, S >::label_type const &v, labeled_graph< G, L, S > &g)
Labeled Mutable Graph
The labeled mutable graph hides the add_ and remove_ vertex functions from the mutable graph concept. Note that the remove_vertex is hidden because removing the vertex without its key could leave a dangling reference in the map.
template<typename G , typename L , typename S >
labeled_graph< G, L, S > ::vertex_descriptor	add_vertex (typename labeled_graph< G, L, S >::label_type const &l, labeled_graph< G, L, S > &g)
template<typename G , typename L , typename S >
labeled_graph< G, L, S > ::vertex_descriptor	add_vertex (typename labeled_graph< G, L, S >::label_type const &l, typename labeled_graph< G, L, S >::vertex_property_type const &p, labeled_graph< G, L, S > &g)
template<typename G , typename L , typename S >
void	remove_vertex (typename labeled_graph< G, L, S >::label_type const &l, labeled_graph< G, L, S > &g)
Property Lookup
The local_property and global_property functions are used to create structures that determine the lookup strategy for properties in subgraphs. Note that the nested kind member is used to help interoperate with actual Property types.
template<typename T >
local_property< T >	local (T x)
template<typename T >
global_property< T >	global (T x)

Variables
GraphTR G_to_TR_VertexMap VertexIndexMap g_index_map typedef graph_traits< Graph > ::vertex_descriptor	Vertex
BOOST_LOG_OPEN_NAMESPACE typedef boost::log::aux::process::id	process_id
	Process identifier type used by the library. More...
BOOST_LOG_OPEN_NAMESPACE typedef boost::log::aux::thread::id	thread_id
	Thread identifier type. More...
BOOST_LOG_OPEN_NAMESPACE typedef error_info< struct attribute_name_info_tag, attribute_name >	attribute_name_info
	Attribute name exception information. More...
BOOST_LOG_OPEN_NAMESPACE typedef boost::null_deleter	empty_deleter
	A deprecated name for null_deleter. More...
BOOST_LOG_OPEN_NAMESPACE typedef mpl::vector < std::time_t, std::tm >	native_date_time_types
	An MPL-sequence of natively supported date and time types of attributes. More...
BOOST_LOG_OPEN_NAMESPACE typedef mpl::vector< bool, char, wchar_t, signed char, unsigned char, short, unsigned short, int, unsigned int, long, unsigned long >	integral_types
	An MPL-sequence of integral types of attributes, supported by default. More...
	E
T &	out
const int	exit_success = EXIT_SUCCESS
const int	exit_failure = EXIT_FAILURE
const int	exit_exception_failure = 200
const int	exit_test_failure = 201
BOOST_FUNCTION_NUM_ARGS	self_type
Allocator Allocator	a
template<typename T >
boost::hash_detail::basic_numbers < T >::type	hash_value (T)
GraphTR &	tr
GraphTR G_to_TR_VertexMap	g_to_tr_map
std::vector< Vertex >	topo_order
iterator_property_map < size_type *, VertexIndexMap, size_type, size_type & > topo_number &[0]	topo_number_storage
size_type	n = 0
std::vector< Vertex >::iterator	it = topo_order.begin()
std::vector< Vertex >::iterator	end = topo_order.end()
Order	iG_map
Order const Graph &	vG
Order const Graph Order	vG_map
Order const Graph Order Func	func
Order const Graph Order Func Seq	inL
bimap_type	iG_bimap
bimap_type	vG_bimap
edge_iterator	current
edge_iterator	last
std::stack< edge_descriptor >	iG_buf
std::stack< edge_descriptor >	vG_buf
std::map< vertex_descriptor, edge_descriptor >	tree_map
std::map< vertex_descriptor, vertex_descriptor >	pred_map
std::map< vertex_descriptor, int >	dist_map
std::map< vertex_descriptor, int >	low_map
detail::bridges_visitor < associative_property_map < std::map< vertex_descriptor, edge_descriptor > >, associative_property_map < std::map< vertex_descriptor, vertex_descriptor > >, associative_property_map < std::map< vertex_descriptor, int > >, associative_property_map < std::map< vertex_descriptor, int > >, std::stack < edge_descriptor > >	iG_vis (associative_property_map< std::map< vertex_descriptor, edge_descriptor > >(tree_map), associative_property_map< std::map< vertex_descriptor, vertex_descriptor > >(pred_map), associative_property_map< std::map< vertex_descriptor, int > >(dist_map), associative_property_map< std::map< vertex_descriptor, int > >(low_map), iG_buf)
detail::bridges_visitor < associative_property_map < std::map< vertex_descriptor, edge_descriptor > >, associative_property_map < std::map< vertex_descriptor, vertex_descriptor > >, associative_property_map < std::map< vertex_descriptor, int > >, associative_property_map < std::map< vertex_descriptor, int > >, std::stack < edge_descriptor > >	vG_vis (associative_property_map< std::map< vertex_descriptor, edge_descriptor > >(tree_map), associative_property_map< std::map< vertex_descriptor, vertex_descriptor > >(pred_map), associative_property_map< std::map< vertex_descriptor, int > >(dist_map), associative_property_map< std::map< vertex_descriptor, int > >(low_map), vG_buf)
std::map< edge_descriptor, bool >	iG_inL
std::map< edge_descriptor, bool >	vG_inL
associative_property_map < std::map< edge_descriptor, bool > >	aiG_inL (iG_inL)
associative_property_map < std::map< edge_descriptor, bool > >	avG_inL (vG_inL)
std::vector< edge_descriptor >	iGO
std::vector< edge_descriptor >	vGO
edge_iterator	curr
class BOOST_SYMBOL_VISIBLE	exception
none_t const	none = (static_cast<none_t>(0))
class BOOST_REGEX_DECL	scoped_static_mutex_lock
BOOST_SIGNALS_NAMESPACE::connection BOOST_SIGNALS_TEMPLATE_ARGS	Combiner
BOOST_SIGNALS_NAMESPACE::connection BOOST_SIGNALS_TEMPLATE_ARGS	Group
BOOST_SIGNALS_NAMESPACE::connection BOOST_SIGNALS_TEMPLATE_ARGS	GroupCompare
BOOST_CONSTEXPR_OR_CONST no_block_tag	no_block = {}
BOOST_CONSTEXPR_OR_CONST defer_lock_t	defer_lock = {}
BOOST_CONSTEXPR_OR_CONST try_to_lock_t	try_to_lock = {}
BOOST_CONSTEXPR_OR_CONST adopt_lock_t	adopt_lock = {}
shared_lock< Mutex > &rhs BOOST_NOEXCEPT lhs	swap (rhs)
initialized_value_t const	initialized_value = {}

Detailed Description

Duration formatting facet for input.

Copyright (c) 2011 Brandon Kohn.

BOOST_MOVE_USE_STANDARD_LIBRARY_MOVE.

defined(BOOST_MOVE_DOXYGEN_INVOKED)

defined(BOOST_MOVE_MSVC_AUTO_MOVE_RETURN_BUG) || defined(BOOST_MOVE_DOXYGEN_INVOKED)

This is an implementation of the maximum adjacency search on an undirected graph.

Copyright (c) 2010 Matthias Walter (xammy.nosp@m.@xam.nosp@m.my.ho.nosp@m.meli.nosp@m.nux.n.nosp@m.et)

Pixel 2D LOCATOR.

Boost namespace.

Duration formatting facet for output.

Author

Hailin Jin and Lubomir Bourdev
Adobe Systems Incorporated

Date

2005-2007
Last updated May 30, 2006

Author

Hailin Jin and Lubomir Bourdev
Adobe Systems Incorporated

Date

2005-2007
Last updated September 24, 2006

Authors: Matthias Walter

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)

It allows a visitor object to perform some operation on each vertex as that vertex is visited.

The algorithm runs as follows:

Initialize all nodes to be unvisited (reach count = 0) and call vis.initialize_vertex For i = number of nodes in graph downto 1 Select the unvisited node with the highest reach count The user provides the starting node to break the first tie, but future ties are broken arbitrarily Visit the node by calling vis.start_vertex Increment the reach count for all unvisited neighbors and call vis.examine_edge for each of these edges Mark the node as visited and call vis.finish_vertex

Typedef Documentation

typedef ratio<BOOST_RATIO_INTMAX_C(1), BOOST_RATIO_INTMAX_C(1000000000000000000)> boost::atto

typedef regex_error boost::bad_expression

typedef regex_error boost::bad_pattern

typedef bimaps::bimap< bimaps::set_of< int >, bimaps::set_of< order_value_type > > boost::bimap_type

typedef bimap_type::value_type boost::bimap_value

typedef std::bitset<512> boost::bitmask_archetype

typedef mpl::vector< posix_time::ptime, local_time::local_date_time> boost::boost_date_time_types

An MPL-sequence of Boost date and time types of attributes.

typedef mpl::push_back< boost_date_time_types, gregorian::date>::type boost::boost_date_types

An MPL-sequence of Boost date types of attributes.

typedef mpl::vector< posix_time::time_duration, gregorian::date_duration> boost::boost_time_duration_types

An MPL-sequence of Boost time duration types of attributes.

typedef mpl::vector< posix_time::time_period, local_time::local_time_period, gregorian::date_period> boost::boost_time_period_types

An MPL-sequence of Boost time duration types of attributes.

typedef boost_date_time_types boost::boost_time_types

An MPL-sequence of Boost time types.

typedef ratio<BOOST_RATIO_INTMAX_C(1), BOOST_RATIO_INTMAX_C(100)> boost::centi

typedef shared_ptr< core > boost::core_ptr

typedef crc_optimal<16, 0x8005, 0, 0, true, true> boost::crc_16_type

typedef crc_optimal<32, 0x04C11DB7, 0xFFFFFFFF, 0xFFFFFFFF, true, true> boost::crc_32_type

typedef crc_optimal<16, 0x1021, 0xFFFF, 0, false, false> boost::crc_ccitt_type

typedef crc_optimal<16, 0x8408, 0, 0, true, true> boost::crc_xmodem_type

typedef regex_iterator<const char*> boost::cregex_iterator

typedef regex_token_iterator<const char*> boost::cregex_token_iterator

typedef sub_match<const char*> boost::csub_match

typedef error_info< struct current_scope_info_tag, attributes::named_scope_list > boost::current_scope_info

Current scope exception information.

typedef mpl::copy< boost_date_time_types, mpl::back_inserter< native_date_time_types >>::type boost::date_time_types

An MPL-sequence with the complete list of the supported date and time types.

typedef mpl::copy< boost_date_types, mpl::back_inserter< native_date_types >>::type boost::date_types

An MPL-sequence with the complete list of the supported date types.

typedef ratio< BOOST_RATIO_INTMAX_C(10), BOOST_RATIO_INTMAX_C(1)> boost::deca

typedef ratio<BOOST_RATIO_INTMAX_C(1), BOOST_RATIO_INTMAX_C(10)> boost::deci

typedef astar_visitor boost::default_astar_visitor

typedef mpl::copy< string_types, mpl::back_inserter< numeric_types >>::type boost::default_attribute_types

An MPL-sequence of all attribute value types that are supported by the library by default.

typedef bellman_visitor boost::default_bellman_visitor

typedef bfs_visitor boost::default_bfs_visitor

typedef core_numbers_visitor boost::default_core_numbers_visitor

typedef dfs_visitor boost::default_dfs_visitor

typedef dijkstra_visitor boost::default_dijkstra_visitor

typedef mas_visitor boost::default_mas_visitor

typedef std::allocator<int> boost::default_r_c_shortest_paths_allocator

typedef GraphTraits::directed_category boost::directed_category

typedef GraphTraits::edge_descriptor boost::edge_descriptor

typedef GraphTraits::edge_iterator boost::edge_iterator

typedef GraphTraits::edges_size_type boost::edges_size_type

typedef error_info<struct errinfo_api_function_,char const *> boost::errinfo_api_function

typedef error_info<struct errinfo_at_line_,int> boost::errinfo_at_line

typedef error_info<struct errinfo_errno_,int> boost::errinfo_errno

typedef error_info<struct errinfo_file_handle_,weak_ptr<FILE> > boost::errinfo_file_handle

typedef error_info<struct errinfo_file_name_,std::string> boost::errinfo_file_name

typedef error_info<struct errinfo_file_open_mode_,std::string> boost::errinfo_file_open_mode

typedef error_info<struct errinfo_nested_exception_,exception_ptr> boost::errinfo_nested_exception

typedef error_info<struct errinfo_type_info_name_,std::string> boost::errinfo_type_info_name

typedef ratio<BOOST_RATIO_INTMAX_C(1000000000000000000), BOOST_RATIO_INTMAX_C(1)> boost::exa

typedef integral_constant<bool,false> boost::false_type

typedef ratio<BOOST_RATIO_INTMAX_C(1), BOOST_RATIO_INTMAX_C(1000000000000000)> boost::femto

typedef mpl::vector< float, double, long double> boost::floating_point_types

An MPL-sequence of FP types of attributes, supported by default.

typedef basic_format<char > boost::format

typedef ratio< BOOST_RATIO_INTMAX_C(1000000000), BOOST_RATIO_INTMAX_C(1)> boost::giga

typedef ratio< BOOST_RATIO_INTMAX_C(100), BOOST_RATIO_INTMAX_C(1)> boost::hecto

typedef typed_identity_property_map<std::size_t> boost::identity_property_map

typedef boost::intrusive_ref_counter< aux::legacy_intrusive_ref_counter_root > boost::intrusive_ref_counter

typedef ratio< BOOST_RATIO_INTMAX_C(1000), BOOST_RATIO_INTMAX_C(1)> boost::kilo

typedef ratio< BOOST_RATIO_INTMAX_C(1000000), BOOST_RATIO_INTMAX_C(1)> boost::mega

typedef ratio<BOOST_RATIO_INTMAX_C(1), BOOST_RATIO_INTMAX_C(1000000)> boost::micro

typedef ratio<BOOST_RATIO_INTMAX_C(1), BOOST_RATIO_INTMAX_C(1000)> boost::milli

typedef boost::forward_traversal_tag boost::multi_pass_input_iterator_tag

typedef ratio<BOOST_RATIO_INTMAX_C(1), BOOST_RATIO_INTMAX_C(1000000000)> boost::nano

typedef native_date_time_types boost::native_date_types

An MPL-sequence of natively supported date types of attributes.

typedef mpl::vector< double > boost::native_time_duration_types

An MPL-sequence of natively supported time duration types of attributes.

typedef native_date_time_types boost::native_time_types

An MPL-sequence of natively supported time types.

typedef bgl_named_params<char, detail::unused_tag_type> boost::no_named_parameters

typedef noncopyable_::noncopyable boost::noncopyable

typedef int detail::none_helper::* boost::none_t

typedef basic_nullbuf<char> boost::nullbuf

typedef mpl::copy< floating_point_types, mpl::back_inserter< integral_types >>::type boost::numeric_types

An MPL-sequence of all numeric types of attributes, supported by default.

typedef basic_onullstream<char> boost::onullstream

typedef Order::size_type boost::order_size_type

typedef Order::value_type boost::order_value_type

typedef ratio< BOOST_RATIO_INTMAX_C(1000000000000000), BOOST_RATIO_INTMAX_C(1)> boost::peta

typedef ratio<BOOST_RATIO_INTMAX_C(1), BOOST_RATIO_INTMAX_C(1000000000000)> boost::pico

typedef error_info< struct position_info_tag, unsigned int > boost::position_info

Parse position exception information.

typedef short boost::processor_id_type

The type used to store an identifier that uniquely names a processor.

typedef mpl::if_c<(sizeof(int) == sizeof(void*)), int, mpl::if_c<(sizeof(long) == sizeof(void*)), long, mpl::if_c<(sizeof(void*) <= sizeof(boost::intmax_t)), boost::intmax_t, void>::type >::type >::type boost::ptr_serialize_type

typedef recursive_mutex boost::recursive_try_mutex

typedef basic_regex<char, regex_traits<char> > boost::regex

typedef void(dummy::* boost::safe_bool)()

typedef aux::attribute_scope_guard const& boost::scoped_attribute

Scoped attribute guard type.

typedef Seq::size_type boost::seq_size_type

typedef Seq::value_type boost::seq_value_type

typedef const Graph* boost::sgb_const_graph_ptr

typedef Graph* boost::sgb_graph_ptr

typedef thread_v2::upgrade_mutex boost::shared_mutex

typedef std::vector<Vertex>::size_type boost::size_type

typedef regex_iterator<std::string::const_iterator> boost::sregex_iterator

typedef regex_token_iterator<std::string::const_iterator> boost::sregex_token_iterator

typedef sub_match<std::string::const_iterator> boost::ssub_match

typedef boost::uintmax_t boost::static_log2_argument_type

typedef int boost::static_log2_result_type

typedef boost::intmax_t boost::static_min_max_signed_type

typedef boost::uintmax_t boost::static_min_max_unsigned_type

typedef basic_string_ref<char, std::char_traits<char> > boost::string_ref

typedef mpl::vector<> boost::string_types

An MPL-sequence of string types of attributes, supported by default.

typedef boost::posix_time::ptime boost::system_time

typedef ratio< BOOST_RATIO_INTMAX_C(1000000000000), BOOST_RATIO_INTMAX_C(1)> boost::tera

typedef error_info<struct throw_file_,char const *> boost::throw_file

typedef error_info<struct throw_function_,char const *> boost::throw_function

typedef error_info<struct throw_line_,int> boost::throw_line

typedef mpl::copy< boost_time_duration_types, mpl::back_inserter< native_time_duration_types >>::type boost::time_duration_types

An MPL-sequence with the complete list of the supported time duration types.

typedef boost_time_period_types boost::time_period_types

An MPL-sequence with the complete list of the supported time period types.

typedef date_time_types boost::time_types

An MPL-sequence with the complete list of the supported time types.

typedef match_results<TCHAR const*> boost::tmatch

typedef basic_regex<TCHAR> boost::tregex

typedef regex_iterator<TCHAR const*> boost::tregex_iterator

typedef regex_token_iterator<TCHAR const*> boost::tregex_token_iterator

typedef integral_constant<bool,true> boost::true_type

typedef mutex boost::try_mutex

typedef error_info< struct type_info_info_tag, type_info_wrapper > boost::type_info_info

Type info exception information.

typedef match_results<const ::UChar*> boost::u16match

typedef basic_string_ref<char16_t, std::char_traits<char16_t> > boost::u16string_ref

typedef match_results<const ::UChar32*> boost::u32match

typedef basic_regex< ::UChar32, icu_regex_traits> boost::u32regex

typedef basic_string_ref<char32_t, std::char_traits<char32_t> > boost::u32string_ref

typedef shared_mutex boost::upgrade_mutex

typedef u32regex_iterator<const UChar*> boost::utf16regex_iterator

typedef u32regex_token_iterator<const UChar*> boost::utf16regex_token_iterator

typedef u32regex_iterator<const UChar32*> boost::utf32regex_iterator

typedef u32regex_token_iterator<const UChar32*> boost::utf32regex_token_iterator

typedef u32regex_iterator<const char*> boost::utf8regex_iterator

typedef u32regex_token_iterator<const char*> boost::utf8regex_token_iterator

typedef GraphTraits::vertex_descriptor boost::vertex_descriptor

typedef graph_traits<Graph>::vertex_iterator boost::VertexIterator

typedef T boost::vtable_type

typedef regex_iterator<const wchar_t*> boost::wcregex_iterator

typedef regex_token_iterator<const wchar_t*> boost::wcregex_token_iterator

typedef sub_match<const wchar_t*> boost::wcsub_match

typedef basic_format<wchar_t > boost::wformat

typedef basic_nullbuf<wchar_t> boost::wnullbuf

typedef basic_onullstream<wchar_t> boost::wonullstream

typedef basic_wrap_stringstream<char> boost::wrap_stringstream

typedef basic_wrap_stringstream<wchar_t> boost::wrap_wstringstream

typedef basic_regex<wchar_t, regex_traits<wchar_t> > boost::wregex

typedef regex_iterator<std::wstring::const_iterator> boost::wsregex_iterator

typedef regex_token_iterator<std::wstring::const_iterator> boost::wsregex_token_iterator

typedef sub_match<std::wstring::const_iterator> boost::wssub_match

typedef basic_string_ref<wchar_t, std::char_traits<wchar_t> > boost::wstring_ref

Enumeration Type Documentation

enum boost::construct_inplace_from_sources_and_targets_global_t

Enumerator
construct_inplace_from_sources_and_targets_global

enum boost::construct_inplace_from_sources_and_targets_t

Enumerator
construct_inplace_from_sources_and_targets

enum boost::default_color_type

Enumerator
white_color
gray_color
green_color
red_color
black_color

enum boost::distributed_construct_inplace_from_sources_and_targets_t

Enumerator
distributed_construct_inplace_from_sources_and_targets

enum boost::edge_all_t

Enumerator
edge_all

enum boost::edge_attribute_t

Enumerator
edge_attribute

enum boost::edge_bundle_t

Enumerator
edge_bundle

enum boost::edge_capacity_t

Enumerator
edge_capacity

enum boost::edge_centrality_t

Enumerator
edge_centrality

enum boost::edge_color_t

Enumerator
edge_color

enum boost::edge_discover_time_t

Enumerator
edge_discover_time

enum boost::edge_finished_t

Enumerator
edge_finished

enum boost::edge_flow_t

Enumerator
edge_flow

enum boost::edge_global_t

Enumerator
edge_global

enum boost::edge_index_t

Enumerator
edge_index

enum boost::edge_local_index_t

Enumerator
edge_local_index

enum boost::edge_local_t

Enumerator
edge_local

enum boost::edge_locally_owned_t

Enumerator
edge_locally_owned

enum boost::edge_name_t

Enumerator
edge_name

enum boost::edge_owner_t

Enumerator
edge_owner

enum boost::edge_residual_capacity_t

Enumerator
edge_residual_capacity

enum boost::edge_reverse_t

Enumerator
edge_reverse

enum boost::edge_target_processor_id_t

Enumerator
edge_target_processor_id

enum boost::edge_underlying_t

Enumerator
edge_underlying

enum boost::edge_update_t

Enumerator
edge_update

enum boost::edge_weight2_t

Enumerator
edge_weight2

enum boost::edge_weight_t

Enumerator
edge_weight

enum boost::edges_are_sorted_global_t

Enumerator
edges_are_sorted_global

enum boost::edges_are_sorted_t

Enumerator
edges_are_sorted

enum boost::edges_are_unsorted_global_t

Enumerator
edges_are_unsorted_global

enum boost::edges_are_unsorted_multi_pass_global_t

Enumerator
edges_are_unsorted_multi_pass_global

enum boost::edges_are_unsorted_multi_pass_t

Enumerator
edges_are_unsorted_multi_pass

enum boost::edges_are_unsorted_t

Enumerator
edges_are_unsorted

enum boost::empty_token_policy

Enumerator
drop_empty_tokens
keep_empty_tokens

enum boost::factory_alloc_propagation

Enumerator
factory_alloc_for_pointee_and_deleter
factory_passes_alloc_to_smart_pointer

enum boost::graph_all_t

Enumerator
graph_all

enum boost::graph_bundle_t

Enumerator
graph_bundle

enum boost::graph_edge_attribute_t

Enumerator
graph_edge_attribute

enum boost::graph_graph_attribute_t

Enumerator
graph_graph_attribute

enum boost::graph_name_t

Enumerator
graph_name

enum boost::graph_vertex_attribute_t

Enumerator
graph_vertex_attribute

enum boost::graph_visitor_t

Enumerator
graph_visitor

enum boost::GraphParserState

Enumerator
PARSE_NUM_NODES
PARSE_VERTEX
PARSE_EDGE

enum boost::lock_access_mode

Access modes for different types of locks.

Enumerator
unlocked_access	A thread that owns this kind of lock doesn't restrict other threads in any way.
shared_access	A thread that owns this kind of lock requires that no other thread modify the locked data.
exclusive_access	A thread that owns this kind of lock requires that no other thread has access to the locked data.

enum boost::memory_order

Enumerator
memory_order_relaxed
memory_order_consume
memory_order_acquire
memory_order_release
memory_order_acq_rel
memory_order_seq_cst

enum boost::one_bit_color_type

Enumerator
one_bit_white
one_bit_not_white

enum boost::two_bit_color_type

Enumerator
two_bit_white
two_bit_gray
two_bit_green
two_bit_black

enum boost::vertex_all_t

Enumerator
vertex_all

enum boost::vertex_attribute_t

Enumerator
vertex_attribute

enum boost::vertex_bundle_t

Enumerator
vertex_bundle

enum boost::vertex_centrality_t

Enumerator
vertex_centrality

enum boost::vertex_color_t

Enumerator
vertex_color

enum boost::vertex_current_degree_t

Enumerator
vertex_current_degree

enum boost::vertex_degree_t

Enumerator
vertex_degree

enum boost::vertex_discover_time_t

Enumerator
vertex_discover_time

enum boost::vertex_distance2_t

Enumerator
vertex_distance2

enum boost::vertex_distance_t

Enumerator
vertex_distance

enum boost::vertex_finish_time_t

Enumerator
vertex_finish_time

enum boost::vertex_global_t

Enumerator
vertex_global

enum boost::vertex_in_degree_t

Enumerator
vertex_in_degree

enum boost::vertex_in_edges_t

Enumerator
vertex_in_edges

enum boost::vertex_index1_t

Enumerator
vertex_index1

enum boost::vertex_index2_t

Enumerator
vertex_index2

enum boost::vertex_index_t

Enumerator
vertex_index

enum boost::vertex_local_index_t

Enumerator
vertex_local_index

enum boost::vertex_local_t

Enumerator
vertex_local

enum boost::vertex_lowpoint_t

Enumerator
vertex_lowpoint

enum boost::vertex_name_t

Enumerator
vertex_name

enum boost::vertex_out_degree_t

Enumerator
vertex_out_degree

enum boost::vertex_owner_t

Enumerator
vertex_owner

enum boost::vertex_potential_t

Enumerator
vertex_potential

enum boost::vertex_predecessor_t

Enumerator
vertex_predecessor

enum boost::vertex_priority_t

Enumerator
vertex_priority

enum boost::vertex_rank_t

Enumerator
vertex_rank

enum boost::vertex_root_t

Enumerator
vertex_root

enum boost::vertex_underlying_t

Enumerator
vertex_underlying

enum boost::vertex_update_t

Enumerator
vertex_update

Function Documentation

template<typename IntType >

rational< IntType > boost::abs ( const rational< IntType > &  r )

inline

Referenced by bandwidth(), boost::units::BOOST_PREVENT_MACRO_SUBSTITUTION(), boost::multiprecision::backends::detail::checked_multiply(), boost::hypercube_topology< 3, RandomNumberGenerator >::distance_from_boundary(), boost::rectangle_topology< RandomNumberGenerator >::distance_from_boundary(), edgesum(), boost::multiprecision::backends::eval_frexp(), boost::polygon::handleResizingVertex45(), and ith_bandwidth().

template<class SinglePassRange , class Value >

Value boost::accumulate ( const SinglePassRange &  rng, Value  init  )

inline

References accumulate(), boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and end.

template<class SinglePassRange , class Value , class BinaryOperation >

Value boost::accumulate ( const SinglePassRange &  rng, Value  init, BinaryOperation  op  )

inline

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and end.

Referenced by accumulate(), and boost::lambda::ll::accumulate::operator()().

BOOST_LOG_OPEN_NAMESPACE void boost::add_common_attributes ( )

inline

Simple attribute initialization routine.

The function adds commonly used attributes to the logging system. Specifically, the following attributes are registered globally:

• LineID - logging records counter with value type unsigned int
• TimeStamp - local time generator with value type boost::posix_time::ptime
• ProcessID - current process identifier with value type attributes::current_process_id::value_type
• ThreadID - in multithreaded builds, current thread identifier with value type attributes::current_thread_id::value_type

References boost::core::get(), process_id, and thread_id.

template<typename CharT >

shared_ptr< sinks::synchronous_sink < sinks::basic_text_ostream_backend< CharT > >> boost::add_console_log ( )

inline

References boost::aux::add_console_log().

template<typename CharT >

shared_ptr< sinks::synchronous_sink < sinks::basic_text_ostream_backend< CharT > >> boost::add_console_log ( std::basic_ostream< CharT > &  strm )

inline

References boost::aux::add_console_log().

template<typename CharT , typename ArgT1 >

shared_ptr< sinks::synchronous_sink < sinks::basic_text_ostream_backend< CharT > >> boost::add_console_log ( std::basic_ostream< CharT > &  strm, ArgT1 const &  arg1  )

inline

References boost::aux::add_console_log().

template<typename CharT , typename ArgT1 , typename ArgT2 >

shared_ptr< sinks::synchronous_sink < sinks::basic_text_ostream_backend< CharT > >> boost::add_console_log ( std::basic_ostream< CharT > &  strm, ArgT1 const &  arg1, ArgT2 const &  arg2  )

inline

References boost::aux::add_console_log().

template<typename CharT , typename ArgT1 , typename ArgT2 , typename ArgT3 >

shared_ptr< sinks::synchronous_sink < sinks::basic_text_ostream_backend< CharT > >> boost::add_console_log ( std::basic_ostream< CharT > &  strm, ArgT1 const &  arg1, ArgT2 const &  arg2, ArgT3 const &  arg3  )

inline

References boost::aux::add_console_log().

template<class EdgeList , class Allocator >

std::pair<typename detail::val_edge<EdgeList>::type, bool> boost::add_edge	(	typename EdgeList::value_type	u,
		typename EdgeList::value_type	v,
		std::vector< EdgeList, Allocator > &	g
	)

References end, and boost::xpressive::make_pair.

template<typename VP , typename EP , typename GP >

std::pair<typename undirected_graph<VP,EP,GP>::edge_descriptor, bool> boost::add_edge ( typename undirected_graph< VP, EP, GP >::vertex_descriptor  u, typename undirected_graph< VP, EP, GP >::vertex_descriptor  v, undirected_graph< VP, EP, GP > &  g  )

inline

template<typename VP , typename EP , typename GP >

std::pair<typename directed_graph<VP,EP,GP>::edge_descriptor, bool> boost::add_edge ( typename directed_graph< VP, EP, GP >::vertex_descriptor  u, typename directed_graph< VP, EP, GP >::vertex_descriptor  v, directed_graph< VP, EP, GP > &  g  )

inline

template<typename VP , typename EP , typename GP >

std::pair<typename undirected_graph<VP,EP,GP>::edge_descriptor, bool> boost::add_edge ( typename undirected_graph< VP, EP, GP >::vertex_descriptor  u, typename undirected_graph< VP, EP, GP >::vertex_descriptor  v, typename undirected_graph< VP, EP, GP >::edge_property_type const &  p, undirected_graph< VP, EP, GP > &  g  )

inline

template<typename VP , typename EP , typename GP >

std::pair<typename directed_graph<VP,EP,GP>::edge_descriptor, bool> boost::add_edge ( typename directed_graph< VP, EP, GP >::vertex_descriptor  u, typename directed_graph< VP, EP, GP >::vertex_descriptor  v, typename directed_graph< VP, EP, GP >::edge_property_type const &  p, directed_graph< VP, EP, GP > &  g  )

inline

template<class vtype , class etype >

std::pair< typename graph_traits< leda::GRAPH<vtype,etype> >::edge_descriptor, bool> boost::add_edge	(	typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor	u,
		typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor	v,
		leda::GRAPH< vtype, etype > &	g
	)

References boost::xpressive::make_pair.

template<class vtype , class etype >

std::pair< typename graph_traits< leda::GRAPH<vtype,etype> >::edge_descriptor, bool> boost::add_edge	(	typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor	u,
		typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor	v,
		const etype &	et,
		leda::GRAPH< vtype, etype > &	g
	)

References boost::xpressive::make_pair.

template<typename G >

std::pair<typename subgraph<G>::edge_descriptor, bool> boost::add_edge	(	typename subgraph< G >::vertex_descriptor	u,
		typename subgraph< G >::vertex_descriptor	v,
		const typename G::edge_property_type &	ep,
		subgraph< G > &	g
	)

References boost::detail::add_edge_recur_up(), boost::subgraph< Graph >::is_root(), boost::subgraph< Graph >::local_to_global(), and boost::xpressive::make_pair.

template<typename G >

std::pair<typename subgraph<G>::edge_descriptor, bool> boost::add_edge	(	typename subgraph< G >::vertex_descriptor	u,
		typename subgraph< G >::vertex_descriptor	v,
		subgraph< G > &	g
	)

References add_edge().

std::pair< graph_traits<leda::graph>::edge_descriptor, bool> boost::add_edge	(	graph_traits< leda::graph >::vertex_descriptor	u,
		graph_traits< leda::graph >::vertex_descriptor	v,
		leda::graph &	g
	)

References boost::xpressive::make_pair.

template<typename G , typename L , typename S >

std::pair<typename labeled_graph<G,L,S>::edge_descriptor, bool> boost::add_edge ( typename labeled_graph< G, L, S >::vertex_descriptor const &  u, typename labeled_graph< G, L, S >::vertex_descriptor const &  v, labeled_graph< G, L, S > &  g  )

inline

References add_edge().

template<typename G , typename L , typename S >

std::pair<typename labeled_graph<G,L,S>::edge_descriptor, bool> boost::add_edge ( typename labeled_graph< G, L, S >::vertex_descriptor const &  u, typename labeled_graph< G, L, S >::vertex_descriptor const &  v, typename labeled_graph< G, L, S >::edge_property_type const &  p, labeled_graph< G, L, S > &  g  )

inline

References add_edge().

template<typename D , typename VP , typename EP , typename GP , typename A , typename EP2 >

std::pair<typename adjacency_matrix<D,VP,EP,GP,A>::edge_descriptor, bool> boost::add_edge	(	typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor	u,
		typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor	v,
		const EP2 &	ep,
		adjacency_matrix< D, VP, EP, GP, A > &	g
	)

References boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator >::get_edge(), boost::detail::get_edge_exists(), boost::detail::get_edge_property(), boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator >::m_num_edges, boost::xpressive::make_pair, boost::detail::set_edge_exists(), and boost::detail::set_edge_property().

Referenced by boost::directed_graph< VertexProp, EdgeProp, GraphProp >::add_edge(), boost::undirected_graph< VertexProp, EdgeProp, GraphProp >::add_edge(), add_edge(), add_edge_by_label(), boost::detail::add_edge_recur_up(), boost::detail::parallel::add_local_edge(), boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator >::adjacency_matrix(), boost::detail::copy_graph_impl< 0 >::apply(), boost::detail::copy_graph_impl< 1 >::apply(), boost::detail::copy_graph_impl< 2 >::apply(), boost::concepts::BOOST_concept(), create_condensation_graph(), boost::mutate_graph_impl< MutableGraph >::do_add_edge(), boost::detail::graph::mutate_graph_impl< MutableGraph >::do_add_edge(), edge_connectivity(), boost::detail::mmd_impl< Graph, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, VertexIndexMap >::eliminate(), generate_random_graph(), generate_random_graph1(), is_kuratowski_subgraph(), johnson_all_pairs_shortest_paths(), boost::serialization::load(), boost::subgraph< Graph >::local_add_edge(), boost::detail::make_K_3_3(), boost::detail::make_K_5(), metric_tsp_approx_from_vertex(), boost::detail::graph_copy_visitor< NewGraph, Copy2OrigIndexMap, CopyVertex, CopyEdge >::non_tree_edge(), boost::assign_detail::call_add_edge< C >::operator()(), boost::GraphParser< Graph_t, VertexProperty, EdgeProperty, VertexPropertySubset, EdgePropertySubset >::operator()(), boost::detail::read_dimacs_max_flow_internal(), boost::graph_test< Graph >::test_add_edge(), transitive_closure(), boost::detail::graph_copy_visitor< NewGraph, Copy2OrigIndexMap, CopyVertex, CopyEdge >::tree_edge(), boost::default_add_edge_visitor::visit_vertex_pair(), boost::edge_index_update_visitor< EdgeIndexMap >::visit_vertex_pair(), warren_transitive_closure(), and warshall_transitive_closure().

template<typename D , typename VP , typename EP , typename GP , typename A >

std::pair<typename adjacency_matrix<D,VP,EP,GP,A>::edge_descriptor, bool> boost::add_edge	(	typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor	u,
		typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor	v,
		adjacency_matrix< D, VP, EP, GP, A > &	g
	)

References add_edge().

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::lazy_add_edge boost::add_edge	(	typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	u,
		typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	v,
		adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::lazy_add_edge_with_property boost::add_edge	(	typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	u,
		typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	v,
		typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::edge_property_type const &	p,
		adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

template<typename G , typename L , typename S >

std::pair<typename labeled_graph<G,L,S>::edge_descriptor, bool> boost::add_edge_by_label ( typename labeled_graph< G, L, S >::label_type const &  u, typename labeled_graph< G, L, S >::label_type const &  v, labeled_graph< G, L, S > &  g  )

inline

References add_edge().

template<typename G , typename L , typename S >

std::pair<typename labeled_graph<G,L,S>::edge_descriptor, bool> boost::add_edge_by_label ( typename labeled_graph< G, L, S >::label_type const &  u, typename labeled_graph< G, L, S >::label_type const &  v, typename labeled_graph< G, L, S >::edge_property_type const &  p, labeled_graph< G, L, S > &  g  )

inline

References add_edge(), and boost::multiprecision::backends::p.

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename InputIterator >

void boost::add_edges ( InputIterator  first, InputIterator  last, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g  )

inline

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename InputIterator , typename EPIterator >

void boost::add_edges ( InputIterator  first, InputIterator  last, EPIterator  ep_iter, EPIterator  ep_iter_end, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g  )

inline

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename InputIterator , typename GlobalToLocal >

void boost::add_edges_global ( InputIterator  first, InputIterator  last, const GlobalToLocal &  global_to_local, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g  )

inline

Referenced by boost::compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::add_edges().

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename InputIterator , typename EPIterator , typename GlobalToLocal >

void boost::add_edges_global ( InputIterator  first, InputIterator  last, EPIterator  ep_iter, EPIterator  ep_iter_end, const GlobalToLocal &  global_to_local, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g  )

inline

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename BidirectionalIteratorOrig , typename EPIterOrig >

void boost::add_edges_sorted	(	BidirectionalIteratorOrig	first_sorted,
		BidirectionalIteratorOrig	last_sorted,
		EPIterOrig	ep_iter_sorted,
		compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &	g
	)

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename BidirectionalIteratorOrig >

void boost::add_edges_sorted	(	BidirectionalIteratorOrig	first_sorted,
		BidirectionalIteratorOrig	last_sorted,
		compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &	g
	)

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename BidirectionalIteratorOrig , typename EPIterOrig , typename GlobalToLocal >

void boost::add_edges_sorted_global	(	BidirectionalIteratorOrig	first_sorted,
		BidirectionalIteratorOrig	last_sorted,
		EPIterOrig	ep_iter_sorted,
		const GlobalToLocal &	global_to_local,
		compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &	g
	)

Referenced by boost::compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::add_edges_sorted().

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename BidirectionalIteratorOrig , typename GlobalToLocal >

void boost::add_edges_sorted_global	(	BidirectionalIteratorOrig	first_sorted,
		BidirectionalIteratorOrig	last_sorted,
		const GlobalToLocal &	global_to_local,
		compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &	g
	)

template<typename LoggerT >

BOOST_FORCEINLINE aux::scoped_logger_attribute< LoggerT > boost::add_scoped_logger_attribute	(	LoggerT &	l,
		attribute_name const &	name,
		attribute const &	attr
	)

Registers an attribute in the logger.

Parameters

l	Logger to register the attribute in
name	Attribute name
attr	The attribute. Must not be NULL.

Returns

An unspecified guard object which may be used to initialize a scoped_attribute variable.

References boost::spirit::x3::attr, move(), and boost::iostreams::gzip::flags::name.

BOOST_FORCEINLINE aux::scoped_thread_attribute boost::add_scoped_thread_attribute	(	attribute_name const &	name,
		attribute const &	attr
	)

Registers a thread-specific attribute.

Parameters

name	Attribute name
attr	The attribute. Must not be NULL.

Returns

An unspecified guard object which may be used to initialize a scoped_attribute variable.

References move().

template<typename T >

add_value_manip< T&& > boost::add_value ( attribute_name const &  name, T &&  value  )

inline

The function creates a manipulator that attaches an attribute value to a log record.

References boost::iostreams::gzip::flags::name, T, and boost::program_options::value().

Referenced by boost::python::enum_< T >::value().

template<typename DescriptorT , template< typename > class ActorT>

add_value_manip< typename DescriptorT::value_type&& > boost::add_value ( expressions::attribute_keyword< DescriptorT, ActorT > const &  , typename DescriptorT::value_type &&  value  )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::program_options::value().

template<typename DescriptorT , template< typename > class ActorT>

add_value_manip< typename DescriptorT::value_type& > boost::add_value ( expressions::attribute_keyword< DescriptorT, ActorT > const &  , typename DescriptorT::value_type &  value  )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::program_options::value().

template<typename DescriptorT , template< typename > class ActorT>

add_value_manip< typename DescriptorT::value_type const& > boost::add_value ( expressions::attribute_keyword< DescriptorT, ActorT > const &  , typename DescriptorT::value_type const &  value  )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::program_options::value().

template<class EdgeList , class Allocator >

EdgeList::value_type boost::add_vertex

(

std::vector< EdgeList, Allocator > &

g

)

template<typename G >

subgraph<G>::vertex_descriptor boost::add_vertex	(	typename subgraph< G >::vertex_descriptor	u_global,
		subgraph< G > &	g
	)

References add_vertex(), BOOST_ASSERT, boost::subgraph< Graph >::find_vertex(), boost::subgraph< Graph >::global_to_local(), is_directed(), boost::subgraph< Graph >::is_root(), boost::subgraph< Graph >::local_add_edge(), boost::subgraph< Graph >::m_global_vertex, boost::subgraph< Graph >::m_graph, boost::subgraph< Graph >::m_local_vertex, out_edges(), boost::subgraph< Graph >::root(), target(), and vertices().

template<typename VP , typename EP , typename GP >

undirected_graph<VP,EP,GP>::vertex_descriptor boost::add_vertex ( undirected_graph< VP, EP, GP > &  g )

inline

template<typename VP , typename EP , typename GP >

directed_graph<VP,EP,GP>::vertex_descriptor boost::add_vertex ( directed_graph< VP, EP, GP > &  g )

inline

template<typename VP , typename EP , typename GP >

undirected_graph<VP,EP,GP>::vertex_descriptor boost::add_vertex ( typename undirected_graph< VP, EP, GP >::vertex_property_type const &  p, undirected_graph< VP, EP, GP > &  g  )

inline

template<typename VP , typename EP , typename GP >

directed_graph<VP,EP,GP>::vertex_descriptor boost::add_vertex ( typename directed_graph< VP, EP, GP >::vertex_property_type const &  p, directed_graph< VP, EP, GP > &  g  )

inline

template<class vtype , class etype >

graph_traits< leda::GRAPH<vtype,etype> >::vertex_descriptor boost::add_vertex

(

leda::GRAPH< vtype, etype > &

g

)

template<class vtype , class etype >

graph_traits< leda::GRAPH<vtype,etype> >::vertex_descriptor boost::add_vertex	(	const vtype &	vp,
		leda::GRAPH< vtype, etype > &	g
	)

graph_traits<leda::graph>::vertex_descriptor boost::add_vertex

(

leda::graph &

g

)

template<typename G >

subgraph<G>::vertex_descriptor boost::add_vertex

(

subgraph< G > &

g

)

References add_vertex(), boost::detail::add_vertex_recur_up(), 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 >::parent().

template<typename G , typename L , typename S >

labeled_graph<G,L,S>::vertex_descriptor boost::add_vertex ( typename labeled_graph< G, L, S >::label_type const &  l, labeled_graph< G, L, S > &  g  )

inline

template<typename G , typename L , typename S >

labeled_graph<G,L,S>::vertex_descriptor boost::add_vertex ( typename labeled_graph< G, L, S >::label_type const &  l, typename labeled_graph< G, L, S >::vertex_property_type const &  p, labeled_graph< G, L, S > &  g  )

inline

template<typename D , typename VP , typename EP , typename GP , typename A >

adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor boost::add_vertex ( adjacency_matrix< D, VP, EP, GP, A > &  g )

inline

References BOOST_ASSERT, and vertices().

Referenced by boost::directed_graph< VertexProp, EdgeProp, GraphProp >::add_vertex(), boost::undirected_graph< VertexProp, EdgeProp, GraphProp >::add_vertex(), boost::compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::add_vertex(), add_vertex(), boost::detail::add_vertex_recur_up(), boost::detail::copy_graph_impl< 0 >::apply(), boost::detail::copy_graph_impl< 1 >::apply(), boost::detail::copy_graph_impl< 2 >::apply(), boost::concepts::BOOST_concept(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::lazy_add_vertex_with_property::commit(), boost::detail::graph_copy_visitor< NewGraph, Copy2OrigIndexMap, CopyVertex, CopyEdge >::copy_one_vertex(), create_condensation_graph(), boost::subgraph< Graph >::create_subgraph(), boost::mutate_graph_impl< MutableGraph >::do_add_vertex(), boost::detail::graph::mutate_graph_impl< MutableGraph >::do_add_vertex(), for(), generate_random_graph(), generate_random_graph1(), boost::graph_detail::insert_labeled_vertex(), boost::serialization::load(), boost::GraphParser< Graph_t, VertexProperty, EdgeProperty, VertexPropertySubset, EdgePropertySubset >::operator()(), boost::detail::read_dimacs_max_flow_internal(), boost::subgraph< Graph >::subgraph(), boost::graph_test< Graph >::test_add_vertex(), transitive_closure(), and boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::lazy_add_vertex_with_property::~lazy_add_vertex_with_property().

template<typename D , typename VP , typename EP , typename GP , typename A , typename VP2 >

adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor boost::add_vertex ( const VP2 &  , adjacency_matrix< D, VP, EP, GP, A > &  g  )

inline

References BOOST_ASSERT, and vertices().

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

Vertex boost::add_vertex ( compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g )

inline

References add_vertex().

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

Vertex boost::add_vertex ( compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::vertex_bundled const &  p  )

inline

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

Vertex boost::add_vertex ( compressed_sparse_row_graph< bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g, typename compressed_sparse_row_graph< bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::vertex_bundled const &  p  )

inline

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::vertex_descriptor boost::add_vertex

(

adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &

g

)

References add_vertex(), and boost::multiprecision::backends::p.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::lazy_add_vertex_with_property boost::add_vertex	(	typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_property_type const &	p,
		adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

Vertex boost::add_vertices ( typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::vertices_size_type  count, compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g  )

inline

References num_vertices().

Referenced by boost::compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::add_vertices().

template<class T >

BOOST_FORCEINLINE T* boost::addressof

(

T &

v

)

References boost::detail::addressof_impl< T >::f().

Referenced by boost::alignment::aligned_allocator< T, Alignment >::address(), boost::interprocess::allocator< bucket_type, segment_manager_base >::address(), boost::alignment::aligned_allocator_adaptor< Allocator, Alignment >::allocate(), boost::type_erasure::any< Concept, T & >::any(), boost::type_erasure::any< Concept, const T & >::any(), boost::type_erasure::any< Concept, T && >::any(), boost::iterators::detail::operator_arrow_dispatch< T &, Pointer >::apply(), boost::sources::basic_composite_logger< CharT, FinalT, ThreadingModelT, FeaturesT >::assign(), boost::detail::function::BOOST_JOIN(), boost::foreach_detail_::contain(), boost::circular_buffer< Sample >::linearize(), boost::iterators::detail::operator_arrow_dispatch< Reference, Pointer >::proxy::operator Reference *(), boost::detail::variant::get_visitor< T >::operator()(), boost::expressions::char_decorator_terminal< SubactorT, ImplT >::operator()(), boost::unit_test::readonly_property< test_unit_type >::operator->(), boost::unit_test::readwrite_property< bool >::operator->(), boost::iterators::detail::operator_arrow_dispatch< Reference, Pointer >::proxy::operator->(), boost::dynamic_bitset< Block, Allocator >::operator=(), boost::optional< status >::operator=(), boost::intrusive::pointer_traits< T * >::pointer_to(), boost::cb_details::uninitialized_copy(), boost::cb_details::uninitialized_fill_n_with_alloc(), uninitialized_move(), and boost::cb_details::uninitialized_move_if_noexcept_impl().

template<typename G , typename L , typename S >

std::pair< typename labeled_graph<G,L,S>::adjacency_iterator, typename labeled_graph<G,L,S>::adjacency_iterator> boost::adjacenct_vertices ( typename labeled_graph< G, L, S >::vertex_descriptor  v, labeled_graph< G, L, S > const &  g  )

inline

References adjacent_vertices().

template<class SinglePassRange , class OutputIterator >

OutputIterator boost::adjacent_difference ( const SinglePassRange &  rng, OutputIterator  result  )

inline

References adjacent_difference(), boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and end.

Referenced by boost::phoenix::impl::adjacent_difference::operator()().

template<class SinglePassRange , class OutputIterator , class BinaryOperation >

OutputIterator boost::adjacent_difference ( const SinglePassRange &  rng, OutputIterator  result, BinaryOperation  op  )

inline

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and end.

Referenced by adjacent_difference(), and boost::lambda::ll::adjacent_difference::operator()().

template<typename V , typename D , typename P , typename B >

std::pair<typename adjacency_graph_archetype<V,D,P,B>::adjacency_iterator, typename adjacency_graph_archetype<V,D,P,B>::adjacency_iterator> boost::adjacent_vertices	(	const V &	,
		const adjacency_graph_archetype< V, D, P, B > &
	)

References boost::xpressive::make_pair.

template<class EdgeList , class Alloc >

std::pair<typename EdgeList::const_iterator, typename EdgeList::const_iterator> boost::adjacent_vertices	(	typename EdgeList::value_type	v,
		const std::vector< EdgeList, Alloc > &	g
	)

References boost::asio::begin, end, and boost::xpressive::make_pair.

std::pair<sgb_adj_iterator,sgb_adj_iterator> boost::adjacent_vertices ( Vertex *  u, sgb_const_graph_ptr    )

inline

References boost::xpressive::make_pair.

template<class BidirectionalGraph , class GRef >

std::pair<typename reverse_graph<BidirectionalGraph,GRef>::adjacency_iterator, typename reverse_graph<BidirectionalGraph,GRef>::adjacency_iterator> boost::adjacent_vertices ( typename graph_traits< BidirectionalGraph >::vertex_descriptor  u, const reverse_graph< BidirectionalGraph, GRef > &  g  )

inline

References boost::xpressive::first, last, boost::xpressive::make_pair, and out_edges().

template<typename G , typename EP , typename VP >

std::pair<typename filtered_graph<G, EP, VP>::adjacency_iterator, typename filtered_graph<G, EP, VP>::adjacency_iterator> boost::adjacent_vertices	(	typename filtered_graph< G, EP, VP >::vertex_descriptor	u,
		const filtered_graph< G, EP, VP > &	g
	)

References boost::xpressive::make_pair, boost::detail::out_edge_iterator, and out_edges().

template<typename VP , typename EP , typename GP >

std::pair< typename undirected_graph<VP,EP,GP>::adjacency_iterator, typename undirected_graph<VP,EP,GP>::adjacency_iterator > boost::adjacent_vertices ( typename undirected_graph< VP, EP, GP >::vertex_descriptor  v, undirected_graph< VP, EP, GP > const &  g  )

inline

References adjacent_vertices().

template<typename VP , typename EP , typename GP >

std::pair< typename directed_graph<VP,EP,GP>::adjacency_iterator, typename directed_graph<VP,EP,GP>::adjacency_iterator > boost::adjacent_vertices ( typename directed_graph< VP, EP, GP >::vertex_descriptor  v, directed_graph< VP, EP, GP > const &  g  )

inline

References adjacent_vertices().

template<class vtype , class etype >

std::pair< typename graph_traits< leda::GRAPH<vtype,etype> >::adjacency_iterator, typename graph_traits< leda::GRAPH<vtype,etype> >::adjacency_iterator > boost::adjacent_vertices ( typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor  u, const leda::GRAPH< vtype, etype > &  g  )

inline

References boost::xpressive::make_pair.

template<typename G >

std::pair<typename subgraph<G>::adjacency_iterator, typename subgraph<G>::adjacency_iterator> boost::adjacent_vertices	(	typename subgraph< G >::vertex_descriptor	v,
		const subgraph< G > &	g
	)

References adjacent_vertices(), and boost::subgraph< Graph >::m_graph.

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

std::pair<typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::adjacency_iterator, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::adjacency_iterator> boost::adjacent_vertices ( typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor  u, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g  )

inline

References adjacent_vertices(), and vertex_local.

std::pair< graph_traits<leda::graph>::adjacency_iterator, graph_traits<leda::graph>::adjacency_iterator > boost::adjacent_vertices ( graph_traits< leda::graph >::vertex_descriptor  u, const leda::graph &  g  )

inline

References boost::xpressive::make_pair.

template<typename D , typename VP , typename EP , typename GP , typename A >

std::pair<typename adjacency_matrix<D,VP,EP,GP,A>::adjacency_iterator, typename adjacency_matrix<D,VP,EP,GP,A>::adjacency_iterator> boost::adjacent_vertices	(	typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor	u,
		const adjacency_matrix< D, VP, EP, GP, A > &	g_
	)

References boost::xpressive::first, last, boost::xpressive::make_pair, boost::detail::out_edge_iterator, and out_edges().

Referenced by adjacenct_vertices(), adjacent_vertices(), boost::concepts::BOOST_concept(), create_condensation_graph(), edge_range(), boost::detail::mmd_impl< Graph, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, VertexIndexMap >::eliminate(), boost::triangulation_visitor< Graph, VertexIndexMap, AddEdgeVisitor >::end_face(), is_adj_dispatch(), boost::detail::neighbors(), num_paths_through_vertex(), num_triangles_on_vertex(), boost::hawick_circuits_detail::get_all_adjacent_vertices::operator()(), boost::hawick_circuits_detail::get_unique_adjacent_vertices::operator()(), planar_canonical_ordering(), sequential_vertex_coloring(), smallest_last_vertex_ordering(), boost::graph_test< Graph >::test_add_edge(), boost::graph_test< Graph >::test_adjacency_graph(), boost::graph_test< Graph >::test_remove_edge(), transitive_closure(), and boost::detail::mmd_impl< Graph, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, VertexIndexMap >::update().

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

std::pair<typename compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex>::adjacency_iterator, typename compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex>::adjacency_iterator> boost::adjacent_vertices ( Vertex  v, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g  )

inline

References boost::xpressive::make_pair.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

std::pair<typename adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::adjacency_iterator, typename adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::adjacency_iterator> boost::adjacent_vertices	(	typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	v,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References boost::xpressive::make_pair, out_edges(), and boost::locale::period::marks::second.

template<typename Graph , typename DistanceMatrixMap , typename CentralityMap , typename Measure >

void boost::all_closeness_centralities ( const Graph &  g, DistanceMatrixMap  dist, CentralityMap  cent, Measure  measure  )

inline

References BOOST_CONCEPT_ASSERT(), boost::multiprecision::backends::c, closeness_centrality(), end, boost::multiprecision::backends::i, put(), Vertex, and vertices().

Referenced by all_closeness_centralities().

template<typename Graph , typename DistanceMatrixMap , typename CentralityMap >

void boost::all_closeness_centralities ( const Graph &  g, DistanceMatrixMap  dist, CentralityMap  cent  )

inline

References all_closeness_centralities(), BOOST_CONCEPT_ASSERT(), and Vertex.

template<typename Graph , typename ClusteringMap >

property_traits<ClusteringMap>::value_type boost::all_clustering_coefficients ( const Graph &  g, ClusteringMap  cm  )

inline

References BOOST_CONCEPT_ASSERT(), end, boost::multiprecision::backends::i, num_vertices(), put(), boost::accumulators::extract::sum, Vertex, and vertices().

template<typename Graph , typename CentralityMap , typename Measure >

void boost::all_degree_centralities ( const Graph &  g, CentralityMap  cent, Measure  measure  )

inline

References BOOST_CONCEPT_ASSERT(), boost::multiprecision::backends::c, degree_centrality(), end, boost::multiprecision::backends::i, put(), Vertex, and vertices().

Referenced by all_degree_centralities(), all_influence_values(), and all_prestige_values().

template<typename Graph , typename CentralityMap >

void boost::all_degree_centralities ( const Graph &  g, CentralityMap  cent  )

inline

References all_degree_centralities(), and measure_influence().

template<typename Graph , typename DistanceMatrix , typename EccentricityMap >

std::pair<typename property_traits<EccentricityMap>::value_type, typename property_traits<EccentricityMap>::value_type> boost::all_eccentricities ( const Graph &  g, const DistanceMatrix &  dist, EccentricityMap  ecc  )

inline

References BOOST_CONCEPT_ASSERT(), BOOST_PREVENT_MACRO_SUBSTITUTION, BOOST_USING_STD_MAX, BOOST_USING_STD_MIN, eccentricity(), end, boost::multiprecision::backends::i, boost::numeric_values< T >::infinity(), boost::xpressive::make_pair, boost::accumulators::extract::max, boost::accumulators::extract::min, put(), Vertex, vertices(), and boost::numeric_values< T >::zero().

template<typename Graph , typename CentralityMap >

void boost::all_influence_values ( const Graph &  g, CentralityMap  cent  )

inline

References all_degree_centralities(), and measure_influence().

template<typename Graph , typename DistanceMatrixMap , typename GeodesicMap , typename Measure >

property_traits<GeodesicMap>::value_type boost::all_mean_geodesics ( const Graph &  g, DistanceMatrixMap  dist, GeodesicMap  geo, Measure  measure  )

inline

References BOOST_CONCEPT_ASSERT(), end, boost::multiprecision::backends::i, boost::xpressive::inf, boost::numeric_values< T >::infinity(), mean_geodesic(), num_vertices(), put(), boost::accumulators::extract::sum, Vertex, vertices(), and boost::numeric_values< T >::zero().

Referenced by all_mean_geodesics().

template<typename Graph , typename DistanceMatrixMap , typename GeodesicMap >

property_traits<GeodesicMap>::value_type boost::all_mean_geodesics ( const Graph &  g, DistanceMatrixMap  dist, GeodesicMap  geo  )

inline

References all_mean_geodesics(), BOOST_CONCEPT_ASSERT(), and Vertex.

template<typename Graph , typename CentralityMap >

void boost::all_prestige_values ( const Graph &  g, CentralityMap  cent  )

inline

References all_degree_centralities(), and measure_prestige().

template<class T , class A >

boost::detail::sp_if_array<T>::type boost::allocate_shared ( const A &  allocator, std::size_t  size  )

inline

References boost::shared_ptr< T >::_internal_get_untyped_deleter(), A1, boost::xpressive::a1, boost::xpressive::a2, boost::xpressive::s1, boost::fusion::size(), and boost::detail::type.

template<class T , class A >

boost::detail::sp_if_size_array<T>::type boost::allocate_shared ( const A &  allocator )

inline

References boost::shared_ptr< T >::_internal_get_untyped_deleter(), A1, boost::xpressive::a1, boost::xpressive::a2, N, boost::xpressive::s1, boost::fusion::size(), and boost::detail::type.

template<class T , class A >

boost::detail::sp_if_array<T>::type boost::allocate_shared ( const A &  allocator, std::size_t  size, const typename boost::detail::array_inner< T >::type &  value  )

inline

References boost::shared_ptr< T >::_internal_get_untyped_deleter(), A1, boost::xpressive::a1, boost::xpressive::a2, boost::xpressive::s1, size(), boost::fusion::size(), boost::detail::type, and boost::program_options::value().

template<class T , class A >

boost::detail::sp_if_size_array<T>::type boost::allocate_shared ( const A &  allocator, const typename boost::detail::array_inner< T >::type &  value  )

inline

References boost::shared_ptr< T >::_internal_get_untyped_deleter(), A1, boost::xpressive::a1, boost::xpressive::a2, N, boost::xpressive::s1, boost::fusion::size(), boost::detail::type, and boost::program_options::value().

template<class T , class A , class... Args>

boost::detail::sp_if_not_array< T >::type boost::allocate_shared	(	A const &	a,
		Args &&...	args
	)

References boost::shared_ptr< T >::_internal_get_untyped_deleter(), A2, boost::xpressive::a2, boost::python::args(), boost::icl::construct(), boost::detail::sp_enable_shared_from_this(), T, and template.

template<class T , class A >

boost::detail::sp_if_array<T>::type boost::allocate_shared_noinit ( const A &  allocator, std::size_t  size  )

inline

References boost::shared_ptr< T >::_internal_get_untyped_deleter(), A1, boost::xpressive::a1, boost::xpressive::a2, boost::xpressive::s1, boost::fusion::size(), and boost::detail::type.

template<class T , class A >

boost::detail::sp_if_size_array<T>::type boost::allocate_shared_noinit ( const A &  allocator )

inline

References boost::shared_ptr< T >::_internal_get_untyped_deleter(), A1, boost::xpressive::a1, boost::xpressive::a2, N, boost::xpressive::s1, boost::fusion::size(), and boost::detail::type.

template<class T , class A >

boost::detail::sp_if_not_array< T >::type boost::allocate_shared_noinit

(

A const &

a

)

References boost::shared_ptr< T >::_internal_get_untyped_deleter(), boost::detail::sp_ms_deleter< T >::address(), BOOST_SP_MSD, boost::detail::sp_ms_deleter< T >::set_initialized(), boost::detail::sp_enable_shared_from_this(), and T.

template<typename Graph >

bool boost::allows_parallel_edges

(

const Graph &

)

References boost::detail::allows_parallel().

Referenced by boost::graph_test< Graph >::test_add_edge().

template<typename ValueType >

ValueType* boost::any_cast

(

any *

operand

)

References boost::detail::type.

Referenced by boost::program_options::variable_value::as(), boost::detail::dynamic_property_map_adaptor< PropertyMap >::get(), get(), boost::nfp::named_parameter< bool, unique_id, bool >::operator[](), boost::mutate_graph_impl< MutableGraph >::set_edge_property(), and boost::mutate_graph_impl< MutableGraph >::set_vertex_property().

template<typename ValueType >

const ValueType* boost::any_cast ( const any *  operand )

inline

References boost::any::any_cast.

template<typename ValueType >

ValueType boost::any_cast

(

any &

operand

)

References boost::any::any_cast, BOOST_DEDUCED_TYPENAME, throw_exception(), and boost::detail::type.

template<typename ValueType >

ValueType boost::any_cast ( const any &  operand )

inline

References boost::any::any_cast, BOOST_DEDUCED_TYPENAME, and boost::detail::type.

template<typename ValueType >

ValueType boost::any_cast ( any &&  operand )

inline

References boost::any::any_cast, BOOST_STATIC_ASSERT_MSG, boost::detail::type, and boost::program_options::value().

template<typename PropertyMapFirst , typename PropertyMapSecond , typename Graph >

bool boost::are_property_maps_different	(	const PropertyMapFirst	property_map1,
		const PropertyMapSecond	property_map2,
		const Graph &	graph
	)

References BGL_FORALL_VERTICES_T, and vertex().

Referenced by boost::detail::unique_subgraph_interceptor< GraphFirst, GraphSecond, VertexIndexMapFirst, VertexIndexMapSecond, SubGraphCallback >::operator()(), and boost::detail::unique_maximum_subgraph_interceptor< GraphFirst, GraphSecond, VertexIndexMapFirst, VertexIndexMapSecond, SubGraphCallback >::operator()().

template<typename Graph , typename OutputIterator , typename P , typename T , typename R >

OutputIterator boost::articulation_points	(	const Graph &	g,
		OutputIterator	out,
		const bgl_named_params< P, T, R > &	params
	)

References biconnected_components().

Referenced by make_biconnected_planar().

template<typename Graph , typename OutputIterator >

OutputIterator boost::articulation_points	(	const Graph &	g,
		OutputIterator	out
	)

References biconnected_components().

template<typename FunT >

BOOST_FORCEINLINE as_action_adapter< FunT > boost::as_action

(

FunT const &

fun

)

template<class R >

iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<R>::type > boost::as_array ( R &  r )

inline

References make_iterator_range().

template<class Range >

boost::iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<const Range>::type > boost::as_array ( const Range &  r )

inline

References make_iterator_range().

template<class Range >

iterator_range<BOOST_DEDUCED_TYPENAME range_iterator<Range>::type> boost::as_literal ( Range &  r )

inline

References boost::range_detail::is_char_ptr(), and boost::range_detail::make_range().

Referenced by boost::algorithm::all(), boost::algorithm::const_formatter(), boost::algorithm::contains(), boost::algorithm::ends_with(), boost::algorithm::equals(), boost::algorithm::find(), boost::algorithm::find_format_all_copy(), boost::algorithm::find_format_copy(), boost::algorithm::find_iterator< IteratorT >::find_iterator(), boost::algorithm::find_regex(), boost::algorithm::first_finder(), boost::xpressive::match_results< BidiIter >::format(), boost::algorithm::is_any_of(), boost::algorithm::iter_find(), boost::algorithm::iter_split(), boost::algorithm::join(), boost::algorithm::join_if(), boost::algorithm::last_finder(), boost::algorithm::lexicographical_compare(), boost::algorithm::nth_finder(), boost::date_time::time_facet< time_type, CharT, OutItrT >::put(), boost::algorithm::split_iterator< IteratorT >::split_iterator(), boost::algorithm::starts_with(), boost::algorithm::to_lower(), boost::algorithm::to_lower_copy(), boost::algorithm::to_upper(), boost::algorithm::to_upper_copy(), boost::algorithm::trim_copy_if(), boost::algorithm::trim_fill_copy_if(), boost::algorithm::trim_fill_if(), boost::algorithm::trim_left_copy_if(), and boost::algorithm::trim_right_copy_if().

template<class Range >

iterator_range<BOOST_DEDUCED_TYPENAME range_iterator<const Range>::type> boost::as_literal ( const Range &  r )

inline

References boost::range_detail::is_char_ptr(), and boost::range_detail::make_range().

template<class Char , std::size_t sz>

iterator_range<Char*> boost::as_literal ( Char(&)  arr[sz] )

inline

References boost::range_detail::is_char_ptr(), and boost::range_detail::make_range().

template<class Char , std::size_t sz>

iterator_range<const Char*> boost::as_literal ( const Char(&)  arr[sz] )

inline

References boost::range_detail::is_char_ptr(), and boost::range_detail::make_range().

template<typename Functor , typename Allocator >

void boost::assign	(	Functor BOOST_FUNCTION_TARGET_FIX(const &)	f,
		Allocator	a
	)

References BOOST_CATCH, BOOST_CATCH_END, BOOST_RETHROW, BOOST_TRY, and boost::fusion::clear().

Referenced by boost::container::basic_string< CharT, Traits, Allocator >::assign(), boost::wave::util::flex_string< E, T, A, Storage >::assign(), boost::container::basic_string< CharT, Traits, Allocator >::clear(), boost::compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::compressed_sparse_row_graph(), boost::compressed_sparse_row_graph< bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::compressed_sparse_row_graph(), boost::wave::util::flex_string< E, T, A, Storage >::flex_string(), boost::unit_test::token_iterator_base< range_token_iterator< Iter, CharCompare, ValueType, Reference >, iterator_value< Iter >::type, CharCompare, ValueType, Reference >::get(), boost::icl::interval_map< DomainT, CodomainT, Traits, Compare, Combine, Section, Interval, Alloc >::interval_map(), boost::icl::interval_set< DomainT, Compare, Interval, Alloc >::interval_set(), boost::geometry::make(), boost::multiprecision::number< Backend, ExpressionTemplates >::number(), boost::offset_separator::operator()(), boost::char_separator< Char, Tr >::operator()(), boost::spirit::match< T >::operator=(), boost::icl::split_interval_map< DomainT, CodomainT, Traits, Compare, Combine, Section, Interval, Alloc >::operator=(), boost::icl::interval_map< DomainT, CodomainT, Traits, Compare, Combine, Section, Interval, Alloc >::operator=(), boost::icl::split_interval_set< DomainT, Compare, Interval, Alloc >::operator=(), boost::icl::separate_interval_set< DomainT, Compare, Interval, Alloc >::operator=(), boost::icl::interval_set< DomainT, Compare, Interval, Alloc >::operator=(), boost::phoenix::actor< proto::terminal< spirit::lex::state_context >::type >::operator=(), boost::numeric::ublas::matrix_row< M >::const_iterator::operator=(), boost::numeric::ublas::vector_range< V >::const_iterator::operator=(), boost::numeric::ublas::matrix_row< M >::iterator::operator=(), boost::numeric::ublas::vector_unary< E, F >::const_iterator::operator=(), boost::numeric::ublas::vector_range< V >::iterator::operator=(), boost::numeric::ublas::symmetric_matrix< T, TRI, L, A >::const_iterator1::operator=(), boost::numeric::ublas::triangular_matrix< T, TRI, L, A >::const_iterator1::operator=(), boost::numeric::ublas::symmetric_matrix< T, TRI, L, A >::iterator1::operator=(), boost::numeric::ublas::vector_matrix_binary< E1, E2, F >::const_iterator1::operator=(), boost::numeric::ublas::matrix< T, L, A >::const_iterator1::operator=(), boost::numeric::ublas::banded_matrix< T, L, A >::const_iterator1::operator=(), boost::numeric::ublas::vector< T, A >::const_iterator::operator=(), boost::numeric::ublas::triangular_matrix< T, TRI, L, A >::iterator1::operator=(), boost::numeric::ublas::mapped_vector< T, A >::const_iterator::operator=(), boost::numeric::ublas::generalized_vector_of_vector< T, L, A >::const_iterator1::operator=(), boost::numeric::ublas::hermitian_matrix< T, TRI, L, A >::const_iterator1::operator=(), boost::numeric::ublas::mapped_vector< T, A >::iterator::operator=(), boost::container::basic_string< CharT, Traits, Allocator >::operator=(), boost::numeric::ublas::vector< T, A >::iterator::operator=(), boost::numeric::ublas::matrix< T, L, A >::iterator1::operator=(), boost::numeric::ublas::banded_matrix< T, L, A >::iterator1::operator=(), boost::numeric::ublas::symmetric_matrix< T, TRI, L, A >::const_iterator2::operator=(), boost::numeric::ublas::matrix_column< M >::const_iterator::operator=(), boost::numeric::ublas::vector_matrix_binary< E1, E2, F >::const_iterator2::operator=(), boost::numeric::ublas::triangular_matrix< T, TRI, L, A >::const_iterator2::operator=(), boost::numeric::ublas::hermitian_matrix< T, TRI, L, A >::iterator1::operator=(), boost::numeric::ublas::mapped_matrix< T, L, A >::const_iterator1::operator=(), boost::numeric::ublas::generalized_vector_of_vector< T, L, A >::iterator1::operator=(), boost::numeric::ublas::vector_binary< E1, E2, F >::const_iterator::operator=(), boost::numeric::ublas::matrix_column< M >::iterator::operator=(), boost::numeric::ublas::symmetric_matrix< T, TRI, L, A >::iterator2::operator=(), boost::numeric::ublas::vector_slice< V >::const_iterator::operator=(), boost::numeric::ublas::matrix< T, L, A >::const_iterator2::operator=(), boost::numeric::ublas::banded_matrix< T, L, A >::const_iterator2::operator=(), boost::numeric::ublas::triangular_matrix< T, TRI, L, A >::iterator2::operator=(), boost::numeric::ublas::mapped_matrix< T, L, A >::iterator1::operator=(), boost::numeric::ublas::hermitian_matrix< T, TRI, L, A >::const_iterator2::operator=(), boost::numeric::ublas::vector_slice< V >::iterator::operator=(), boost::numeric::ublas::generalized_vector_of_vector< T, L, A >::const_iterator2::operator=(), boost::numeric::ublas::matrix< T, L, A >::iterator2::operator=(), boost::numeric::ublas::banded_matrix< T, L, A >::iterator2::operator=(), boost::numeric::ublas::basic_range< Z, D >::const_iterator::operator=(), boost::numeric::ublas::matrix_unary1< E, F >::const_iterator1::operator=(), boost::numeric::ublas::hermitian_matrix< T, TRI, L, A >::iterator2::operator=(), boost::numeric::ublas::mapped_matrix< T, L, A >::const_iterator2::operator=(), boost::numeric::ublas::vector_binary_scalar1< E1, E2, F >::const_iterator::operator=(), boost::numeric::ublas::generalized_vector_of_vector< T, L, A >::iterator2::operator=(), boost::numeric::ublas::matrix_vector_range< M >::const_iterator::operator=(), boost::numeric::ublas::compressed_vector< T, IB, IA, TA >::const_iterator::operator=(), boost::numeric::ublas::mapped_matrix< T, L, A >::iterator2::operator=(), boost::numeric::ublas::matrix_unary1< E, F >::const_iterator2::operator=(), boost::numeric::ublas::basic_slice< Z, D >::const_iterator::operator=(), boost::numeric::ublas::compressed_vector< T, IB, IA, TA >::iterator::operator=(), boost::numeric::ublas::matrix_vector_range< M >::iterator::operator=(), boost::numeric::ublas::vector_binary_scalar2< E1, E2, F >::const_iterator::operator=(), boost::numeric::ublas::triangular_adaptor< M, TRI >::const_iterator1::operator=(), boost::numeric::ublas::vector_indirect< V, IA >::const_iterator::operator=(), boost::wave::util::flex_string< E, T, A, Storage >::operator=(), boost::numeric::ublas::symmetric_adaptor< M, TRI >::const_iterator1::operator=(), boost::numeric::ublas::vector_indirect< V, IA >::iterator::operator=(), boost::numeric::ublas::triangular_adaptor< M, TRI >::iterator1::operator=(), boost::numeric::ublas::indirect_array< A >::const_iterator::operator=(), boost::numeric::ublas::matrix_unary2< E, F >::const_iterator1::operator=(), boost::numeric::ublas::banded_adaptor< M >::const_iterator1::operator=(), boost::numeric::ublas::symmetric_adaptor< M, TRI >::iterator1::operator=(), boost::numeric::ublas::matrix_vector_slice< M >::const_iterator::operator=(), boost::numeric::ublas::triangular_adaptor< M, TRI >::const_iterator2::operator=(), boost::numeric::ublas::zero_vector< T, ALLOC >::const_iterator::operator=(), boost::numeric::ublas::matrix_vector_slice< M >::iterator::operator=(), boost::numeric::ublas::matrix_unary2< E, F >::const_iterator2::operator=(), boost::numeric::ublas::banded_adaptor< M >::iterator1::operator=(), boost::numeric::ublas::hermitian_adaptor< M, TRI >::const_iterator1::operator=(), boost::numeric::ublas::triangular_adaptor< M, TRI >::iterator2::operator=(), boost::numeric::ublas::coordinate_vector< T, IB, IA, TA >::const_iterator::operator=(), boost::numeric::ublas::hermitian_adaptor< M, TRI >::iterator1::operator=(), boost::numeric::ublas::symmetric_adaptor< M, TRI >::const_iterator2::operator=(), boost::numeric::ublas::banded_adaptor< M >::const_iterator2::operator=(), boost::numeric::ublas::unit_vector< T, ALLOC >::const_iterator::operator=(), boost::variant< BOOST_PP_ENUM_PARAMS(BOOST_MPL_LIMIT_LIST_SIZE, T)>::operator=(), boost::numeric::ublas::coordinate_vector< T, IB, IA, TA >::iterator::operator=(), boost::numeric::ublas::mapped_vector_of_mapped_vector< T, L, A >::const_iterator1::operator=(), boost::numeric::ublas::symmetric_adaptor< M, TRI >::iterator2::operator=(), boost::numeric::ublas::banded_adaptor< M >::iterator2::operator=(), boost::numeric::ublas::matrix_vector_indirect< M, IA >::const_iterator::operator=(), boost::numeric::ublas::mapped_vector_of_mapped_vector< T, L, A >::iterator1::operator=(), boost::numeric::ublas::matrix_vector_indirect< M, IA >::iterator::operator=(), boost::numeric::ublas::scalar_vector< T, ALLOC >::const_iterator::operator=(), boost::numeric::ublas::hermitian_adaptor< M, TRI >::const_iterator2::operator=(), boost::numeric::ublas::matrix_binary< E1, E2, F >::const_iterator1::operator=(), boost::numeric::ublas::mapped_vector_of_mapped_vector< T, L, A >::const_iterator2::operator=(), boost::numeric::ublas::hermitian_adaptor< M, TRI >::iterator2::operator=(), boost::numeric::ublas::mapped_vector_of_mapped_vector< T, L, A >::iterator2::operator=(), boost::numeric::ublas::c_vector< T, N >::const_iterator::operator=(), boost::numeric::ublas::matrix_binary< E1, E2, F >::const_iterator2::operator=(), boost::numeric::ublas::vector_of_vector< T, L, A >::const_iterator1::operator=(), boost::numeric::ublas::matrix_range< M >::const_iterator1::operator=(), boost::numeric::ublas::c_vector< T, N >::iterator::operator=(), boost::numeric::ublas::matrix_range< M >::iterator1::operator=(), boost::numeric::ublas::vector_of_vector< T, L, A >::iterator1::operator=(), boost::numeric::ublas::matrix_range< M >::const_iterator2::operator=(), boost::numeric::ublas::vector_of_vector< T, L, A >::const_iterator2::operator=(), boost::numeric::ublas::matrix_binary_scalar1< E1, E2, F >::const_iterator1::operator=(), boost::numeric::ublas::matrix_range< M >::iterator2::operator=(), boost::numeric::ublas::vector_of_vector< T, L, A >::iterator2::operator=(), boost::numeric::ublas::matrix_binary_scalar1< E1, E2, F >::const_iterator2::operator=(), boost::numeric::ublas::compressed_matrix< T, L, IB, IA, TA >::const_iterator1::operator=(), boost::numeric::ublas::zero_matrix< T, ALLOC >::const_iterator1::operator=(), boost::numeric::ublas::matrix_binary_scalar2< E1, E2, F >::const_iterator1::operator=(), boost::numeric::ublas::compressed_matrix< T, L, IB, IA, TA >::iterator1::operator=(), boost::numeric::ublas::matrix_slice< M >::const_iterator1::operator=(), boost::numeric::ublas::zero_matrix< T, ALLOC >::const_iterator2::operator=(), boost::numeric::ublas::matrix_binary_scalar2< E1, E2, F >::const_iterator2::operator=(), boost::numeric::ublas::matrix_slice< M >::iterator1::operator=(), boost::numeric::ublas::compressed_matrix< T, L, IB, IA, TA >::const_iterator2::operator=(), boost::numeric::ublas::compressed_matrix< T, L, IB, IA, TA >::iterator2::operator=(), boost::numeric::ublas::matrix_slice< M >::const_iterator2::operator=(), boost::numeric::ublas::identity_matrix< T, ALLOC >::const_iterator1::operator=(), boost::numeric::ublas::matrix_vector_binary1< E1, E2, F >::const_iterator::operator=(), boost::numeric::ublas::matrix_slice< M >::iterator2::operator=(), boost::numeric::ublas::identity_matrix< T, ALLOC >::const_iterator2::operator=(), boost::numeric::ublas::matrix_vector_binary2< E1, E2, F >::const_iterator::operator=(), boost::numeric::ublas::scalar_matrix< T, ALLOC >::const_iterator1::operator=(), boost::numeric::ublas::matrix_indirect< M, IA >::const_iterator1::operator=(), boost::numeric::ublas::scalar_matrix< T, ALLOC >::const_iterator2::operator=(), boost::numeric::ublas::matrix_indirect< M, IA >::iterator1::operator=(), boost::numeric::ublas::matrix_matrix_binary< E1, E2, F >::const_iterator1::operator=(), boost::numeric::ublas::coordinate_matrix< T, L, IB, IA, TA >::const_iterator1::operator=(), boost::numeric::ublas::matrix_indirect< M, IA >::const_iterator2::operator=(), boost::numeric::ublas::coordinate_matrix< T, L, IB, IA, TA >::iterator1::operator=(), boost::numeric::ublas::matrix_indirect< M, IA >::iterator2::operator=(), boost::numeric::ublas::matrix_matrix_binary< E1, E2, F >::const_iterator2::operator=(), boost::numeric::ublas::c_matrix< T, N, M >::const_iterator1::operator=(), boost::numeric::ublas::coordinate_matrix< T, L, IB, IA, TA >::const_iterator2::operator=(), boost::numeric::ublas::c_matrix< T, N, M >::iterator1::operator=(), boost::numeric::ublas::coordinate_matrix< T, L, IB, IA, TA >::iterator2::operator=(), boost::numeric::ublas::c_matrix< T, N, M >::const_iterator2::operator=(), boost::numeric::ublas::c_matrix< T, N, M >::iterator2::operator=(), boost::container::basic_string< CharT, Traits, Allocator >::pop_back(), boost::container::basic_string< CharT, Traits, Allocator >::push_back(), boost::container::basic_string< CharT, Traits, Allocator >::replace(), boost::icl::separate_interval_set< DomainT, Compare, Interval, Alloc >::separate_interval_set(), boost::icl::split_interval_set< DomainT, Compare, Interval, Alloc >::split_interval_set(), and to_string_helper().

template<typename VertexListGraph , typename AStarHeuristic , typename AStarVisitor , typename PredecessorMap , typename CostMap , typename DistanceMap , typename WeightMap , typename VertexIndexMap , typename ColorMap , typename CompareFunction , typename CombineFunction , typename CostInf , typename CostZero >

void boost::astar_search ( const VertexListGraph &  g, typename graph_traits< VertexListGraph >::vertex_descriptor  s, AStarHeuristic  h, AStarVisitor  vis, PredecessorMap  predecessor, CostMap  cost, DistanceMap  distance, WeightMap  weight, VertexIndexMap  index_map, ColorMap  color, CompareFunction  compare, CombineFunction  combine, CostInf  inf, CostZero  zero  )

inline

References astar_search_no_init(), put(), vertices(), and white().

Referenced by astar_search().

template<typename VertexListGraph , typename AStarHeuristic , typename P , typename T , typename R >

void boost::astar_search	(	const VertexListGraph &	g,
		typename graph_traits< VertexListGraph >::vertex_descriptor	s,
		AStarHeuristic	h,
		const bgl_named_params< P, T, R > &	params
	)

References astar_search(), BOOST_GRAPH_DECLARE_CONVERTED_PARAMETERS, edge_weight, make_astar_visitor(), boost::detail::override_const_property(), vertex_index, and weight_map().

template<typename VertexListGraph , typename AStarHeuristic , typename AStarVisitor , typename PredecessorMap , typename CostMap , typename DistanceMap , typename WeightMap , typename ColorMap , typename VertexIndexMap , typename CompareFunction , typename CombineFunction , typename CostInf , typename CostZero >

void boost::astar_search_no_init ( const VertexListGraph &  g, typename graph_traits< VertexListGraph >::vertex_descriptor  s, AStarHeuristic  h, AStarVisitor  vis, PredecessorMap  predecessor, CostMap  cost, DistanceMap  distance, WeightMap  weight, ColorMap  color, VertexIndexMap  index_map, CompareFunction  compare, CombineFunction  combine, CostInf  , CostZero  zero  )

inline

References breadth_first_visit(), and Vertex.

Referenced by astar_search(), and astar_search_no_init().

template<typename VertexListGraph , typename AStarHeuristic , typename P , typename T , typename R >

void boost::astar_search_no_init	(	const VertexListGraph &	g,
		typename graph_traits< VertexListGraph >::vertex_descriptor	s,
		AStarHeuristic	h,
		const bgl_named_params< P, T, R > &	params
	)

References astar_search_no_init(), BOOST_GRAPH_DECLARE_CONVERTED_PARAMETERS, edge_weight, make_astar_visitor(), boost::detail::override_const_property(), vertex_index, and weight_map().

template<typename VertexListGraph , typename AStarHeuristic , typename AStarVisitor , typename PredecessorMap , typename CostMap , typename DistanceMap , typename WeightMap , typename CompareFunction , typename CombineFunction , typename CostInf , typename CostZero >

void boost::astar_search_no_init_tree ( const VertexListGraph &  g, typename graph_traits< VertexListGraph >::vertex_descriptor  s, AStarHeuristic  h, AStarVisitor  vis, PredecessorMap  predecessor, CostMap  cost, DistanceMap  distance, WeightMap  weight, CompareFunction  compare, CombineFunction  combine, CostInf  , CostZero  zero  )

inline

References BGL_FORALL_OUTEDGES_T, BOOST_THROW_EXCEPTION, boost::iostreams::combine(), compare(), make_function_property_map(), boost::xpressive::make_pair, put(), relax(), target(), and Vertex.

Referenced by astar_search_no_init_tree(), and astar_search_tree().

template<typename VertexListGraph , typename AStarHeuristic , typename P , typename T , typename R >

void boost::astar_search_no_init_tree	(	const VertexListGraph &	g,
		typename graph_traits< VertexListGraph >::vertex_descriptor	s,
		AStarHeuristic	h,
		const bgl_named_params< P, T, R > &	params
	)

References astar_search_no_init_tree(), BOOST_GRAPH_DECLARE_CONVERTED_PARAMETERS, edge_weight, make_astar_visitor(), boost::detail::override_const_property(), and weight_map().

template<typename VertexListGraph , typename AStarHeuristic , typename AStarVisitor , typename PredecessorMap , typename CostMap , typename DistanceMap , typename WeightMap , typename CompareFunction , typename CombineFunction , typename CostInf , typename CostZero >

void boost::astar_search_tree ( const VertexListGraph &  g, typename graph_traits< VertexListGraph >::vertex_descriptor  s, AStarHeuristic  h, AStarVisitor  vis, PredecessorMap  predecessor, CostMap  cost, DistanceMap  distance, WeightMap  weight, CompareFunction  compare, CombineFunction  combine, CostInf  inf, CostZero  zero  )

inline

References astar_search_no_init_tree(), put(), and vertices().

Referenced by astar_search_tree().

template<typename VertexListGraph , typename AStarHeuristic , typename P , typename T , typename R >

void boost::astar_search_tree	(	const VertexListGraph &	g,
		typename graph_traits< VertexListGraph >::vertex_descriptor	s,
		AStarHeuristic	h,
		const bgl_named_params< P, T, R > &	params
	)

References astar_search_tree(), BOOST_GRAPH_DECLARE_CONVERTED_PARAMETERS, edge_weight, make_astar_visitor(), boost::detail::override_const_property(), and weight_map().

template<class F >

unique_future<typename boost::result_of<typename decay<F>::type()>::type> boost::async	(	launch	policy,
		BOOST_THREAD_FWD_REF(F)	f
	)

References async(), boost::future_state::deferred, move(), boost::fusion::move(), and boost::detail::type.

Referenced by async(), and BOOST_SCOPED_ENUM_DECLARE_BEGIN().

template<class F >

unique_future<typename boost::result_of<F()>::type> boost::async

(

BOOST_THREAD_FWD_REF(F)

f

)

References boost::fusion::any(), and async().

Referenced by async(), and boost::detail::shared_state_base::set_async().

template<class T >

bool boost::atomic_compare_exchange	(	shared_ptr< T > *	p,
		shared_ptr< T > *	v,
		shared_ptr< T >	w
	)

Referenced by atomic_compare_exchange_explicit().

template<class T >

bool boost::atomic_compare_exchange_explicit ( shared_ptr< T > *  p, shared_ptr< T > *  v, shared_ptr< T >  w, int  , int    )

inline

References atomic_compare_exchange().

template<class T >

shared_ptr<T> boost::atomic_exchange	(	shared_ptr< T > *	p,
		shared_ptr< T >	r
	)

Referenced by atomic_exchange_explicit().

template<class T >

shared_ptr<T> boost::atomic_exchange_explicit	(	shared_ptr< T > *	p,
		shared_ptr< T >	r,
		int
	)

References atomic_exchange().

template<class T >

bool boost::atomic_is_lock_free ( shared_ptr< T > const *  )

inline

template<class T >

shared_ptr<T> boost::atomic_load

(

shared_ptr< T > const *

p

)

References lock(), and boost::multiprecision::backends::p.

Referenced by atomic_load_explicit().

template<class T >

shared_ptr<T> boost::atomic_load_explicit ( shared_ptr< T > const *  p, int    )

inline

References atomic_load().

template<class T >

void boost::atomic_store	(	shared_ptr< T > *	p,
		shared_ptr< T >	r
	)

References lock().

Referenced by atomic_store_explicit().

template<class T >

void boost::atomic_store_explicit ( shared_ptr< T > *  p, shared_ptr< T >  r, int    )

inline

References atomic_store().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( attractive_force , _t)> boost::attractive_force

(

const PType &

p

)

Referenced by fruchterman_reingold_force_directed_layout().

template<typename T >

T boost::attribute_cast ( attribute const &  attr )

inline

The function casts one attribute factory to another.

References boost::attribute::get_impl(), and T.

template<std::size_t Bits, typename::boost::uint_t< Bits >::fast TruncPoly>

uint_t< Bits >::fast boost::augmented_crc	(	void const *	buffer,
		std::size_t	byte_count,
		typename uint_t< Bits >::fast	initial_remainder
	)

References boost::asio::b, buffer(), and boost::multiprecision::backends::p.

template<std::size_t Bits, typename::boost::uint_t< Bits >::fast TruncPoly>

uint_t< Bits >::fast boost::augmented_crc ( void const *  buffer, std::size_t  byte_count  )

inline

References buffer().

template<typename Graph , typename VertexIndexMap >

double boost::aver_wavefront	(	const Graph &	g,
		VertexIndexMap	index
	)

References boost::asio::b, end, boost::multiprecision::backends::i, ith_wavefront(), num_vertices(), and vertices().

Referenced by aver_wavefront().

template<typename Graph >

double boost::aver_wavefront

(

const Graph &

g

)

References aver_wavefront(), and vertex_index.

template<typename C >

back_move_insert_iterator<C> boost::back_move_inserter ( C &  x )

inline

Returns: back_move_insert_iterator<C>(x).

References boost::flyweights::x.

template<typename Graph , typename VertexIndexMap >

graph_traits<Graph>::vertices_size_type boost::bandwidth	(	const Graph &	g,
		VertexIndexMap	index
	)

References abs(), boost::geometry::math::abs(), boost::asio::b, BOOST_PREVENT_MACRO_SUBSTITUTION, BOOST_USING_STD_MAX, edges(), end, boost::multiprecision::backends::i, boost::accumulators::extract::max, source(), target(), and boost::detail::vertices_size_type.

Referenced by bandwidth().

template<typename Graph >

graph_traits<Graph>::vertices_size_type boost::bandwidth

(

const Graph &

g

)

References bandwidth(), and vertex_index.

template<class EdgeListGraph , class Size , class WeightMap , class PredecessorMap , class DistanceMap , class BinaryFunction , class BinaryPredicate , class BellmanFordVisitor >

bool boost::bellman_ford_shortest_paths	(	EdgeListGraph &	g,
		Size	N,
		WeightMap	weight,
		PredecessorMap	pred,
		DistanceMap	distance,
		BinaryFunction	combine,
		BinaryPredicate	compare,
		BellmanFordVisitor	v
	)

References BOOST_CONCEPT_ASSERT(), boost::iostreams::combine(), compare(), edges(), end, boost::multiprecision::backends::i, N, relax(), source(), target(), and Vertex.

Referenced by boost::detail::bellman_dispatch2(), bellman_ford_shortest_paths(), cycle_canceling(), and johnson_all_pairs_shortest_paths().

template<class EdgeListGraph , class Size , class P , class T , class R >

bool boost::bellman_ford_shortest_paths	(	EdgeListGraph &	g,
		Size	N,
		const bgl_named_params< P, T, R > &	params
	)

References boost::detail::bellman_dispatch(), choose_const_pmap(), choose_pmap(), edge_weight, get_param(), and vertex_distance.

template<class EdgeListGraph , class Size >

bool boost::bellman_ford_shortest_paths	(	EdgeListGraph &	g,
		Size	N
	)

References bellman_ford_shortest_paths().

template<class VertexAndEdgeListGraph , class P , class T , class R >

bool boost::bellman_ford_shortest_paths	(	VertexAndEdgeListGraph &	g,
		const bgl_named_params< P, T, R > &	params
	)

References boost::detail::bellman_dispatch(), BOOST_CONCEPT_ASSERT(), choose_const_pmap(), choose_pmap(), edge_weight, get_param(), num_vertices(), and vertex_distance.

template<typename MutableGraph , typename Done , typename EdgeCentralityMap , typename VertexIndexMap >

void boost::betweenness_centrality_clustering	(	MutableGraph &	g,
		Done	done,
		EdgeCentralityMap	edge_centrality,
		VertexIndexMap	vertex_index
	)

Graph clustering based on edge betweenness centrality.

This algorithm implements graph clustering based on edge betweenness centrality. It is an iterative algorithm, where in each step it compute the edge betweenness centrality (via brandes_betweenness_centrality) and removes the edge with the maximum betweenness centrality. The done function object determines when the algorithm terminates (the edge found when the algorithm terminates will not be removed).

Parameters

g	The graph on which clustering will be performed. The type of this parameter (MutableGraph) must be a model of the VertexListGraph, IncidenceGraph, EdgeListGraph, and Mutable Graph concepts.
done	The function object that indicates termination of the algorithm. It must be a ternary function object thats accepts the maximum centrality, the descriptor of the edge that will be removed, and the graph g.
edge_centrality	(UTIL/OUT) The property map that will store the betweenness centrality for each edge. When the algorithm terminates, it will contain the edge centralities for the graph. The type of this property map must model the ReadWritePropertyMap concept. Defaults to an iterator_property_map whose value type is Done::centrality_type and using get(edge_index, g) for the index map.
vertex_index	(IN) The property map that maps vertices to indices in the range [0, num_vertices(g)). This type of this property map must model the ReadablePropertyMap concept and its value type must be an integral type. Defaults to get(vertex_index, g).

References brandes_betweenness_centrality(), boost::foreach_detail_::done(), edge_centrality_map(), edges(), boost::graph::has_no_edges(), boost::range::max_element(), remove_edge(), vertex_index_map(), and boost::detail::vertices_size_type.

Referenced by betweenness_centrality_clustering().

template<typename MutableGraph , typename Done , typename EdgeCentralityMap >

void boost::betweenness_centrality_clustering	(	MutableGraph &	g,
		Done	done,
		EdgeCentralityMap	edge_centrality
	)

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References betweenness_centrality_clustering(), and vertex_index.

template<typename MutableGraph , typename Done >

void boost::betweenness_centrality_clustering	(	MutableGraph &	g,
		Done	done
	)

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References betweenness_centrality_clustering(), edge_centrality, edge_index, make_iterator_property_map(), num_edges(), and vertex_index.

template<typename Graph , typename ComponentMap , typename OutputIterator , typename DiscoverTimeMap , typename LowPointMap >

std::pair<std::size_t, OutputIterator> boost::biconnected_components	(	const Graph &	g,
		ComponentMap	comp,
		OutputIterator	out,
		DiscoverTimeMap	dtm,
		LowPointMap	lowpt
	)

References boost::detail::bicomp_dispatch3< PredecessorMap >::apply(), and vertex_index.

Referenced by articulation_points(), biconnected_components(), and make_biconnected_planar().

template<typename Graph , typename ComponentMap , typename OutputIterator , typename P , typename T , typename R >

std::pair<std::size_t, OutputIterator> boost::biconnected_components	(	const Graph &	g,
		ComponentMap	comp,
		OutputIterator	out,
		const bgl_named_params< P, T, R > &	params
	)

References boost::detail::bicomp_dispatch1< DiscoverTimeMap >::apply(), choose_const_pmap(), get_param(), vertex_discover_time, and vertex_index.

template<typename Graph , typename ComponentMap , typename OutputIterator >

std::pair<std::size_t, OutputIterator> boost::biconnected_components	(	const Graph &	g,
		ComponentMap	comp,
		OutputIterator	out
	)

References biconnected_components().

template<typename Graph , typename ComponentMap , typename P , typename T , typename R >

std::size_t boost::biconnected_components	(	const Graph &	g,
		ComponentMap	comp,
		const bgl_named_params< P, T, R > &	params
	)

References biconnected_components().

template<typename Graph , typename ComponentMap >

std::size_t boost::biconnected_components	(	const Graph &	g,
		ComponentMap	comp
	)

References biconnected_components().

template<class Iterator , class T >

void boost::bidirectional_readable_iterator_test	(	Iterator	i,
		T	v1,
		T	v2
	)

References BOOST_TEST, forward_readable_iterator_test(), boost::multiprecision::backends::i, and readable_iterator_test().

Referenced by random_access_readable_iterator_test().

template<class R , class F >

_bi::bind_t<R, F, _bi::list0> boost::bind

(

F

f

)

Referenced by boost::gil::copy_and_convert_pixels(), boost::gil::copy_pixels(), boost::statechart::processor_container< fifo_scheduler, typename FifoWorker::work_item, Allocator >::create_processor(), boost::msm::back::state_machine< A0, A1, A2, A3, A4 >::defer_event(), boost::statechart::processor_container< fifo_scheduler, typename FifoWorker::work_item, Allocator >::destroy_processor(), boost::msm::back::state_machine< A0, A1, A2, A3, A4 >::handle_defer_helper< StateType, typename enable_if< typename::boost::msm::back::has_fsm_deferred_events< StateType >::type, int >::type >::do_post_handle_deferred(), boost::msm::back::state_machine< A0, A1, A2, A3, A4 >::do_pre_msg_queue_helper(), boost::numeric::odeint::implicit_euler_mtl4< ValueType, Resizer >::do_step(), boost::numeric::odeint::implicit_euler< ValueType, Resizer >::do_step(), boost::numeric::odeint::explicit_stepper_base< euler< State, Value, Deriv, Time, Algebra, Operations, Resizer >, 1, State, Value, Deriv, Time, Algebra, Operations, Resizer >::do_step(), boost::numeric::odeint::explicit_error_stepper_fsal_base< runge_kutta_dopri5< State, Value, Deriv, Time, Algebra, Operations, Resizer >, 5, 5, 4, State, Value, Deriv, Time, Algebra, Operations, Resizer >::do_step(), boost::numeric::odeint::explicit_error_stepper_base< runge_kutta_cash_karp54_classic< State, Value, Deriv, Time, Algebra, Operations, Resizer >, 5, 5, 4, State, Value, Deriv, Time, Algebra, Operations, Resizer >::do_step(), boost::numeric::odeint::rosenbrock4< Value, Coefficients, Resizer >::do_step(), boost::numeric::odeint::modified_midpoint_dense_out< state_type, value_type, deriv_type, time_type, algebra_type, operations_type, resizer_type >::do_step(), boost::numeric::odeint::modified_midpoint< state_type, value_type, deriv_type, time_type, algebra_type, operations_type, resizer_type >::do_step_impl(), boost::numeric::odeint::runge_kutta4_classic< State, Value, Deriv, Time, Algebra, Operations, Resizer >::do_step_impl(), boost::numeric::odeint::runge_kutta_dopri5< State, Value, Deriv, Time, Algebra, Operations, Resizer >::do_step_impl(), boost::numeric::odeint::runge_kutta_cash_karp54_classic< State, Value, Deriv, Time, Algebra, Operations, Resizer >::do_step_impl(), boost::numeric::odeint::explicit_error_generic_rk< 6, 5, 5, 4, State, Value, Deriv, Time, Algebra, Operations, Resizer >::do_step_impl(), boost::numeric::odeint::explicit_generic_rk< 4, 4, State, Value, Deriv, Time, Algebra, Operations, Resizer >::do_step_impl(), boost::msm::back::state_machine< A0, A1, A2, A3, A4 >::enqueue_event_helper(), boost::gil::equal_pixels(), boost::numeric::odeint::rosenbrock4_dense_output< ControlledStepper >::initialize(), boost::numeric::odeint::dense_output_runge_kutta< Stepper, stepper_tag >::initialize(), boost::numeric::odeint::velocity_verlet< Coor, Velocity, Value, Acceleration, Time, TimeSq, Algebra, Operations, Resizer >::initialize(), boost::numeric::odeint::adams_bashforth< steps, state_type, value_type, deriv_type, time_type, algebra_type, operations_type, resizer_type >::initialize(), boost::numeric::odeint::bulirsch_stoer_dense_out< State, Value, Deriv, Time, Algebra, Operations, Resizer >::initialize(), boost::numeric::odeint::dense_output_runge_kutta< Stepper, explicit_controlled_stepper_fsal_tag >::initialize(), boost::statechart::processor_container< fifo_scheduler, typename FifoWorker::work_item, Allocator >::initiate_processor(), boost::multi_index::detail::sequenced_index< SuperMeta, TagList >::load_(), boost::multi_index::detail::random_access_index< SuperMeta, TagList >::load_(), boost::python::detail::make_iterator(), boost::statechart::processor_container< fifo_scheduler, typename FifoWorker::work_item, Allocator >::queue_event(), boost::detail::shared_state_base::set_wait_callback(), boost::statechart::fifo_worker< Allocator >::terminate(), boost::statechart::processor_container< fifo_scheduler, typename FifoWorker::work_item, Allocator >::terminate_processor(), transitive_closure(), boost::numeric::odeint::rosenbrock4_controller< Stepper >::try_step(), boost::numeric::odeint::bulirsch_stoer< State, Value, Deriv, Time, Algebra, Operations, Resizer >::try_step(), boost::numeric::odeint::controlled_runge_kutta< ErrorStepper, ErrorChecker, Resizer, explicit_error_stepper_tag >::try_step(), and boost::numeric::odeint::controlled_runge_kutta< ErrorStepper, ErrorChecker, Resizer, explicit_error_stepper_fsal_tag >::try_step().

template<class R , class F , class A1 >

_bi::bind_t<R, F, typename _bi::list_av_1<A1>::type> boost::bind	(	F	f,
		A1	a1
	)

template<class R , class F , class A1 , class A2 >

_bi::bind_t<R, F, typename _bi::list_av_2<A1, A2>::type> boost::bind	(	F	f,
		A1	a1,
		A2	a2
	)

template<class R , class F , class A1 , class A2 , class A3 >

_bi::bind_t<R, F, typename _bi::list_av_3<A1, A2, A3>::type> boost::bind	(	F	f,
		A1	a1,
		A2	a2,
		A3	a3
	)

template<class R , class F , class A1 , class A2 , class A3 , class A4 >

_bi::bind_t<R, F, typename _bi::list_av_4<A1, A2, A3, A4>::type> boost::bind	(	F	f,
		A1	a1,
		A2	a2,
		A3	a3,
		A4	a4
	)

template<class R , class F , class A1 , class A2 , class A3 , class A4 , class A5 >

_bi::bind_t<R, F, typename _bi::list_av_5<A1, A2, A3, A4, A5>::type> boost::bind	(	F	f,
		A1	a1,
		A2	a2,
		A3	a3,
		A4	a4,
		A5	a5
	)

template<class R , class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 >

_bi::bind_t<R, F, typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type> boost::bind	(	F	f,
		A1	a1,
		A2	a2,
		A3	a3,
		A4	a4,
		A5	a5,
		A6	a6
	)

template<class R , class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 , class A7 >

_bi::bind_t<R, F, typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type> boost::bind	(	F	f,
		A1	a1,
		A2	a2,
		A3	a3,
		A4	a4,
		A5	a5,
		A6	a6,
		A7	a7
	)

template<class R , class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 , class A7 , class A8 >

_bi::bind_t<R, F, typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type> boost::bind	(	F	f,
		A1	a1,
		A2	a2,
		A3	a3,
		A4	a4,
		A5	a5,
		A6	a6,
		A7	a7,
		A8	a8
	)

template<class R , class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 , class A7 , class A8 , class A9 >

_bi::bind_t<R, F, typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type> boost::bind	(	F	f,
		A1	a1,
		A2	a2,
		A3	a3,
		A4	a4,
		A5	a5,
		A6	a6,
		A7	a7,
		A8	a8,
		A9	a9
	)

template<class R , class F >

_bi::bind_t<R, F, _bi::list0> boost::bind	(	boost::type< R >	,
		F	f
	)

template<class R , class F , class A1 >

_bi::bind_t<R, F, typename _bi::list_av_1<A1>::type> boost::bind	(	boost::type< R >	,
		F	f,
		A1	a1
	)

template<class R , class F , class A1 , class A2 >

_bi::bind_t<R, F, typename _bi::list_av_2<A1, A2>::type> boost::bind	(	boost::type< R >	,
		F	f,
		A1	a1,
		A2	a2
	)

template<class R , class F , class A1 , class A2 , class A3 >

_bi::bind_t<R, F, typename _bi::list_av_3<A1, A2, A3>::type> boost::bind	(	boost::type< R >	,
		F	f,
		A1	a1,
		A2	a2,
		A3	a3
	)

template<class R , class F , class A1 , class A2 , class A3 , class A4 >

_bi::bind_t<R, F, typename _bi::list_av_4<A1, A2, A3, A4>::type> boost::bind	(	boost::type< R >	,
		F	f,
		A1	a1,
		A2	a2,
		A3	a3,
		A4	a4
	)

template<class R , class F , class A1 , class A2 , class A3 , class A4 , class A5 >

_bi::bind_t<R, F, typename _bi::list_av_5<A1, A2, A3, A4, A5>::type> boost::bind	(	boost::type< R >	,
		F	f,
		A1	a1,
		A2	a2,
		A3	a3,
		A4	a4,
		A5	a5
	)

template<class R , class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 >

_bi::bind_t<R, F, typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type> boost::bind	(	boost::type< R >	,
		F	f,
		A1	a1,
		A2	a2,
		A3	a3,
		A4	a4,
		A5	a5,
		A6	a6
	)

template<class R , class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 , class A7 >

_bi::bind_t<R, F, typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type> boost::bind	(	boost::type< R >	,
		F	f,
		A1	a1,
		A2	a2,
		A3	a3,
		A4	a4,
		A5	a5,
		A6	a6,
		A7	a7
	)

template<class R , class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 , class A7 , class A8 >

_bi::bind_t<R, F, typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type> boost::bind	(	boost::type< R >	,
		F	f,
		A1	a1,
		A2	a2,
		A3	a3,
		A4	a4,
		A5	a5,
		A6	a6,
		A7	a7,
		A8	a8
	)

template<class R , class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 , class A7 , class A8 , class A9 >

_bi::bind_t<R, F, typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type> boost::bind	(	boost::type< R >	,
		F	f,
		A1	a1,
		A2	a2,
		A3	a3,
		A4	a4,
		A5	a5,
		A6	a6,
		A7	a7,
		A8	a8,
		A9	a9
	)

template<class F >

_bi::bind_t<_bi::unspecified, F, _bi::list0> boost::bind

(

F

f

)

template<class F , class A1 >

_bi::bind_t<_bi::unspecified, F, typename _bi::list_av_1<A1>::type> boost::bind	(	F	f,
		A1	a1
	)

template<class F , class A1 , class A2 >

_bi::bind_t<_bi::unspecified, F, typename _bi::list_av_2<A1, A2>::type> boost::bind	(	F	f,
		A1	a1,
		A2	a2
	)

template<class F , class A1 , class A2 , class A3 >

_bi::bind_t<_bi::unspecified, F, typename _bi::list_av_3<A1, A2, A3>::type> boost::bind	(	F	f,
		A1	a1,
		A2	a2,
		A3	a3
	)

template<class F , class A1 , class A2 , class A3 , class A4 >

_bi::bind_t<_bi::unspecified, F, typename _bi::list_av_4<A1, A2, A3, A4>::type> boost::bind	(	F	f,
		A1	a1,
		A2	a2,
		A3	a3,
		A4	a4
	)

template<class F , class A1 , class A2 , class A3 , class A4 , class A5 >

_bi::bind_t<_bi::unspecified, F, typename _bi::list_av_5<A1, A2, A3, A4, A5>::type> boost::bind	(	F	f,
		A1	a1,
		A2	a2,
		A3	a3,
		A4	a4,
		A5	a5
	)

template<class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 >

_bi::bind_t<_bi::unspecified, F, typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type> boost::bind	(	F	f,
		A1	a1,
		A2	a2,
		A3	a3,
		A4	a4,
		A5	a5,
		A6	a6
	)

template<class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 , class A7 >

_bi::bind_t<_bi::unspecified, F, typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type> boost::bind	(	F	f,
		A1	a1,
		A2	a2,
		A3	a3,
		A4	a4,
		A5	a5,
		A6	a6,
		A7	a7
	)

template<class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 , class A7 , class A8 >

_bi::bind_t<_bi::unspecified, F, typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type> boost::bind	(	F	f,
		A1	a1,
		A2	a2,
		A3	a3,
		A4	a4,
		A5	a5,
		A6	a6,
		A7	a7,
		A8	a8
	)

template<class F , class A1 , class A2 , class A3 , class A4 , class A5 , class A6 , class A7 , class A8 , class A9 >

_bi::bind_t<_bi::unspecified, F, typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type> boost::bind	(	F	f,
		A1	a1,
		A2	a2,
		A3	a3,
		A4	a4,
		A5	a5,
		A6	a6,
		A7	a7,
		A8	a8,
		A9	a9
	)

template<class A1 , class M , class T >

_bi::bind_t< typename _bi::dm_result< M T::*, A1 >::type, _mfi::dm<M, T>, typename _bi::list_av_1<A1>::type> boost::bind	(	M T::*	f,
		A1	a1
	)

template<typename FunT , typename FirstArgT >

BOOST_FORCEINLINE binder1st< FunT, FirstArgT > boost::bind1st	(	FunT	fun,
		FirstArgT const &	arg
	)

template<typename FunT , typename FirstArgT >

BOOST_FORCEINLINE binder1st< FunT, FirstArgT > boost::bind1st	(	FunT	fun,
		FirstArgT &	arg
	)

template<class Operation >

binder1st<Operation> boost::bind1st ( const Operation &  op, typename call_traits< typename binary_traits< Operation >::first_argument_type >::param_type  x  )

inline

Referenced by boost::unit_test::find_first_not_of(), boost::unit_test::find_last_not_of(), boost::unit_test::find_last_of(), boost::accumulators::detail::make_times2_iterator(), and boost::container::basic_string< CharT, Traits, Allocator >::Not_within_traits< Tr >::operator()().

template<class Operation >

binder1st<Operation> boost::bind1st ( Operation &  op, typename call_traits< typename binary_traits< Operation >::first_argument_type >::param_type  x  )

inline

References boost::flyweights::x.

template<typename FunT , typename SecondArgT >

BOOST_FORCEINLINE binder2nd< FunT, SecondArgT > boost::bind2nd	(	FunT	fun,
		SecondArgT const &	arg
	)

template<typename FunT , typename SecondArgT >

BOOST_FORCEINLINE binder2nd< FunT, SecondArgT > boost::bind2nd	(	FunT	fun,
		SecondArgT &	arg
	)

template<class Operation >

binder2nd<Operation> boost::bind2nd ( const Operation &  op, typename call_traits< typename binary_traits< Operation >::second_argument_type >::param_type  x  )

inline

Referenced by boost::container::basic_string< CharT, Traits, Allocator >::find(), boost::container::basic_string< CharT, Traits, Allocator >::find_first_not_of(), boost::container::basic_string< CharT, Traits, Allocator >::find_last_not_of(), boost::random::uniform_on_sphere< RealType, Cont >::operator()(), boost::multi_index::detail::sequenced_index< SuperMeta, TagList >::remove(), boost::multi_index::detail::random_access_index< SuperMeta, TagList >::remove(), boost::accumulators::impl::tail_variate_means_impl< Sample, Impl, LeftRight, VariateTag >::result(), boost::accumulators::impl::weighted_tail_variate_means_impl< Sample, Weight, Impl, LeftRight, VariateType >::result(), and boost::container::basic_string< CharT, Traits, Allocator >::rfind().

template<class Operation >

binder2nd<Operation> boost::bind2nd ( Operation &  op, typename call_traits< typename binary_traits< Operation >::second_argument_type >::param_type  x  )

inline

References boost::flyweights::x.

template<typename FunT , typename ThirdArgT >

BOOST_FORCEINLINE binder3rd< FunT, ThirdArgT > boost::bind3rd	(	FunT	fun,
		ThirdArgT const &	arg
	)

template<typename FunT , typename ThirdArgT >

BOOST_FORCEINLINE binder3rd< FunT, ThirdArgT > boost::bind3rd	(	FunT	fun,
		ThirdArgT &	arg
	)

template<typename AssigneeT >

BOOST_FORCEINLINE binder1st< assign_fun, AssigneeT& > boost::bind_assign

(

AssigneeT &

assignee

)

template<typename StreamT >

BOOST_FORCEINLINE binder1st< output_fun, StreamT& > boost::bind_output

(

StreamT &

strm

)

Referenced by boost::expressions::aux::message_formatter::operator()(), and operator<<().

template<typename StreamT >

BOOST_FORCEINLINE binder1st< to_log_fun< >, StreamT& > boost::bind_to_log

(

StreamT &

strm

)

template<typename TagT , typename StreamT >

BOOST_FORCEINLINE binder1st< to_log_fun< TagT >, StreamT& > boost::bind_to_log

(

StreamT &

strm

)

default_color_type boost::black ( default_color_type  )

inline

References black_color.

Referenced by boost::detail::copy_graph_impl< 2 >::apply(), breadth_first_visit(), boost::detail::depth_first_visit_impl(), boost::detail::neighbor_bfs_impl(), boost::property_reduce< vertex_color_t >::apply< Color >::operator()(), boost::intrusive::detail::rbtree_node_checker< ValueTraits, NodePtrCompare, ExtraChecker >::operator()(), boost::detail::random_spanning_tree_internal(), sloan_ordering(), boost::graph::st_connected(), boost::graph::distributed::st_connected(), and boost::detail::undir_dfv_impl().

boost::BOOST_concept	(	Buffer	,
		(B)
	)

References BOOST_CONCEPT_ASSERT(), BOOST_CONCEPT_USAGE, ignore_unused_variable_warning(), boost::asio::s, boost::flyweights::t, and boost::detail::type.

boost::BOOST_concept	(	UpdatableQueue	,
		(Q)
	)

References BOOST_CONCEPT_USAGE.

boost::BOOST_concept	(	KeyedUpdatableQueue	,
		(Q)
	)

References BOOST_CONCEPT_ASSERT(), and BOOST_CONCEPT_USAGE.

boost::BOOST_concept	(	Integer	,
		(T)
	)

References BOOST_CONCEPT_USAGE, T, and boost::flyweights::x.

boost::BOOST_concept	(	SignedInteger	,
		(T)
	)

References BOOST_CONCEPT_USAGE, T, and boost::flyweights::x.

boost::BOOST_concept	(	UnsignedInteger	,
		(T)
	)

References BOOST_CONCEPT_USAGE, T, and boost::flyweights::x.

boost::BOOST_concept	(	DefaultConstructible	,
		(TT)
	)

References a, BOOST_CONCEPT_USAGE, and ignore_unused_variable_warning().

boost::BOOST_concept	(	Assignable	,
		(TT)
	)

References a, boost::asio::b, BOOST_CONCEPT_USAGE, ignore_unused_variable_warning(), and boost::flyweights::x.

boost::BOOST_concept	(	CopyConstructible	,
		(TT)
	)

References a, boost::asio::b, BOOST_CONCEPT_USAGE, boost::multiprecision::backends::c, ignore_unused_variable_warning(), and boost::python::ptr().

boost::BOOST_concept	(	SGIAssignable	,
		(TT)
	)

References a, boost::asio::b, BOOST_CONCEPT_USAGE, boost::multiprecision::backends::c, ignore_unused_variable_warning(), and boost::flyweights::x.

boost::BOOST_concept	(	Convertible	,
		(X)(Y)
	)

References BOOST_CONCEPT_USAGE, ignore_unused_variable_warning(), boost::flyweights::x, and boost::polygon::y().

boost::BOOST_concept	(	EqualityComparable	,
		(TT)
	)

References a, boost::asio::b, BOOST_CONCEPT_USAGE, and require_boolean_expr().

boost::BOOST_concept	(	LessThanComparable	,
		(TT)
	)

References a, boost::asio::b, BOOST_CONCEPT_USAGE, and require_boolean_expr().

boost::BOOST_concept	(	Comparable	,
		(TT)
	)

References a, boost::asio::b, BOOST_CONCEPT_USAGE, and require_boolean_expr().

boost::BOOST_concept	(	EqualOp	,
		(First)(Second)
	)

boost::BOOST_concept	(	NotEqualOp	,
		(First)(Second)
	)

boost::BOOST_concept	(	LessThanOp	,
		(First)(Second)
	)

boost::BOOST_concept	(	LessEqualOp	,
		(First)(Second)
	)

boost::BOOST_concept	(	GreaterThanOp	,
		(First)(Second)
	)

boost::BOOST_concept	(	GreaterEqualOp	,
		(First)(Second)
	)

boost::BOOST_concept	(	PlusOp	,
		(Ret)(First)(Second)
	)

boost::BOOST_concept	(	TimesOp	,
		(Ret)(First)(Second)
	)

boost::BOOST_concept	(	DivideOp	,
		(Ret)(First)(Second)
	)

boost::BOOST_concept	(	SubtractOp	,
		(Ret)(First)(Second)
	)

boost::BOOST_concept	(	ModOp	,
		(Ret)(First)(Second)
	)

boost::BOOST_concept	(	Generator	,
		(Func)(Return)
	)

References BOOST_CONCEPT_USAGE, ignore_unused_variable_warning(), and boost::spirit::x3::testing::test().

boost::BOOST_concept	(	UnaryFunction	,
		(Func)(Return)(Arg)
	)

References BOOST_CONCEPT_USAGE, ignore_unused_variable_warning(), and boost::spirit::x3::testing::test().

boost::BOOST_concept	(	BinaryFunction	,
		(Func)(Return)(First)(Second)
	)

References BOOST_CONCEPT_USAGE, boost::xpressive::first, boost::locale::period::marks::second, boost::spirit::x3::testing::test(), and boost::detail::void.

boost::BOOST_concept	(	UnaryPredicate	,
		(Func)(Arg)
	)

References BOOST_CONCEPT_USAGE, and require_boolean_expr().

boost::BOOST_concept	(	BinaryPredicate	,
		(Func)(First)(Second)
	)

References a, boost::asio::b, BOOST_CONCEPT_USAGE, and require_boolean_expr().

boost::BOOST_concept	(	Const_BinaryPredicate	,
		(Func)(First)(Second)
	)

References a, boost::asio::b, BOOST_CONCEPT_USAGE, and require_boolean_expr().

boost::BOOST_concept	(	AdaptableGenerator	,
		(Func)(Return)
	)

References BOOST_CONCEPT_ASSERT(), and BOOST_CONCEPT_USAGE.

boost::BOOST_concept	(	AdaptableUnaryFunction	,
		(Func)(Return)(Arg)
	)

References BOOST_CONCEPT_ASSERT().

boost::BOOST_concept	(	AdaptableBinaryFunction	,
		(Func)(Return)(First)(Second)
	)

References BOOST_CONCEPT_ASSERT().

boost::BOOST_concept	(	AdaptablePredicate	,
		(Func)(Arg)
	)

boost::BOOST_concept	(	AdaptableBinaryPredicate	,
		(Func)(First)(Second)
	)

boost::BOOST_concept	(	InputIterator	,
		(TT)
	)

References BOOST_CONCEPT_ASSERT(), BOOST_CONCEPT_USAGE, boost::multiprecision::backends::i, and boost::detail::void.

boost::BOOST_concept	(	OutputIterator	,
		(TT)(ValueT)
	)

References BOOST_CONCEPT_USAGE, boost::multiprecision::backends::i, and boost::flyweights::t.

boost::BOOST_concept	(	ForwardIterator	,
		(TT)
	)

References BOOST_CONCEPT_ASSERT(), BOOST_CONCEPT_USAGE, BOOST_DEDUCED_TYPENAME, boost::multiprecision::backends::i, and ignore_unused_variable_warning().

boost::BOOST_concept	(	Mutable_ForwardIterator	,
		(TT)
	)

References BOOST_CONCEPT_USAGE, and boost::multiprecision::backends::i.

boost::BOOST_concept	(	BidirectionalIterator	,
		(TT)
	)

References BOOST_CONCEPT_ASSERT(), BOOST_CONCEPT_USAGE, BOOST_DEDUCED_TYPENAME, and boost::multiprecision::backends::i.

boost::BOOST_concept	(	Mutable_BidirectionalIterator	,
		(TT)
	)

References BOOST_CONCEPT_USAGE, and boost::multiprecision::backends::i.

boost::BOOST_concept	(	RandomAccessIterator	,
		(TT)
	)

References a, boost::asio::b, BOOST_CONCEPT_ASSERT(), BOOST_CONCEPT_USAGE, BOOST_DEDUCED_TYPENAME, boost::multiprecision::backends::i, n, and boost::detail::void.

boost::BOOST_concept	(	Mutable_RandomAccessIterator	,
		(TT)
	)

References BOOST_CONCEPT_USAGE, boost::multiprecision::backends::i, and n.

boost::BOOST_concept	(	Container	,
		(C)
	)

References boost::asio::b, BOOST_CONCEPT_ASSERT(), BOOST_CONCEPT_USAGE, boost::multiprecision::backends::c, boost::multiprecision::backends::i, and n.

boost::BOOST_concept	(	Mutable_Container	,
		(C)
	)

References BOOST_CONCEPT_ASSERT(), BOOST_CONCEPT_USAGE, boost::multiprecision::backends::c, and boost::multiprecision::backends::i.

boost::BOOST_concept	(	ForwardContainer	,
		(C)
	)

References BOOST_CONCEPT_ASSERT(), and BOOST_CONCEPT_USAGE.

boost::BOOST_concept	(	Mutable_ForwardContainer	,
		(C)
	)

References BOOST_CONCEPT_ASSERT(), and BOOST_CONCEPT_USAGE.

boost::BOOST_concept	(	ReversibleContainer	,
		(C)
	)

References BOOST_CONCEPT_ASSERT(), BOOST_CONCEPT_USAGE, boost::multiprecision::backends::c, and boost::multiprecision::backends::i.

boost::BOOST_concept	(	Mutable_ReversibleContainer	,
		(C)
	)

References BOOST_CONCEPT_ASSERT(), BOOST_CONCEPT_USAGE, boost::multiprecision::backends::c, and boost::multiprecision::backends::i.

boost::BOOST_concept	(	RandomAccessContainer	,
		(C)
	)

References BOOST_CONCEPT_ASSERT(), BOOST_CONCEPT_USAGE, boost::multiprecision::backends::c, ignore_unused_variable_warning(), and n.

boost::BOOST_concept	(	Mutable_RandomAccessContainer	,
		(C)
	)

References BOOST_CONCEPT_ASSERT(), BOOST_CONCEPT_USAGE, boost::multiprecision::backends::c, boost::multiprecision::backends::i, and ignore_unused_variable_warning().

boost::BOOST_concept	(	Sequence	,
		(S)
	)

References BOOST_CONCEPT_USAGE, boost::multiprecision::backends::c, boost::xpressive::first, ignore_unused_variable_warning(), last, n, boost::multiprecision::backends::p, and boost::flyweights::t.

boost::BOOST_concept	(	FrontInsertionSequence	,
		(S)
	)

References BOOST_CONCEPT_USAGE, boost::multiprecision::backends::c, and boost::flyweights::t.

boost::BOOST_concept	(	BackInsertionSequence	,
		(S)
	)

References BOOST_CONCEPT_USAGE, boost::multiprecision::backends::c, ignore_unused_variable_warning(), and boost::flyweights::t.

boost::BOOST_concept	(	AssociativeContainer	,
		(C)
	)

References BOOST_CONCEPT_ASSERT(), BOOST_CONCEPT_USAGE, boost::multiprecision::backends::c, boost::multiprecision::backends::i, and n.

boost::BOOST_concept	(	UniqueAssociativeContainer	,
		(C)
	)

References BOOST_CONCEPT_USAGE, boost::multiprecision::backends::c, boost::xpressive::first, ignore_unused_variable_warning(), last, and boost::flyweights::t.

boost::BOOST_concept	(	MultipleAssociativeContainer	,
		(C)
	)

References BOOST_CONCEPT_USAGE, boost::multiprecision::backends::c, boost::xpressive::first, ignore_unused_variable_warning(), last, and boost::flyweights::t.

boost::BOOST_concept	(	SimpleAssociativeContainer	,
		(C)
	)

References BOOST_CONCEPT_USAGE, and BOOST_MPL_ASSERT.

boost::BOOST_concept	(	PairAssociativeContainer	,
		(C)
	)

References BOOST_CONCEPT_USAGE, and BOOST_MPL_ASSERT.

boost::BOOST_concept	(	SortedAssociativeContainer	,
		(C)
	)

References BOOST_CONCEPT_USAGE, boost::multiprecision::backends::c, boost::xpressive::first, ignore_unused_variable_warning(), last, boost::multiprecision::backends::p, and boost::flyweights::t.

boost::BOOST_concept	(	Collection	,
		(C)
	)

References boost::asio::b, BOOST_CONCEPT_USAGE, boost::multiprecision::backends::c, boost::multiprecision::backends::i, and n.

boost::BOOST_CONCEPT_ASSERT

(

(Convertible< order_size_type, edges_size_type >)

)

Referenced by boost::geometry::add_point(), boost::geometry::add_value(), all_closeness_centralities(), all_clustering_coefficients(), boost::detail::all_cycles_from_vertex(), all_degree_centralities(), all_eccentricities(), all_mean_geodesics(), boost::geometry::strategy::distance::cross_track_point_box< CalculationType, Strategy >::apply(), boost::geometry::detail::area::ring_area< order_as_direction< geometry::point_order< Ring >::value >::value, geometry::closure< Ring >::value >::apply(), boost::geometry::strategy::distance::cross_track< CalculationType, Strategy >::apply(), boost::geometry::strategy::distance::comparable::pythagoras< CalculationType >::apply(), boost::geometry::strategy::intersection::relate_cartesian_segments< Policy, CalculationType >::apply(), boost::geometry::strategy::distance::comparable::pythagoras_point_box< CalculationType >::apply(), boost::geometry::strategy::distance::comparable::pythagoras_box_box< CalculationType >::apply(), boost::geometry::resolve_strategy::convex_hull::apply(), boost::geometry::resolve_strategy::convex_hull_insert::apply(), boost::geometry::resolve_strategy::simplify::apply(), boost::geometry::resolve_strategy::simplify_insert::apply(), boost::geometry::assign_point(), boost::geometry::assign_value(), bellman_ford_shortest_paths(), boost::detail::biconnected_components_impl(), boost::concepts::BOOST_concept(), BOOST_concept(), boost::heap::PriorityQueue< C >::BOOST_CONCEPT_USAGE(), boost::heap::MutablePriorityQueue< C >::BOOST_CONCEPT_USAGE(), boykov_kolmogorov_max_flow(), breadth_first_visit(), bron_kerbosch_all_cliques(), boost::detail::can_extend_path(), boost::detail::can_wrap_path(), boost::icl::closed_interval< DomainT, Compare >::closed_interval(), closeness_centrality(), connected_components(), boost::NeighborBFSVisitorConcept< Visitor, Graph >::constraints(), boost::BFSVisitorConcept< Visitor, Graph >::constraints(), boost::DFSVisitorConcept< Visitor, Graph >::constraints(), boost::AStarHeuristicConcept< Heuristic, Graph >::constraints(), boost::BellmanFordVisitorConcept< Visitor, Graph >::constraints(), boost::DistributedVertexListGraphConcept< G >::constraints(), boost::CoreNumbersVisitorConcept< Visitor, Graph >::constraints(), boost::AStarVisitorConcept< Visitor, Graph >::constraints(), boost::DijkstraVisitorConcept< Visitor, Graph >::constraints(), boost::DistributedEdgeListGraphConcept< G >::constraints(), boost::icl::continuous_interval< DomainT, Compare >::continuous_interval(), boost::detail::count_edges(), degree_centrality(), depth_first_search(), boost::detail::depth_first_visit_impl(), boost::geometry::detail::determinant(), boost::icl::discrete_interval< DomainT, Compare >::discrete_interval(), boost::geometry::divide_point(), boost::geometry::divide_value(), boost::geometry::dot_product(), eccentricity(), boost::detail::exhaust_paths(), boost::detail::extend_clique(), boost::detail::extend_path(), boost::detail::filter_unconnected_vertices(), boost::algorithm::find_format(), boost::algorithm::find_format_all(), boost::algorithm::find_format_all_copy(), boost::algorithm::find_format_copy(), floyd_warshall_all_pairs_shortest_paths(), floyd_warshall_initialized_all_pairs_shortest_paths(), boost::geometry::for_each_coordinate(), function_requires(), boost::externally_locked< T &, MutexType >::get(), boost::heap::heap_merge(), boost::graph::distributed::hohberg_biconnected_components(), boost::icl::interval_base_map< interval_map< DomainT, CodomainT, Traits, Compare, Combine, Section, Interval, Alloc >, DomainT, CodomainT, Traits, Compare, Combine, Section, Interval, Alloc >::interval_base_map(), boost::icl::interval_base_set< split_interval_set< DomainT, Compare, Interval, Alloc >, DomainT, Compare, Interval, Alloc >::interval_base_set(), boost::range::iota(), isomorphism(), boost::algorithm::iter_find(), boost::algorithm::iter_split(), iterative_bit_vector_dominator_tree(), johnson_all_pairs_shortest_paths(), kosaraju_strong_components(), boost::detail::kruskal_mst_impl(), boost::icl::left_open_interval< DomainT, Compare >::left_open_interval(), lengauer_tarjan_dominator_tree(), lengauer_tarjan_dominator_tree_without_dfs(), boost::icl::map< DomainT, CodomainT, Traits, Compare, Combine, Section, Alloc >::map(), maximum_adjacency_search(), mean_clustering_coefficient(), mean_geodesic(), metric_tsp_approx_from_vertex(), boost::geometry::multiply_point(), boost::geometry::multiply_value(), boost::detail::neighbor_bfs_impl(), num_paths_through_vertex(), num_triangles_on_vertex(), boost::icl::open_interval< DomainT, Compare >::open_interval(), boost::closeness_measure< Graph, DistanceType, ResultType, Reciprocal >::operator()(), boost::mean_geodesic_measure< Graph, DistanceType, ResultType, Divides >::operator()(), boost::influence_measure< Graph >::operator()(), boost::prestige_measure< Graph >::operator()(), boost::mean_graph_distance_measure< Graph, DistanceType >::operator()(), boost::detail::optimum_cycle_ratio(), boost::spirit::qi::parse(), boost::spirit::x3::parse_main(), boost::spirit::qi::phrase_parse(), boost::spirit::x3::phrase_parse_main(), boost::detail::possible_edges(), radius_and_diameter(), boost::icl::right_open_interval< DomainT, Compare >::right_open_interval(), small_world_distance(), stoer_wagner_min_cut(), boost::detail::strong_components_impl(), boost::geometry::subtract_point(), boost::geometry::subtract_value(), tiernan_all_cycles(), transitive_closure(), boost::detail::undir_dfv_impl(), undirected_dfs(), verify_vf2_subgraph_iso(), vf2_graph_iso(), boost::detail::vf2_subgraph_morphism(), boost::tsp_tour_visitor< OutItr >::visit_vertex(), warren_transitive_closure(), warshall_transitive_closure(), and write_graphviz().

boost::BOOST_CONCEPT_ASSERT

(

(Convertible< seq_size_type, edges_size_type >)

)

template<typename Graph , typename GraphTR , typename G_to_TR_VertexMap , typename VertexIndexMap >

boost::BOOST_CONCEPT_REQUIRES	(	((VertexListGraphConcept< Graph >))((IncidenceGraphConcept< Graph >))((MutableGraphConcept< GraphTR >))((ReadablePropertyMapConcept< VertexIndexMap,typename graph_traits< Graph >::vertex_descriptor >))((Integer< typenameproperty_traits< VertexIndexMap >::value_type >))((LvaluePropertyMapConcept< G_to_TR_VertexMap,typename graph_traits< Graph >::vertex_descriptor >))	,
		(void)
	)		const

template<typename Graph , typename Order , typename Func , typename Seq >

boost::BOOST_CONCEPT_REQUIRES	(	((RandomAccessContainer< Order >))((IncidenceGraphConcept< Graph >))((UnaryFunction< Func, void, Seq >))((Mutable_RandomAccessContainer< Seq >))((VertexAndEdgeListGraphConcept< Graph >))	,
		(void)
	)		const

template<typename Graph , typename Func , typename Seq >

boost::BOOST_CONCEPT_REQUIRES	(	((IncidenceGraphConcept< Graph >))((EdgeListGraphConcept< Graph >))	,
		(void)
	)		const

boost::BOOST_INSTALL_PROPERTY	(	edge	,
		target_processor_id
	)

boost::BOOST_INSTALL_PROPERTY	(	edge	,
		locally_owned
	)

boost::BOOST_INSTALL_PROPERTY	(	vertex	,
		in_edges
	)

boost::BOOST_INSTALL_PROPERTY	(	edge	,
		attribute
	)

boost::BOOST_INSTALL_PROPERTY	(	vertex	,
		attribute
	)

boost::BOOST_INSTALL_PROPERTY	(	graph	,
		graph_attribute
	)

boost::BOOST_INSTALL_PROPERTY	(	graph	,
		vertex_attribute
	)

boost::BOOST_INSTALL_PROPERTY	(	graph	,
		edge_attribute
	)

template<typename R , BOOST_SIGNALS_TEMPLATE_PARMS typename Combiner = last_value<R>, typename Group = int, typename GroupCompare = std::less<Group>, typename SlotFunction = BOOST_JOIN(function,BOOST_SIGNALS_NUM_ARGS)< R BOOST_SIGNALS_TEMPLATE_ARGS>>

BOOST_SIGNALS_TEMPLATE_ARGS SlotFunction::result_type boost::BOOST_JOIN	(	signal	,
		BOOST_SIGNALS_NUM_ARGS
	)

References boost::xpressive::at, BOOST_SIGNALS_ARG_TYPES, BOOST_SIGNALS_COMMA_IF_NONZERO_ARGS, BOOST_SIGNALS_PARMS, BOOST_SIGNALS_SIGNAL, BOOST_SIGNALS_TEMPLATE_ARGS, boost::multiprecision::backends::c, Combiner, boost::asio::connect(), boost::io::group(), GroupCompare, boost::multiprecision::backends::i, operator()(), boost::asio::s, T, boost::flyweights::t, template, boost::detail::type, unsafe_any_cast(), and boost::program_options::value().

template<typename R , BOOST_SIGNALS_TEMPLATE_PARMS typename Combiner, typename Group , typename GroupCompare , typename SlotFunction >

BOOST_SIGNALS_NAMESPACE::connection boost::BOOST_JOIN	(	signal	,
		BOOST_SIGNALS_NUM_ARGS
	)

template<typename R , BOOST_SIGNALS_TEMPLATE_PARMS typename Combiner, typename Group , typename GroupCompare , typename SlotFunction >

boost::BOOST_JOIN	(	signal	,
		BOOST_SIGNALS_NUM_ARGS
	)

boost::BOOST_JOIN	(	function	,
		BOOST_FUNCTION_NUM_ARGS
	)

boost::BOOST_PP_REPEAT	(	BOOST_FUNCTION_NUM_ARGS	,
		BOOST_FUNCTION_ARG_TYPE	,
		BOOST_PP_EMPTY
	)

BOOST_REGEX_DECL void boost::boost_regex_free_static_mutex

(

)

boost::BOOST_SCOPED_ENUM_DECLARE_BEGIN

(

cv_status

)

boost::BOOST_SCOPED_ENUM_DECLARE_BEGIN

(

future_errc

)

boost::BOOST_SCOPED_ENUM_DECLARE_BEGIN

(

launch

)

References async(), boost::future_state::deferred, and none.

boost::BOOST_SCOPED_ENUM_DECLARE_BEGIN

(

future_status

)

References boost::future_state::deferred, and boost::future_state::ready.

boost::BOOST_STATIC_ASSERT

(

(!boost::is_void< ptr_serialize_type >::value)

)

boost::BOOST_STATIC_ASSERT

(

(is_same< order_value_type, edge_descriptor >::value)

)

Referenced by boost::container::adaptive_pool< T, BOOST_CONTAINER_DOCONLY, BOOST_CONTAINER_DOCONLY, BOOST_CONTAINER_DOCONLY >::allocate_many(), boost::geometry::detail::touches::box_box::apply(), boost::arg< I >::arg(), boost::iostreams::detail::array_adapter< Mode, Ch >::array_adapter(), boost::geometry::assert_dimension(), boost::geometry::assert_dimension_equal(), boost::geometry::assert_dimension_greater_equal(), boost::geometry::assert_dimension_less_equal(), boost::ptr_array< T, N, CloneAllocator >::at(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::back(), boost::intrusive::sgtree_impl< ValueTraits, Compare, SizeType, FloatingPoint, HeaderHolder >::balance_factor(), boost::serialization::base_object(), boost::math::binomial_coefficient(), boost::gil::bit_aligned_pixel_reference< BitField, ChannelBitSizes, Layout, IsMutable >::bit_aligned_pixel_reference(), boost::concepts::BOOST_concept(), boost::lambda::detail::return_or_throw_phase2< is_conversion >::call(), boost::serialization::smart_cast_impl::error< T >::cast(), boost::lambda::catch_all(), boost::math::detail::cbrt_imp(), boost::spirit::ch_p(), boost::iterators::lvalue_test< is_pointer >::check(), circle_graph_layout(), boost::statechart::state_machine< MostDerived, InitialState, Allocator, ExceptionTranslator >::clear_deep_history(), boost::statechart::state_machine< MostDerived, InitialState, Allocator, ExceptionTranslator >::clear_shallow_history(), boost::iostreams::device< Mode, Ch >::close(), boost::iostreams::filter< Mode, Ch >::close(), boost::iostreams::detail::composite_device< Filter, Device, Mode >::close(), boost::icl::closed_interval< DomainT, Compare >::closed_interval(), connected_components(), constant_lvalue_iterator_test(), boost::gil::SameType< T, U >::constraints(), boost::gil::Point2DConcept< P >::constraints(), boost::BaseRegexConcept< Regex >::constraints(), boost::gil::ColorSpacesCompatibleConcept< Cs1, Cs2 >::constraints(), boost::gil::ChannelsCompatibleConcept< T1, T2 >::constraints(), boost::gil::HomogeneousColorBaseConcept< ColorBase >::constraints(), boost::gil::ColorBasesCompatibleConcept< ColorBase1, ColorBase2 >::constraints(), boost::gil::PixelConcept< P >::constraints(), boost::gil::MutablePixelConcept< P >::constraints(), boost::gil::HomogeneousPixelValueConcept< P >::constraints(), boost::gil::PixelsCompatibleConcept< P1, P2 >::constraints(), boost::gil::IteratorAdaptorConcept< Iterator >::constraints(), boost::gil::RandomAccessNDLocatorConcept< Loc >::constraints(), boost::gil::RandomAccess2DLocatorConcept< Loc >::constraints(), boost::gil::PixelLocatorConcept< Loc >::constraints(), boost::gil::RandomAccessNDImageViewConcept< View >::constraints(), boost::gil::RandomAccess2DImageViewConcept< View >::constraints(), boost::gil::ImageViewConcept< View >::constraints(), boost::gil::ViewsCompatibleConcept< V1, V2 >::constraints(), boost::gil::ImageConcept< Img >::constraints(), boost::icl::static_interval< IntervalT, false, PretendedBounds, RepresentedBounds >::construct(), boost::optional_detail::optional_base< T >::construct(), boost::icl::continuous_interval< DomainT, Compare >::continuous_interval(), boost::math::constants::detail::convert_from_string(), boost::fusion::copy(), boost::iostreams::detail::copy_impl(), boost::heap::d_ary_heap< T, A0, A1, A2, A3, A4, A5 >::decrease(), boost::heap::skew_heap< T, A0, A1, A2, A3, A4, A5, A6 >::decrease(), boost::movelib::default_delete< T >::default_delete(), boost::math::tools::digits(), boost::math::policies::detail::digits_imp(), boost::icl::discrete_interval< DomainT, Compare >::discrete_interval(), boost::hypercube_topology< 3, RandomNumberGenerator >::distance_from_boundary(), boost::math::double_factorial(), boost::heap::skew_heap< T, A0, A1, A2, A3, A4, A5, A6 >::erase(), boost::heap::d_ary_heap< T, A0, A1, A2, A3, A4, A5 >::erase(), boost::math::factorial(), boost::math::detail::falling_factorial_imp(), boost::iterators::filter_iterator< Predicate, Iterator >::filter_iterator(), boost::math::find_location(), boost::math::find_scale(), boost::container::flat_map< Key, T, Compare, Allocator >::flat_map(), boost::container::flat_multimap< Key, T, Compare, Allocator >::flat_multimap(), forward(), boost::fusion::get(), boost::geometry::model::point< CoordinateType, 2, CoordinateSystem >::get(), boost::externally_locked< Stream &, RecursiveMutex >::get(), boost::externally_locked< T &, MutexType >::get(), boost::multi_index::get(), boost::spirit::get_action_subject(), boost::spirit::get_binary_left_subject(), boost::spirit::get_binary_right_subject(), boost::math::policies::detail::get_epsilon_imp(), boost::spirit::get_semantic_action(), boost::spirit::grammar_def< T, >::get_start_parser(), boost::spirit::get_unary_subject(), boost::BaseRegexConcept< Regex >::global_constraints(), boost::heap::heap_merge(), boost::graph::distributed::hohberg_biconnected_components(), boost::heap::d_ary_heap< T, A0, A1, A2, A3, A4, A5 >::increase(), boost::heap::skew_heap< T, A0, A1, A2, A3, A4, A5, A6 >::increase(), boost::intrusive::hashtable_impl< ValueTraits, Hash, Equal, SizeType, BucketTraits, BoolFlags >::incremental_rehash(), boost::iostreams::detail::array_adapter< Mode, Ch >::input_sequence(), boost::gil::interleaved_view_get_raw_data(), boost::ptr_array< T, N, CloneAllocator >::is_null(), isomorphism(), boost::gil::jpeg_read_image(), boost::gil::jpeg_read_view(), boost::gil::jpeg_write_view(), kamada_kawai_spring_layout(), boost::math::kurtosis(), boost::math::kurtosis_excess(), boost::icl::left_open_interval< DomainT, Compare >::left_open_interval(), boost::serialization::load(), boost::archive::basic_text_iprimitive< std::wistream >::load(), boost::math::tools::detail::log_max_value(), boost::math::tools::log_max_value(), boost::math::tools::detail::log_min_value(), boost::math::tools::log_min_value(), boost::container::map< const sync_id *, umap_type::iterator, address_less >::map(), boost::math::tools::max_value(), boost::math::mean(), boost::math::tools::min_value(), boost::fusion::move(), move_if_not_lvalue_reference(), boost::container::multimap< Key, T, Compare, Allocator, MultiMapOptions >::multimap(), boost::detail::name_once_mutex(), boost::match_results< BidirectionalIterator >::named_subexpression(), boost::match_results< BidirectionalIterator >::named_subexpression_index(), non_const_lvalue_iterator_test(), boost::icl::open_interval< DomainT, Compare >::open_interval(), boost::tuples::operator!=(), boost::archive::iterators::detail::to_6_bit< CharType >::operator()(), boost::python::objects::register_base_of< Derived >::operator()(), boost::algorithm::knuth_morris_pratt< patIter >::operator()(), boost::algorithm::boyer_moore_horspool< patIter, traits >::operator()(), boost::algorithm::boyer_moore< patIter, traits >::operator()(), boost::wave::grammars::impl::compose_character_literal::operator()(), boost::void_ptr_indirect_fun< Fun, Arg1, Arg2 >::operator()(), boost::test_tools::check_is_close_t::operator()(), boost::numeric::ublas::vector_unary< E, F >::operator()(), boost::multi_index::composite_key_equal_to<>::operator()(), boost::multi_index::composite_key_compare<>::operator()(), boost::multi_index::composite_key_hash<>::operator()(), boost::numeric::ublas::matrix_unary2< E, F >::operator()(), boost::units::quantity< Unit, Y >::operator*=(), boost::units::operator+(), boost::spirit::case_parser< 0x15F97A7, epsilon_parser, true >::operator,(), boost::units::operator-(), boost::units::quantity< Unit, Y >::operator/=(), boost::tuples::operator<(), boost::tuples::operator<=(), boost::initialized< T >::operator=(), boost::units::quantity< Unit, Y >::operator=(), boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y >::operator=(), boost::tuples::operator==(), boost::multi_index::operator==(), boost::tuples::operator>(), boost::tuples::operator>=(), boost::match_results< BidirectionalIterator >::operator[](), boost::numeric::ublas::vector_unary< E, F >::operator[](), boost::iostreams::operator|(), boost::detail::optimum_cycle_ratio(), boost::numeric::ublas::outer_prod(), boost::iostreams::detail::array_adapter< Mode, Ch >::output_sequence(), boost::gil::packed_pixel< BitField, ChannelRefVec, Layout >::packed_pixel(), boost::spirit::rxstrlit< CharT >::parse(), boost::gil::planar_view_get_raw_data(), boost::gil::png_read_image(), boost::gil::png_read_view(), boost::gil::png_write_view(), boost::python::return_arg< 1, Base >::postcall(), boost::numeric::ublas::prec_prod(), boost::numeric::ublas::prod(), boost::multi_index::project(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::push_back(), boost::units::quantity< Unit, Y >::quantity(), boost::lockfree::queue< T, A0, A1, A2 >::queue(), boost::math::policies::detail::raise_rounding_error(), boost::iostreams::tee_device< Device, Sink >::read(), readable_iterator_test(), boost::intrusive::bstree_impl< ValueTraits, Compare, SizeType, ConstantTimeSize, RbTreeAlgorithms, HeaderHolder >::remove_node(), boost::ptr_array< T, N, CloneAllocator >::replace(), boost::interprocess::shared_ptr< T, VoidAllocator, Deleter >::reset(), boost::icl::right_open_interval< DomainT, Compare >::right_open_interval(), boost::math::detail::rising_factorial_imp(), boost::heap::d_ary_heap< T, A0, A1, A2, A3, A4, A5 >::s_handle_from_iterator(), boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::s_iterator_to(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::s_iterator_to(), boost::intrusive::hashtable_impl< ValueTraits, Hash, Equal, SizeType, BucketTraits, BoolFlags >::s_local_iterator_to(), boost::serialization::save(), boost::archive::basic_text_oprimitive< std::wostream >::save(), boost::serialization::serialize(), boost::geometry::model::point< CoordinateType, 2, CoordinateSystem >::set(), boost::spirit::lex::lexertl::detail::data< Iterator, mpl::false_, mpl::false_, TokenValue >::set_state_name(), boost::spirit::lex::lexertl::detail::static_data< Iterator, mpl::false_, mpl::false_, TokenValue >::set_state_name(), boost::interprocess::shared_ptr< T, VoidAllocator, Deleter >::shared_ptr(), boost::math::skewness(), boost::iostreams::skip(), boost::intrusive::hashtable_impl< ValueTraits, Hash, Equal, SizeType, BucketTraits, BoolFlags >::split_count(), boost::lockfree::spsc_queue< T, A0, A1 >::spsc_queue(), strong_components(), boost::gil::tiff_read_image(), boost::gil::tiff_read_view(), boost::gil::tiff_write_view(), boost::iterators::transform_iterator< UnaryFunc, Iterator, Reference, Value >::transform_iterator(), boost::graph::distributed::tsin_depth_first_visit(), boost::movelib::unique_ptr< T, D >::unique_ptr(), boost::heap::d_ary_heap< T, A0, A1, A2, A3, A4, A5 >::update(), boost::heap::skew_heap< T, A0, A1, A2, A3, A4, A5, A6 >::update(), boost::math::variance(), vf2_graph_iso(), boost::detail::vf2_subgraph_morphism(), and boost::iostreams::tee_device< Device, Sink >::write().

boost::BOOST_STATIC_ASSERT

(

(is_same< seq_value_type, bool >::value)

)

boost::BOOST_STATIC_ASSERT

(

(is_same< directed_category, undirected_tag >::value)

)

boost::BOOST_STATIC_CONSTANT	(	int	,
		args	= BOOST_FUNCTION_NUM_ARGS
	)

Referenced by boost::assign_detail::converter< generic_ptr_list< T >, BOOST_DEDUCED_TYPENAME boost::ptr_vector< T >::iterator >::convert_to_container(), boost::msm::back::state_machine< A0, A1, A2, A3, A4 >::row_< ROW >::execute(), boost::msm::back::state_machine< A0, A1, A2, A3, A4 >::g_row_< ROW >::execute(), boost::msm::back::state_machine< A0, A1, A2, A3, A4 >::a_row_< ROW >::execute(), boost::msm::back::state_machine< A0, A1, A2, A3, A4 >::_row_< ROW >::execute(), boost::msm::back::state_machine< A0, A1, A2, A3, A4 >::irow_< ROW >::execute(), boost::msm::back::state_machine< A0, A1, A2, A3, A4 >::g_irow_< ROW >::execute(), boost::msm::back::state_machine< A0, A1, A2, A3, A4 >::a_irow_< ROW >::execute(), boost::msm::back::state_machine< A0, A1, A2, A3, A4 >::_irow_< ROW >::execute(), get(), boost::msm::back::state_machine< A0, A1, A2, A3, A4 >::get_state_id_helper::operator()(), put(), boost::multiprecision::backends::subtract_unsigned(), and write_graphml().

boost::BOOST_STATIC_CONSTANT	(	int	,
		arity	= BOOST_FUNCTION_NUM_ARGS
	)

boost::BOOST_TEMPLATED_STREAM ( ostream  , E  , T    )

inline

boost::BOOST_THREAD_DCL_MOVABLE_BEG

(

Mutex

)

References BOOST_ASSERT, BOOST_NOEXCEPT, is_locked_by_this_thread(), lock(), move(), boost::system::errc::operation_not_permitted, operator!(), boost::multiprecision::backends::operator=(), boost::spirit::x3::unicode::other, boost::system::errc::resource_deadlock_would_occur, swap, boost::flyweights::t, throw_exception(), try_lock(), and boost::detail::void.

boost::BOOST_THREAD_DCL_MOVABLE_BEG

(

T

)

Copy construction from a shared_future

Copy construction from a shared_future

References BOOST_CONSTEXPR, BOOST_NOEXCEPT, BOOST_THREAD_FUTURE, boost::multiprecision::backends::c, func, make_future_deferred_shared_state(), move(), boost::fusion::move(), boost::multiprecision::backends::operator=(), boost::spirit::x3::unicode::other, boost::shared_ptr< T >::reset(), swap, throw_exception(), and boost::detail::type.

template<std::size_t size_, std::size_t alignment_>

struct is_pod< ::boost::detail::aligned_storage::aligned_storage_imp< size_, alignment_ > > boost::BOOST_TT_AUX_BOOL_C_BASE

(

true

)

boost::BOOST_TT_AUX_BOOL_TRAIT_DEF1	(	is_recursive_wrapper	,
		T	,
		(::boost::detail::is_recursive_wrapper_impl< T >::value)
	)

References T, and boost::detail::type.

template<typename A0 >

bool boost::boyer_myrvold_planarity_test

(

A0 const &

arg0

)

References boost::boyer_myrvold_params::core::boyer_myrvold_planarity_test().

template<typename A0 , typename A1 >

bool boost::boyer_myrvold_planarity_test	(	A0 const &	arg0,
		A1 const &	arg1
	)

References boost::boyer_myrvold_params::core::boyer_myrvold_planarity_test().

template<typename A0 , typename A1 , typename A2 >

bool boost::boyer_myrvold_planarity_test	(	A0 const &	arg0,
		A1 const &	arg1,
		A2 const &	arg2
	)

References boost::boyer_myrvold_params::core::boyer_myrvold_planarity_test().

template<typename A0 , typename A1 , typename A2 , typename A3 >

bool boost::boyer_myrvold_planarity_test	(	A0 const &	arg0,
		A1 const &	arg1,
		A2 const &	arg2,
		A3 const &	arg3
	)

References boost::boyer_myrvold_params::core::boyer_myrvold_planarity_test().

template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 >

bool boost::boyer_myrvold_planarity_test	(	A0 const &	arg0,
		A1 const &	arg1,
		A2 const &	arg2,
		A3 const &	arg3,
		A4 const &	arg4
	)

References boost::boyer_myrvold_params::core::boyer_myrvold_planarity_test().

template<class Graph , class CapacityEdgeMap , class ResidualCapacityEdgeMap , class ReverseEdgeMap , class PredecessorMap , class ColorMap , class DistanceMap , class IndexMap >

property_traits<CapacityEdgeMap>::value_type boost::boykov_kolmogorov_max_flow	(	Graph &	g,
		CapacityEdgeMap	cap,
		ResidualCapacityEdgeMap	res_cap,
		ReverseEdgeMap	rev_map,
		PredecessorMap	pre_map,
		ColorMap	color,
		DistanceMap	dist,
		IndexMap	idx,
		typename graph_traits< Graph >::vertex_descriptor	src,
		typename graph_traits< Graph >::vertex_descriptor	sink
	)

non-named-parameter version, given everything this is the catch all version

References BOOST_ASSERT, BOOST_CONCEPT_ASSERT(), and num_vertices().

Referenced by boykov_kolmogorov_max_flow().

template<class Graph , class CapacityEdgeMap , class ResidualCapacityEdgeMap , class ReverseEdgeMap , class IndexMap >

property_traits<CapacityEdgeMap>::value_type boost::boykov_kolmogorov_max_flow	(	Graph &	g,
		CapacityEdgeMap	cap,
		ResidualCapacityEdgeMap	res_cap,
		ReverseEdgeMap	rev,
		IndexMap	idx,
		typename graph_traits< Graph >::vertex_descriptor	src,
		typename graph_traits< Graph >::vertex_descriptor	sink
	)

non-named-parameter version, given capacity, residucal_capacity, reverse_edges, and an index map.

References boykov_kolmogorov_max_flow(), make_iterator_property_map(), num_vertices(), and boost::detail::vertices_size_type.

template<class Graph , class CapacityEdgeMap , class ResidualCapacityEdgeMap , class ReverseEdgeMap , class ColorMap , class IndexMap >

property_traits<CapacityEdgeMap>::value_type boost::boykov_kolmogorov_max_flow	(	Graph &	g,
		CapacityEdgeMap	cap,
		ResidualCapacityEdgeMap	res_cap,
		ReverseEdgeMap	rev,
		ColorMap	color,
		IndexMap	idx,
		typename graph_traits< Graph >::vertex_descriptor	src,
		typename graph_traits< Graph >::vertex_descriptor	sink
	)

non-named-parameter version, some given: capacity, residual_capacity, reverse_edges, color_map and an index map.

Use this if you are interested in the minimum cut, as the color map provides that info.

References boykov_kolmogorov_max_flow(), make_iterator_property_map(), num_vertices(), and boost::detail::vertices_size_type.

template<class Graph , class P , class T , class R >

property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow	(	Graph &	g,
		typename graph_traits< Graph >::vertex_descriptor	src,
		typename graph_traits< Graph >::vertex_descriptor	sink,
		const bgl_named_params< P, T, R > &	params
	)

named-parameter version, some given

References boykov_kolmogorov_max_flow(), choose_const_pmap(), choose_pmap(), edge_capacity, edge_residual_capacity, edge_reverse, get_param(), vertex_color, vertex_distance, vertex_index, and vertex_predecessor.

template<class Graph >

property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow	(	Graph &	g,
		typename graph_traits< Graph >::vertex_descriptor	src,
		typename graph_traits< Graph >::vertex_descriptor	sink
	)

named-parameter version, none given

References boykov_kolmogorov_max_flow().

template<typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename IncomingMap , typename DistanceMap , typename DependencyMap , typename PathCountMap , typename VertexIndexMap >

void boost::brandes_betweenness_centrality	(	const Graph &	g,
		CentralityMap	centrality,
		EdgeCentralityMap	edge_centrality_map,
		IncomingMap	incoming,
		DistanceMap	distance,
		DependencyMap	dependency,
		PathCountMap	path_count,
		VertexIndexMap vertex_index	BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, vertex_list_graph_tag
	)

References boost::detail::graph::brandes_betweenness_centrality_impl(), and vertex_index.

Referenced by betweenness_centrality_clustering(), boost::detail::graph::brandes_betweenness_centrality_dispatch2(), and boost::graph::parallel::detail::brandes_betweenness_centrality_dispatch2().

template<typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename IncomingMap , typename DistanceMap , typename DependencyMap , typename PathCountMap , typename VertexIndexMap , typename WeightMap >

void boost::brandes_betweenness_centrality	(	const Graph &	g,
		CentralityMap	centrality,
		EdgeCentralityMap	edge_centrality_map,
		IncomingMap	incoming,
		DistanceMap	distance,
		DependencyMap	dependency,
		PathCountMap	path_count,
		VertexIndexMap	vertex_index,
		WeightMap weight_map	BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, vertex_list_graph_tag
	)

References boost::detail::graph::brandes_betweenness_centrality_impl(), and weight_map().

template<typename Graph , typename Param , typename Tag , typename Rest >

void boost::brandes_betweenness_centrality	(	const Graph &	g,
		const bgl_named_params< Param, Tag, Rest > &params	BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, vertex_list_graph_tag
	)

References choose_const_pmap(), choose_param(), edge_centrality, edge_weight, get_param(), boost::detail::graph::brandes_betweenness_centrality_dispatch1< WeightMap >::run(), and vertex_centrality.

template<typename Graph , typename CentralityMap >

disable_if<detail::graph::is_bgl_named_params<CentralityMap>, void>::type boost::brandes_betweenness_centrality	(	const Graph &	g,
		CentralityMap centrality	BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, vertex_list_graph_tag
	)

References boost::detail::graph::brandes_betweenness_centrality_dispatch2().

template<typename Graph , typename CentralityMap , typename EdgeCentralityMap >

void boost::brandes_betweenness_centrality	(	const Graph &	g,
		CentralityMap	centrality,
		EdgeCentralityMap edge_centrality_map	BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, vertex_list_graph_tag
	)

References boost::detail::graph::brandes_betweenness_centrality_dispatch2().

template<typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename IncomingMap , typename DistanceMap , typename DependencyMap , typename PathCountMap , typename VertexIndexMap , typename Buffer >

void boost::brandes_betweenness_centrality	(	const Graph &	g,
		CentralityMap	centrality,
		EdgeCentralityMap	edge_centrality_map,
		IncomingMap	incoming,
		DistanceMap	distance,
		DependencyMap	dependency,
		PathCountMap	path_count,
		VertexIndexMap	vertex_index,
		Buffer	sources,
		typename property_traits< DistanceMap >::value_type delta	BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, distributed_graph_tag
	)

References boost::graph::parallel::detail::brandes_betweenness_centrality_impl(), and boost::polygon::delta().

template<typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename IncomingMap , typename DistanceMap , typename DependencyMap , typename PathCountMap , typename VertexIndexMap , typename WeightMap , typename Buffer >

void boost::brandes_betweenness_centrality	(	const Graph &	g,
		CentralityMap	centrality,
		EdgeCentralityMap	edge_centrality_map,
		IncomingMap	incoming,
		DistanceMap	distance,
		DependencyMap	dependency,
		PathCountMap	path_count,
		VertexIndexMap	vertex_index,
		Buffer	sources,
		typename property_traits< WeightMap >::value_type	delta,
		WeightMap weight_map	BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, distributed_graph_tag
	)

References boost::graph::parallel::detail::brandes_betweenness_centrality_impl(), and weight_map().

template<typename Graph , typename Param , typename Tag , typename Rest >

void boost::brandes_betweenness_centrality	(	const Graph &	g,
		const bgl_named_params< Param, Tag, Rest > &params	BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, distributed_graph_tag
	)

References choose_const_pmap(), choose_param(), edge_centrality, edge_weight, get_param(), ref(), boost::graph::parallel::detail::brandes_betweenness_centrality_dispatch1< WeightMap >::run(), and vertex_centrality.

template<typename Graph , typename CentralityMap >

void boost::brandes_betweenness_centrality	(	const Graph &	g,
		CentralityMap centrality	BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, distributed_graph_tag
	)

References boost::graph::parallel::detail::brandes_betweenness_centrality_dispatch2(), and ref().

template<typename Graph , typename CentralityMap , typename EdgeCentralityMap >

void boost::brandes_betweenness_centrality	(	const Graph &	g,
		CentralityMap	centrality,
		EdgeCentralityMap edge_centrality_map	BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, distributed_graph_tag
	)

References boost::graph::parallel::detail::brandes_betweenness_centrality_dispatch2(), and ref().

template<class VertexListGraph , class SourceIterator , class Buffer , class BFSVisitor , class ColorMap >

void boost::breadth_first_search	(	const VertexListGraph &	g,
		SourceIterator	sources_begin,
		SourceIterator	sources_end,
		Buffer &	Q,
		BFSVisitor	vis,
		ColorMap	color
	)

References breadth_first_visit(), boost::multiprecision::backends::i, put(), vertices(), and white().

Referenced by boost::detail::bfs_helper(), breadth_first_search(), boost::detail::copy_component_impl(), boost::graph::distributed::crauser_et_al_shortest_paths(), boost::graph::distributed::eager_dijkstra_shortest_paths(), edmonds_karp_max_flow(), boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), boost::graph_as_tree< Graph, ParentMap, Node, ChIt >::graph_as_tree(), boost::graph::detail::breadth_first_search_impl< Graph, Source >::operator()(), boost::detail::parallel_bfs_helper(), boost::detail::gursoy_shortest< dummy_property_map >::run(), sloan_ordering(), and sloan_start_end_vertices().

template<class VertexListGraph , class Buffer , class BFSVisitor , class ColorMap >

void boost::breadth_first_search	(	const VertexListGraph &	g,
		typename graph_traits< VertexListGraph >::vertex_descriptor	s,
		Buffer &	Q,
		BFSVisitor	vis,
		ColorMap	color
	)

References breadth_first_search().

template<class VertexListGraph , class P , class T , class R >

void boost::breadth_first_search	(	const VertexListGraph &	g,
		typename graph_traits< VertexListGraph >::vertex_descriptor	s,
		const bgl_named_params< P, T, R > &	params
	)

References boost::detail::bfs_dispatch< ColorMap >::apply(), get_param(), and vertex_color.

template<class IncidenceGraph , class Buffer , class BFSVisitor , class ColorMap , class SourceIterator >

void boost::breadth_first_visit	(	const IncidenceGraph &	g,
		SourceIterator	sources_begin,
		SourceIterator	sources_end,
		Buffer &	Q,
		BFSVisitor	vis,
		ColorMap	color
	)

References black(), BOOST_CONCEPT_ASSERT(), gray(), boost::detail::out_edge_iterator, out_edges(), put(), boost::asio::s, target(), Vertex, and white().

Referenced by astar_search_no_init(), breadth_first_search(), breadth_first_visit(), cuthill_mckee_ordering(), dijkstra_shortest_paths_no_init(), king_ordering(), and boost::detail::graph::brandes_unweighted_shortest_paths::operator()().

template<class IncidenceGraph , class Buffer , class BFSVisitor , class ColorMap >

void boost::breadth_first_visit	(	const IncidenceGraph &	g,
		typename graph_traits< IncidenceGraph >::vertex_descriptor	s,
		Buffer &	Q,
		BFSVisitor	vis,
		ColorMap	color
	)

References breadth_first_visit().

template<class IncidenceGraph , class P , class T , class R >

void boost::breadth_first_visit	(	const IncidenceGraph &	g,
		typename graph_traits< IncidenceGraph >::vertex_descriptor	s,
		const bgl_named_params< P, T, R > &	params
	)

References breadth_first_visit(), choose_param(), choose_pmap(), get_param(), graph_visitor, make_bfs_visitor(), ref(), and vertex_color.

template<typename Graph , typename Visitor >

void boost::bron_kerbosch_all_cliques ( const Graph &  g, Visitor  vis, std::size_t  min  )

inline

References BOOST_CONCEPT_ASSERT(), end, boost::detail::extend_clique(), boost::multiprecision::backends::i, Vertex, and vertices().

Referenced by bron_kerbosch_all_cliques(), and bron_kerbosch_clique_number().

template<typename Graph , typename Visitor >

void boost::bron_kerbosch_all_cliques ( const Graph &  g, Visitor  vis  )

inline

References bron_kerbosch_all_cliques().

template<typename Graph >

std::size_t boost::bron_kerbosch_clique_number ( const Graph &  g )

inline

References bron_kerbosch_all_cliques(), and find_max_clique().

template<typename ForwardIterator , typename ItemToRankMap , typename SizeType >

void boost::bucket_sort	(	ForwardIterator	begin,
		ForwardIterator	end,
		ItemToRankMap	rank,
		SizeType	range = 0
	)

References boost::asio::begin, end, boost::range::max_element(), boost::xpressive::push_back, and boost::range::stable_sort().

Referenced by boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::boyer_myrvold_impl(), bucket_sort(), is_straight_line_drawing(), and make_connected().

template<typename ForwardIterator , typename ItemToRankMap >

void boost::bucket_sort	(	ForwardIterator	begin,
		ForwardIterator	end,
		ItemToRankMap	rank
	)

References bucket_sort().

template<typename ForwardIterator >

void boost::bucket_sort	(	ForwardIterator	begin,
		ForwardIterator	end
	)

References bucket_sort().

template<typename PType >

bgl_named_params<boost::reference_wrapper<PType>, BOOST_PP_CAT( buffer_param , _t)> boost::buffer

(

PType &

p

)

Referenced by augmented_crc(), boost::wave::preprocess_exception::description(), boost::wave::cpplexer::lexing_exception::description(), boost::wave::impl::pp_iterator_functor< ContextT >::emit_line_directive(), boost::wave::util::macromap< ContextT >::expand_predefined_macro(), boost::wave::util::predefined_macros::get_config(), boost::wave::util::predefined_macros::get_version(), boost::wave::cpplexer::lexing_exception::lexing_exception(), boost::spirit::karma::debug_handler< OutputIterator, Context, Delimiter, Properties, F >::operator()(), boost::wave::preprocess_exception::preprocess_exception(), boost::uuids::detail::sha1::process_bytes(), boost::crc_basic< Bits >::process_bytes(), boost::crc_optimal< Bits, TruncPoly, InitRem, FinalXor, ReflectIn, ReflectRem >::process_bytes(), boost::wave::util::iteration_context_stack< iteration_ptr_type >::push(), boost::wave::cpplexer::re2clex::lexer< IteratorT, PositionT, TokenT >::report_error(), boost::wave::util::predefined_macros::reset_datestr(), boost::wave::util::predefined_macros::reset_timestr(), boost::wave::util::predefined_macros::reset_version(), boost::wave::util::predefined_macros::reset_versionstr(), boost::locale::basic_format< CharType >::str(), boost::locale::basic_message< char_type >::str(), and boost::locale::basic_message< char_type >::write().

template<typename Graph , typename ComponentMap , typename ComponentLists >

void boost::build_component_lists	(	const Graph &	g,
		typename graph_traits< Graph >::vertices_size_type	num_scc,
		ComponentMap	component_number,
		ComponentLists &	components
	)

References boost::xpressive::push_back, and vertices().

Referenced by transitive_closure().

template<typename Function >

void boost::call_once ( Function  func, once_flag &  flag  )

inline

template<typename Function , class... ArgTypes>

void boost::call_once ( once_flag &  flag, BOOST_THREAD_RV_REF(Function)  f, BOOST_THREAD_RV_REF(ArgTypes)...  args  )

inline

References BOOST_CATCH, BOOST_CATCH_END, BOOST_ONCE_INITIAL_FLAG_VALUE, BOOST_RETHROW, BOOST_THREAD_INVOKE_RET_VOID, BOOST_THREAD_INVOKE_RET_VOID_CALL, BOOST_TRY, BOOST_VERIFY, boost::thread_detail::get_once_per_thread_epoch(), boost::thread_detail::once_epoch_cv, boost::thread_detail::once_epoch_mutex, and boost::thread_detail::once_global_epoch.

void boost::call_once ( once_flag &  flag, void(*)()  f  )

inline

References BOOST_CATCH, BOOST_CATCH_END, BOOST_RETHROW, BOOST_TRY, BOOST_VERIFY, boost::detail::commit_once_region(), boost::detail::once_context::counted, boost::detail::create_once_event(), boost::detail::enter_once_region(), boost::detail::once_context::event_handle, boost::detail::once_context::function_complete_flag_value, boost::detail::interlocked_read_acquire(), boost::detail::once_context::mutex_name, boost::detail::rollback_once_region(), and boost::filesystem::detail::status().

template<typename Function >

void boost::call_once ( once_flag &  flag, BOOST_THREAD_RV_REF(Function)  f  )

inline

References BOOST_CATCH, BOOST_CATCH_END, BOOST_RETHROW, BOOST_TRY, BOOST_VERIFY, boost::detail::commit_once_region(), boost::detail::once_context::counted, boost::detail::create_once_event(), boost::detail::enter_once_region(), boost::detail::once_context::event_handle, boost::detail::once_context::function_complete_flag_value, boost::detail::interlocked_read_acquire(), boost::detail::once_context::mutex_name, boost::detail::rollback_once_region(), and boost::filesystem::detail::status().

template<typename Function , class A , class... ArgTypes>

void boost::call_once ( once_flag &  flag, BOOST_THREAD_RV_REF(Function)  f, BOOST_THREAD_RV_REF(A)  a, BOOST_THREAD_RV_REF(ArgTypes)...  args  )

inline

References BOOST_CATCH, BOOST_CATCH_END, BOOST_RETHROW, BOOST_THREAD_INVOKE_RET_VOID, BOOST_THREAD_INVOKE_RET_VOID_CALL, BOOST_TRY, BOOST_VERIFY, boost::detail::commit_once_region(), boost::detail::once_context::counted, boost::detail::create_once_event(), boost::detail::enter_once_region(), boost::detail::once_context::event_handle, boost::detail::once_context::function_complete_flag_value, boost::detail::interlocked_read_acquire(), boost::detail::once_context::mutex_name, boost::detail::rollback_once_region(), and boost::filesystem::detail::status().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( edge_capacity , _t)> boost::capacity_map

(

const PType &

p

)

template<typename Graph , typename CentralityMap >

property_traits<CentralityMap>::value_type boost::central_point_dominance	(	const Graph &	g,
		CentralityMap centrality	BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, vertex_list_graph_tag
	)

References boost::accumulators::extract::max, n, num_vertices(), boost::accumulators::extract::sum, boost::detail::vertex_iterator, and vertices().

template<typename Graph , typename CentralityMap >

property_traits<CentralityMap>::value_type boost::central_point_dominance	(	const Graph &	g,
		CentralityMap centrality	BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, distributed_graph_tag
	)

References boost::parallel::all_reduce(), boost::graph::distributed::all_reduce(), boost::accumulators::extract::max, n, boost::graph::num_vertices(), boost::graph::parallel::process_group(), boost::accumulators::extract::sum, boost::detail::vertex_iterator, boost::graph::vertices(), and boost::detail::vertices_size_type.

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( vertex_centrality , _t)> boost::centrality_map

(

const PType &

p

)

template<class Graph , class Resource_Container , class Resource_Extension_Function >

void boost::check_r_c_path	(	const Graph &	g,
		const std::vector< typename graph_traits< Graph >::edge_descriptor > &	ed_vec_path,
		const Resource_Container &	initial_resource_levels,
		bool	b_result_must_be_equal_to_desired_final_resource_levels,
		const Resource_Container &	desired_final_resource_levels,
		Resource_Container &	actual_final_resource_levels,
		const Resource_Extension_Function &	ref,
		bool &	b_is_a_path_at_all,
		bool &	b_feasible,
		bool &	b_correctly_extended,
		typename graph_traits< Graph >::edge_descriptor &	ed_last_extended_arc
	)

References boost::multiprecision::backends::i, ref(), source(), and target().

template<class T >

void boost::checked_array_delete ( T *  x )

inline

References T, boost::detail::void, and boost::flyweights::x.

Referenced by boost::checked_array_deleter< T >::operator()(), and boost::scoped_array< boost::boost::unique_lock< boost::boost::mutex > >::~scoped_array().

template<class T >

void boost::checked_delete ( T *  x )

inline

References T, boost::detail::void, and boost::flyweights::x.

Referenced by delete_clone(), boost::checked_deleter< T >::operator()(), boost::signals2::predestructing_deleter< T >::operator()(), boost::spirit::x3::forward_ast< T >::~forward_ast(), boost::recursive_wrapper< T >::~recursive_wrapper(), and boost::scoped_ptr< boost::detail::translate_exception_base >::~scoped_ptr().

template<typename Graph , typename MateMap , typename VertexIndexMap >

bool boost::checked_edmonds_maximum_cardinality_matching ( const Graph &  g, MateMap  mate, VertexIndexMap  vm  )

inline

References matching().

Referenced by checked_edmonds_maximum_cardinality_matching().

template<typename Graph , typename MateMap >

bool boost::checked_edmonds_maximum_cardinality_matching ( const Graph &  g, MateMap  mate  )

inline

References checked_edmonds_maximum_cardinality_matching(), and vertex_index.

template<typename Param , typename Graph , typename PropertyTag >

detail::choose_impl_result<boost::mpl::true_, Graph, Param, PropertyTag>::type boost::choose_const_pmap	(	const Param &	p,
		const Graph &	g,
		PropertyTag	tag
	)

Referenced by boost::detail::edmonds_karp_dispatch2< ColorMap >::apply(), boost::detail::strong_comp_dispatch2< param_not_found >::apply(), boost::detail::edmonds_karp_dispatch2< param_not_found >::apply(), boost::detail::strong_comp_dispatch1< param_not_found >::apply(), boost::detail::edmonds_karp_dispatch1< param_not_found >::apply(), boost::detail::udfs_dispatch< param_not_found >::apply(), boost::detail::neighbor_bfs_dispatch< param_not_found >::apply(), boost::detail::bfs_dispatch< param_not_found >::apply(), bellman_ford_shortest_paths(), boost::detail::bfs_helper(), biconnected_components(), boykov_kolmogorov_max_flow(), brandes_betweenness_centrality(), copy_graph(), cycle_canceling(), boost::detail::cycle_canceling_dispatch1(), boost::detail::cycle_canceling_dispatch2(), dag_shortest_paths(), dijkstra_shortest_paths(), dijkstra_shortest_paths_no_color_map(), find_flow_cost(), floyd_warshall_all_pairs_shortest_paths(), floyd_warshall_initialized_all_pairs_shortest_paths(), gursoy_atun_layout(), johnson_all_pairs_shortest_paths(), kruskal_minimum_spanning_tree(), mcgregor_common_subgraphs(), mcgregor_common_subgraphs_maximum(), mcgregor_common_subgraphs_maximum_unique(), mcgregor_common_subgraphs_unique(), non_distributed_brandes_betweenness_centrality(), prim_minimum_spanning_tree(), push_relabel_max_flow(), boost::detail::fr_force_directed_layout< param_not_found >::run(), successive_shortest_path_nonnegative_weights(), transitive_closure(), vf2_graph_iso(), vf2_subgraph_iso(), and vf2_subgraph_mono().

template<class P , class Default >

const P& boost::choose_param	(	const P &	param,
		const Default &
	)

Referenced by boost::detail::bicomp_dispatch3< PredecessorMap >::apply(), boost::detail::bicomp_dispatch3< param_not_found >::apply(), boost::graph::detail::mas_dispatch< WeightMap >::apply(), boost::detail::neighbor_bfs_dispatch< ColorMap >::apply(), boost::graph::detail::mas_dispatch< boost::param_not_found >::apply(), boost::detail::neighbor_bfs_dispatch< param_not_found >::apply(), boost::detail::bfs_dispatch< ColorMap >::apply(), boost::detail::bfs_dispatch< param_not_found >::apply(), boost::detail::bellman_dispatch(), boost::detail::bellman_dispatch2(), boost::detail::bfs_helper(), brandes_betweenness_centrality(), breadth_first_visit(), copy_component(), copy_graph(), dag_shortest_paths(), boost::detail::dag_sp_dispatch1(), boost::detail::dag_sp_dispatch2(), boost::detail::dijkstra_dispatch1(), boost::detail::dijkstra_dispatch2(), boost::detail::dijkstra_no_color_map_dispatch1(), boost::detail::dijkstra_no_color_map_dispatch2(), boost::detail::floyd_warshall_init_dispatch(), boost::detail::floyd_warshall_noninit_dispatch(), fruchterman_reingold_force_directed_layout(), gursoy_atun_layout(), boost::detail::isomorphism_impl(), boost::detail::johnson_dispatch(), kruskal_minimum_spanning_tree(), mcgregor_common_subgraphs(), mcgregor_common_subgraphs_maximum(), mcgregor_common_subgraphs_maximum_unique(), mcgregor_common_subgraphs_unique(), boost::detail::neighbor_bfs_helper(), neighbor_breadth_first_visit(), non_distributed_brandes_betweenness_centrality(), boost::graph::detail::stoer_wagner_min_cut_impl< UndirectedGraph, WeightMap >::operator()(), boost::graph::detail::isomorphism_impl< Graph1, Graph2 >::operator()(), prim_minimum_spanning_tree(), boost::detail::transitive_closure_dispatch(), undirected_dfs(), vf2_graph_iso(), vf2_subgraph_iso(), and vf2_subgraph_mono().

template<class Default >

Default boost::choose_param	(	const param_not_found &	,
		const Default &	d
	)

template<typename Param , typename Graph , typename PropertyTag >

detail::choose_impl_result<boost::mpl::false_, Graph, Param, PropertyTag>::type boost::choose_pmap	(	const Param &	p,
		Graph &	g,
		PropertyTag	tag
	)

Referenced by boost::detail::edmonds_karp_dispatch2< ColorMap >::apply(), boost::detail::edmonds_karp_dispatch2< param_not_found >::apply(), bellman_ford_shortest_paths(), boykov_kolmogorov_max_flow(), breadth_first_visit(), copy_component(), cycle_canceling(), kruskal_minimum_spanning_tree(), neighbor_breadth_first_visit(), push_relabel_max_flow(), and successive_shortest_path_nonnegative_weights().

template<typename Graph , typename PlanarEmbedding , typename ForwardIterator , typename GridPositionMap , typename VertexIndexMap >

void boost::chrobak_payne_straight_line_drawing	(	const Graph &	g,
		PlanarEmbedding	embedding,
		ForwardIterator	ordering_begin,
		ForwardIterator	ordering_end,
		GridPositionMap	drawing,
		VertexIndexMap	vm
	)

References boost::graph::detail::accumulate_offsets(), boost::asio::begin, boost::bimaps::support::left, num_vertices(), boost::icl::right(), source(), target(), vertices(), boost::flyweights::x, and boost::polygon::y().

Referenced by chrobak_payne_straight_line_drawing().

template<typename Graph , typename PlanarEmbedding , typename ForwardIterator , typename GridPositionMap >

void boost::chrobak_payne_straight_line_drawing ( const Graph &  g, PlanarEmbedding  embedding, ForwardIterator  ord_begin, ForwardIterator  ord_end, GridPositionMap  drawing  )

inline

References chrobak_payne_straight_line_drawing(), and vertex_index.

template<typename VertexListGraph , typename PositionMap , typename Radius >

void boost::circle_graph_layout	(	const VertexListGraph &	g,
		PositionMap	position,
		Radius	radius
	)

Layout the graph with the vertices at the points of a regular n-polygon.

The distance from the center of the polygon to each point is determined by the radius parameter. The position parameter must be an Lvalue Property Map whose value type is a class type containing x and y members that will be set to the x and y coordinates.

References BGL_FORALL_VERTICES_T, BOOST_STATIC_ASSERT(), boost::math::ef::cos(), boost::multiprecision::backends::i, n, num_vertices(), boost::math::ef::sin(), and boost::detail::vertices_size_type.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

void boost::clear_in_edges	(	typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	u,
		adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References remove_in_edge_if().

Referenced by clear_vertex().

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

void boost::clear_out_edges	(	typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, directedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	u,
		adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, directedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References BOOST_ASSERT.

Referenced by clear_vertex().

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

void boost::clear_out_edges	(	typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	u,
		adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References remove_out_edge_if().

template<class EdgeList , class Allocator >

void boost::clear_vertex	(	typename EdgeList::value_type	u,
		std::vector< EdgeList, Allocator > &	g
	)

References boost::multiprecision::backends::i, and remove_edge().

template<typename VP , typename EP , typename GP >

void boost::clear_vertex ( typename undirected_graph< VP, EP, GP >::vertex_descriptor  v, undirected_graph< VP, EP, GP > &  g  )

inline

template<typename VP , typename EP , typename GP >

void boost::clear_vertex ( typename directed_graph< VP, EP, GP >::vertex_descriptor  v, directed_graph< VP, EP, GP > &  g  )

inline

template<class vtype , class etype >

void boost::clear_vertex	(	typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor	u,
		leda::GRAPH< vtype, etype > &	g
	)

References in_edges(), out_edges(), and remove_edge().

void boost::clear_vertex	(	graph_traits< leda::graph >::vertex_descriptor	u,
		leda::graph &	g
	)

References in_edges(), out_edges(), and remove_edge().

template<typename G >

void boost::clear_vertex	(	typename subgraph< G >::vertex_descriptor	v,
		subgraph< G > &	g
	)

References out_edges(), boost::multiprecision::backends::p, and remove_edge().

template<typename G , typename L , typename S >

void boost::clear_vertex ( typename labeled_graph< G, L, S >::vertex_descriptor  v, labeled_graph< G, L, S > &  g  )

inline

References clear_vertex().

template<typename VP , typename EP , typename GP , typename A >

void boost::clear_vertex	(	typename adjacency_matrix< directedS, VP, EP, GP, A >::vertex_descriptor	u,
		adjacency_matrix< directedS, VP, EP, GP, A > &	g
	)

References remove_edge(), and vertices().

Referenced by boost::concepts::BOOST_concept(), boost::directed_graph< VertexProp, EdgeProp, GraphProp >::clear_vertex(), boost::undirected_graph< VertexProp, EdgeProp, GraphProp >::clear_vertex(), clear_vertex(), clear_vertex_by_label(), boost::graph::remove_dangling_links(), boost::graph::distributed::remove_dangling_links(), remove_vertex(), and boost::graph_test< Graph >::test_clear_vertex().

template<typename VP , typename EP , typename GP , typename A >

void boost::clear_vertex	(	typename adjacency_matrix< undirectedS, VP, EP, GP, A >::vertex_descriptor	u,
		adjacency_matrix< undirectedS, VP, EP, GP, A > &	g
	)

References remove_edge(), and vertices().

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

void boost::clear_vertex	(	typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	u,
		adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References clear_in_edges(), and clear_out_edges().

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

void boost::clear_vertex	(	typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	u,
		adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References remove_out_edge_if().

template<typename G , typename L , typename S >

void boost::clear_vertex_by_label ( typename labeled_graph< G, L, S >::label_type const &  l, labeled_graph< G, L, S > &  g  )

inline

References clear_vertex().

template<typename Graph , typename DistanceMap , typename Measure , typename Combinator >

Measure::result_type boost::closeness_centrality ( const Graph &  g, DistanceMap  dist, Measure  measure, Combinator  combine  )

inline

References BOOST_CONCEPT_ASSERT(), n, and Vertex.

Referenced by all_closeness_centralities(), and closeness_centrality().

template<typename Graph , typename DistanceMap , typename Measure >

Measure::result_type boost::closeness_centrality ( const Graph &  g, DistanceMap  dist, Measure  measure  )

inline

References BOOST_CONCEPT_ASSERT(), closeness_centrality(), and Vertex.

template<typename Graph , typename DistanceMap >

double boost::closeness_centrality ( const Graph &  g, DistanceMap  dist  )

inline

References closeness_centrality(), and measure_closeness().

template<typename T , typename Graph , typename DistanceMap >

T boost::closeness_centrality ( const Graph &  g, DistanceMap  dist  )

inline

References closeness_centrality().

template<typename T , typename Graph , typename Vertex >

T boost::clustering_coefficient ( const Graph &  g, Vertex  v  )

inline

References num_paths_through_vertex(), num_triangles_on_vertex(), and T.

template<typename Graph , typename Vertex >

double boost::clustering_coefficient ( const Graph &  g, Vertex  v  )

inline

template<typename Graph , typename ColorMap >

boost::property_traits<ColorMap>::value_type boost::color_edge	(	const Graph &	g,
		ColorMap	color,
		typename boost::graph_traits< Graph >::edge_descriptor	e
	)

References boost::multiprecision::backends::c, edge(), boost::detail::find_free_color(), boost::fusion::find_if(), boost::xpressive::first, boost::detail::invert_cd_path(), boost::accumulators::extract::max, boost::detail::maximal_fan(), put(), boost::detail::rotate_fan(), source(), target(), boost::flyweights::x, and boost::polygon::y().

Referenced by edge_coloring().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( vertex_color , _t)> boost::color_map

(

const PType &

p

)

Referenced by boost::detail::dag_sp_dispatch1(), dijkstra_shortest_paths(), boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), boost::detail::isomorphism_algo< Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2 >::test_isomorphism(), and vertex_color_map().

template<class ParentIterator >

boost::detail::iterator_traits<ParentIterator>::difference_type boost::component_count	(	ParentIterator	first,
		ParentIterator	last
	)

References count, current, and last.

template<class ParentIterator >

void boost::compress_components	(	ParentIterator	first,
		ParentIterator	last
	)

References current, and last.

template<class Model >

concept_check<Model> boost::concept_check_

(

void(*)(Model)

)

template<class Model >

void boost::concept_check_failed

(

)

template<class Graph , class ComponentMap , class P , class T , class R >

property_traits<ComponentMap>::value_type boost::connected_components ( const Graph &  g, ComponentMap  c, const bgl_named_params< P, T, R > &params   BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, vertex_list_graph_tag  )

inline

References BOOST_CONCEPT_ASSERT(), BOOST_STATIC_ASSERT(), depth_first_search(), boost::accumulators::extract::max, num_vertices(), boost::program_options::value(), and Vertex.

Referenced by if(), make_connected(), and boost::graph::distributed::cc_detail::parallel_connected_components().

template<class Graph , class ComponentMap >

property_traits<ComponentMap>::value_type boost::connected_components ( const Graph &  g, ComponentMap c   BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, vertex_list_graph_tag  )

inline

References BOOST_CONCEPT_ASSERT(), depth_first_search(), boost::accumulators::extract::max, num_vertices(), Vertex, and visitor().

template<typename Vertex , typename Graph >

connects_predicate<Vertex, Graph> boost::connects ( Vertex  u, Vertex  v, const Graph &  g  )

inline

Referenced by boost::graph_test< Graph >::test_adjacency_matrix(), and boost::graph_test< Graph >::test_edge_list_graph().

template<class T , class U >

T* boost::const_pointer_cast ( U *  ptr )

inline

References boost::python::ptr(), and T.

template<class T , class U >

intrusive_ptr<T> boost::const_pointer_cast

(

intrusive_ptr< U > const &

p

)

References boost::intrusive_ptr< T >::get(), and T.

template<class T , class U >

shared_ptr< T > boost::const_pointer_cast

(

shared_ptr< U > const &

r

)

References E, boost::multiprecision::backends::p, and boost::detail::void.

template<class T >

BOOST_DEDUCED_TYPENAME range_reverse_iterator<const T>::type boost::const_rbegin ( const T &  r )

inline

References rbegin().

template<class T >

BOOST_DEDUCED_TYPENAME range_reverse_iterator<const T>::type boost::const_rend ( const T &  r )

inline

References rend().

template<class Iterator , class T >

void boost::constant_lvalue_iterator_test	(	Iterator	i,
		T	v1
	)

References BOOST_STATIC_ASSERT(), BOOST_TEST, T, and boost::program_options::value().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( cooling , _t)> boost::cooling

(

const PType &

p

)

template<typename IncidenceGraph , typename MutableGraph , typename P , typename T , typename R >

graph_traits<MutableGraph>::vertex_descriptor boost::copy_component	(	IncidenceGraph &	g_in,
		typename graph_traits< IncidenceGraph >::vertex_descriptor	src,
		MutableGraph &	g_out,
		const bgl_named_params< P, T, R > &	params
	)

References boost::detail::choose_edge_copier(), choose_param(), choose_pmap(), boost::detail::choose_vertex_copier(), boost::detail::copy_component_impl(), get_param(), is_default_param(), make_iterator_property_map(), n, num_vertices(), and vertex_index.

template<typename IncidenceGraph , typename MutableGraph >

graph_traits<MutableGraph>::vertex_descriptor boost::copy_component	(	IncidenceGraph &	g_in,
		typename graph_traits< IncidenceGraph >::vertex_descriptor	src,
		MutableGraph &	g_out
	)

References boost::detail::copy_component_impl(), boost::detail::make_edge_copier(), make_iterator_property_map(), boost::detail::make_vertex_copier(), num_vertices(), and vertex_index.

template<class PropertyIn , class PropertyOut , class Graph >

void boost::copy_edge_property	(	PropertyIn	p_in,
		PropertyOut	p_out,
		Graph &	g
	)

References BGL_FORALL_EDGES_T, and put().

template<typename VertexListGraph , typename MutableGraph >

void boost::copy_graph	(	const VertexListGraph &	g_in,
		MutableGraph &	g_out
	)

References boost::iostreams::detail::copy_impl(), boost::detail::make_edge_copier(), make_iterator_property_map(), boost::detail::make_vertex_copier(), num_vertices(), and vertex_index.

Referenced by generate_random_graph1(), boost::graph_test< Graph >::test_add_edge(), boost::graph_test< Graph >::test_add_vertex(), boost::graph_test< Graph >::test_clear_vertex(), boost::graph_test< Graph >::test_remove_edge(), and transpose_graph().

template<typename VertexListGraph , typename MutableGraph , class P , class T , class R >

void boost::copy_graph	(	const VertexListGraph &	g_in,
		MutableGraph &	g_out,
		const bgl_named_params< P, T, R > &	params
	)

References choose_const_pmap(), boost::detail::choose_edge_copier(), choose_param(), boost::detail::choose_vertex_copier(), boost::iostreams::detail::copy_impl(), get_param(), is_default_param(), make_iterator_property_map(), n, num_vertices(), and vertex_index.

template<typename I , typename F >

F boost::copy_or_move ( I  f, I  l, F  r  )

inline

Effects:

for (; first != last; ++result, ++first)
   *result = *first;

Returns: result

Note: This function is provided because std::uninitialized_copy from some STL implementations is not compatible with move_iterator

References std::copy().

template<typename SeqT , typename Range >

SeqT boost::copy_range ( const Range &  r )

inline

copy a range into a sequence

Construct a new sequence of the specified type from the elements in the given range

Parameters

Range

An input range

Returns

New sequence

References boost::asio::begin, and end.

template<class PropertyIn , class PropertyOut , class Graph >

void boost::copy_vertex_property	(	PropertyIn	p_in,
		PropertyOut	p_out,
		Graph &	g
	)

References BGL_FORALL_VERTICES_T, and put().

template<typename Graph , typename CoreMap , typename CoreNumVisitor >

property_traits<CoreMap>::value_type boost::core_numbers	(	Graph &	g,
		CoreMap	c,
		CoreNumVisitor	vis
	)

References boost::asio::begin, boost::detail::compute_in_degree_map(), boost::detail::core_numbers_impl(), make_iterator_property_map(), num_vertices(), and vertex_index.

Referenced by core_numbers(), and weighted_core_numbers().

template<typename Graph , typename CoreMap >

property_traits<CoreMap>::value_type boost::core_numbers	(	Graph &	g,
		CoreMap	c
	)

References core_numbers(), and make_core_numbers_visitor().

template<typename Graph , typename CoreMap , typename EdgeWeightMap , typename VertexIndexMap , typename CoreNumVisitor >

property_traits<CoreMap>::value_type boost::core_numbers	(	Graph &	g,
		CoreMap	c,
		EdgeWeightMap	wm,
		VertexIndexMap	vim,
		CoreNumVisitor	vis
	)

References boost::detail::compute_in_degree_map(), and boost::detail::core_numbers_dispatch().

template<typename Graph >

size_t boost::count_vertices

(

const Graph &

g

)

References BGL_FORALL_VERTICES_T, n, and boost::detail::void.

Referenced by isomorphism().

template<class Value >

iterator_range<counting_iterator<Value> > boost::counting_range ( Value  first, Value  last  )

inline

template<class Range >

iterator_range< counting_iterator< BOOST_DEDUCED_TYPENAME range_iterator<const Range>::type > > boost::counting_range ( const Range &  rng )

inline

References boost::asio::begin, BOOST_DEDUCED_TYPENAME, and end.

template<class Range >

iterator_range< counting_iterator< BOOST_DEDUCED_TYPENAME range_iterator<Range>::type > > boost::counting_range ( Range &  rng )

inline

References boost::asio::begin, BOOST_DEDUCED_TYPENAME, and end.

template<std::size_t Bits, typename::boost::uint_t< Bits >::fast TruncPoly, typename::boost::uint_t< Bits >::fast InitRem, typename::boost::uint_t< Bits >::fast FinalXor, bool ReflectIn, bool ReflectRem>

uint_t< Bits >::fast boost::crc ( void const *  buffer, std::size_t  byte_count  )

inline

References BOOST_CRC_OPTIMAL_NAME.

Referenced by boost::iostreams::basic_gzip_compressor< Alloc >::close(), boost::iostreams::basic_gzip_decompressor< Alloc >::close(), boost::iostreams::basic_gzip_decompressor< Alloc >::read(), and boost::iostreams::basic_gzip_decompressor< Alloc >::write().

template<typename Graph , typename ComponentLists , typename ComponentNumberMap , typename CondensationGraph , typename EdgeMultiplicityMap >

void boost::create_condensation_graph	(	const Graph &	g,
		const ComponentLists &	components,
		ComponentNumberMap	component_number,
		CondensationGraph &	cg,
		EdgeMultiplicityMap	edge_mult_map
	)

References add_edge(), add_vertex(), adjacent_vertices(), boost::multiprecision::backends::i, put(), boost::asio::s, boost::flyweights::t, and vertex().

Referenced by create_condensation_graph().

template<typename Graph , typename ComponentLists , typename ComponentNumberMap , typename CondensationGraph >

void boost::create_condensation_graph	(	const Graph &	g,
		const ComponentLists &	components,
		ComponentNumberMap	component_number,
		CondensationGraph &	cg
	)

References create_condensation_graph().

template<class T >

BOOST_FORCEINLINE reference_wrapper<T const> BOOST_REF_CONST boost::cref

(

T const &

t

)

Returns

reference_wrapper<T const>(t)

Remarks

Does not throw.

References boost::flyweights::t.

Referenced by boost::spirit::karma::detail::duplicate_sequence_attribute< Attribute, T, N >::call(), boost::spirit::karma::detail::duplicate_sequence_attribute< Attribute, T, 1 >::call(), boost::BoostRegexConcept< Regex >::constraints(), boost::phoenix::expression::reference< T const >::make(), minmax(), boost::multi_index::composite_key_compare<>::operator()(), and boost::dynamic_type_dispatcher::register_type().

template<class T >

void boost::cref

(

T const &&

)

Remarks

Construction from a temporary object is disabled.

template<class E >

E* boost::current_exception_cast ( )

inline

References E.

Referenced by current_exception_diagnostic_information().

std::string boost::current_exception_diagnostic_information ( bool  verbose = true )

inline

References current_exception_cast(), boost::exception_detail::diagnostic_information_impl(), and exception.

current_scope_info boost::current_scope ( )

inline

The function returns an error information object that contains current stack of scopes.

This information can then be attached to an exception and extracted at the catch site. The extracted scope list won't be affected by any scope changes that may happen during the exception propagation.

Note

See the named_scope attribute documentation on how to maintain scope list.

References boost::attributes::named_scope::get_scopes().

Referenced by boost::wave::util::macromap< ContextT >::add_macro(), and boost::wave::util::macromap< ContextT >::init_predefined_macros().

template<class Graph , class OutputIterator , class ColorMap , class DegreeMap >

OutputIterator boost::cuthill_mckee_ordering	(	const Graph &	g,
		std::deque< typename graph_traits< Graph >::vertex_descriptor >	vertex_queue,
		OutputIterator	permutation,
		ColorMap	color,
		DegreeMap	degree
	)

References breadth_first_visit(), put(), boost::asio::s, Vertex, vertices(), and white().

Referenced by cuthill_mckee_ordering().

template<class Graph , class OutputIterator , class ColorMap , class DegreeMap >

OutputIterator boost::cuthill_mckee_ordering	(	const Graph &	g,
		typename graph_traits< Graph >::vertex_descriptor	s,
		OutputIterator	permutation,
		ColorMap	color,
		DegreeMap	degree
	)

References cuthill_mckee_ordering().

template<class Graph , class OutputIterator , class ColorMap , class DegreeMap >

OutputIterator boost::cuthill_mckee_ordering	(	const Graph &	G,
		OutputIterator	permutation,
		ColorMap	color,
		DegreeMap	degree
	)

References BGL_FORALL_VERTICES_T, cuthill_mckee_ordering(), depth_first_visit(), boost::graph::has_no_vertices(), boost::multiprecision::backends::i, put(), Vertex, and white().

template<typename Graph , typename OutputIterator , typename VertexIndexMap >

OutputIterator boost::cuthill_mckee_ordering	(	const Graph &	G,
		OutputIterator	permutation,
		VertexIndexMap	index_map
	)

References cuthill_mckee_ordering(), boost::graph::has_no_vertices(), make_iterator_property_map(), and num_vertices().

template<typename Graph , typename OutputIterator >

OutputIterator boost::cuthill_mckee_ordering ( const Graph &  G, OutputIterator  permutation  )

inline

References cuthill_mckee_ordering(), and vertex_index.

template<class Graph , class Pred , class Distance , class Reversed , class ResidualCapacity , class Weight >

void boost::cycle_canceling	(	const Graph &	g,
		Weight	weight,
		Reversed	rev,
		ResidualCapacity	residual_capacity,
		Pred	pred,
		Distance	distance
	)

References boost::detail::augment(), bellman_ford_shortest_paths(), BGL_FORALL_VERTICES_T, distance_map(), N, num_vertices(), put(), boost::detail::residual_graph(), boost::detail::vertices_size_type, visitor(), and weight_map().

Referenced by cycle_canceling(), and boost::detail::cycle_canceling_dispatch2().

template<class Graph , class P , class T , class R >

void boost::cycle_canceling	(	Graph &	g,
		const bgl_named_params< P, T, R > &	params
	)

References choose_const_pmap(), choose_pmap(), boost::detail::cycle_canceling_dispatch1(), edge_residual_capacity, edge_reverse, edge_weight, get_param(), and vertex_predecessor.

template<class Graph >

void boost::cycle_canceling

(

Graph &

g

)

References cycle_canceling().

template<class VertexListGraph , class DijkstraVisitor , class DistanceMap , class WeightMap , class ColorMap , class PredecessorMap , class Compare , class Combine , class DistInf , class DistZero >

void boost::dag_shortest_paths ( const VertexListGraph &  g, typename graph_traits< VertexListGraph >::vertex_descriptor  s, DistanceMap  distance, WeightMap  weight, ColorMap  color, PredecessorMap  pred, DijkstraVisitor  vis, Compare  compare, Combine  combine, DistInf  inf, DistZero  zero  )

inline

References depth_first_visit(), boost::multiprecision::backends::i, num_vertices(), out_edges(), put(), relax(), target(), Vertex, and vertices().

Referenced by boost::detail::dag_sp_dispatch2().

template<class VertexListGraph , class Param , class Tag , class Rest >

void boost::dag_shortest_paths ( const VertexListGraph &  g, typename graph_traits< VertexListGraph >::vertex_descriptor  s, const bgl_named_params< Param, Tag, Rest > &  params  )

inline

References choose_const_pmap(), choose_param(), boost::detail::dag_sp_dispatch1(), edge_weight, get_param(), graph_visitor, make_dijkstra_visitor(), vertex_color, vertex_distance, and vertex_index.

template<typename T >

add_rvalue_reference<T>::type boost::declval

(

)

template<typename VP , typename EP , typename GP >

undirected_graph<VP,EP,GP>::degree_size_type boost::degree ( typename undirected_graph< VP, EP, GP >::vertex_descriptor  v, undirected_graph< VP, EP, GP > const &  g  )

inline

References degree().

template<typename VP , typename EP , typename GP >

directed_graph<VP,EP,GP>::degree_size_type boost::degree ( typename directed_graph< VP, EP, GP >::vertex_descriptor  v, directed_graph< VP, EP, GP > const &  g  )

inline

Referenced by boost::directed_graph< VertexProp, EdgeProp, GraphProp >::clear_vertex(), degree(), boost::detail::min_degree_vertex(), boost::degree_property_map< Graph >::operator[](), sloan_ordering(), sloan_start_end_vertices(), and boost::undirected_plod_iterator< RandomGenerator >::undirected_plod_iterator().

template<class vtype , class etype >

graph_traits< leda::GRAPH<vtype,etype> >::degree_size_type boost::degree	(	typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor	u,
		const leda::GRAPH< vtype, etype > &	g
	)

template<typename G >

graph_traits<G>::degree_size_type boost::degree	(	typename graph_traits< G >::vertex_descriptor	v,
		const subgraph< G > &	g
	)

References degree(), and boost::subgraph< Graph >::m_graph.

template<typename G , typename L , typename S >

labeled_graph<G,L,S>::degree_size_type boost::degree ( typename labeled_graph< G, L, S >::vertex_descriptor  v, labeled_graph< G, L, S > const &  g  )

inline

References degree().

graph_traits<leda::graph>::degree_size_type boost::degree	(	graph_traits< leda::graph >::vertex_descriptor	u,
		const leda::graph &	g
	)

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, undirectedS , VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::degree_size_type boost::degree	(	typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	v,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

Returns the number of edges incident on the given vertex.

The vertex

Parameters

v	must be local to the processor executing this routine.

References BOOST_ASSERT, and out_degree().

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, bidirectionalS , VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::degree_size_type boost::degree	(	typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	v,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References BOOST_ASSERT, in_degree(), and out_degree().

template<typename Graph , typename Vertex , typename Measure >

Measure::degree_type boost::degree_centrality ( const Graph &  g, Vertex  v, Measure  measure  )

inline

References BOOST_CONCEPT_ASSERT().

Referenced by all_degree_centralities(), degree_centrality(), influence(), and prestige().

template<typename Graph , typename Vertex >

graph_traits<Graph>::degree_size_type boost::degree_centrality ( const Graph &  g, Vertex  v  )

inline

References degree_centrality(), and measure_influence().

template<class T >

void boost::delete_clone ( const T *  r )

inline

References checked_delete().

Referenced by boost::heap_clone_allocator::deallocate_clone().

template<class T , multiprecision::expression_template_option ExpressionTemplates>

multiprecision::number<T, ExpressionTemplates> boost::denominator ( const rational< multiprecision::number< T, ExpressionTemplates > > &  a )

inline

References a.

Referenced by boost::math::quaternion< T >::operator/=(), and boost::math::octonion< T >::operator/=().

template<class VertexListGraph , class DFSVisitor , class ColorMap >

void boost::depth_first_search	(	const VertexListGraph &	g,
		DFSVisitor	vis,
		ColorMap	color,
		typename graph_traits< VertexListGraph >::vertex_descriptor	start_vertex
	)

References BOOST_CONCEPT_ASSERT(), boost::detail::depth_first_visit_impl(), boost::detail::get_default_starting_vertex(), implicit_cast(), put(), Vertex, vertices(), and white().

Referenced by boost::detail::biconnected_components_impl(), boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::boyer_myrvold_impl(), connected_components(), depth_first_search(), find_odd_cycle(), is_bipartite(), kosaraju_strong_components(), boost::graph::detail::depth_first_search_impl< Graph >::operator()(), boost::detail::strong_components_impl(), topological_sort(), and boost::maximum_cardinality_matching_verifier< Graph, MateMap, VertexIndexMap >::verify_matching().

template<class VertexListGraph , class DFSVisitor , class ColorMap >

void boost::depth_first_search	(	const VertexListGraph &	g,
		DFSVisitor	vis,
		ColorMap	color
	)

References depth_first_search(), boost::detail::get_default_starting_vertex(), and vertices().

template<typename DistributedGraph , typename DFSVisitor >

void boost::depth_first_visit	(	const DistributedGraph &	g,
		typename graph_traits< DistributedGraph >::vertex_descriptor	s,
		DFSVisitor	vis
	)

References boost::graph::distributed::tsin_depth_first_visit(), and vertex_index.

template<class IncidenceGraph , class DFSVisitor , class ColorMap >

void boost::depth_first_visit	(	const IncidenceGraph &	g,
		typename graph_traits< IncidenceGraph >::vertex_descriptor	u,
		DFSVisitor	vis,
		ColorMap	color
	)

References boost::detail::depth_first_visit_impl().

Referenced by cuthill_mckee_ordering(), dag_shortest_paths(), is_reachable(), king_ordering(), kosaraju_strong_components(), lengauer_tarjan_dominator_tree(), and boost::detail::isomorphism_algo< Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2 >::test_isomorphism().

template<class IncidenceGraph , class DFSVisitor , class ColorMap , class TerminatorFunc >

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

References boost::detail::depth_first_visit_impl().

template<class T >

std::string boost::diagnostic_information	(	T const &	e,
		bool	verbose = true
	)

References boost::exception_detail::diagnostic_information_impl(), boost::exception_detail::get_boost_exception(), and boost::exception_detail::get_std_exception().

char const* boost::diagnostic_information_what ( exception const &  e, bool  verbose = true  ) throw ( )

inline

References boost::exception_detail::diagnostic_information_impl(), boost::exception_detail::get_diagnostic_information(), and boost::detail::void.

template<typename Graph , typename EccentricityMap >

property_traits<EccentricityMap>::value_type boost::diameter ( const Graph &  g, EccentricityMap  ecc  )

inline

References radius_and_diameter().

Referenced by radius_and_diameter().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( diameter_range , _t)> boost::diameter_range

(

const PType &

p

)

template<typename Buffer , typename Vertex , typename DistanceType >

void boost::dijkstra_queue_update ( Buffer &  Q, Vertex  vertex, DistanceType  old_distance  )

inline

Updates a particular value in a queue used by Dijkstra's algorithm.

This routine is called by Dijkstra's algorithm after it has decreased the distance from the source vertex to the given vertex. By default, this routine will just call Q.update(vertex). However, other queues may provide more specialized versions of this routine.

Parameters

Q	the queue that will be updated.
vertex	the vertex whose distance has been updated
old_distance	the previous distance to vertex

References boost::detail::void.

Referenced by boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::gray_target().

template<typename DistributedGraph , typename DijkstraVisitor , typename PredecessorMap , typename DistanceMap , typename WeightMap , typename IndexMap , typename Compare , typename Combine , typename DistInf , typename DistZero , typename T , typename Tag , typename Base >

void boost::dijkstra_shortest_paths ( const DistributedGraph &  g, typename graph_traits< DistributedGraph >::vertex_descriptor  s, PredecessorMap  predecessor, DistanceMap  distance, WeightMap  weight, IndexMap  index_map, Compare  compare, Combine  combine, DistInf  inf, DistZero  zero, DijkstraVisitor  vis, const bgl_named_params< T, Tag, Base > &params   BOOST_GRAPH_ENABLE_IF_MODELS_PARMDistributedGraph, distributed_graph_tag  )

inline

Dijkstra's single-source shortest paths algorithm for distributed graphs.

Also implements the heuristics of:

Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, and Peter Sanders. A Parallelization of Dijkstra's Shortest Path Algorithm. In Lubos Brim, Jozef Gruska, and Jiri Zlatuska, editors, Mathematical Foundations of Computer Science (MFCS), volume 1450 of Lecture Notes in Computer Science, pages 722–731, 1998. Springer.

References color_map(), get_param(), is_default_param(), n, num_vertices(), boost::graph::detail::parallel_dijkstra_impl< ColorMap >::run(), vertex_color, boost::detail::vertices_size_type, and white_color.

template<class VertexListGraph , class SourceInputIter , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistInf , class DistZero , typename T , typename Tag , typename Base >

void boost::dijkstra_shortest_paths ( const VertexListGraph &  g, SourceInputIter  s_begin, SourceInputIter  s_end, PredecessorMap  predecessor, DistanceMap  distance, WeightMap  weight, IndexMap  index_map, Compare  compare, Combine  combine, DistInf  inf, DistZero  zero, DijkstraVisitor  vis, const bgl_named_params< T, Tag, Base > &  BOOST_GRAPH_ENABLE_IF_MODELS_PARMVertexListGraph, vertex_list_graph_tag  )

inline

References num_vertices().

Referenced by boost::detail::dijkstra_dispatch2(), dijkstra_shortest_paths(), johnson_all_pairs_shortest_paths(), boost::detail::graph::brandes_dijkstra_shortest_paths< WeightMap >::operator()(), prim_minimum_spanning_tree(), boost::detail::prim_mst_impl(), boost::detail::gursoy_shortest< EdgeWeightMap >::run(), and successive_shortest_path_nonnegative_weights().

template<class VertexListGraph , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistInf , class DistZero , typename T , typename Tag , typename Base >

void boost::dijkstra_shortest_paths ( const VertexListGraph &  g, typename graph_traits< VertexListGraph >::vertex_descriptor  s, PredecessorMap  predecessor, DistanceMap  distance, WeightMap  weight, IndexMap  index_map, Compare  compare, Combine  combine, DistInf  inf, DistZero  zero, DijkstraVisitor  vis, const bgl_named_params< T, Tag, Base > &  BOOST_GRAPH_ENABLE_IF_MODELS_PARMVertexListGraph, vertex_list_graph_tag  )

inline

References dijkstra_shortest_paths().

template<class VertexListGraph , class SourceInputIter , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistInf , class DistZero , class ColorMap >

void boost::dijkstra_shortest_paths ( const VertexListGraph &  g, SourceInputIter  s_begin, SourceInputIter  s_end, PredecessorMap  predecessor, DistanceMap  distance, WeightMap  weight, IndexMap  index_map, Compare  compare, Combine  combine, DistInf  inf, DistZero  zero, DijkstraVisitor  vis, ColorMap  color  )

inline

References dijkstra_shortest_paths_no_init(), it, put(), vertices(), and white().

template<class VertexListGraph , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistInf , class DistZero , class ColorMap >

void boost::dijkstra_shortest_paths ( const VertexListGraph &  g, typename graph_traits< VertexListGraph >::vertex_descriptor  s, PredecessorMap  predecessor, DistanceMap  distance, WeightMap  weight, IndexMap  index_map, Compare  compare, Combine  combine, DistInf  inf, DistZero  zero, DijkstraVisitor  vis, ColorMap  color  )

inline

References dijkstra_shortest_paths().

template<class VertexListGraph , class SourceInputIter , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistInf , class DistZero >

void boost::dijkstra_shortest_paths ( const VertexListGraph &  g, SourceInputIter  s_begin, SourceInputIter  s_end, PredecessorMap  predecessor, DistanceMap  distance, WeightMap  weight, IndexMap  index_map, Compare  compare, Combine  combine, DistInf  inf, DistZero  zero, DijkstraVisitor  vis  )

inline

References dijkstra_shortest_paths().

template<class VertexListGraph , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistInf , class DistZero >

void boost::dijkstra_shortest_paths ( const VertexListGraph &  g, typename graph_traits< VertexListGraph >::vertex_descriptor  s, PredecessorMap  predecessor, DistanceMap  distance, WeightMap  weight, IndexMap  index_map, Compare  compare, Combine  combine, DistInf  inf, DistZero  zero, DijkstraVisitor  vis  )

inline

References dijkstra_shortest_paths().

template<class VertexListGraph , class Param , class Tag , class Rest >

void boost::dijkstra_shortest_paths ( const VertexListGraph &  g, typename graph_traits< VertexListGraph >::vertex_descriptor  s, const bgl_named_params< Param, Tag, Rest > &  params  )

inline

References choose_const_pmap(), boost::detail::dijkstra_dispatch1(), edge_weight, get_param(), vertex_distance, and vertex_index.

template<typename Graph , typename DijkstraVisitor , typename PredecessorMap , typename DistanceMap , typename WeightMap , typename VertexIndexMap , typename DistanceCompare , typename DistanceWeightCombine , typename DistanceInfinity , typename DistanceZero >

void boost::dijkstra_shortest_paths_no_color_map	(	const Graph &	graph,
		typename graph_traits< Graph >::vertex_descriptor	start_vertex,
		PredecessorMap	predecessor_map,
		DistanceMap	distance_map,
		WeightMap	weight_map,
		VertexIndexMap	index_map,
		DistanceCompare	distance_compare,
		DistanceWeightCombine	distance_weight_combine,
		DistanceInfinity	distance_infinity,
		DistanceZero	distance_zero,
		DijkstraVisitor	visitor
	)

References BGL_FORALL_VERTICES_T, dijkstra_shortest_paths_no_color_map_no_init(), and put().

Referenced by boost::detail::dijkstra_no_color_map_dispatch2().

template<typename Graph , typename Param , typename Tag , typename Rest >

void boost::dijkstra_shortest_paths_no_color_map ( const Graph &  graph, typename graph_traits< Graph >::vertex_descriptor  start_vertex, const bgl_named_params< Param, Tag, Rest > &  params  )

inline

References choose_const_pmap(), boost::detail::dijkstra_no_color_map_dispatch1(), edge_weight, get_param(), vertex_distance, and vertex_index.

template<typename Graph , typename DijkstraVisitor , typename PredecessorMap , typename DistanceMap , typename WeightMap , typename VertexIndexMap , typename DistanceCompare , typename DistanceWeightCombine , typename DistanceInfinity , typename DistanceZero >

void boost::dijkstra_shortest_paths_no_color_map_no_init	(	const Graph &	graph,
		typename graph_traits< Graph >::vertex_descriptor	start_vertex,
		PredecessorMap	predecessor_map,
		DistanceMap	distance_map,
		WeightMap	weight_map,
		VertexIndexMap	index_map,
		DistanceCompare	distance_compare,
		DistanceWeightCombine	distance_weight_combine,
		DistanceInfinity	distance_infinity,
		DistanceZero	distance_zero,
		DijkstraVisitor	visitor
	)

References BGL_FORALL_OUTEDGES_T, distance_compare(), distance_map(), num_vertices(), relax(), target(), throw_exception(), boost::detail::type, and Vertex.

Referenced by dijkstra_shortest_paths_no_color_map().

template<class Graph , class SourceInputIter , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistZero >

void boost::dijkstra_shortest_paths_no_init ( const Graph &  g, SourceInputIter  s_begin, SourceInputIter  s_end, PredecessorMap  predecessor, DistanceMap  distance, WeightMap  weight, IndexMap  index_map, Compare  compare, Combine  combine, DistZero  zero, DijkstraVisitor  vis  )

inline

References boost::detail::type.

Referenced by dijkstra_shortest_paths(), and dijkstra_shortest_paths_no_init().

template<class Graph , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistZero >

void boost::dijkstra_shortest_paths_no_init ( const Graph &  g, typename graph_traits< Graph >::vertex_descriptor  s, PredecessorMap  predecessor, DistanceMap  distance, WeightMap  weight, IndexMap  index_map, Compare  compare, Combine  combine, DistZero  zero, DijkstraVisitor  vis  )

inline

References dijkstra_shortest_paths_no_init().

template<class Graph , class SourceInputIter , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistZero , class ColorMap >

void boost::dijkstra_shortest_paths_no_init ( const Graph &  g, SourceInputIter  s_begin, SourceInputIter  s_end, PredecessorMap  predecessor, DistanceMap  distance, WeightMap  weight, IndexMap  index_map, Compare  compare, Combine  combine, DistZero  zero, DijkstraVisitor  vis, ColorMap  color  )

inline

References breadth_first_visit(), num_vertices(), boost::detail::type, and Vertex.

template<class Graph , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistZero , class ColorMap >

void boost::dijkstra_shortest_paths_no_init ( const Graph &  g, typename graph_traits< Graph >::vertex_descriptor  s, PredecessorMap  predecessor, DistanceMap  distance, WeightMap  weight, IndexMap  index_map, Compare  compare, Combine  combine, DistZero  zero, DijkstraVisitor  vis, ColorMap  color  )

inline

References dijkstra_shortest_paths_no_init().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( vertex_discover_time , _t)> boost::discover_time_map

(

const PType &

p

)

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( vertex_displacement , _t)> boost::displacement_map

(

const PType &

p

)

template<class T >

BOOST_DEDUCED_TYPENAME range_difference<T>::type boost::distance ( const T &  r )

inline

References boost::asio::begin, and end.

Referenced by boost::geometry::detail::buffer::box_loop< BoxIn, BoxOut, T, C, D, N >::apply(), boost::geometry::strategy::buffer::join_miter::apply(), boost::geometry::strategy::distance::services::result_from_distance< cross_track_point_box< CalculationType, Strategy >, P, Box >::apply(), boost::geometry::strategy::distance::services::result_from_distance< cross_track< CalculationType, Strategy >, P, PS >::apply(), boost::polygon::bloatVertexInDirWithOptions(), boost::detail::graph::brandes_betweenness_centrality_dispatch2(), boost::graph::parallel::detail::brandes_betweenness_centrality_dispatch2(), boost::range::copy_n(), boost::graph::detail::initialize_global_index_map(), kamada_kawai_spring_layout(), boost::geometry::strategy::buffer::end_flat::max_distance(), boost::geometry::strategy::buffer::join_round_by_divide::max_distance(), boost::geometry::strategy::buffer::end_round::max_distance(), boost::geometry::strategy::buffer::join_round::max_distance(), boost::intrusive::linear_slist_algorithms< NodeTraits >::move_first_n_forward(), boost::intrusive::circular_slist_algorithms< NodeTraits >::move_forward(), boost::grid_graph< Dimensions, VertexIndex, EdgeIndex >::next(), boost::detail::graph::non_distributed_brandes_betweenness_centrality_dispatch2(), boost::detail::update_position_visitor< PositionMap, NodeDistanceMap, Topology, Graph >::operator()(), boost::grid_graph< Dimensions, VertexIndex, EdgeIndex >::previous(), boost::polygon::polygon_set_data< T >::resize_poly_down(), boost::polygon::polygon_set_data< T >::resize_poly_up(), boost::polygon::roundWithOptions(), boost::graph::distributed::delta_stepping_impl< Graph, PredecessorMap, DistanceMap, EdgeWeightMap >::run(), boost::graph::parallel::detail::betweenness_centrality_delta_stepping_impl< Graph, DistanceMap, IncomingMap, EdgeWeightMap, PathCountMap >::run(), and boost::mpi::wait_all().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( distance_combine , _t)> boost::distance_combine

(

const PType &

p

)

Referenced by boost::detail::prim_mst_impl().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( distance_compare , _t)> boost::distance_compare

(

const PType &

p

)

Referenced by dijkstra_shortest_paths_no_color_map_no_init().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( distance_inf , _t)> boost::distance_inf

(

const PType &

p

)

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( vertex_distance , _t)> boost::distance_map

(

const PType &

p

)

Referenced by cycle_canceling(), boost::detail::dag_sp_dispatch1(), boost::detail::dijkstra_dispatch1(), dijkstra_shortest_paths_no_color_map_no_init(), boost::detail::graph::brandes_dijkstra_shortest_paths< WeightMap >::operator()(), and successive_shortest_path_nonnegative_weights().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( vertex_distance2 , _t)> boost::distance_map2

(

const PType &

p

)

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( distance_zero , _t)> boost::distance_zero

(

const PType &

p

)

template<class TreeNode , class Compare , class ExternalData >

TreeNode boost::down_heap ( TreeNode  x, const Compare &  comp, ExternalData &  edata  )

inline

References boost::range::min_element(), and boost::flyweights::x.

Referenced by boost::mutable_queue< IndexedType, RandomAccessContainer, Comp, ID >::pop(), and update_heap().

template<typename T >

aux::enable_dump< T, dump_manip >::type boost::dump ( T *  data, std::size_t  size  )

inline

Creates a stream manipulator that will output contents of a memory region in hexadecimal form.

Parameters

data	The pointer to the beginning of the region
size	The size of the region, in bytes

Returns

The manipulator that is to be put to a stream

References boost::proto::envns_::data, and size().

Referenced by boost::spirit::lex::lexertl::lexer< Token, Iterator, Functor >::init_dfa().

template<typename T >

aux::enable_dump< T, bounded_dump_manip >::type boost::dump ( T *  data, std::size_t  size, std::size_t  max_size  )

inline

Creates a stream manipulator that will output contents of a memory region in hexadecimal form.

Parameters

data	The pointer to the beginning of the region
size	The size of the region, in bytes max_size The maximum number of bytes of the region to output

Returns

The manipulator that is to be put to a stream

References boost::proto::envns_::data, and size().

template<typename T >

dump_manip boost::dump_elements ( T *  data, std::size_t  count  )

inline

Creates a stream manipulator that will dump elements of an array in hexadecimal form.

Parameters

data	The pointer to the beginning of the array
count	The size of the region, in number of T elements

Returns

The manipulator that is to be put to a stream

References count, boost::proto::envns_::data, and T.

template<typename T >

bounded_dump_manip boost::dump_elements ( T *  data, std::size_t  count, std::size_t  max_count  )

inline

Creates a stream manipulator that will dump elements of an array in hexadecimal form.

Parameters

data	The pointer to the beginning of the array
count	The size of the region, in number of T elements max_count The maximum number of elements to output

Returns

The manipulator that is to be put to a stream

References count, boost::proto::envns_::data, and T.

template<typename B , typename A , typename stringT >

void boost::dump_to_string ( const dynamic_bitset< B, A > &  b, stringT &  s  )

inline

References to_string_helper().

template<class T , class U >

T* boost::dynamic_pointer_cast ( U *  ptr )

inline

References boost::python::ptr(), and T.

Referenced by boost::sources::aux::logger_singleton< TagT >::init_instance().

template<class T , class U >

intrusive_ptr<T> boost::dynamic_pointer_cast

(

intrusive_ptr< U > const &

p

)

References boost::intrusive_ptr< T >::get(), and T.

template<class T , class U >

shared_ptr< T > boost::dynamic_pointer_cast

(

shared_ptr< U > const &

r

)

References E, boost::multiprecision::backends::p, and boost::detail::void.

template<typename Graph , typename DistanceMap , typename Combinator >

property_traits<DistanceMap>::value_type boost::eccentricity ( const Graph &  g, DistanceMap  dist, Combinator  combine  )

inline

References BOOST_CONCEPT_ASSERT(), and Vertex.

Referenced by all_eccentricities(), and eccentricity().

template<typename Graph , typename DistanceMap >

property_traits<DistanceMap>::value_type boost::eccentricity ( const Graph &  g, DistanceMap  dist  )

inline

References BOOST_CONCEPT_ASSERT(), eccentricity(), and Vertex.

template<class EdgeList , class Allocator >

std::pair<typename detail::val_edge<EdgeList>::type, bool> boost::edge	(	typename EdgeList::value_type	u,
		typename EdgeList::value_type	v,
		std::vector< EdgeList, Allocator > &	g
	)

References end, boost::multiprecision::backends::i, and boost::xpressive::make_pair.

template<class BidirectionalGraph , class GRef >

std::pair< typename graph_traits<reverse_graph<BidirectionalGraph,GRef> >::edge_descriptor, bool> boost::edge ( const typename graph_traits< BidirectionalGraph >::vertex_descriptor  u, const typename graph_traits< BidirectionalGraph >::vertex_descriptor  v, const reverse_graph< BidirectionalGraph, GRef > &  g  )

inline

References edge(), boost::reverse_graph< BidirectionalGraph, GraphRef >::m_g, and boost::xpressive::make_pair.

template<typename G , typename EP , typename VP >

std::pair<typename filtered_graph<G, EP, VP>::edge_descriptor, bool> boost::edge	(	typename filtered_graph< G, EP, VP >::vertex_descriptor	u,
		typename filtered_graph< G, EP, VP >::vertex_descriptor	v,
		const filtered_graph< G, EP, VP > &	g
	)

References edge(), boost::filesystem::exists(), boost::filtered_graph< Graph, EdgePredicate, VertexPredicate >::m_edge_pred, boost::filtered_graph_base< Graph >::m_g, and boost::xpressive::make_pair.

template<typename VP , typename EP , typename GP >

std::pair<typename undirected_graph<VP,EP,GP>::edge_descriptor, bool> boost::edge	(	typename undirected_graph< VP, EP, GP >::vertex_descriptor	u,
		typename undirected_graph< VP, EP, GP >::vertex_descriptor	v,
		undirected_graph< VP, EP, GP > const &	g
	)

References edge().

template<typename VP , typename EP , typename GP >

std::pair<typename directed_graph<VP,EP,GP>::edge_descriptor, bool> boost::edge	(	typename directed_graph< VP, EP, GP >::vertex_descriptor	u,
		typename directed_graph< VP, EP, GP >::vertex_descriptor	v,
		directed_graph< VP, EP, GP > const &	g
	)

References edge().

template<typename G >

std::pair<typename subgraph<G>::edge_descriptor, bool> boost::edge	(	typename subgraph< G >::vertex_descriptor	u,
		typename subgraph< G >::vertex_descriptor	v,
		const subgraph< G > &	g
	)

References edge(), and boost::subgraph< Graph >::m_graph.

template<typename G , typename L , typename S >

std::pair<typename labeled_graph<G,L,S>::edge_descriptor, bool> boost::edge ( typename labeled_graph< G, L, S >::vertex_descriptor const &  u, typename labeled_graph< G, L, S >::vertex_descriptor const &  v, labeled_graph< G, L, S > const &  g  )

inline

References edge().

template<typename D , typename VP , typename EP , typename GP , typename A >

std::pair<typename adjacency_matrix<D,VP,EP,GP,A>::edge_descriptor, bool> boost::edge	(	typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor	u,
		typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor	v,
		const adjacency_matrix< D, VP, EP, GP, A > &	g
	)

References boost::filesystem::exists(), boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator >::get_edge(), boost::detail::get_edge_exists(), boost::detail::get_edge_property(), and boost::xpressive::make_pair.

Referenced by boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::add_remote_edge(), boost::graph::metis_reader::begin(), boost::concepts::BOOST_concept(), color_edge(), edge(), edge_by_label(), boost::polygon::polygon_90_set_data< T >::insert(), lookup_edge(), boost::detail::equivalent_edge_exists< Graph, typename boost::disable_if< is_multigraph< Graph > >::type >::operator()(), remove_edge(), boost::detail::rotate_fan(), boost::mutate_graph_impl< MutableGraph >::set_edge_property(), boost::graph_test< Graph >::test_adjacency_matrix(), warren_transitive_closure(), and warshall_transitive_closure().

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

std::pair<typename compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex>::edge_descriptor, bool> boost::edge ( Vertex  i, Vertex  j, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g  )

inline

References boost::xpressive::make_pair, out_edges(), and target().

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

std::pair<typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::edge_descriptor, bool> boost::edge ( typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor  i, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor  j, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g  )

inline

References edge_range(), and boost::xpressive::make_pair.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

std::pair< typename adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, directedS , VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::edge_descriptor, bool > boost::edge	(	typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, directedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	u,
		typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, directedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	v,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, directedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References BOOST_ASSERT, boost::xpressive::make_pair, out_edges(), PBGL_DISTRIB_ADJLIST_TYPE_CONFIG, process_id, and target().

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

std::pair< typename adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::edge_descriptor, bool > boost::edge	(	typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	u,
		typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	v,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References BOOST_ASSERT, boost::detail::in_edge_iterator, in_edges(), boost::xpressive::make_pair, out_edges(), process_id, source(), and target().

template<typename G , typename L , typename S >

std::pair<typename labeled_graph<G,L,S>::edge_descriptor, bool> boost::edge_by_label ( typename labeled_graph< G, L, S >::label_type const &  u, typename labeled_graph< G, L, S >::label_type const &  v, labeled_graph< G, L, S > const &  g  )

inline

References edge().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( edge_centrality , _t)> boost::edge_centrality_map

(

const PType &

p

)

Referenced by betweenness_centrality_clustering().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( edge_color , _t)> boost::edge_color_map

(

const PType &

p

)

template<typename Graph , typename ColorMap >

boost::property_traits<ColorMap>::value_type boost::edge_coloring	(	const Graph &	g,
		ColorMap	color
	)

References BGL_FORALL_EDGES_T, color_edge(), boost::accumulators::extract::max, and put().

template<class VertexListGraph , class OutputIterator >

graph_traits<VertexListGraph>::degree_size_type boost::edge_connectivity	(	VertexListGraph &	g,
		OutputIterator	disconnecting_set
	)

References add_edge(), boost::multiprecision::backends::c, boost::detail::degree_size_type, boost::polygon::delta(), edge_capacity, edge_residual_capacity, edge_reverse, edges(), edmonds_karp_max_flow(), boost::geometry::index::inserter(), boost::detail::min_degree_vertex(), boost::detail::neighbors(), num_vertices(), boost::detail::out_edge_iterator, out_edges(), boost::multiprecision::backends::p, boost::range::set_difference(), source(), target(), boost::detail::vertex_iterator, vertices(), and white().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( edge_copy , _t)> boost::edge_copy

(

const PType &

p

)

Referenced by generate_random_graph1().

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex>::edge_descriptor boost::edge_from_index ( EdgeIndex  idx, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g  )

inline

References BOOST_ASSERT, num_edges(), and boost::numeric::ublas::detail::upper_bound().

std::vector< std::vector< bool > > boost::edge_in_closure	(	num_vertices(g)	,
		std::vector< bool >	num_vertices(g), false
	)

template<typename T >

detail::graph::edge_or_side<true, T> boost::edge_length ( T  x )

inline

States that the given quantity is an edge length.

References boost::flyweights::x.

Referenced by boost::polygon::polygon_set_data< T >::compute_offset_edge(), and boost::detail::graph::kamada_kawai_spring_layout_impl< Topology, Graph, PositionMap, WeightMap, EdgeOrSideLength, Done, VertexIndexMap, DistanceMatrix, SpringStrengthMatrix, PartialDerivativeMap >::run().

template<typename G , typename EP , typename VP >

std::pair<typename filtered_graph<G, EP, VP>::out_edge_iterator, typename filtered_graph<G, EP, VP>::out_edge_iterator> boost::edge_range	(	typename filtered_graph< G, EP, VP >::vertex_descriptor	u,
		typename filtered_graph< G, EP, VP >::vertex_descriptor	v,
		const filtered_graph< G, EP, VP > &	g
	)

References edge_range(), boost::filtered_graph< Graph, EdgePredicate, VertexPredicate >::m_edge_pred, boost::filtered_graph_base< Graph >::m_g, boost::filtered_graph< Graph, EdgePredicate, VertexPredicate >::m_vertex_pred, boost::xpressive::make_pair, and boost::detail::out_edge_iterator.

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

std::pair<typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::out_edge_iterator, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::out_edge_iterator> boost::edge_range ( typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor  i, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor  j, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g  )

inline

References adjacent_vertices(), boost::graph_detail::equal_range(), boost::xpressive::make_pair, and Vertex.

Referenced by edge(), and edge_range().

template<class G , class EI , class T , class D >

std::pair<typename edge_list_impl<G,EI,T,D>::edge_iterator, typename edge_list_impl<G,EI,T,D>::edge_iterator> boost::edges

(

const edge_list_impl< G, EI, T, D > &

g_

)

References boost::xpressive::make_pair.

template<class G , class EI , class T , class D >

std::pair<typename edge_list_impl_ra<G,EI,T,D>::edge_iterator, typename edge_list_impl_ra<G,EI,T,D>::edge_iterator> boost::edges

(

const edge_list_impl_ra< G, EI, T, D > &

g_

)

References boost::xpressive::make_pair.

template<class BidirectionalGraph , class GRef >

std::pair<typename reverse_graph<BidirectionalGraph>::edge_iterator, typename reverse_graph<BidirectionalGraph>::edge_iterator> boost::edges

(

const reverse_graph< BidirectionalGraph, GRef > &

g

)

References edges(), and boost::reverse_graph< BidirectionalGraph, GraphRef >::m_g.

template<typename G , typename EP , typename VP >

std::pair<typename filtered_graph<G, EP, VP>::edge_iterator, typename filtered_graph<G, EP, VP>::edge_iterator> boost::edges

(

const filtered_graph< G, EP, VP > &

g

)

References edges(), boost::filtered_graph< Graph, EdgePredicate, VertexPredicate >::m_edge_pred, boost::filtered_graph_base< Graph >::m_g, boost::filtered_graph< Graph, EdgePredicate, VertexPredicate >::m_vertex_pred, and boost::xpressive::make_pair.

template<class vtype , class etype >

std::pair< typename graph_traits< leda::GRAPH<vtype,etype> >::edge_iterator, typename graph_traits< leda::GRAPH<vtype,etype> >::edge_iterator > boost::edges ( const leda::GRAPH< vtype, etype > &  g )

inline

References boost::xpressive::make_pair.

template<typename VP , typename EP , typename GP >

std::pair< typename undirected_graph<VP,EP,GP>::edge_iterator, typename undirected_graph<VP,EP,GP>::edge_iterator> boost::edges ( undirected_graph< VP, EP, GP > const &  g )

inline

References edges().

template<typename VP , typename EP , typename GP >

std::pair< typename directed_graph<VP,EP,GP>::edge_iterator, typename directed_graph<VP,EP,GP>::edge_iterator> boost::edges ( directed_graph< VP, EP, GP > const &  g )

inline

References edges().

template<typename G >

std::pair<typename subgraph<G>::edge_iterator, typename subgraph<G>::edge_iterator> boost::edges

(

const subgraph< G > &

g

)

References edges(), and boost::subgraph< Graph >::m_graph.

std::pair< graph_traits<leda::graph>::edge_iterator, graph_traits<leda::graph>::edge_iterator > boost::edges ( const leda::graph &  g )

inline

References boost::xpressive::make_pair.

template<typename G , typename L , typename S >

std::pair< typename labeled_graph<G,L,S>::edge_iterator, typename labeled_graph<G,L,S>::edge_iterator> boost::edges ( labeled_graph< G, L, S > const &  g )

inline

References edges().

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

std::pair<typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::edge_iterator, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::edge_iterator> boost::edges

(

const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &

g

)

References boost::xpressive::make_pair, num_vertices(), and Vertex.

template<typename D , typename VP , typename EP , typename GP , typename A >

std::pair<typename adjacency_matrix<D,VP,EP,GP,A>::edge_iterator, typename adjacency_matrix<D,VP,EP,GP,A>::edge_iterator> boost::edges

(

const adjacency_matrix< D, VP, EP, GP, A > &

g_

)

References boost::xpressive::first, last, and boost::xpressive::make_pair.

Referenced by boost::detail::copy_graph_impl< 0 >::apply(), bandwidth(), bellman_ford_shortest_paths(), betweenness_centrality_clustering(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::bk_max_flow(), boost::concepts::BOOST_concept(), boost::detail::graph::brandes_betweenness_centrality_impl(), boost::DistributedEdgeListGraphConcept< G >::const_constraints(), boost::DistributedEdgeListGraphConcept< G >::constraints(), edge_connectivity(), edges(), edgesum(), boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::extract_kuratowski_subgraph(), boost::greedy_matching< Graph, MateMap >::find_matching(), boost::extra_greedy_matching< Graph, MateMap >::find_matching(), floyd_warshall_all_pairs_shortest_paths(), fruchterman_reingold_force_directed_layout(), boost::detail::get_property_iter_range_kind(), if(), in_edge_set(), incremental_components(), is_straight_line_drawing(), johnson_all_pairs_shortest_paths(), boost::detail::kruskal_mst_impl(), boost::ssca_iterator< RandomGenerator, Graph >::operator++(), planar_face_traversal(), print_edges(), print_edges2(), random_edge(), boost::detail::randomize_property(), boost::detail::rec_two_graphs_common_spanning_trees(), boost::directed_graph< VertexProp, EdgeProp, GraphProp >::remove_edge(), boost::undirected_graph< VertexProp, EdgeProp, GraphProp >::remove_edge(), boost::undirected_graph< VertexProp, EdgeProp, GraphProp >::remove_edge_and_renumber_indices(), boost::directed_graph< VertexProp, EdgeProp, GraphProp >::remove_edge_and_renumber_indices(), remove_edge_if(), boost::undirected_graph< VertexProp, EdgeProp, GraphProp >::renumber_edge_indices(), boost::directed_graph< VertexProp, EdgeProp, GraphProp >::renumber_edge_indices(), boost::sorted_unique_rmat_iterator< RandomGenerator, Graph, EdgePredicate >::sorted_unique_rmat_iterator(), boost::graph_test< Graph >::test_edge_list_graph(), undirected_dfs(), boost::unique_rmat_iterator< RandomGenerator, Graph, EdgePredicate >::unique_rmat_iterator(), write_dimacs_max_flow(), write_graphml(), write_graphviz(), and boost::detail::write_graphviz_subgraph().

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

std::pair<typename compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex>::edge_iterator, typename compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex>::edge_iterator> boost::edges

(

const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &

g

)

References boost::xpressive::make_pair, and num_vertices().

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

std::pair< typename adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::edge_iterator, typename adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::edge_iterator> boost::edges

(

const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &

g

)

References edges(), boost::xpressive::make_pair, boost::iterators::make_transform_iterator(), and boost::locale::period::marks::second.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

std::pair< typename adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, undirectedS , VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::edge_iterator, typename adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, undirectedS , VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::edge_iterator> boost::edges

(

const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &

g

)

References boost::xpressive::make_pair.

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( edges_equivalent , _t)> boost::edges_equivalent

(

const PType &

p

)

Referenced by boost::detail::can_extend_graph(), and boost::detail::mcgregor_common_subgraphs_internal().

template<typename Graph , typename VertexIndexMap >

graph_traits<Graph>::vertices_size_type boost::edgesum	(	const Graph &	g,
		VertexIndexMap	index_map
	)

References abs(), edges(), end, boost::multiprecision::backends::i, source(), boost::accumulators::extract::sum, and target().

template<class Graph , class CapacityEdgeMap , class ResidualCapacityEdgeMap , class ReverseEdgeMap , class ColorMap , class PredEdgeMap >

property_traits<CapacityEdgeMap>::value_type boost::edmonds_karp_max_flow	(	Graph &	g,
		typename graph_traits< Graph >::vertex_descriptor	src,
		typename graph_traits< Graph >::vertex_descriptor	sink,
		CapacityEdgeMap	cap,
		ResidualCapacityEdgeMap	res,
		ReverseEdgeMap	rev,
		ColorMap	color,
		PredEdgeMap	pred
	)

References boost::detail::augment(), breadth_first_search(), gray(), make_bfs_visitor(), out_edges(), put(), record_edge_predecessors(), boost::detail::residual_graph(), vertices(), and white().

Referenced by boost::detail::edmonds_karp_dispatch2< ColorMap >::apply(), boost::detail::edmonds_karp_dispatch2< param_not_found >::apply(), edge_connectivity(), and edmonds_karp_max_flow().

template<class Graph , class P , class T , class R >

detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow	(	Graph &	g,
		typename graph_traits< Graph >::vertex_descriptor	src,
		typename graph_traits< Graph >::vertex_descriptor	sink,
		const bgl_named_params< P, T, R > &	params
	)

References boost::detail::edmonds_karp_dispatch1< PredMap >::apply(), get_param(), and vertex_predecessor.

template<class Graph >

property_traits< typename property_map<Graph, edge_capacity_t>::const_type >::value_type boost::edmonds_karp_max_flow	(	Graph &	g,
		typename graph_traits< Graph >::vertex_descriptor	src,
		typename graph_traits< Graph >::vertex_descriptor	sink
	)

References edmonds_karp_max_flow().

template<typename Graph , typename MateMap , typename VertexIndexMap >

void boost::edmonds_maximum_cardinality_matching ( const Graph &  g, MateMap  mate, VertexIndexMap  vm  )

inline

References matching().

Referenced by edmonds_maximum_cardinality_matching().

template<typename Graph , typename MateMap >

void boost::edmonds_maximum_cardinality_matching ( const Graph &  g, MateMap  mate  )

inline

References edmonds_maximum_cardinality_matching(), and vertex_index.

template<class T >

bool boost::empty ( const T &  r )

inline

References boost::asio::begin, and end.

Referenced by boost::dynamic_bitset< Block, Allocator >::all(), boost::geometry::range::back(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::back(), boost::signals2::shared_connection_block::blocking(), boost::concurrent::BOOST_SCOPED_ENUM_DECLARE_BEGIN(), boost::graph::distributed::build_reverse_graph(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::c_array(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::c_array(), boost::geometry::adapt::bp::holes_proxy< Polygon >::clear(), boost::algorithm::contains(), boost::python::arg_from_python< parameter::aux::maybe< T > >::convertible(), boost::sync_bounded_queue< ValueType >::empty(), boost::sync_queue< ValueType >::empty(), boost::geometry::range::erase(), boost::wave::util::macromap< ContextT >::expand_replacement_list(), boost::wave::util::macromap< ContextT >::expand_whole_tokensequence(), boost::sinks::basic_formatting_sink_frontend< CharT >::feed_record(), boost::wave::util::flex_string< E, T, A, Storage >::find_last_not_of(), boost::wave::util::flex_string< E, T, A, Storage >::find_last_of(), boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), boost::geometry::range::front(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::front(), boost::intrusive::treap_impl< ValueTraits, VoidOrKeyComp, VoidOrPrioComp, SizeType, ConstantTimeSize, HeaderHolder >::insert_unique(), boost::intrusive::sgtree_impl< ValueTraits, Compare, SizeType, FloatingPoint, HeaderHolder >::insert_unique(), is_kuratowski_subgraph(), operator safe_bool(), operator!(), boost::proto::functional::empty::operator()(), boost::python::arg_from_python< parameter::aux::maybe< T > >::operator()(), boost::graph::distributed::neighboring_tiles_force_pairs< PositionMap >::operator()(), boost::dynamic_bitset< Block, Allocator >::operator=(), boost::graph::distributed::cc_detail::parallel_connected_components(), boost::iostreams::detail::chain_base< Self, Ch, Tr, Alloc, Mode >::pop(), boost::geometry::range::pop_back(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::pop_back(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::pop_front(), boost::ptr_set_adapter< Key, std::set< void *, void_ptr_indirect_fun< Compare, Key >, Allocator >, CloneAllocator, true >::ptr_set_adapter(), boost::property_tree::string_path< String, Translator >::reduce(), remove_edge_if(), boost::ptr_container_detail::ptr_map_adapter_base< T, VoidPtrMultiMap, CloneAllocator, Ordered >::replace(), boost::graph::distributed::cc_detail::request_parent_map_entries(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::rerase(), boost::graph::parallel::detail::betweenness_centrality_delta_stepping_impl< Graph, DistanceMap, IncomingMap, EdgeWeightMap, PathCountMap >::run(), boost::sinks::basic_sink_frontend::try_feed_record(), and boost::sinks::basic_formatting_sink_frontend< CharT >::try_feed_record().

template<class T >

exception_detail::clone_impl<T> boost::enable_current_exception ( T const &  x )

inline

References boost::flyweights::x.

Referenced by throw_exception().

template<class T >

exception_detail::enable_error_info_return_type<T>::type boost::enable_error_info ( T const &  x )

inline

Referenced by throw_exception(), and boost::exception_detail::throw_exception_().

template<class OptionalPointee >

bool boost::equal_pointees ( OptionalPointee const &  x, OptionalPointee const &  y  )

inline

References boost::polygon::y().

Referenced by boost::equal_pointees_t< OptionalPointee >::operator()(), and operator==().

template<class Tag , class T >

std::string boost::error_info_name ( error_info< Tag, T > const &  x )

inline

Referenced by to_string().

template<typename T >

std::string boost::escape_dot_string ( const T &  obj )

inline

References boost::xpressive::_d, boost::xpressive::_w, boost::xpressive::alpha, boost::xpressive::as_xpr, boost::xpressive::regex_match(), boost::algorithm::replace_all(), and boost::asio::s.

Referenced by boost::label_writer< Name >::operator()(), boost::dynamic_properties_writer::operator()(), boost::dynamic_vertex_properties_writer::operator()(), boost::dynamic_graph_properties_writer< Graph >::operator()(), write_attributes(), write_graphviz(), and boost::detail::write_graphviz_subgraph().

template<typename T , typename TagT = void>

result_of::extract< T, TagT >::type boost::extract ( attribute_name const &  name, attribute_value_set const &  attrs  )

inline

The function extracts an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be extracted.

Parameters

name	The name of the attribute value to extract.
attrs	A set of attribute values in which to look for the specified attribute value.

Returns

A value_ref that refers to the extracted value, if found. An empty value otherwise.

Referenced by boost::spirit::qi::any_bool_parser< T, BoolPolicies >::parse(), boost::spirit::qi::any_real_parser< T, RealPolicies >::parse(), boost::spirit::qi::literal_bool_parser< T, BoolPolicies, no_attribute >::parse(), boost::spirit::qi::any_int_parser< T, Radix, MinDigits, MaxDigits >::parse(), boost::spirit::qi::literal_real_parser< T, RealPolicies, no_attribute >::parse(), boost::spirit::qi::any_uint_parser< T, Radix, MinDigits, MaxDigits >::parse(), boost::spirit::qi::literal_int_parser< T, Radix, MinDigits, MaxDigits, no_attribute >::parse(), and boost::spirit::qi::literal_uint_parser< T, Radix, MinDigits, MaxDigits, no_attribute >::parse().

template<typename T , typename TagT = void>

result_of::extract< T, TagT >::type boost::extract ( attribute_name const &  name, record const &  rec  )

inline

The function extracts an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be extracted.

Parameters

name	The name of the attribute value to extract.
rec	A log record. The attribute value will be sought among those associated with the record.

Returns

A value_ref that refers to the extracted value, if found. An empty value otherwise.

template<typename T , typename TagT = void>

result_of::extract< T, TagT >::type boost::extract ( attribute_name const &  name, record_view const &  rec  )

inline

The function extracts an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be extracted.

Parameters

name	The name of the attribute value to extract.
rec	A log record view. The attribute value will be sought among those associated with the record.

Returns

A value_ref that refers to the extracted value, if found. An empty value otherwise.

template<typename T , typename TagT = void>

result_of::extract< T, TagT >::type boost::extract ( attribute_value const &  value )

inline

The function extracts an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be extracted.

Parameters

value

Attribute value.

Returns

A value_ref that refers to the extracted value, if found. An empty value otherwise.

template<typename DescriptorT , template< typename > class ActorT>

result_of::extract< typename DescriptorT::value_type, DescriptorT >::type boost::extract ( expressions::attribute_keyword< DescriptorT, ActorT > const &  keyword, attribute_value_set const &  attrs  )

inline

The function extracts an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be extracted.

Parameters

keyword	The keyword of the attribute value to extract.
attrs	A set of attribute values in which to look for the specified attribute value.

Returns

A value_ref that refers to the extracted value, if found. An empty value otherwise.

References boost::expressions::attribute_keyword< DescriptorT, ActorT >::get_name().

template<typename DescriptorT , template< typename > class ActorT>

result_of::extract< typename DescriptorT::value_type, DescriptorT >::type boost::extract ( expressions::attribute_keyword< DescriptorT, ActorT > const &  keyword, record const &  rec  )

inline

The function extracts an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be extracted.

Parameters

keyword	The keyword of the attribute value to extract.
rec	A log record. The attribute value will be sought among those associated with the record.

Returns

A value_ref that refers to the extracted value, if found. An empty value otherwise.

References boost::expressions::attribute_keyword< DescriptorT, ActorT >::get_name().

template<typename DescriptorT , template< typename > class ActorT>

result_of::extract< typename DescriptorT::value_type, DescriptorT >::type boost::extract ( expressions::attribute_keyword< DescriptorT, ActorT > const &  keyword, record_view const &  rec  )

inline

The function extracts an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be extracted.

Parameters

keyword	The keyword of the attribute value to extract.
rec	A log record view. The attribute value will be sought among those associated with the record.

Returns

A value_ref that refers to the extracted value, if found. An empty value otherwise.

References boost::expressions::attribute_keyword< DescriptorT, ActorT >::get_name().

template<typename T , typename TagT = void, typename DefaultT >

result_of::extract_or_default< T, DefaultT, TagT >::type boost::extract_or_default ( attribute_name const &  name, attribute_value_set const &  attrs, DefaultT const &  def_val  )

inline

The function extracts an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be extracted.

Note

Caution must be exercised if the default value is a temporary object. Because the function returns a reference, if the temporary object is destroyed, the reference may become dangling.

Parameters

name	The name of the attribute value to extract.
attrs	A set of attribute values in which to look for the specified attribute value.
def_val	The default value

Returns

The extracted value, if found. The default value otherwise.

References boost::aux::unwrap_value_ref().

template<typename T , typename TagT = void, typename DefaultT >

result_of::extract_or_default< T, DefaultT, TagT >::type boost::extract_or_default ( attribute_name const &  name, record const &  rec, DefaultT const &  def_val  )

inline

The function extracts an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be visited.

Note

Caution must be exercised if the default value is a temporary object. Because the function returns a reference, if the temporary object is destroyed, the reference may become dangling.

Parameters

name	The name of the attribute value to extract.
rec	A log record. The attribute value will be sought among those associated with the record.
def_val	The default value

Returns

The extracted value, if found. The default value otherwise.

References boost::aux::unwrap_value_ref().

template<typename T , typename TagT = void, typename DefaultT >

result_of::extract_or_default< T, DefaultT, TagT >::type boost::extract_or_default ( attribute_name const &  name, record_view const &  rec, DefaultT const &  def_val  )

inline

The function extracts an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be visited.

Note

Caution must be exercised if the default value is a temporary object. Because the function returns a reference, if the temporary object is destroyed, the reference may become dangling.

Parameters

name	The name of the attribute value to extract.
rec	A log record view. The attribute value will be sought among those associated with the record.
def_val	The default value

Returns

The extracted value, if found. The default value otherwise.

References boost::aux::unwrap_value_ref().

template<typename T , typename TagT = void, typename DefaultT >

result_of::extract_or_default< T, DefaultT, TagT >::type boost::extract_or_default ( attribute_value const &  value, DefaultT const &  def_val  )

inline

The function extracts an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be visited.

Note

Caution must be exercised if the default value is a temporary object. Because the function returns a reference, if the temporary object is destroyed, the reference may become dangling.

Parameters

value	Attribute value.
def_val	The default value

Returns

The extracted value, if found. The default value otherwise.

References boost::aux::unwrap_value_ref().

template<typename DescriptorT , template< typename > class ActorT, typename DefaultT >

result_of::extract_or_default< typename DescriptorT::value_type, DefaultT, DescriptorT >::type boost::extract_or_default ( expressions::attribute_keyword< DescriptorT, ActorT > const &  keyword, attribute_value_set const &  attrs, DefaultT const &  def_val  )

inline

The function extracts an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be extracted.

Note

Caution must be exercised if the default value is a temporary object. Because the function returns a reference, if the temporary object is destroyed, the reference may become dangling.

Parameters

keyword	The keyword of the attribute value to extract.
attrs	A set of attribute values in which to look for the specified attribute value.
def_val	The default value

Returns

The extracted value, if found. The default value otherwise.

References boost::expressions::attribute_keyword< DescriptorT, ActorT >::get_name(), and boost::aux::unwrap_value_ref().

template<typename DescriptorT , template< typename > class ActorT, typename DefaultT >

result_of::extract_or_default< typename DescriptorT::value_type, DefaultT, DescriptorT >::type boost::extract_or_default ( expressions::attribute_keyword< DescriptorT, ActorT > const &  keyword, record const &  rec, DefaultT const &  def_val  )

inline

The function extracts an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be visited.

Note

Caution must be exercised if the default value is a temporary object. Because the function returns a reference, if the temporary object is destroyed, the reference may become dangling.

Parameters

keyword	The keyword of the attribute value to extract.
rec	A log record. The attribute value will be sought among those associated with the record.
def_val	The default value

Returns

The extracted value, if found. The default value otherwise.

References boost::expressions::attribute_keyword< DescriptorT, ActorT >::get_name(), and boost::aux::unwrap_value_ref().

template<typename DescriptorT , template< typename > class ActorT, typename DefaultT >

result_of::extract_or_default< typename DescriptorT::value_type, DefaultT, DescriptorT >::type boost::extract_or_default ( expressions::attribute_keyword< DescriptorT, ActorT > const &  keyword, record_view const &  rec, DefaultT const &  def_val  )

inline

The function extracts an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be visited.

Note

Caution must be exercised if the default value is a temporary object. Because the function returns a reference, if the temporary object is destroyed, the reference may become dangling.

Parameters

keyword	The keyword of the attribute value to extract.
rec	A log record view. The attribute value will be sought among those associated with the record.
def_val	The default value

Returns

The extracted value, if found. The default value otherwise.

References boost::expressions::attribute_keyword< DescriptorT, ActorT >::get_name(), and boost::aux::unwrap_value_ref().

template<typename T , typename TagT = void>

result_of::extract_or_throw< T, TagT >::type boost::extract_or_throw ( attribute_name const &  name, attribute_value_set const &  attrs  )

inline

The function extracts an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be extracted.

Parameters

name	The name of the attribute value to extract.
attrs	A set of attribute values in which to look for the specified attribute value.

Returns

The extracted value or a non-empty value_ref that refers to the value.

Exceptions

An	exception is thrown if the requested value cannot be extracted.

References boost::aux::unwrap_value_ref().

template<typename T , typename TagT = void>

result_of::extract_or_throw< T, TagT >::type boost::extract_or_throw ( attribute_name const &  name, record const &  rec  )

inline

The function extracts an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be extracted.

Parameters

name	The name of the attribute value to extract.
rec	A log record. The attribute value will be sought among those associated with the record.

Returns

The extracted value or a non-empty value_ref that refers to the value.

Exceptions

An	exception is thrown if the requested value cannot be extracted.

References boost::aux::unwrap_value_ref().

template<typename T , typename TagT = void>

result_of::extract_or_throw< T, TagT >::type boost::extract_or_throw ( attribute_name const &  name, record_view const &  rec  )

inline

The function extracts an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be extracted.

Parameters

name	The name of the attribute value to extract.
rec	A log record view. The attribute value will be sought among those associated with the record.

Returns

The extracted value or a non-empty value_ref that refers to the value.

Exceptions

An	exception is thrown if the requested value cannot be extracted.

References boost::aux::unwrap_value_ref().

template<typename T , typename TagT = void>

result_of::extract_or_throw< T, TagT >::type boost::extract_or_throw ( attribute_value const &  value )

inline

The function extracts an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be extracted.

Parameters

value

Attribute value.

Returns

The extracted value or a non-empty value_ref that refers to the value.

Exceptions

An	exception is thrown if the requested value cannot be extracted.

References boost::aux::unwrap_value_ref().

template<typename DescriptorT , template< typename > class ActorT>

result_of::extract_or_throw< typename DescriptorT::value_type, DescriptorT >::type boost::extract_or_throw ( expressions::attribute_keyword< DescriptorT, ActorT > const &  keyword, attribute_value_set const &  attrs  )

inline

The function extracts an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be extracted.

Parameters

keyword	The keyword of the attribute value to extract.
attrs	A set of attribute values in which to look for the specified attribute value.

Returns

The extracted value or a non-empty value_ref that refers to the value.

Exceptions

An	exception is thrown if the requested value cannot be extracted.

References boost::expressions::attribute_keyword< DescriptorT, ActorT >::get_name(), and boost::aux::unwrap_value_ref().

template<typename DescriptorT , template< typename > class ActorT>

result_of::extract_or_throw< typename DescriptorT::value_type, DescriptorT >::type boost::extract_or_throw ( expressions::attribute_keyword< DescriptorT, ActorT > const &  keyword, record const &  rec  )

inline

The function extracts an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be extracted.

Parameters

keyword	The keyword of the attribute value to extract.
rec	A log record. The attribute value will be sought among those associated with the record.

Returns

The extracted value or a non-empty value_ref that refers to the value.

Exceptions

An	exception is thrown if the requested value cannot be extracted.

References boost::expressions::attribute_keyword< DescriptorT, ActorT >::get_name(), and boost::aux::unwrap_value_ref().

template<typename DescriptorT , template< typename > class ActorT>

result_of::extract_or_throw< typename DescriptorT::value_type, DescriptorT >::type boost::extract_or_throw ( expressions::attribute_keyword< DescriptorT, ActorT > const &  keyword, record_view const &  rec  )

inline

The function extracts an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be extracted.

Parameters

keyword	The keyword of the attribute value to extract.
rec	A log record view. The attribute value will be sought among those associated with the record.

Returns

The extracted value or a non-empty value_ref that refers to the value.

Exceptions

An	exception is thrown if the requested value cannot be extracted.

References boost::expressions::attribute_keyword< DescriptorT, ActorT >::get_name(), and boost::aux::unwrap_value_ref().

template<typename GraphSecond , typename GraphFirst , typename CorrespondenceMapFirstToSecond , typename MembershipMapFirst >

void boost::fill_membership_map	(	const GraphFirst &	graph1,
		const CorrespondenceMapFirstToSecond	correspondence_map_1_to_2,
		MembershipMapFirst	membership_map1
	)

References BGL_FORALL_VERTICES_T, and put().

template<class Graph , class Capacity , class ResidualCapacity , class Weight >

property_traits<typename property_map < Graph, edge_capacity_t >::type>::value_type boost::find_flow_cost	(	const Graph &	g,
		Capacity	capacity,
		ResidualCapacity	residual_capacity,
		Weight	weight
	)

References BGL_FORALL_EDGES_T.

Referenced by find_flow_cost().

template<class Graph , class P , class T , class R >

property_traits<typename property_map < Graph, edge_capacity_t >::type>::value_type boost::find_flow_cost	(	const Graph &	g,
		const bgl_named_params< P, T, R > &	params
	)

References choose_const_pmap(), edge_capacity, edge_residual_capacity, edge_weight, find_flow_cost(), and get_param().

template<class Graph >

property_traits<typename property_map < Graph, edge_capacity_t >::type>::value_type boost::find_flow_cost

(

const Graph &

g

)

References find_flow_cost().

max_clique_visitor boost::find_max_clique ( std::size_t &  max )

inline

Referenced by bron_kerbosch_clique_number().

min_max_cycle_visitor boost::find_min_max_cycle ( std::size_t &  min_, std::size_t &  max_  )

inline

Referenced by tiernan_girth_and_circumference().

template<typename Graph , typename IndexMap , typename PartitionMap , typename OutputIterator >

OutputIterator boost::find_odd_cycle	(	const Graph &	graph,
		const IndexMap	index_map,
		PartitionMap	partition_map,
		OutputIterator	result
	)

Checks a given graph for bipartiteness and fills a given color map with white and black according to the bipartition.

If the graph is not bipartite, a sequence of vertices, producing an odd-cycle, is written to the output iterator. The final iterator value is returned. Runs in linear time in the size of the graph, if access to the property maps is in constant time.

Parameters

graph	The given graph.
index_map	An index map associating vertices with an index.
partition_map	A color map to fill with the bipartition.
result	An iterator to write the odd-cycle vertices to.

Returns

The final iterator value after writing.

General types and variables

Declare predecessor map

Initialize predecessor map

Call dfs

First path

Second path

Find beginning of common suffix

Copy the odd-length cycle

References boost::detail::check_bipartition(), boost::detail::colorize_bipartition(), boost::filesystem::detail::copy(), current, depth_first_search(), boost::sinks::event_log::error, make_dfs_visitor(), boost::xpressive::make_pair, boost::algorithm::mismatch(), next(), num_vertices(), predecessor_map(), put(), put_property(), record_predecessors(), boost::range::reverse_copy(), boost::detail::reverse_mismatch(), vertex_index_map(), vertices(), visitor(), and boost::detail::bipartite_visitor_error< Vertex >::witnesses.

Referenced by find_odd_cycle().

template<typename Graph , typename IndexMap , typename OutputIterator >

OutputIterator boost::find_odd_cycle	(	const Graph &	graph,
		const IndexMap	index_map,
		OutputIterator	result
	)

Checks a given graph for bipartiteness.

If the graph is not bipartite, a sequence of vertices, producing an odd-cycle, is written to the output iterator. The final iterator value is returned. Runs in linear time in the size of the graph, if access to the property maps is in constant time.

Parameters

graph	The given graph.
index_map	An index map associating vertices with an index.
result	An iterator to write the odd-cycle vertices to.

Returns

The final iterator value after writing.

References find_odd_cycle(), and num_vertices().

template<typename Graph , typename OutputIterator >

OutputIterator boost::find_odd_cycle	(	const Graph &	graph,
		OutputIterator	result
	)

Checks a given graph for bipartiteness.

If the graph is not bipartite, a sequence of vertices, producing an odd-cycle, is written to the output iterator. The final iterator value is returned. The graph must have an internal vertex_index property. Runs in linear time in the size of the graph, if access to the property maps is in constant time.

Parameters

graph	The given graph.
result	An iterator to write the odd-cycle vertices to.

Returns

The final iterator value after writing.

References find_odd_cycle(), and vertex_index.

template<typename ForwardIter >

ForwardIter boost::first_max_element	(	ForwardIter	first,
		ForwardIter	last
	)

References boost::detail::basic_first_max_element().

template<typename ForwardIter , class BinaryPredicate >

ForwardIter boost::first_max_element	(	ForwardIter	first,
		ForwardIter	last,
		BinaryPredicate	comp
	)

References boost::detail::basic_first_max_element().

template<typename ForwardIter >

ForwardIter boost::first_min_element	(	ForwardIter	first,
		ForwardIter	last
	)

References boost::detail::basic_first_min_element().

template<typename ForwardIter , class BinaryPredicate >

ForwardIter boost::first_min_element	(	ForwardIter	first,
		ForwardIter	last,
		BinaryPredicate	comp
	)

References boost::detail::basic_first_min_element().

template<typename ForwardIter >

std::pair<ForwardIter,ForwardIter> boost::first_min_first_max_element ( ForwardIter  first, ForwardIter  last  )

inline

References minmax_element().

template<typename ForwardIter , class BinaryPredicate >

std::pair<ForwardIter,ForwardIter> boost::first_min_first_max_element ( ForwardIter  first, ForwardIter  last, BinaryPredicate  comp  )

inline

References minmax_element().

template<typename ForwardIter >

std::pair<ForwardIter,ForwardIter> boost::first_min_last_max_element	(	ForwardIter	first,
		ForwardIter	last
	)

References boost::detail::basic_first_min_last_max_element().

template<typename ForwardIter , class BinaryPredicate >

std::pair<ForwardIter,ForwardIter> boost::first_min_last_max_element ( ForwardIter  first, ForwardIter  last, BinaryPredicate  comp  )

inline

References boost::detail::basic_first_min_last_max_element().

template<typename VertexAndEdgeListGraph , typename DistanceMatrix , typename WeightMap , typename BinaryPredicate , typename BinaryFunction , typename Infinity , typename Zero >

bool boost::floyd_warshall_all_pairs_shortest_paths	(	const VertexAndEdgeListGraph &	g,
		DistanceMatrix &	d,
		const WeightMap &	w,
		const BinaryPredicate &	compare,
		const BinaryFunction &	combine,
		const Infinity &	inf,
		const Zero &	zero
	)

References BOOST_CONCEPT_ASSERT(), edges(), boost::xpressive::first, boost::detail::floyd_warshall_dispatch(), boost::xpressive::inf, is_undirected(), last, boost::detail::min_with_compare(), source(), target(), boost::program_options::value(), and vertices().

Referenced by boost::detail::floyd_warshall_noninit_dispatch().

template<class VertexAndEdgeListGraph , class DistanceMatrix , class P , class T , class R >

bool boost::floyd_warshall_all_pairs_shortest_paths	(	const VertexAndEdgeListGraph &	g,
		DistanceMatrix &	d,
		const bgl_named_params< P, T, R > &	params
	)

References choose_const_pmap(), edge_weight, boost::detail::floyd_warshall_noninit_dispatch(), and get_param().

template<class VertexAndEdgeListGraph , class DistanceMatrix >

bool boost::floyd_warshall_all_pairs_shortest_paths	(	const VertexAndEdgeListGraph &	g,
		DistanceMatrix &	d
	)

References edge_weight, and boost::detail::floyd_warshall_noninit_dispatch().

template<typename VertexListGraph , typename DistanceMatrix , typename BinaryPredicate , typename BinaryFunction , typename Infinity , typename Zero >

bool boost::floyd_warshall_initialized_all_pairs_shortest_paths	(	const VertexListGraph &	g,
		DistanceMatrix &	d,
		const BinaryPredicate &	compare,
		const BinaryFunction &	combine,
		const Infinity &	inf,
		const Zero &	zero
	)

References BOOST_CONCEPT_ASSERT(), and boost::detail::floyd_warshall_dispatch().

Referenced by boost::detail::floyd_warshall_init_dispatch().

template<class VertexListGraph , class DistanceMatrix , class P , class T , class R >

bool boost::floyd_warshall_initialized_all_pairs_shortest_paths	(	const VertexListGraph &	g,
		DistanceMatrix &	d,
		const bgl_named_params< P, T, R > &	params
	)

References choose_const_pmap(), edge_weight, boost::detail::floyd_warshall_init_dispatch(), and get_param().

template<class VertexListGraph , class DistanceMatrix >

bool boost::floyd_warshall_initialized_all_pairs_shortest_paths	(	const VertexListGraph &	g,
		DistanceMatrix &	d
	)

References edge_weight, and boost::detail::floyd_warshall_init_dispatch().

boost::for	(	;it!	= topo_order.rend(); ++it,
		++	n
	)

References it, and n.

Referenced by boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::remove_local_edge().

boost::for

(

;it!

= topo_order.rend(); ++it

)

References add_vertex(), and it.

boost::for

(

)

References aiG_inL, avG_inL, and put().

boost::for

(

;current!

= last;++current

)

Initial value:

== vG_bimap.right.end())
      return

boost::for

(

;curr!

= last;++curr

)

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( force_pairs , _t)> boost::force_pairs

(

const PType &

p

)

Referenced by fruchterman_reingold_force_directed_layout().

template<class T >

T&& boost::forward ( typename::boost::move_detail::remove_reference< T >::type &  t )

inline

References T, and boost::flyweights::t.

template<class T >

T&& boost::forward ( typename::boost::move_detail::remove_reference< T >::type &&  t )

inline

References BOOST_STATIC_ASSERT(), T, boost::flyweights::t, and boost::program_options::value().

template<class Iterator , class T >

void boost::forward_readable_iterator_test	(	Iterator	i,
		Iterator	j,
		T	val1,
		T	val2
	)

References BOOST_TEST, boost::multiprecision::backends::i, and readable_iterator_test().

Referenced by bidirectional_readable_iterator_test(), and forward_swappable_iterator_test().

template<class Iterator , class T >

void boost::forward_swappable_iterator_test	(	Iterator	i,
		Iterator	j,
		T	val1,
		T	val2
	)

References forward_readable_iterator_test(), boost::multiprecision::backends::i, and swappable_iterator_test().

template<typename BlockIterator , typename B , typename A >

void boost::from_block_range ( BlockIterator  first, BlockIterator  last, dynamic_bitset< B, A > &  result  )

inline

References boost::filesystem::detail::copy().

template<typename C >

front_move_insert_iterator<C> boost::front_move_inserter ( C &  x )

inline

Returns: front_move_insert_iterator<C>(x).

References boost::flyweights::x.

template<typename Topology , typename Graph , typename PositionMap , typename AttractiveForce , typename RepulsiveForce , typename ForcePairs , typename Cooling , typename DisplacementMap >

void boost::fruchterman_reingold_force_directed_layout	(	const Graph &	g,
		PositionMap	position,
		const Topology &	topology,
		AttractiveForce	attractive_force,
		RepulsiveForce	repulsive_force,
		ForcePairs	force_pairs,
		Cooling	cool,
		DisplacementMap	displacement
	)

References attractive_force(), BGL_FORALL_VERTICES_T, BOOST_PREVENT_MACRO_SUBSTITUTION, BOOST_USING_STD_MAX, BOOST_USING_STD_MIN, boost::polygon::delta(), edges(), force_pairs(), boost::detail::maybe_jitter_point(), boost::accumulators::extract::min, num_vertices(), pow(), put(), source(), target(), boost::detail::vertex_iterator, and vertices().

Referenced by boost::graph::distributed::fruchterman_reingold_force_directed_layout(), fruchterman_reingold_force_directed_layout(), boost::detail::fr_force_directed_layout< DisplacementMap >::run(), and boost::detail::fr_force_directed_layout< param_not_found >::run().

template<typename Topology , typename Graph , typename PositionMap , typename Param , typename Tag , typename Rest >

void boost::fruchterman_reingold_force_directed_layout	(	const Graph &	g,
		PositionMap	position,
		const Topology &	topology,
		const bgl_named_params< Param, Tag, Rest > &	params
	)

References choose_param(), get_param(), make_grid_force_pairs(), and boost::detail::fr_force_directed_layout< DisplacementMap >::run().

template<typename Topology , typename Graph , typename PositionMap >

void boost::fruchterman_reingold_force_directed_layout	(	const Graph &	g,
		PositionMap	position,
		const Topology &	topology
	)

References attractive_force(), and fruchterman_reingold_force_directed_layout().

template<typename FunT >

BOOST_FORCEINLINE function_reference_wrapper< FunT > boost::fun_ref

(

FunT &

fun

)

template<typename F , typename G >

bool boost::function_equal	(	const F &	f,
		const G &	g
	)

References function_equal_impl().

Referenced by boost::function_base::contains(), operator!=(), and operator==().

template<typename F , typename G >

bool boost::function_equal_impl	(	const F &	f,
		const G &	g,
		long
	)

Referenced by function_equal().

template<class Model >

void boost::function_requires ( Model *  = 0 )

inline

References BOOST_CONCEPT_ASSERT().

Referenced by boost::detail::multi_array::multi_array_impl_base< T, NumDims >::access_element(), boost::const_multi_array_ref< T, NumDims, T * >::const_multi_array_ref(), boost::multi_array< T, NumDims, Allocator >::multi_array(), boost::multi_array_ref< T, NumDims >::multi_array_ref(), boost::detail::multi_array::const_sub_array< T, NumDims, T * >::operator()(), boost::detail::multi_array::const_multi_array_view< T, NumDims, T * >::operator()(), boost::const_multi_array_ref< T, NumDims, T * >::operator()(), boost::detail::multi_array::sub_array< T, NumDims >::operator()(), boost::detail::multi_array::multi_array_view< T, NumDims >::operator()(), boost::multi_array_ref< T, NumDims >::operator()(), boost::detail::multi_array::sub_array< T, NumDims >::operator=(), boost::detail::multi_array::multi_array_view< T, NumDims >::operator=(), boost::multi_array_ref< T, NumDims >::operator=(), boost::detail::multi_array::const_multi_array_view< T, NumDims, T * >::reindex(), boost::const_multi_array_ref< T, NumDims, T * >::reindex(), boost::const_multi_array_ref< T, NumDims, T * >::reshape(), and boost::multi_array< T, NumDims, Allocator >::resize().

BOOST_THREAD_DECL const system::error_category& boost::future_category

(

)

Referenced by boost::system::make_error_code(), and boost::system::make_error_condition().

template<typename IntType >

IntType boost::gcd	(	IntType	n,
		IntType	m
	)

References boost::math::gcd().

template<typename MutableGraph , class RandNumGen >

void boost::generate_random_graph	(	MutableGraph &	g,
		typename graph_traits< MutableGraph >::vertices_size_type	V,
		typename graph_traits< MutableGraph >::vertices_size_type	E,
		RandNumGen &	gen,
		bool	allow_parallel = true,
		bool	self_edges = false
	)

References generate_random_graph1().

template<typename MutableGraph , typename RandNumGen , typename VertexOutputIterator , typename EdgeOutputIterator >

void boost::generate_random_graph	(	MutableGraph &	g,
		typename graph_traits< MutableGraph >::vertices_size_type	V,
		typename graph_traits< MutableGraph >::vertices_size_type	E,
		RandNumGen &	gen,
		VertexOutputIterator	vertex_out,
		EdgeOutputIterator	edge_out,
		bool	self_edges = false
	)

References a, add_edge(), add_vertex(), boost::asio::b, E, boost::multiprecision::backends::i, boost::xpressive::make_pair, num_vertices(), random_vertex(), source(), target(), and boost::detail::vertices_size_type.

template<typename MutableGraph , class RandNumGen >

void boost::generate_random_graph1	(	MutableGraph &	g,
		typename graph_traits< MutableGraph >::vertices_size_type	V,
		typename graph_traits< MutableGraph >::vertices_size_type	E,
		RandNumGen &	gen,
		bool	allow_parallel = true,
		bool	self_edges = false
	)

References a, add_edge(), add_vertex(), boost::asio::b, copy_graph(), E, edge_copy(), boost::multiprecision::backends::i, num_vertices(), random_vertex(), vertex_copy(), and boost::detail::vertices_size_type.

Referenced by generate_random_graph().

template<typename T >

T boost::get ( boost::spirit::utree const &  x )

inline

References T, and boost::flyweights::x.

template<class Tag , class Bimap >

const BOOST_DEDUCED_TYPENAME ::boost::bimaps::support::data_type_by<Tag,Bimap>::type& boost::get	(	const ::boost::bimaps::views::map_view< Tag, Bimap > &	m,
		const BOOST_DEDUCED_TYPENAME::boost::bimaps::support::key_type_by< Tag, Bimap >::type &	key
	)

Referenced by boost::detail::astar_bfs_visitor< AStarHeuristic, UniformCostVisitor, UpdatableQueue, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, BinaryFunction, BinaryPredicate >::black_target(), boost::spirit::traits::make_attribute< Attribute const, ActualAttribute >::call(), boost::re_detail::create_cpp_regex_traits(), boost::re_detail::create_w32_regex_traits(), boost::mpl::aux::for_each_impl< false >::execute(), boost::graph::get(), boost::parallel::get(), boost::detail::get_wrapper_xxx(), boost::detail::astar_bfs_visitor< AStarHeuristic, UniformCostVisitor, UpdatableQueue, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, BinaryFunction, BinaryPredicate >::gray_target(), boost::container::container_detail::basic_string_base< Allocator >::next_capacity(), boost::container::container_detail::vector_alloc_holder< Allocator, alloc_version >::next_capacity(), boost::python::api::object_base_initializer(), and boost::detail::astar_bfs_visitor< AStarHeuristic, UniformCostVisitor, UpdatableQueue, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, BinaryFunction, BinaryPredicate >::tree_edge().

template<class Tag , class Bimap >

const BOOST_DEDUCED_TYPENAME ::boost::bimaps::support::data_type_by<Tag,Bimap>::type& boost::get	(	const ::boost::bimaps::views::unordered_map_view< Tag, Bimap > &	m,
		const BOOST_DEDUCED_TYPENAME::boost::bimaps::support::key_type_by< Tag, Bimap >::type &	key
	)

template<typename ProcessGroup , typename GlobalMap , typename StorageMap >

one_bit_color_type boost::get ( one_bit_color_map< local_property_map< ProcessGroup, GlobalMap, StorageMap > > const &  pm, typename property_traits< GlobalMap >::key_type  key  )

inline

template<typename ProcessGroup , typename GlobalMap , typename StorageMap >

two_bit_color_type boost::get ( two_bit_color_map< local_property_map< ProcessGroup, GlobalMap, StorageMap > > const &  pm, typename property_traits< GlobalMap >::key_type  key  )

inline

template<typename IndexMap >

one_bit_color_type boost::get ( const one_bit_color_map< IndexMap > &  pm, typename property_traits< IndexMap >::key_type  key  )

inline

References BOOST_ASSERT, BOOST_STATIC_CONSTANT(), boost::one_bit_color_map< IndexMap >::data, boost::shared_array< T >::get(), boost::multiprecision::backends::i, boost::one_bit_color_map< IndexMap >::index, and boost::one_bit_color_map< IndexMap >::n.

template<class Tag , class Value , class Next , class V , class Stag >

void boost::get	(	property< Tag, Value, Next > &	p,
		const V &	v,
		Stag	s
	)

References boost::property< Tag, T, Base >::m_base, and boost::asio::s.

template<typename ProcessGroup , typename GlobalMap , typename StorageMap >

local_property_map<ProcessGroup, GlobalMap, StorageMap>::reference boost::get ( const local_property_map< ProcessGroup, GlobalMap, StorageMap > &  pm, typename local_property_map< ProcessGroup, GlobalMap, StorageMap >::key_type const &  key  )

inline

References boost::local_property_map< ProcessGroup, GlobalMap, StorageMap >::base(), boost::local_property_map< ProcessGroup, GlobalMap, StorageMap >::global(), and boost::multiprecision::backends::p.

template<typename IndexMap >

two_bit_color_type boost::get ( const two_bit_color_map< IndexMap > &  pm, typename property_traits< IndexMap >::key_type  key  )

inline

References BOOST_ASSERT, BOOST_STATIC_CONSTANT(), boost::two_bit_color_map< IndexMap >::data, boost::shared_array< T >::get(), boost::multiprecision::backends::i, boost::two_bit_color_map< IndexMap >::index, and boost::two_bit_color_map< IndexMap >::n.

template<class Value , class Next , class V , class Stag >

void boost::get	(	property< Stag, Value, Next > &	p,
		const V &	v,
		Stag
	)

References boost::property< Tag, T, Base >::m_value.

template<typename ProcessGroup , typename GlobalMap , typename StorageMap >

one_bit_color_type boost::get ( one_bit_color_map< parallel::distributed_property_map< ProcessGroup, GlobalMap, one_bit_color_map< StorageMap > > > const &  pm, typename property_traits< GlobalMap >::key_type  key  )

inline

template<typename ProcessGroup , typename GlobalMap , typename StorageMap >

two_bit_color_type boost::get ( two_bit_color_map< parallel::distributed_property_map< ProcessGroup, GlobalMap, two_bit_color_map< StorageMap > > > const &  pm, typename property_traits< GlobalMap >::key_type  key  )

inline

template<typename OwnerMap , typename Tuple >

get_owner_of_first_tuple_element<OwnerMap, Tuple>::owner_type boost::get	(	get_owner_of_first_tuple_element< OwnerMap, Tuple >	o,
		Tuple	t
	)

References boost::get_owner_of_first_tuple_element< OwnerMap, Tuple >::get_owner(), and boost::flyweights::t.

template<typename U , BOOST_VARIANT_ENUM_PARAMS(typename T) >

add_pointer<U>::type boost::get ( boost::variant< BOOST_VARIANT_ENUM_PARAMS(T) > *  operand )

inline

References boost::detail::type.

template<typename T , BOOST_PP_ENUM_PARAMS(BOOST_MPL_LIMIT_LIST_SIZE,typename T) >

T const& boost::get ( boost::spirit::extended_variant< BOOST_PP_ENUM_PARAMS(BOOST_MPL_LIMIT_LIST_SIZE, T)> const &  x )

inline

References boost::flyweights::x.

template<typename T , BOOST_PP_ENUM_PARAMS(BOOST_MPL_LIMIT_LIST_SIZE,typename T) >

T& boost::get ( boost::spirit::extended_variant< BOOST_PP_ENUM_PARAMS(BOOST_MPL_LIMIT_LIST_SIZE, T)> &  x )

inline

References boost::flyweights::x.

template<typename Graph , typename P , typename N , typename C , typename Property >

property_map<Graph, Property>::type boost::get	(	Property	p,
		graph_as_tree< Graph, P, N, C > &	g
	)

References boost::multiprecision::backends::p.

template<typename U , BOOST_VARIANT_ENUM_PARAMS(typename T) >

add_pointer<const U>::type boost::get ( const boost::variant< BOOST_VARIANT_ENUM_PARAMS(T) > *  operand )

inline

References boost::detail::type.

template<typename OwnerMap , typename Vertex , typename T >

get_owner_of_first_pair_element<OwnerMap>::owner_type boost::get	(	get_owner_of_first_pair_element< OwnerMap >	o,
		std::pair< Vertex, T >	p
	)

References boost::get_owner_of_first_pair_element< OwnerMap >::get_owner(), and boost::multiprecision::backends::p.

template<typename T , BOOST_PP_ENUM_PARAMS(BOOST_MPL_LIMIT_LIST_SIZE,typename T) >

T const* boost::get ( boost::spirit::extended_variant< BOOST_PP_ENUM_PARAMS(BOOST_MPL_LIMIT_LIST_SIZE, T)> const *  x )

inline

References boost::flyweights::x.

template<typename Graph , typename P , typename N , typename C , typename Property >

property_map<Graph, Property>::const_type boost::get	(	Property	p,
		const graph_as_tree< Graph, P, N, C > &	g
	)

References boost::multiprecision::backends::p.

template<typename T , BOOST_PP_ENUM_PARAMS(BOOST_MPL_LIMIT_LIST_SIZE,typename T) >

T* boost::get ( boost::spirit::extended_variant< BOOST_PP_ENUM_PARAMS(BOOST_MPL_LIMIT_LIST_SIZE, T)> *  x )

inline

References boost::flyweights::x.

template<typename U , BOOST_VARIANT_ENUM_PARAMS(typename T) >

add_reference<U>::type boost::get ( boost::variant< BOOST_VARIANT_ENUM_PARAMS(T) > &  operand )

inline

References throw_exception(), and boost::detail::type.

template<typename Graph , typename P , typename N , typename C , typename Property , typename Key >

property_traits< typename property_map<Graph, Property>::const_type >::value_type boost::get	(	Property	p,
		const graph_as_tree< Graph, P, N, C > &	g,
		const Key &	k
	)

References boost::multiprecision::backends::p.

template<class G , class EI , class T , class D >

property_map< edge_list_impl<G,EI,T,D>, edge_index_t>::type boost::get	(	edge_index_t	,
		const edge_list_impl< G, EI, T, D > &
	)

template<typename U , BOOST_VARIANT_ENUM_PARAMS(typename T) >

add_reference<const U>::type boost::get ( const boost::variant< BOOST_VARIANT_ENUM_PARAMS(T) > &  operand )

inline

References throw_exception(), and boost::detail::type.

template<class G , class EI , class T , class D >

D boost::get ( edge_index_t  , const edge_list_impl< G, EI, T, D > &  , typename edge_list_impl< G, EI, T, D >::edge_descriptor  e  )

inline

template<typename PropertyTag , typename DistributedGraph >

property_map<local_subgraph<DistributedGraph>, PropertyTag>::type boost::get ( PropertyTag  p, local_subgraph< DistributedGraph > &  g  )

inline

References boost::multiprecision::backends::p.

template<typename K , typename V >

const readable_property_map_archetype<K,V>::reference& boost::get	(	const readable_property_map_archetype< K, V > &	,
		const typename readable_property_map_archetype< K, V >::key_type &
	)

References boost::static_object< T >::get().

template<typename PropertyTag , typename DistributedGraph >

property_map<local_subgraph<DistributedGraph>, PropertyTag>::const_type boost::get ( PropertyTag  p, const local_subgraph< DistributedGraph > &  g  )

inline

References boost::multiprecision::backends::p.

template<class T >

BOOST_GPU_ENABLED T const& boost::get

(

initialized< T > const &

x

)

References boost::flyweights::x.

template<class T >

BOOST_GPU_ENABLED T& boost::get

(

initialized< T > &

x

)

References boost::flyweights::x.

template<typename T , typename... Types>

T const& boost::get ( boost::spirit::x3::variant< Types...> const &  x )

inline

References boost::flyweights::x.

template<class G , class EI , class T , class D >

property_map< edge_list_impl_ra<G,EI,T,D>, edge_index_t>::type boost::get ( edge_index_t  , const edge_list_impl_ra< G, EI, T, D > &    )

inline

template<typename T , typename... Types>

T& boost::get ( boost::spirit::x3::variant< Types...> &  x )

inline

References boost::flyweights::x.

template<typename G , typename P , typename V >

property_map<property_graph_archetype<G, P, V>, P>::type boost::get	(	P	,
		property_graph_archetype< G, P, V > &
	)

template<class G , class EI , class T , class D >

D boost::get ( edge_index_t  , const edge_list_impl_ra< G, EI, T, D > &  , typename edge_list_impl_ra< G, EI, T, D >::edge_descriptor  e  )

inline

template<typename T , typename... Types>

T const* boost::get ( boost::spirit::x3::variant< Types...> const *  x )

inline

References boost::flyweights::x.

template<typename G , typename P , typename V >

property_map<property_graph_archetype<G, P, V>, P>::const_type boost::get	(	P	,
		const property_graph_archetype< G, P, V > &
	)

template<class T >

BOOST_GPU_ENABLED T const& boost::get

(

value_initialized< T > const &

x

)

References boost::flyweights::x.

template<typename T , typename... Types>

T* boost::get ( boost::spirit::x3::variant< Types...> *  x )

inline

References boost::flyweights::x.

template<typename G , typename P , typename K , typename V >

property_traits<typename property_map<property_graph_archetype<G, P, V>, P>::const_type>::value_type boost::get	(	P	p,
		const property_graph_archetype< G, P, V > &	g,
		K	k
	)

References boost::multiprecision::backends::p.

template<class T >

BOOST_GPU_ENABLED T& boost::get

(

value_initialized< T > &

x

)

References boost::flyweights::x.

sgb_vertex_id_map boost::get ( vertex_index_t  , sgb_graph_ptr  g  )

inline

sgb_vertex_name_map boost::get ( vertex_name_t  , sgb_graph_ptr    )

inline

template<class PropertyMap , class Reference , class K >

Reference boost::get ( const put_get_helper< Reference, PropertyMap > &  pa, const K &  k  )

inline

References boost::multiprecision::backends::pa.

template<typename Value , typename Key >

Value boost::get	(	const std::string &	name,
		const dynamic_properties &	dp,
		const Key &	key
	)

References any_cast(), BOOST_THROW_EXCEPTION, boost::multiprecision::backends::i, and boost::iostreams::gzip::flags::name.

template<typename EdgeList , typename Allocator >

identity_property_map boost::get	(	vertex_index_t	,
		const std::vector< EdgeList, Allocator > &
	)

template<typename Value , typename Key >

Value boost::get	(	const std::string &	name,
		const dynamic_properties &	dp,
		const Key &	key,
		type< Value >
	)

References any_cast(), BOOST_THROW_EXCEPTION, boost::multiprecision::backends::i, and boost::iostreams::gzip::flags::name.

template<typename EdgeList , typename Allocator >

identity_property_map boost::get	(	vertex_index_t	,
		std::vector< EdgeList, Allocator > &
	)

template<typename Key >

std::string boost::get	(	const std::string &	name,
		const dynamic_properties &	dp,
		const Key &	key
	)

References BOOST_THROW_EXCEPTION, boost::multiprecision::backends::i, and boost::iostreams::gzip::flags::name.

template<class BidirGraph , class GRef , class Property >

disable_if< is_same<Property, edge_underlying_t>, typename property_map<reverse_graph<BidirGraph,GRef>, Property>::type>::type boost::get	(	Property	p,
		reverse_graph< BidirGraph, GRef > &	g
	)

References boost::detail::type.

sgb_edge_length_map<const long&> boost::get ( edge_length_t  , const sgb_graph_ptr &    )

inline

sgb_edge_length_map<const long&> boost::get ( edge_length_t  , const sgb_const_graph_ptr &    )

inline

template<class BidirGraph , class GRef , class Property >

disable_if< is_same<Property, edge_underlying_t>, typename property_map<reverse_graph<BidirGraph,GRef>, Property>::const_type>::type boost::get	(	Property	p,
		const reverse_graph< BidirGraph, GRef > &	g
	)

References boost::adjacency_iterator< Graph, Vertex, OutEdgeIter, Difference >::m_g.

sgb_edge_length_map<long&> boost::get ( edge_length_t  , sgb_graph_ptr &    )

inline

long boost::get ( edge_length_t  , const sgb_graph_ptr &  , const sgb_edge &  key  )

inline

long boost::get ( edge_length_t  , const sgb_const_graph_ptr &  , const sgb_edge &  key  )

inline

template<class BidirectionalGraph , class GRef , class Property , class Key >

disable_if< is_same<Property, edge_underlying_t>, typename property_traits< typename property_map<reverse_graph<BidirectionalGraph, GRef>, Property>::const_type >::value_type>::type boost::get	(	Property	p,
		const reverse_graph< BidirectionalGraph, GRef > &	g,
		const Key &	k
	)

References boost::multiprecision::backends::p.

template<typename G , typename EP , typename VP , typename Property >

property_map<G, Property>::type boost::get	(	Property	p,
		filtered_graph< G, EP, VP > &	g
	)

References boost::multiprecision::backends::p.

template<typename G , typename EP , typename VP , typename Property >

property_map<G, Property>::const_type boost::get	(	Property	p,
		const filtered_graph< G, EP, VP > &	g
	)

References boost::multiprecision::backends::p.

template<class G >

enable_if<is_reverse_graph<G>, detail::underlying_edge_desc_map_type<typename graph_traits<typename G::base_type>::edge_descriptor> >::type boost::get	(	edge_underlying_t	,
		G &
	)

template<typename G , typename EP , typename VP , typename Property , typename Key >

property_map_value<G, Property>::type boost::get	(	Property	p,
		const filtered_graph< G, EP, VP > &	g,
		const Key &	k
	)

References boost::multiprecision::backends::p.

template<class G >

enable_if<is_reverse_graph<G>, typename graph_traits<typename G::base_type>::edge_descriptor>::type boost::get	(	edge_underlying_t	,
		G &	,
		const typename graph_traits< G >::edge_descriptor &	k
	)

template<class G >

enable_if<is_reverse_graph<G>, detail::underlying_edge_desc_map_type<typename graph_traits<typename G::base_type>::edge_descriptor> >::type boost::get	(	edge_underlying_t	,
		const G &
	)

template<class G >

enable_if<is_reverse_graph<G>, typename graph_traits<typename G::base_type>::edge_descriptor>::type boost::get	(	edge_underlying_t	,
		const G &	,
		const typename graph_traits< G >::edge_descriptor &	k
	)

template<class T >

sgb_vertex_util_map< u_property<T>, T&> boost::get ( u_property< T >  , sgb_graph_ptr &    )

inline

template<class T >

sgb_vertex_util_map< u_property<T>, const T&> boost::get ( u_property< T >  , const sgb_graph_ptr &    )

inline

template<class T >

sgb_vertex_util_map< u_property<T>, const T&> boost::get ( u_property< T >  , const sgb_const_graph_ptr &    )

inline

template<class T , class Key >

sgb_vertex_util_map< u_property<T>, const T&>::value_type boost::get ( u_property< T >  , const sgb_graph_ptr &  , const Key &  key  )

inline

template<class T , class Key >

sgb_vertex_util_map< u_property<T>, const T&>::value_type boost::get ( u_property< T >  , const sgb_const_graph_ptr &  , const Key &  key  )

inline

template<class T >

sgb_vertex_util_map< v_property<T>, T&> boost::get ( v_property< T >  , sgb_graph_ptr &    )

inline

template<class T >

sgb_vertex_util_map< v_property<T>, const T&> boost::get ( v_property< T >  , const sgb_graph_ptr &    )

inline

template<class T >

sgb_vertex_util_map< v_property<T>, const T&> boost::get ( v_property< T >  , const sgb_const_graph_ptr &    )

inline

template<class T , class Key >

sgb_vertex_util_map< v_property<T>, const T&>::value_type boost::get ( v_property< T >  , const sgb_graph_ptr &  , const Key &  key  )

inline

template<class T , class Key >

sgb_vertex_util_map< v_property<T>, const T&>::value_type boost::get ( v_property< T >  , const sgb_const_graph_ptr &  , const Key &  key  )

inline

template<class T >

sgb_vertex_util_map< w_property<T>, T&> boost::get ( w_property< T >  , sgb_graph_ptr &    )

inline

template<class T >

sgb_vertex_util_map< w_property<T>, const T&> boost::get ( w_property< T >  , const sgb_graph_ptr &    )

inline

template<class T >

sgb_vertex_util_map< w_property<T>, const T&> boost::get ( w_property< T >  , const sgb_const_graph_ptr &    )

inline

template<class T , class Key >

sgb_vertex_util_map< w_property<T>, const T&>::value_type boost::get ( w_property< T >  , const sgb_graph_ptr &  , const Key &  key  )

inline

template<class T , class Key >

sgb_vertex_util_map< w_property<T>, const T&>::value_type boost::get ( w_property< T >  , const sgb_const_graph_ptr &  , const Key &  key  )

inline

template<class T >

sgb_vertex_util_map< x_property<T>, T&> boost::get ( x_property< T >  , sgb_graph_ptr &    )

inline

template<class T >

sgb_vertex_util_map< x_property<T>, const T&> boost::get ( x_property< T >  , const sgb_graph_ptr &    )

inline

template<class T >

sgb_vertex_util_map< x_property<T>, const T&> boost::get ( x_property< T >  , const sgb_const_graph_ptr &    )

inline

template<class T , class Key >

sgb_vertex_util_map< x_property<T>, const T&>::value_type boost::get ( x_property< T >  , const sgb_graph_ptr &  , const Key &  key  )

inline

template<class T , class Key >

sgb_vertex_util_map< x_property<T>, const T&>::value_type boost::get ( x_property< T >  , const sgb_const_graph_ptr &  , const Key &  key  )

inline

template<class T >

sgb_vertex_util_map< y_property<T>, T&> boost::get ( y_property< T >  , sgb_graph_ptr &    )

inline

template<class T >

sgb_vertex_util_map< y_property<T>, const T&> boost::get ( y_property< T >  , const sgb_graph_ptr &    )

inline

template<class T >

sgb_vertex_util_map< y_property<T>, const T&> boost::get ( y_property< T >  , const sgb_const_graph_ptr &    )

inline

template<class T , class Key >

sgb_vertex_util_map< y_property<T>, const T&>::value_type boost::get ( y_property< T >  , const sgb_graph_ptr &  , const Key &  key  )

inline

template<class T , class Key >

sgb_vertex_util_map< y_property<T>, const T&>::value_type boost::get ( y_property< T >  , const sgb_const_graph_ptr &  , const Key &  key  )

inline

template<class T >

sgb_vertex_util_map< z_property<T>, T&> boost::get ( z_property< T >  , sgb_graph_ptr &    )

inline

template<class T >

sgb_vertex_util_map< z_property<T>, const T&> boost::get ( z_property< T >  , const sgb_graph_ptr &    )

inline

template<class T >

sgb_vertex_util_map< z_property<T>, const T&> boost::get ( z_property< T >  , const sgb_const_graph_ptr &    )

inline

template<class T , class Key >

sgb_vertex_util_map< z_property<T>, const T&>::value_type boost::get ( z_property< T >  , const sgb_graph_ptr &  , const Key &  key  )

inline

template<class T , class Key >

sgb_vertex_util_map< z_property<T>, const T&>::value_type boost::get ( z_property< T >  , const sgb_const_graph_ptr &  , const Key &  key  )

inline

template<class T >

sgb_edge_util_map< a_property<T>, T&> boost::get ( a_property< T >  , sgb_graph_ptr &    )

inline

template<class T >

sgb_edge_util_map< a_property<T>, const T&> boost::get ( a_property< T >  , const sgb_graph_ptr &    )

inline

template<class T >

sgb_edge_util_map< a_property<T>, const T&> boost::get ( a_property< T >  , const sgb_const_graph_ptr &    )

inline

template<class T , class Key >

sgb_edge_util_map< a_property<T>, const T&>::value_type boost::get ( a_property< T >  , const sgb_graph_ptr &  , const Key &  key  )

inline

template<class T , class Key >

sgb_edge_util_map< a_property<T>, const T&>::value_type boost::get ( a_property< T >  , const sgb_const_graph_ptr &  , const Key &  key  )

inline

template<class T >

sgb_edge_util_map< b_property<T>, T&> boost::get ( b_property< T >  , sgb_graph_ptr &    )

inline

template<class T >

sgb_edge_util_map< b_property<T>, const T&> boost::get ( b_property< T >  , const sgb_graph_ptr &    )

inline

template<class T >

sgb_edge_util_map< b_property<T>, const T&> boost::get ( b_property< T >  , const sgb_const_graph_ptr &    )

inline

template<class T , class Key >

sgb_edge_util_map< b_property<T>, const T&>::value_type boost::get ( b_property< T >  , const sgb_graph_ptr &  , const Key &  key  )

inline

template<class T , class Key >

sgb_edge_util_map< b_property<T>, const T&>::value_type boost::get ( b_property< T >  , const sgb_const_graph_ptr &  , const Key &  key  )

inline

template<typename VP , typename EP , typename GP , typename Property >

property_map< directed_graph<VP,EP,GP> , Property>::type boost::get ( Property  p, directed_graph< VP, EP, GP > &  g  )

inline

References boost::multiprecision::backends::p.

template<typename VP , typename EP , typename GP , typename Property >

property_map< directed_graph<VP,EP,GP> , Property>::const_type boost::get ( Property  p, directed_graph< VP, EP, GP > const &  g  )

inline

References boost::multiprecision::backends::p.

template<typename VP , typename EP , typename GP , typename Property >

property_map< undirected_graph<VP,EP,GP> , Property>::type boost::get ( Property  p, undirected_graph< VP, EP, GP > &  g  )

inline

References boost::multiprecision::backends::p.

template<typename VP , typename EP , typename GP >

property_map< directed_graph<VP,EP,GP> , vertex_all_t>::type boost::get ( vertex_all_t  , directed_graph< VP, EP, GP > &  g  )

inline

References vertex_all.

template<typename VP , typename EP , typename GP , typename Property >

property_map< undirected_graph<VP,EP,GP> , Property>::const_type boost::get ( Property  p, undirected_graph< VP, EP, GP > const &  g  )

inline

References boost::multiprecision::backends::p.

template<typename VP , typename EP , typename GP >

property_map< directed_graph<VP,EP,GP> , vertex_all_t>::const_type boost::get ( vertex_all_t  , directed_graph< VP, EP, GP > const &  g  )

inline

References vertex_all.

template<typename VP , typename EP , typename GP >

property_map< undirected_graph<VP,EP,GP> , vertex_all_t>::type boost::get ( vertex_all_t  , undirected_graph< VP, EP, GP > &  g  )

inline

References vertex_all.

template<typename VP , typename EP , typename GP >

property_map< directed_graph<VP,EP,GP> , edge_all_t>::type boost::get ( edge_all_t  , directed_graph< VP, EP, GP > &  g  )

inline

References edge_all.

template<typename VP , typename EP , typename GP >

property_map< undirected_graph<VP,EP,GP> , vertex_all_t>::const_type boost::get ( vertex_all_t  , undirected_graph< VP, EP, GP > const &  g  )

inline

References vertex_all.

template<typename VP , typename EP , typename GP >

property_map< directed_graph<VP,EP,GP> , edge_all_t>::const_type boost::get ( edge_all_t  , directed_graph< VP, EP, GP > const &  g  )

inline

References edge_all.

template<typename VP , typename EP , typename GP >

property_map< undirected_graph<VP,EP,GP> , edge_all_t>::type boost::get ( edge_all_t  , undirected_graph< VP, EP, GP > &  g  )

inline

References edge_all.

template<typename VP , typename EP , typename GP >

property_map< undirected_graph<VP,EP,GP> , edge_all_t>::const_type boost::get ( edge_all_t  , undirected_graph< VP, EP, GP > const &  g  )

inline

References edge_all.

template<typename VP , typename EP , typename GP , typename Property , typename Key >

property_traits< typename property_map< typename directed_graph<VP,EP,GP>::graph_type, Property >::const_type>::value_type boost::get ( Property  p, directed_graph< VP, EP, GP > const &  g, Key const &  k  )

inline

References boost::multiprecision::backends::p.

template<typename VP , typename EP , typename GP , typename Property , typename Key >

property_traits< typename property_map< typename undirected_graph<VP,EP,GP>::graph_type, Property >::const_type>::value_type boost::get ( Property  p, undirected_graph< VP, EP, GP > const &  g, Key const &  k  )

inline

References boost::multiprecision::backends::p.

template<typename VP , typename EP , typename GP , typename Key >

property_traits< typename property_map< typename directed_graph<VP,EP,GP>::graph_type, vertex_all_t >::const_type>::value_type boost::get ( vertex_all_t  , directed_graph< VP, EP, GP > const &  g, Key const &  k  )

inline

References boost::serialization::void_cast_detail::m_base, and vertex_all.

template<typename VP , typename EP , typename GP , typename Key >

property_traits< typename property_map< typename undirected_graph<VP,EP,GP>::graph_type, vertex_all_t >::const_type>::value_type boost::get ( vertex_all_t  , undirected_graph< VP, EP, GP > const &  g, Key const &  k  )

inline

References boost::serialization::void_cast_detail::m_base, and vertex_all.

template<typename VP , typename EP , typename GP , typename Key >

property_traits< typename property_map< typename directed_graph<VP,EP,GP>::graph_type, edge_all_t >::const_type>::value_type boost::get ( edge_all_t  , directed_graph< VP, EP, GP > const &  g, Key const &  k  )

inline

References edge_all, and boost::serialization::void_cast_detail::m_base.

template<typename VP , typename EP , typename GP , typename Key >

property_traits< typename property_map< typename undirected_graph<VP,EP,GP>::graph_type, edge_all_t >::const_type>::value_type boost::get ( edge_all_t  , undirected_graph< VP, EP, GP > const &  g, Key const &  k  )

inline

References edge_all, and boost::serialization::void_cast_detail::m_base.

template<typename G , typename L , typename S , typename Prop >

property_map< labeled_graph<G,L,S> , Prop>::type boost::get ( Prop  p, labeled_graph< G, L, S > &  g  )

inline

References boost::multiprecision::backends::p.

template<typename G , typename L , typename S , typename Prop >

property_map< labeled_graph<G,L,S> , Prop>::const_type boost::get ( Prop  p, labeled_graph< G, L, S > const &  g  )

inline

References boost::multiprecision::backends::p.

template<typename G , typename L , typename S , typename Prop , typename Key >

property_traits< typename property_map<typename labeled_graph<G,L,S>::graph_type, Prop>::const_type>::value_type boost::get ( Prop  p, labeled_graph< G, L, S > const &  g, const Key &  k  )

inline

References boost::multiprecision::backends::p.

template<class vtype , class etype >

leda_graph_id_map boost::get ( vertex_index_t  , const leda::GRAPH< vtype, etype > &  g  )

inline

template<class vtype , class etype >

leda_graph_id_map boost::get ( edge_index_t  , const leda::GRAPH< vtype, etype > &  g  )

inline

template<class vtype , class etype >

property_map< leda::GRAPH<vtype, etype>, vertex_all_t>::type boost::get ( vertex_all_t  , leda::GRAPH< vtype, etype > &  g  )

inline

template<class vtype , class etype >

property_map< leda::GRAPH<vtype, etype>, vertex_all_t>::const_type boost::get ( vertex_all_t  , const leda::GRAPH< vtype, etype > &  g  )

inline

template<class vtype , class etype >

property_map< leda::GRAPH<vtype, etype>, edge_all_t>::type boost::get ( edge_all_t  , leda::GRAPH< vtype, etype > &  g  )

inline

template<class vtype , class etype >

property_map< leda::GRAPH<vtype, etype>, edge_all_t>::const_type boost::get ( edge_all_t  , const leda::GRAPH< vtype, etype > &  g  )

inline

template<class vtype , class etype , class PropertyTag , class Key >

boost::property_traits< typename boost::property_map<leda::GRAPH<vtype, etype>,PropertyTag>::const_type >::value_type boost::get ( PropertyTag  p, const leda::GRAPH< vtype, etype > &  g, const Key &  key  )

inline

References boost::multiprecision::backends::p.

template<typename G , typename Property >

property_map<subgraph<G>, Property>::type boost::get	(	Property	p,
		subgraph< G > &	g
	)

template<typename G , typename Property >

property_map<subgraph<G>, Property>::const_type boost::get	(	Property	p,
		const subgraph< G > &	g
	)

template<typename G , typename Property , typename Key >

property_traits< typename property_map<subgraph<G>, Property>::const_type>::value_type boost::get	(	Property	p,
		const subgraph< G > &	g,
		const Key &	k
	)

template<typename G , typename Property >

property_map<subgraph<G>, global_property<Property> >::type boost::get	(	global_property< Property >	p,
		subgraph< G > &	g
	)

References boost::global_property< T >::value.

template<typename G , typename Property >

property_map<subgraph<G>, global_property<Property> >::const_type boost::get	(	global_property< Property >	p,
		const subgraph< G > &	g
	)

References boost::global_property< T >::value.

template<typename G , typename Property >

property_map<subgraph<G>, local_property<Property> >::type boost::get	(	local_property< Property >	p,
		subgraph< G > &	g
	)

References boost::local_property< T >::value.

template<typename G , typename Property >

property_map<subgraph<G>, local_property<Property> >::const_type boost::get	(	local_property< Property >	p,
		const subgraph< G > &	g
	)

References boost::local_property< T >::value.

template<typename D , typename VP , typename EP , typename GP , typename A , typename Tag >

property_map<adjacency_matrix<D, VP, EP, GP, A>, Tag>::type boost::get	(	Tag	tag,
		adjacency_matrix< D, VP, EP, GP, A > &	g
	)

template<typename D , typename VP , typename EP , typename GP , typename A , typename Tag >

property_map<adjacency_matrix<D, VP, EP, GP, A>, Tag>::const_type boost::get	(	Tag	tag,
		const adjacency_matrix< D, VP, EP, GP, A > &	g
	)

template<typename D , typename VP , typename EP , typename GP , typename A , typename Tag >

property_map<adjacency_matrix<D, VP, EP, GP, A>, Tag>::single_nonconst_type boost::get	(	Tag	tag,
		adjacency_matrix< D, VP, EP, GP, A > &	g,
		typename property_map< adjacency_matrix< D, VP, EP, GP, A >, Tag >::arg_type	a
	)

References a.

template<typename D , typename VP , typename EP , typename GP , typename A , typename Tag >

property_map<adjacency_matrix<D, VP, EP, GP, A>, Tag>::single_const_type boost::get	(	Tag	tag,
		const adjacency_matrix< D, VP, EP, GP, A > &	g,
		typename property_map< adjacency_matrix< D, VP, EP, GP, A >, Tag >::arg_type	a
	)

References a.

template<class T >

BOOST_DEDUCED_TYPENAME optional<T>::reference_const_type boost::get ( optional< T > const &  opt )

inline

template<class T >

BOOST_DEDUCED_TYPENAME optional<T>::reference_type boost::get ( optional< T > &  opt )

inline

template<class T >

BOOST_DEDUCED_TYPENAME optional<T>::pointer_const_type boost::get ( optional< T > const *  opt )

inline

template<class T >

BOOST_DEDUCED_TYPENAME optional<T>::pointer_type boost::get ( optional< T > *  opt )

inline

template<typename D , typename VP , typename EP , typename GP , typename A >

property_map<adjacency_matrix<D, VP, EP, GP, A>, vertex_index_t>::const_type boost::get	(	vertex_index_t	,
		adjacency_matrix< D, VP, EP, GP, A > &
	)

template<typename D , typename VP , typename EP , typename GP , typename A >

adjacency_matrix<D, VP, EP, GP, A>::vertex_descriptor boost::get	(	vertex_index_t	,
		adjacency_matrix< D, VP, EP, GP, A > &	,
		typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor	v
	)

template<typename D , typename VP , typename EP , typename GP , typename A >

property_map<adjacency_matrix<D, VP, EP, GP, A>, vertex_index_t>::const_type boost::get	(	vertex_index_t	,
		const adjacency_matrix< D, VP, EP, GP, A > &
	)

template<typename D , typename VP , typename EP , typename GP , typename A >

adjacency_matrix<D, VP, EP, GP, A>::vertex_descriptor boost::get	(	vertex_index_t	,
		const adjacency_matrix< D, VP, EP, GP, A > &	,
		typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor	v
	)

template<typename ProcessID , typename Key >

std::pair<ProcessID, Key> boost::get ( csr_vertex_global_map< ProcessID, Key >  , typename csr_vertex_global_map< ProcessID, Key >::key_type  k  )

inline

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex> , vertex_global_t>::type boost::get ( vertex_global_t  , compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g  )

inline

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename Tag >

property_map< compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex> , Tag>::type boost::get	(	Tag	tag,
		compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &	g
	)

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename Tag >

property_map< compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex> , Tag>::const_type boost::get	(	Tag	tag,
		const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &	g
	)

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

std::pair<typename ProcessGroup::process_id_type, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::vertex_descriptor> boost::get ( vertex_global_t  , compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor  k  )

inline

References BOOST_DISTRIB_CSR_GRAPH_TYPE, and vertex_global.

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename Tag >

property_traits<typename property_map< compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex> , Tag>::type>::reference boost::get	(	Tag	tag,
		compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &	g,
		typename property_map< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, Tag >::key_type	k
	)

References boost::python::converter::registry::lookup().

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex> , vertex_global_t>::const_type boost::get ( vertex_global_t  , const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g  )

inline

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename Tag >

property_traits<typename property_map< compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex> , Tag>::const_type>::reference boost::get	(	Tag	tag,
		const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &	g,
		typename property_map< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, Tag >::key_type	k
	)

References boost::python::converter::registry::lookup().

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

std::pair<typename ProcessGroup::process_id_type, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::vertex_descriptor> boost::get ( vertex_global_t  , const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor  k  )

inline

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

typed_identity_property_map<Vertex> boost::get ( vertex_index_t  , const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &    )

inline

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

Vertex boost::get ( vertex_index_t  , const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  , Vertex  v  )

inline

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

typed_identity_property_map<Vertex> boost::get ( vertex_index_t  , compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &    )

inline

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

Vertex boost::get ( vertex_index_t  , compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  , Vertex  v  )

inline

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

property_map< compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex> , edge_index_t>::const_type boost::get ( edge_index_t  , const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &    )

inline

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

EdgeIndex boost::get ( edge_index_t  , const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  , typename compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::edge_descriptor  e  )

inline

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

property_map< compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex> , edge_index_t>::const_type boost::get ( edge_index_t  , compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &    )

inline

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

EdgeIndex boost::get ( edge_index_t  , compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  , typename compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::edge_descriptor  e  )

inline

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

property_map< compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex> , vertex_all_t>::type boost::get ( vertex_all_t  , compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g  )

inline

References vertex_index.

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

property_map< compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex> , vertex_all_t>::const_type boost::get ( vertex_all_t  , const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g  )

inline

References vertex_index.

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

VertexProperty& boost::get ( vertex_all_t  , compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g, Vertex  v  )

inline

References vertex_all.

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

const VertexProperty& boost::get ( vertex_all_t  , const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g, Vertex  v  )

inline

References vertex_all.

template<typename ProcessID , typename Key >

ProcessID boost::get ( csr_vertex_owner_map< ProcessID, Key >  pm, typename csr_vertex_owner_map< ProcessID, Key >::key_type  k  )

inline

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

property_map< compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex> , edge_all_t>::type boost::get ( edge_all_t  , compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g  )

inline

References edge_index.

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

property_map< compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex> , edge_all_t>::const_type boost::get ( edge_all_t  , const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g  )

inline

References edge_index.

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

EdgeProperty& boost::get ( edge_all_t  , compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g, const typename compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::edge_descriptor &  e  )

inline

References edge_all.

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex> , vertex_owner_t>::type boost::get ( vertex_owner_t  , compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g  )

inline

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

const EdgeProperty& boost::get ( edge_all_t  , const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g, const typename compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::edge_descriptor &  e  )

inline

References edge_all.

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

ProcessGroup::process_id_type boost::get ( vertex_owner_t  , compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor  k  )

inline

References BOOST_DISTRIB_CSR_GRAPH_TYPE, and vertex_owner.

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex> , vertex_owner_t>::const_type boost::get ( vertex_owner_t  , const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g  )

inline

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

property_map< compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex> , graph_all_t>::type boost::get ( graph_all_t  , compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g  )

inline

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

ProcessGroup::process_id_type boost::get ( vertex_owner_t  , const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor  k  )

inline

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

property_map< compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex> , graph_all_t>::const_type boost::get ( graph_all_t  , const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g  )

inline

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

GraphProperty& boost::get ( graph_all_t  , compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g, compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > *    )

inline

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

const GraphProperty& boost::get ( graph_all_t  , const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g, compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > *    )

inline

template<typename Key >

Key boost::get ( csr_vertex_local_map< Key >  pm, typename csr_vertex_local_map< Key >::key_type  k  )

inline

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex> , vertex_local_t>::type boost::get ( vertex_local_t  , compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g  )

inline

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::vertex_descriptor boost::get ( vertex_local_t  , compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor  k  )

inline

References BOOST_DISTRIB_CSR_GRAPH_TYPE, and vertex_local.

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex> , vertex_local_t>::const_type boost::get ( vertex_local_t  , const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g  )

inline

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::vertex_descriptor boost::get ( vertex_local_t  , const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor  k  )

inline

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex> , vertex_index_t>::type boost::get ( vertex_index_t  , compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g  )

inline

References vertex_global, and vertex_local.

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::vertices_size_type boost::get ( vertex_index_t  , compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor  k  )

inline

References vertex_local.

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex> , vertex_index_t>::const_type boost::get ( vertex_index_t  , const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g  )

inline

References vertex_global, and vertex_local.

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::vertices_size_type boost::get ( vertex_index_t  , const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor  k  )

inline

References vertex_local.

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex> , vertex_local_index_t>::type boost::get ( vertex_local_index_t  , compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g  )

inline

References vertex_local.

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::vertices_size_type boost::get ( vertex_local_index_t  , compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor  k  )

inline

References vertex_local.

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex> , vertex_local_index_t>::const_type boost::get ( vertex_local_index_t  , const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g  )

inline

References vertex_local.

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::vertices_size_type boost::get ( vertex_local_index_t  , const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor  k  )

inline

References vertex_local.

template<typename ProcessID , typename Vertex , typename EdgeIndex >

std::pair<ProcessID, detail::csr_edge_descriptor<Vertex, EdgeIndex> > boost::get ( csr_edge_global_map< ProcessID, Vertex, EdgeIndex >  pm, typename csr_edge_global_map< ProcessID, Vertex, EdgeIndex >::key_type  k  )

inline

References Vertex.

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex> , edge_global_t>::type boost::get ( edge_global_t  , compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g  )

inline

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

std::pair<typename ProcessGroup::process_id_type, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::base_type::edge_descriptor> boost::get ( edge_global_t  , compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::edge_descriptor  k  )

inline

References BOOST_DISTRIB_CSR_GRAPH_TYPE, and edge_global.

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex> , edge_global_t>::const_type boost::get ( edge_global_t  , const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g  )

inline

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

std::pair<typename ProcessGroup::process_id_type, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::base_type::edge_descriptor> boost::get ( edge_global_t  , const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::edge_descriptor  k  )

inline

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex> , edge_index_t>::type boost::get ( edge_index_t  , compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g  )

inline

References edge_global, and edge_index.

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::edges_size_type boost::get ( edge_index_t  , compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::edge_descriptor  k  )

inline

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex> , edge_index_t>::const_type boost::get ( edge_index_t  , const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g  )

inline

References edge_global, and edge_index.

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::edges_size_type boost::get ( edge_index_t  , const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::edge_descriptor  k  )

inline

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex , typename Tag >

property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex> , Tag>::type boost::get	(	Tag	tag,
		compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &	g
	)

References BOOST_DISTRIB_CSR_GRAPH_TYPE, and boost::chrono::detail::reduce().

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex , typename Tag >

property_map< compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex> , Tag>::const_type boost::get	(	Tag	tag,
		const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &	g
	)

References BOOST_DISTRIB_CSR_GRAPH_TYPE, and boost::chrono::detail::reduce().

template<typename Property , typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

property_map< adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> , Property>::type boost::get	(	Property	p,
		adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References boost::chrono::detail::reduce().

template<typename Property , typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

property_map< adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> , Property>::const_type boost::get	(	Property	p,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References boost::chrono::detail::reduce().

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

property_map< adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> , vertex_local_index_t>::type boost::get	(	vertex_local_index_t	,
		adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References vertex_local_index.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

property_map< adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> , vertex_local_index_t>::const_type boost::get	(	vertex_local_index_t	,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References vertex_local_index.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

property_map< adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> , vertex_global_t>::const_type boost::get	(	vertex_global_t	,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References PBGL_DISTRIB_ADJLIST_TYPE.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

property_map< adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> , vertex_global_t>::const_type boost::get	(	vertex_global_t	,
		adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References PBGL_DISTRIB_ADJLIST_TYPE.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

property_map< adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> , vertex_owner_t>::type boost::get	(	vertex_owner_t	,
		adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

Retrieve a property map mapping from a vertex descriptor to its owner.

References PBGL_DISTRIB_ADJLIST_TYPE.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

property_map< adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> , vertex_owner_t>::const_type boost::get	(	vertex_owner_t	,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

Retrieve a property map mapping from a vertex descriptor to its owner.

References PBGL_DISTRIB_ADJLIST_TYPE.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

processor_id_type boost::get ( vertex_owner_t  , adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &  , typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor  v  )

inline

Retrieve the owner of a vertex.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

processor_id_type boost::get ( vertex_owner_t  , const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &  , typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor  v  )

inline

Retrieve the owner of a vertex.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

property_map< adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> , vertex_local_t>::type boost::get	(	vertex_local_t	,
		adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

Retrieve a property map that maps from a vertex descriptor to its local descriptor.

References PBGL_DISTRIB_ADJLIST_TYPE.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

property_map< adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> , vertex_local_t>::const_type boost::get	(	vertex_local_t	,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

Retrieve a property map that maps from a vertex descriptor to its local descriptor.

References PBGL_DISTRIB_ADJLIST_TYPE.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::local_vertex_descriptor boost::get ( vertex_local_t  , adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &  , typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor  v  )

inline

Retrieve the local descriptor of a vertex.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::local_vertex_descriptor boost::get ( vertex_local_t  , const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &  , typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor  v  )

inline

Retrieve the local descriptor of a vertex.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

property_map< adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> , edge_global_t>::const_type boost::get	(	edge_global_t	,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References PBGL_DISTRIB_ADJLIST_TYPE.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

property_map< adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> , edge_global_t>::const_type boost::get	(	edge_global_t	,
		adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References PBGL_DISTRIB_ADJLIST_TYPE.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

property_map< adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> , edge_owner_t>::type boost::get	(	edge_owner_t	,
		adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References PBGL_DISTRIB_ADJLIST_TYPE.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

property_map< adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> , edge_owner_t>::const_type boost::get	(	edge_owner_t	,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References PBGL_DISTRIB_ADJLIST_TYPE.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

property_map< adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> , edge_local_t>::type boost::get	(	edge_local_t	,
		adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References PBGL_DISTRIB_ADJLIST_TYPE.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

property_map< adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> , edge_local_t>::const_type boost::get	(	edge_local_t	,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References PBGL_DISTRIB_ADJLIST_TYPE.

template<typename Property , typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename Key >

property_traits<typename property_map< adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> , Property>::const_type >::value_type boost::get ( Property  p, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &  g, const Key &  key  )

inline

References BOOST_ASSERT, local(), boost::detail::parallel::owner(), boost::multiprecision::backends::p, and process_id.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

property_map< adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> , vertex_index_t>::type boost::get	(	vertex_index_t	vi,
		adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References vertex_global.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

property_map< adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> , vertex_index_t>::const_type boost::get	(	vertex_index_t	vi,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References vertex_global.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename T , typename Bundle >

property_map< adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> , T Bundle::*>::type boost::get	(	T Bundle::*	p,
		adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References boost::chrono::detail::reduce().

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename T , typename Bundle >

property_map< adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> , T Bundle::*>::const_type boost::get	(	T Bundle::*	p,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References boost::chrono::detail::reduce().

template<typename T , std::size_t N>

T(& boost::get_c_array

(

boost::array< T, N > &

arg

)

)[N]

template<typename T , std::size_t N>

const T(& boost::get_c_array

(

const boost::array< T, N > &

arg

)

)[N]

template<class D , class T >

D* boost::get_deleter

(

shared_array< T > const &

p

)

References boost::shared_array< T >::_internal_get_deleter().

template<class D , class T >

D * boost::get_deleter

(

shared_ptr< T > const &

p

)

References boost::python::api::del(), and boost::multiprecision::backends::p.

template<typename VP , typename EP , typename GP >

directed_graph<VP,EP,GP>::edge_index_type boost::get_edge_index ( typename directed_graph< VP, EP, GP >::edge_descriptor  v, directed_graph< VP, EP, GP > const &  g  )

inline

References edge_index.

Referenced by boost::graph::distributed::hohberg_vertex_processor< Graph >::operator()().

template<typename VP , typename EP , typename GP >

undirected_graph<VP,EP,GP>::edge_index_type boost::get_edge_index ( typename undirected_graph< VP, EP, GP >::edge_descriptor  v, undirected_graph< VP, EP, GP > const &  g  )

inline

References edge_index.

template<class ErrorInfo , class E >

exception_detail::get_error_info_return_type<E,typename ErrorInfo::value_type>::type boost::get_error_info ( E &  some_exception )

inline

References get(), and boost::flyweights::x.

template<class T >

BOOST_DEDUCED_TYPENAME optional<T>::reference_const_type boost::get_optional_value_or ( optional< T > const &  opt, BOOST_DEDUCED_TYPENAME optional< T >::reference_const_type  v  )

inline

References boost::optional< T >::get_value_or().

template<class T >

BOOST_DEDUCED_TYPENAME optional<T>::reference_type boost::get_optional_value_or ( optional< T > &  opt, BOOST_DEDUCED_TYPENAME optional< T >::reference_type  v  )

inline

References boost::optional< T >::get_value_or().

template<class Tag , typename Args >

const lookup_named_param_def<Tag, Args, param_not_found>::type& boost::get_param ( const Args &  p, Tag    )

inline

References boost::lookup_named_param_def< Tag, Args, Def >::get().

Referenced by boost::detail::edmonds_karp_dispatch2< ColorMap >::apply(), boost::detail::strong_comp_dispatch2< param_not_found >::apply(), boost::detail::edmonds_karp_dispatch2< param_not_found >::apply(), boost::detail::strong_comp_dispatch1< RootMap >::apply(), boost::detail::edmonds_karp_dispatch1< PredMap >::apply(), boost::detail::strong_comp_dispatch1< param_not_found >::apply(), boost::detail::edmonds_karp_dispatch1< param_not_found >::apply(), boost::detail::bicomp_dispatch3< PredecessorMap >::apply(), boost::detail::udfs_dispatch< param_not_found >::apply(), boost::detail::bicomp_dispatch3< param_not_found >::apply(), boost::graph::detail::mas_dispatch< WeightMap >::apply(), boost::detail::neighbor_bfs_dispatch< ColorMap >::apply(), boost::detail::bicomp_dispatch2< LowPointMap >::apply(), boost::graph::detail::mas_dispatch< boost::param_not_found >::apply(), boost::detail::neighbor_bfs_dispatch< param_not_found >::apply(), boost::detail::bicomp_dispatch2< param_not_found >::apply(), boost::detail::bfs_dispatch< ColorMap >::apply(), boost::detail::bicomp_dispatch1< DiscoverTimeMap >::apply(), boost::detail::bicomp_dispatch1< param_not_found >::apply(), boost::detail::bfs_dispatch< param_not_found >::apply(), boost::detail::bellman_dispatch(), boost::detail::bellman_dispatch2(), bellman_ford_shortest_paths(), boost::detail::bfs_helper(), biconnected_components(), boykov_kolmogorov_max_flow(), brandes_betweenness_centrality(), breadth_first_search(), breadth_first_visit(), copy_component(), copy_graph(), cycle_canceling(), boost::detail::cycle_canceling_dispatch1(), boost::detail::cycle_canceling_dispatch2(), dag_shortest_paths(), boost::detail::dag_sp_dispatch2(), boost::detail::dijkstra_dispatch2(), boost::detail::dijkstra_no_color_map_dispatch2(), dijkstra_shortest_paths(), dijkstra_shortest_paths_no_color_map(), edmonds_karp_max_flow(), find_flow_cost(), floyd_warshall_all_pairs_shortest_paths(), boost::detail::floyd_warshall_init_dispatch(), floyd_warshall_initialized_all_pairs_shortest_paths(), boost::detail::floyd_warshall_noninit_dispatch(), fruchterman_reingold_force_directed_layout(), gursoy_atun_layout(), boost::detail::isomorphism_impl(), johnson_all_pairs_shortest_paths(), boost::detail::johnson_dispatch(), kruskal_minimum_spanning_tree(), maximum_adjacency_search(), mcgregor_common_subgraphs(), mcgregor_common_subgraphs_maximum(), mcgregor_common_subgraphs_maximum_unique(), mcgregor_common_subgraphs_unique(), boost::detail::neighbor_bfs_helper(), neighbor_breadth_first_search(), neighbor_breadth_first_visit(), non_distributed_brandes_betweenness_centrality(), boost::graph::detail::stoer_wagner_min_cut_impl< UndirectedGraph, WeightMap >::operator()(), boost::graph::detail::maximum_adjacency_search_impl< Graph >::operator()(), prim_minimum_spanning_tree(), push_relabel_max_flow(), boost::detail::fr_force_directed_layout< param_not_found >::run(), strong_components(), successive_shortest_path_nonnegative_weights(), boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(), boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(), transitive_closure(), undirected_dfs(), vf2_graph_iso(), vf2_subgraph_iso(), and vf2_subgraph_mono().

template<class T >

T* boost::get_pointer

(

T *

p

)

References boost::multiprecision::backends::p.

Referenced by boost::statechart::state_machine< MostDerived, InitialState, Allocator, ExceptionTranslator >::add(), BOOST_MEM_FN_NAME(), boost::io::detail::distribute(), boost::statechart::simple_state< MostDerived, Context, InnerInitial, historyMode >::exit_impl(), boost::statechart::simple_state< MostDerived, Context, InnerInitial, historyMode >::outermost_context(), boost::statechart::simple_state< MostDerived, Context, InnerInitial, historyMode >::outermost_context_base(), boost::statechart::state_machine< MostDerived, InitialState, Allocator, ExceptionTranslator >::post_event_impl(), boost::statechart::simple_state< MostDerived, Context, InnerInitial, historyMode >::set_context(), boost::statechart::state_machine< MostDerived, InitialState, Allocator, ExceptionTranslator >::state_cast(), boost::statechart::state_machine< MostDerived, InitialState, Allocator, ExceptionTranslator >::state_downcast(), and boost::statechart::simple_state< MostDerived, Context, InnerInitial, historyMode >::~simple_state().

template<class T >

T* boost::get_pointer

(

std::auto_ptr< T > const &

p

)

template<class T >

T* boost::get_pointer

(

std::unique_ptr< T > const &

p

)

template<class T >

T* boost::get_pointer

(

std::shared_ptr< T > const &

p

)

template<class T >

T* boost::get_pointer ( scoped_ptr< T > const &  p )

inline

References boost::multiprecision::backends::p.

template<class T >

T* boost::get_pointer

(

intrusive_ptr< T > const &

p

)

References boost::intrusive_ptr< T >::get().

template<class T >

shared_ptr<T>::element_type* boost::get_pointer ( shared_ptr< T > const &  p )

inline

References boost::multiprecision::backends::p.

template<class T >

BOOST_DEDUCED_TYPENAME optional<T>::pointer_const_type boost::get_pointer ( optional< T > const &  opt )

inline

References boost::optional_detail::optional_base< T >::get_ptr().

template<class T >

BOOST_DEDUCED_TYPENAME optional<T>::pointer_type boost::get_pointer ( optional< T > &  opt )

inline

References boost::optional_detail::optional_base< T >::get_ptr().

template<typename Graph , typename Tag >

graph_property<Graph, graph_bundle_t>::type& boost::get_property	(	Graph &	g,
		Tag
	)

template<typename Graph , typename Tag >

graph_property<Graph, graph_bundle_t>::type const& boost::get_property	(	Graph const &	g,
		Tag
	)

template<typename Graph >

graph_property<Graph, graph_bundle_t>::type& boost::get_property ( Graph &  g )

inline

References get_property(), and graph_bundle.

template<typename Graph >

graph_property<Graph, graph_bundle_t>::type const& boost::get_property ( const Graph &  g )

inline

References get_property(), and graph_bundle.

template<typename OEL , typename VL , typename D , typename VP , typename EP , typename GP , typename EL , typename Tag >

graph_property< adjacency_list<OEL,VL,D,VP,EP,GP,EL> , Tag>::type& boost::get_property ( adjacency_list< OEL, VL, D, VP, EP, GP, EL > &  g, Tag  tag  )

inline

References get_property_value().

Referenced by boost::detail::graph::mutate_graph_impl< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > >::finish_building_graph(), get_property(), boost::serialization::load(), make_graph_attributes_writer(), boost::undirected_graph< VertexProp, EdgeProp, GraphProp >::operator[](), boost::directed_graph< VertexProp, EdgeProp, GraphProp >::operator[](), boost::adjacency_list< listS, listS, undirectedS, internal_vertex_property, internal_edge_property, GraphProp, listS >::operator[](), boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator >::operator[](), boost::compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::operator[](), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::operator[](), boost::serialization::save(), and boost::detail::write_graphviz_subgraph().

template<typename OEL , typename VL , typename D , typename VP , typename EP , typename GP , typename EL , typename Tag >

graph_property< adjacency_list<OEL,VL,D,VP,EP,GP,EL> , Tag>::type const& boost::get_property ( adjacency_list< OEL, VL, D, VP, EP, GP, EL > const &  g, Tag  tag  )

inline

References get_property_value().

template<typename BidirectionalGraph , typename GRef , typename Tag >

boost::mpl::if_< boost::is_const<typename boost::remove_reference<GRef>::type>, const typename graph_property<BidirectionalGraph, Tag>::type&, typename graph_property<BidirectionalGraph, Tag>::type& >::type boost::get_property ( const reverse_graph< BidirectionalGraph, GRef > &  g, Tag  tag  )

inline

References get_property(), and boost::reverse_graph< BidirectionalGraph, GraphRef >::m_g.

template<typename VP , typename EP , typename GP , class Property >

graph_property< directed_graph<VP,EP,GP> , Property>::type& boost::get_property	(	directed_graph< VP, EP, GP > &	g,
		Property	p
	)

References get_property(), and boost::multiprecision::backends::p.

template<typename VP , typename EP , typename GP , class Property >

graph_property< directed_graph<VP,EP,GP> , Property>::type const& boost::get_property	(	directed_graph< VP, EP, GP > const &	g,
		Property	p
	)

References get_property(), and boost::multiprecision::backends::p.

template<typename VP , typename EP , typename GP , class Property >

graph_property< undirected_graph<VP,EP,GP> , Property>::type& boost::get_property ( undirected_graph< VP, EP, GP > &  g, Property  p  )

inline

References get_property(), and boost::multiprecision::backends::p.

template<typename VP , typename EP , typename GP , class Property >

graph_property< undirected_graph<VP,EP,GP> , Property>::type const& boost::get_property ( undirected_graph< VP, EP, GP > const &  g, Property  p  )

inline

References get_property(), and boost::multiprecision::backends::p.

template<typename G , typename Tag >

graph_property<G, Tag>::type& boost::get_property ( subgraph< G > &  g, Tag  tag  )

inline

References get_property(), and boost::subgraph< Graph >::m_graph.

template<typename G , typename Tag >

const graph_property<G, Tag>::type& boost::get_property ( const subgraph< G > &  g, Tag  tag  )

inline

References get_property(), and boost::subgraph< Graph >::m_graph.

template<typename D , typename VP , typename EP , typename GP , typename A , typename Tag >

graph_property<adjacency_matrix<D,VP,EP,GP,A>, Tag>::type& boost::get_property ( adjacency_matrix< D, VP, EP, GP, A > &  g, Tag  tag  )

inline

References get_property_value(), and boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator >::m_property.

template<typename D , typename VP , typename EP , typename GP , typename A , typename Tag >

const graph_property<adjacency_matrix<D,VP,EP,GP,A>, Tag>::type& boost::get_property ( const adjacency_matrix< D, VP, EP, GP, A > &  g, Tag  tag  )

inline

References get_property_value(), and boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator >::m_property.

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , class Tag >

graph_property< compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex> , Tag>::type& boost::get_property ( compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g, Tag  tag  )

inline

References get_property_value().

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , class Tag >

const graph_property< compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex> , Tag>::type& boost::get_property ( const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g, Tag  tag  )

inline

References get_property_value().

template<class Graph , class Tag >

graph_property_iter_range<Graph, Tag>::type boost::get_property_iter_range	(	Graph &	graph,
		const Tag &	tag
	)

References boost::detail::get_property_iter_range_kind().

template<class Graph , class Tag >

graph_property_iter_range<Graph, Tag>::const_type boost::get_property_iter_range	(	const Graph &	graph,
		const Tag &	tag
	)

References boost::detail::get_property_iter_range_kind().

template<class Tag >

sgb_vertex_util_map<Tag, const typename Tag::type&> boost::get_property_map ( Tag  , const sgb_graph_ptr &  g, vertex_property_tag    )

inline

template<class Tag >

sgb_vertex_util_map<Tag, typename Tag::type&> boost::get_property_map ( Tag  , sgb_graph_ptr &  g, vertex_property_tag    )

inline

template<class Tag >

sgb_edge_util_map<Tag, const typename Tag::type&> boost::get_property_map ( Tag  , const sgb_graph_ptr &  g, edge_property_tag    )

inline

template<class Tag >

sgb_edge_util_map<Tag, typename Tag::type&> boost::get_property_map ( Tag  , sgb_graph_ptr &  g, edge_property_tag    )

inline

template<class PropertyList , class Tag >

lookup_one_property<PropertyList, Tag>::type& boost::get_property_value ( PropertyList &  p, Tag  tag  )

inline

References boost::python::converter::registry::lookup().

Referenced by get_property(), boost::detail::parallel::maybe_load_properties(), boost::detail::parallel::maybe_save_properties(), and set_property().

template<class PropertyList , class Tag >

const lookup_one_property<PropertyList, Tag>::type& boost::get_property_value ( const PropertyList &  p, Tag  tag  )

inline

References boost::python::converter::registry::lookup().

system_time boost::get_system_time ( )

inline

References boost::date_time::second_clock< time_type >::universal_time().

Referenced by boost::detail::get_milliseconds_until(), and boost::detail::timeout::remaining_milliseconds().

Vertex*& boost::get_util ( util &  u, Vertex *    )

inline

Arc*& boost::get_util ( util &  u, Arc *    )

inline

sgb_graph_ptr& boost::get_util ( util &  u, sgb_graph_ptr    )

inline

char*& boost::get_util ( util &  u, char *    )

inline

long& boost::get_util ( util &  u, long    )

inline

template<class T >

T& boost::get_util_field ( Vertex *  k, u_property< T >    )

inline

Referenced by boost::sgb_vertex_util_map< Tag, Ref >::operator[](), and boost::sgb_edge_util_map< Tag, Ref >::operator[]().

template<class T >

T& boost::get_util_field ( Vertex *  k, v_property< T >    )

inline

template<class T >

T& boost::get_util_field ( Vertex *  k, w_property< T >    )

inline

template<class T >

T& boost::get_util_field ( Vertex *  k, x_property< T >    )

inline

template<class T >

T& boost::get_util_field ( Vertex *  k, y_property< T >    )

inline

template<class T >

T& boost::get_util_field ( Vertex *  k, z_property< T >    )

inline

template<class T >

T& boost::get_util_field ( Arc *  k, a_property< T >    )

inline

template<class T >

T& boost::get_util_field ( Arc *  k, b_property< T >    )

inline

template<typename VP , typename EP , typename GP >

directed_graph<VP,EP,GP>::vertex_index_type boost::get_vertex_index ( typename directed_graph< VP, EP, GP >::vertex_descriptor  v, directed_graph< VP, EP, GP > const &  g  )

inline

References vertex_index.

template<typename VP , typename EP , typename GP >

undirected_graph<VP,EP,GP>::vertex_index_type boost::get_vertex_index ( typename undirected_graph< VP, EP, GP >::vertex_descriptor  v, undirected_graph< VP, EP, GP > const &  g  )

inline

References vertex_index.

template<class Tag , class Value , class Next , class Stag , class Svalue , class Snext >

void boost::getSubset	(	property< Tag, Value, Next > &	p,
		const property< Stag, Svalue, Snext > &	s
	)

References boost::property< Tag, T, Base >::m_base, boost::property< Tag, T, Base >::m_value, and boost::multiprecision::backends::p.

Referenced by boost::GraphParser< Graph_t, VertexProperty, EdgeProperty, VertexPropertySubset, EdgePropertySubset >::operator()().

template<class Tag , class Value , class Next , class Stag , class Svalue >

void boost::getSubset	(	property< Tag, Value, Next > &	p,
		const property< Stag, Svalue, no_property > &	s
	)

References boost::property< Tag, T, Base >::m_value, and boost::multiprecision::backends::p.

void boost::getSubset ( no_property &  , const no_property &    )

inline

template<typename T , typename U >

void boost::getSubset	(	T &	p,
		const U &	s
	)

References boost::asio::s.

template<typename T >

void boost::getSubset	(	T &	,
		const no_property &
	)

template<typename T >

global_property<T> boost::global ( T  x )

inline

References boost::flyweights::x.

Referenced by boost::graph::distributed::connected_components_ps(), and boost::numeric::odeint::compute_operations::scale_sum_swap2< Fac1, Fac2 >::operator()().

default_color_type boost::gray ( default_color_type  )

inline

References gray_color.

Referenced by breadth_first_visit(), boost::detail::depth_first_visit_impl(), edmonds_karp_max_flow(), loop_erased_random_walk(), boost::detail::neighbor_bfs_impl(), boost::detail::darken_and_push< ColorMap >::operator()(), boost::detail::random_spanning_tree_internal(), boost::graph::st_connected(), boost::graph::distributed::st_connected(), and boost::detail::undir_dfv_impl().

default_color_type boost::green ( default_color_type  )

inline

References green_color.

Referenced by sloan_ordering(), boost::graph::st_connected(), and boost::graph::distributed::st_connected().

template<typename VertexListAndIncidenceGraph , typename Topology , typename PositionMap , typename VertexIndexMap , typename EdgeWeightMap >

void boost::gursoy_atun_layout	(	const VertexListAndIncidenceGraph &	graph,
		const Topology &	space,
		PositionMap	position,
		int	nsteps,
		double	diameter_initial,
		double	diameter_final,
		double	learning_constant_initial,
		double	learning_constant_final,
		VertexIndexMap	vertex_index_map,
		EdgeWeightMap	weight
	)

References gursoy_atun_refine(), boost::multiprecision::backends::i, put(), boost::detail::vertex_iterator, and vertices().

Referenced by gursoy_atun_layout().

template<typename VertexListAndIncidenceGraph , typename Topology , typename PositionMap , typename VertexIndexMap >

void boost::gursoy_atun_layout	(	const VertexListAndIncidenceGraph &	graph,
		const Topology &	space,
		PositionMap	position,
		int	nsteps,
		double	diameter_initial,
		double	diameter_final,
		double	learning_constant_initial,
		double	learning_constant_final,
		VertexIndexMap	vertex_index_map
	)

References gursoy_atun_layout().

template<typename VertexListAndIncidenceGraph , typename Topology , typename PositionMap >

void boost::gursoy_atun_layout	(	const VertexListAndIncidenceGraph &	graph,
		const Topology &	space,
		PositionMap	position,
		int	nsteps,
		double	diameter_initial,
		double	diameter_final = 1.0,
		double	learning_constant_initial = 0.8,
		double	learning_constant_final = 0.2
	)

References gursoy_atun_layout(), and vertex_index.

template<typename VertexListAndIncidenceGraph , typename Topology , typename PositionMap >

void boost::gursoy_atun_layout	(	const VertexListAndIncidenceGraph &	graph,
		const Topology &	space,
		PositionMap	position,
		int	nsteps
	)

References gursoy_atun_layout(), num_vertices(), and boost::geometry::math::sqrt().

template<typename VertexListAndIncidenceGraph , typename Topology , typename PositionMap >

void boost::gursoy_atun_layout	(	const VertexListAndIncidenceGraph &	graph,
		const Topology &	space,
		PositionMap	position
	)

References gursoy_atun_layout(), and num_vertices().

template<typename VertexListAndIncidenceGraph , typename Topology , typename PositionMap , typename P , typename T , typename R >

void boost::gursoy_atun_layout	(	const VertexListAndIncidenceGraph &	graph,
		const Topology &	space,
		PositionMap	position,
		const bgl_named_params< P, T, R > &	params
	)

References choose_const_pmap(), choose_param(), edge_weight, boost::xpressive::first, get_param(), gursoy_atun_layout(), num_vertices(), boost::locale::period::marks::second, boost::geometry::math::sqrt(), and vertex_index.

template<typename VertexListAndIncidenceGraph , typename Topology , typename PositionMap , typename VertexIndexMap , typename EdgeWeightMap >

void boost::gursoy_atun_refine	(	const VertexListAndIncidenceGraph &	graph,
		const Topology &	space,
		PositionMap	position,
		int	nsteps,
		double	diameter_initial,
		double	diameter_final,
		double	learning_constant_initial,
		double	learning_constant_final,
		VertexIndexMap	vertex_index_map,
		EdgeWeightMap	weight
	)

References boost::math::ef::exp(), gursoy_atun_step(), boost::multiprecision::backends::i, num_vertices(), pow(), round, vertex_index_map(), and boost::detail::vertex_iterator.

Referenced by gursoy_atun_layout().

template<typename VertexListAndIncidenceGraph , typename Topology , typename PositionMap , typename Diameter , typename VertexIndexMap , typename EdgeWeightMap >

void boost::gursoy_atun_step	(	const VertexListAndIncidenceGraph &	graph,
		const Topology &	space,
		PositionMap	position,
		Diameter	diameter,
		double	learning_constant,
		VertexIndexMap	vertex_index_map,
		EdgeWeightMap	weight
	)

References BOOST_ASSERT, boost::math::ef::exp(), std::fill(), boost::multiprecision::backends::i, num_vertices(), pow(), put(), boost::iostreams::bzip2::run, vertex_index_map(), boost::detail::vertex_iterator, and vertices().

Referenced by gursoy_atun_refine().

template<class T >

void boost::hash_combine ( std::size_t &  seed, T const &  v  )

inline

References boost::hash_detail::hash_combine_impl().

Referenced by boost::hash_detail::hash_combine_tuple(), hash_range(), hash_value(), boost::bimaps::relation::hash_value(), boost::filesystem::hash_value(), boost::hash< detail::parallel::global_descriptor< LocalDescriptor > >::operator()(), and boost::hash< detail::parallel::edge_descriptor< Edge > >::operator()().

template<class It >

std::size_t boost::hash_range ( It  first, It  last  )

inline

References boost::xpressive::first, hash_combine(), last, and boost::uuids::detail::seed().

Referenced by boost::typeindex::stl_type_index::hash_code(), boost::typeindex::type_index_facade< ctti_type_index, detail::ctti_data >::hash_code(), boost::typeindex::ctti_type_index::hash_code(), hash_value(), boost::filesystem::hash_value(), boost::container::hash_value(), boost::re_detail::hash_value_from_capture_name(), boost::interprocess::unordered_map_index_aux< MapConfig >::hasher::operator()(), and boost::interprocess::iunordered_set_index_aux< MapConfig >::hash_function::operator()().

template<class It >

void boost::hash_range ( std::size_t &  seed, It  first, It  last  )

inline

References boost::xpressive::first, hash_combine(), and last.

template<class T >

std::size_t boost::hash_value

(

const iterator_range< T > &

rng

)

References boost::iterator_range_detail::iterator_range_base< IteratorT, BOOST_DEDUCED_TYPENAME iterator_range_detail::pure_iterator_traversal< IteratorT >::type >::begin(), boost::iterator_range_detail::iterator_range_base< IteratorT, BOOST_DEDUCED_TYPENAME iterator_range_detail::pure_iterator_traversal< IteratorT >::type >::end(), and hash_range().

template<class A , class B >

std::size_t boost::hash_value

(

std::pair< A, B > const &

v

)

References hash_combine(), and boost::uuids::detail::seed().

template<class T , class A >

std::size_t boost::hash_value

(

std::vector< T, A > const &

v

)

References hash_range().

template<class T , class A >

std::size_t boost::hash_value

(

std::list< T, A > const &

v

)

References hash_range().

template<class T , class A >

std::size_t boost::hash_value

(

std::deque< T, A > const &

v

)

References hash_range().

template<class K , class C , class A >

std::size_t boost::hash_value

(

std::set< K, C, A > const &

v

)

References hash_range().

template<class K , class C , class A >

std::size_t boost::hash_value

(

std::multiset< K, C, A > const &

v

)

References hash_range().

template<class K , class T , class C , class A >

std::size_t boost::hash_value

(

std::map< K, T, C, A > const &

v

)

References hash_range().

template<class K , class T , class C , class A >

std::size_t boost::hash_value

(

std::multimap< K, T, C, A > const &

v

)

References hash_range().

template<class T >

std::size_t boost::hash_value

(

std::complex< T > const &

v

)

References boost::uuids::detail::seed().

long boost::hash_value ( char_architype  val )

inline

References boost::phoenix::val().

template<class T , std::size_t N>

std::size_t boost::hash_value

(

std::array< T, N > const &

v

)

References hash_range().

template<typename T >

boost::hash_detail::long_numbers< T >::type boost::hash_value

(

T

v

)

References boost::hash_detail::hash_value_signed().

template<typename T >

boost::hash_detail::ulong_numbers< T >::type boost::hash_value

(

T

v

)

References boost::hash_detail::hash_value_unsigned().

template<typename T >

boost::enable_if< boost::is_enum< T >, std::size_t >::type boost::hash_value

(

T

v

)

template<class T >

std::size_t boost::hash_value

(

T *const &

v

)

References boost::flyweights::x.

template<class T , unsigned N>

std::size_t boost::hash_value ( const T(&)  x[N] )

inline

References hash_range(), and boost::flyweights::x.

template<class T , unsigned N>

std::size_t boost::hash_value ( T(&)  x[N] )

inline

References hash_range(), and boost::flyweights::x.

template<class Ch , class A >

std::size_t boost::hash_value ( std::basic_string< Ch, std::char_traits< Ch >, A > const &  v )

inline

References hash_range().

template<typename T >

boost::hash_detail::float_numbers< T >::type boost::hash_value

(

T

v

)

std::size_t boost::hash_value

(

std::type_index

v

)

template<typename... T>

std::size_t boost::hash_value ( std::tuple< T...> const &  v )

inline

References boost::hash_detail::hash_tuple().

template<typename T >

std::size_t boost::hash_value ( std::shared_ptr< T > const &  x )

inline

References hash_value.

template<typename T , typename Deleter >

std::size_t boost::hash_value ( std::unique_ptr< T, Deleter > const &  x )

inline

References hash_value.

template<typename T >

boost::hash_detail::basic_numbers<T>::type boost::hash_value

(

T

v

)

template<class T >

std::size_t boost::hash_value

(

boost::intrusive_ptr< T > const &

p

)

References boost::intrusive_ptr< T >::get().

template<class T , std::size_t N>

std::size_t boost::hash_value

(

const array< T, N > &

arr

)

References boost::array< T, N >::begin(), boost::array< T, N >::end(), and hash_range().

template<class T >

std::size_t boost::hash_value

(

boost::shared_ptr< T > const &

p

)

template<typename Graph , typename Visitor , typename VertexIndexMap >

void boost::hawick_circuits	(	BOOST_FWD_REF(Graph)	graph,
		BOOST_FWD_REF(Visitor)	visitor,
		BOOST_FWD_REF(VertexIndexMap)	vertex_index_map
	)

Enumerate all the elementary circuits in a directed multigraph.

References boost::hawick_circuits_detail::call_hawick_circuits(), boost::spirit::ascii::graph, and vertex_index_map().

template<typename Graph , typename Visitor >

void boost::hawick_circuits	(	BOOST_FWD_REF(Graph)	graph,
		BOOST_FWD_REF(Visitor)	visitor
	)

References boost::hawick_circuits_detail::call_hawick_circuits(), and boost::spirit::ascii::graph.

template<typename Graph , typename Visitor , typename VertexIndexMap >

void boost::hawick_unique_circuits	(	BOOST_FWD_REF(Graph)	graph,
		BOOST_FWD_REF(Visitor)	visitor,
		BOOST_FWD_REF(VertexIndexMap)	vertex_index_map
	)

Same as boost::hawick_circuits, but duplicate circuits caused by parallel edges will not be considered.

Each circuit will be considered only once.

References boost::hawick_circuits_detail::call_hawick_circuits(), boost::spirit::ascii::graph, and vertex_index_map().

template<typename Graph , typename Visitor >

void boost::hawick_unique_circuits	(	BOOST_FWD_REF(Graph)	graph,
		BOOST_FWD_REF(Visitor)	visitor
	)

References boost::hawick_circuits_detail::call_hawick_circuits(), and boost::spirit::ascii::graph.

boost::if

(

num_vertices(iG)!

= num_vertices(vG)

)

boost::if

(

inL.size()!

= num_edges(iG)||inL.size()!=num_edges(vG)

)

boost::if

(

iG_map.size()!

= num_edges(iG)||vG_map.size()!=num_edges(vG)

)

boost::if

(

iG_buf.

empty)&&vG_buf.empty(

)

References aiG_inL, avG_inL, connected_components(), current, edges(), func, iG_bimap, inL, last, make_dfs_visitor(), make_filtered_graph(), put(), boost::detail::rec_two_graphs_common_spanning_trees(), undirected_dfs(), vG, and vG_bimap.

boost::shared_ptr<boost::dynamic_property_map> boost::ignore_other_properties ( const std::string &  , const boost::any &  , const boost::any &    )

inline

template<typename... Ts>

void boost::ignore_unused ( Ts const &  ... )

inline

Referenced by boost::geometry::strategy::within::winding< Point, PointOfSegment, CalculationType >::apply(), boost::xpressive::detail::ignore_unused_regex_actions(), boost::xpressive::detail::ignore_unused_regex_primitives(), boost::xpressive::null_regex_traits< Elem >::isctype(), boost::xpressive::null_regex_traits< Elem >::lookup_classname(), boost::xpressive::null_regex_traits< Elem >::lookup_collatename(), boost::xpressive::null_regex_traits< Elem >::operator!=(), boost::xpressive::null_regex_traits< Elem >::operator==(), boost::xpressive::null_regex_traits< Elem >::value(), and boost::mutex::~mutex().

template<typename... Ts>

void boost::ignore_unused ( )

inline

template<class T >

void boost::ignore_unused_variable_warning ( T const &  )

inline

Referenced by boost::detail::multi_array::value_accessor_one< T >::access(), boost::detail::multi_array::multi_array_impl_base< T, NumDims >::access_element(), boost::numeric::ublas::basic_row_major< Z, D >::address(), boost::numeric::ublas::basic_column_major< Z, D >::address(), boost::geometry::strategy::within::point_in_box_by_side< Point, Box, Decide >::apply(), boost::geometry::detail::area::ring_area< order_as_direction< geometry::point_order< Ring >::value >::value, geometry::closure< Ring >::value >::apply(), boost::geometry::dispatch::covered_by< Point, Box, point_tag, box_tag >::apply(), boost::geometry::detail::length::range_length< Geometry, closed >::apply(), boost::geometry::dispatch::covered_by< Box1, Box2, box_tag, box_tag >::apply(), boost::geometry::strategy::distance::projected_point< CalculationType, Strategy >::apply(), boost::geometry::strategy::intersection::relate_cartesian_segments< Policy, CalculationType >::apply(), boost::geometry::dispatch::within< Point, Box, point_tag, box_tag >::apply(), boost::geometry::dispatch::within< Box1, Box2, box_tag, box_tag >::apply(), boost::geometry::strategy::distance::detail::projected_point_ax< CalculationType, Strategy >::apply(), boost_concepts::BOOST_concept(), BOOST_concept(), boost::concepts::BOOST_concept(), boost::range_detail::SinglePassIteratorConcept< Iterator >::BOOST_CONCEPT_USAGE(), boost::range_detail::ForwardIteratorConcept< Iterator >::BOOST_CONCEPT_USAGE(), boost::SinglePassRangeConcept< T >::BOOST_CONCEPT_USAGE(), boost::geometry::concept::check(), boost::geometry::concept::within::check(), boost::RegexTraitsConcept< traits >::constraints(), boost::LvaluePropertyMapConcept< PMap, Key >::constraints(), boost::Mutable_LvaluePropertyMapConcept< PMap, Key >::constraints(), boost::gil::PointNDConcept< P >::constraints(), boost::gil::detail::RandomAccessIteratorIsMutableConcept< TT >::constraints(), boost::BaseRegexConcept< Regex >::constraints(), boost::gil::ChannelConvertibleConcept< SrcChannel, DstChannel >::constraints(), boost::gil::ColorBaseConcept< ColorBase >::constraints(), boost::RegexConcept< Regex >::constraints(), boost::gil::PixelBasedConcept< P >::constraints(), boost::BoostRegexConcept< Regex >::constraints(), boost::gil::PixelConcept< P >::constraints(), boost::gil::PixelDereferenceAdaptorConcept< D >::constraints(), boost::gil::PixelIteratorConcept< Iterator >::constraints(), boost::gil::detail::RandomAccessIteratorIsMemoryBasedConcept< Iterator >::constraints(), boost::gil::IteratorAdaptorConcept< Iterator >::constraints(), boost::gil::RandomAccessNDLocatorConcept< Loc >::constraints(), boost::gil::RandomAccess2DLocatorConcept< Loc >::constraints(), boost::gil::detail::RandomAccess2DLocatorIsMutableConcept< Loc >::constraints(), boost::gil::RandomAccessNDImageViewConcept< View >::constraints(), boost::gil::RandomAccess2DImageViewConcept< View >::constraints(), boost::gil::ImageViewConcept< View >::constraints(), boost::gil::detail::RandomAccessNDImageViewIsMutableConcept< View >::constraints(), boost::gil::detail::RandomAccess2DImageViewIsMutableConcept< View >::constraints(), boost::gil::RandomAccessNDImageConcept< Img >::constraints(), boost::numeric::ublas::basic_row_major< Z, D >::element(), boost::numeric::ublas::basic_column_major< Z, D >::element(), boost::geometry::get(), boost::BaseRegexConcept< Regex >::global_constraints(), boost_concepts::detail::interop_rand_access_constraints(), boost_concepts::detail::interop_single_pass_constraints(), boost::numeric::ublas::basic_row_major< Z, D >::lower_element(), boost::numeric::ublas::zero_vector< T, ALLOC >::const_iterator::operator==(), boost::numeric::ublas::zero_matrix< T, ALLOC >::const_iterator1::operator==(), boost::numeric::ublas::zero_matrix< T, ALLOC >::const_iterator2::operator==(), require_boolean_expr(), boost::geometry::set(), and boost::range_detail::swap_ranges_impl().

template<typename T >

T boost::implicit_cast ( typename boost::detail::icast_identity< T >::type  x )

inline

References boost::flyweights::x.

Referenced by depth_first_search().

template<class BidirectionalGraph , class GRef >

graph_traits<BidirectionalGraph>::degree_size_type boost::in_degree ( const typename graph_traits< BidirectionalGraph >::vertex_descriptor  u, const reverse_graph< BidirectionalGraph, GRef > &  g  )

inline

References boost::reverse_graph< BidirectionalGraph, GraphRef >::m_g, and out_degree().

template<typename VP , typename EP , typename GP >

undirected_graph<VP,EP,GP>::degree_size_type boost::in_degree ( typename undirected_graph< VP, EP, GP >::vertex_descriptor  v, undirected_graph< VP, EP, GP > const &  g  )

inline

References in_degree().

template<typename VP , typename EP , typename GP >

directed_graph<VP,EP,GP>::degree_size_type boost::in_degree ( typename directed_graph< VP, EP, GP >::vertex_descriptor  v, directed_graph< VP, EP, GP > const &  g  )

inline

References in_degree().

template<typename G , typename EP , typename VP >

filtered_graph<G, EP, VP>::degree_size_type boost::in_degree	(	typename filtered_graph< G, EP, VP >::vertex_descriptor	u,
		const filtered_graph< G, EP, VP > &	g
	)

References in_edges(), and n.

template<class vtype , class etype >

graph_traits< leda::GRAPH<vtype,etype> >::degree_size_type boost::in_degree	(	typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor	u,
		const leda::GRAPH< vtype, etype > &	g
	)

template<typename G >

graph_traits<G>::degree_size_type boost::in_degree	(	typename graph_traits< G >::vertex_descriptor	v,
		const subgraph< G > &	g
	)

References in_degree(), and boost::subgraph< Graph >::m_graph.

template<typename G , typename L , typename S >

labeled_graph<G,L,S>::degree_size_type boost::in_degree ( typename labeled_graph< G, L, S >::vertex_descriptor  v, labeled_graph< G, L, S > const &  g  )

inline

References in_degree().

graph_traits<leda::graph>::degree_size_type boost::in_degree	(	graph_traits< leda::graph >::vertex_descriptor	u,
		const leda::graph &	g
	)

template<typename D , typename VP , typename EP , typename GP , typename A >

adjacency_matrix<D,VP,EP,GP,A>::degree_size_type boost::in_degree	(	typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor	u,
		const adjacency_matrix< D, VP, EP, GP, A > &	g
	)

References in_edges(), and n.

Referenced by boost::concepts::BOOST_concept(), degree(), in_degree(), boost::prestige_measure< Graph >::operator()(), boost::detail::vertex_in_out_degree_cmp< Graph >::operator()(), boost::detail::vertex_frequency_degree_cmp< Graph, FrequencyMap >::operator()(), out_degree(), boost::detail::sort_vertices(), and boost::graph_test< Graph >::test_bidirectional_graph().

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

EdgeIndex boost::in_degree ( Vertex  v, const compressed_sparse_row_graph< bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g  )

inline

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, bidirectionalS , VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::degree_size_type boost::in_degree	(	typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	v,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

Returns the number of edges incoming to a particular vertex.

The vertex

Parameters

v	must be local to the processor executing this routine.

References BOOST_ASSERT, and vertex_in_edges.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, undirectedS , VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::degree_size_type boost::in_degree	(	typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	v,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References BOOST_ASSERT, and out_degree().

template<class Graph , class Edge >

bool boost::in_edge_set	(	Graph &	g,
		Edge	e
	)

References edges(), and boost::algorithm::find().

template<class Graph , class Vertex >

bool boost::in_edge_set	(	Graph &	g,
		Vertex	u,
		Vertex	v
	)

References edges(), source(), and target().

template<class BidirectionalGraph , class GRef >

std::pair<typename reverse_graph<BidirectionalGraph>::in_edge_iterator, typename reverse_graph<BidirectionalGraph>::in_edge_iterator> boost::in_edges ( const typename graph_traits< BidirectionalGraph >::vertex_descriptor  u, const reverse_graph< BidirectionalGraph, GRef > &  g  )

inline

References boost::reverse_graph< BidirectionalGraph, GraphRef >::m_g, and out_edges().

template<typename VP , typename EP , typename GP >

std::pair< typename undirected_graph<VP,EP,GP>::in_edge_iterator, typename undirected_graph<VP,EP,GP>::in_edge_iterator> boost::in_edges ( typename undirected_graph< VP, EP, GP >::vertex_descriptor  v, undirected_graph< VP, EP, GP > const &  g  )

inline

References in_edges().

template<typename G , typename EP , typename VP >

std::pair<typename filtered_graph<G, EP, VP>::in_edge_iterator, typename filtered_graph<G, EP, VP>::in_edge_iterator> boost::in_edges	(	typename filtered_graph< G, EP, VP >::vertex_descriptor	u,
		const filtered_graph< G, EP, VP > &	g
	)

References boost::detail::in_edge_iterator, in_edges(), boost::filtered_graph< Graph, EdgePredicate, VertexPredicate >::m_edge_pred, boost::filtered_graph_base< Graph >::m_g, boost::filtered_graph< Graph, EdgePredicate, VertexPredicate >::m_vertex_pred, and boost::xpressive::make_pair.

template<typename VP , typename EP , typename GP >

std::pair< typename directed_graph<VP,EP,GP>::in_edge_iterator, typename directed_graph<VP,EP,GP>::in_edge_iterator> boost::in_edges ( typename directed_graph< VP, EP, GP >::vertex_descriptor  v, directed_graph< VP, EP, GP > const &  g  )

inline

References in_edges().

template<class vtype , class etype >

std::pair< typename graph_traits< leda::GRAPH<vtype,etype> >::in_edge_iterator, typename graph_traits< leda::GRAPH<vtype,etype> >::in_edge_iterator > boost::in_edges ( typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor  u, const leda::GRAPH< vtype, etype > &  g  )

inline

References boost::xpressive::make_pair.

template<typename G >

std::pair<typename graph_traits<G>::in_edge_iterator, typename graph_traits<G>::in_edge_iterator> boost::in_edges	(	typename graph_traits< G >::vertex_descriptor	v,
		const subgraph< G > &	g
	)

References in_edges(), and boost::subgraph< Graph >::m_graph.

std::pair< graph_traits<leda::graph>::in_edge_iterator, graph_traits<leda::graph>::in_edge_iterator > boost::in_edges ( graph_traits< leda::graph >::vertex_descriptor  u, const leda::graph &  g  )

inline

References boost::xpressive::make_pair.

template<typename G , typename L , typename S >

std::pair< typename labeled_graph<G,L,S>::in_edge_iterator, typename labeled_graph<G,L,S>::in_edge_iterator> boost::in_edges ( typename labeled_graph< G, L, S >::vertex_descriptor  v, labeled_graph< G, L, S > const &  g  )

inline

References in_edges().

template<typename VP , typename EP , typename GP , typename A >

std::pair<typename adjacency_matrix<directedS,VP,EP,GP,A>::in_edge_iterator, typename adjacency_matrix<directedS,VP,EP,GP,A>::in_edge_iterator> boost::in_edges	(	typename adjacency_matrix< directedS, VP, EP, GP, A >::vertex_descriptor	u,
		const adjacency_matrix< directedS, VP, EP, GP, A > &	g_
	)

References boost::xpressive::first, boost::detail::in_edge_iterator, last, boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator >::m_matrix, boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator >::m_vertex_set, and boost::xpressive::make_pair.

Referenced by boost::concepts::BOOST_concept(), clear_vertex(), edge(), in_degree(), in_edges(), is_adj_dispatch(), iterative_bit_vector_dominator_tree(), boost::detail::neighbor_bfs_impl(), boost::detail::dominator_visitor< Graph, IndexMap, TimeMap, PredMap, DomTreePredMap >::operator()(), out_edges(), print_in_edges(), boost::detail::parallel::remove_in_edge(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::remove_local_edge(), boost::detail::parallel::save_in_edges(), and boost::graph_test< Graph >::test_bidirectional_graph().

template<typename VP , typename EP , typename GP , typename A >

std::pair< typename adjacency_matrix<undirectedS,VP,EP,GP,A>::in_edge_iterator, typename adjacency_matrix<undirectedS,VP,EP,GP,A>::in_edge_iterator> boost::in_edges	(	typename adjacency_matrix< undirectedS, VP, EP, GP, A >::vertex_descriptor	u,
		const adjacency_matrix< undirectedS, VP, EP, GP, A > &	g_
	)

References boost::xpressive::first, boost::detail::in_edge_iterator, last, boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator >::m_matrix, boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator >::m_vertex_set, boost::xpressive::make_pair, boost::asio::offset, and boost::detail::vertices_size_type.

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

std::pair<typename compressed_sparse_row_graph<bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex>::in_edge_iterator, typename compressed_sparse_row_graph<bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex>::in_edge_iterator> boost::in_edges ( Vertex  v, const compressed_sparse_row_graph< bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g  )

inline

References it, and boost::xpressive::make_pair.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

std::pair<typename adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, bidirectionalS , VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::in_edge_iterator, typename adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, bidirectionalS , VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::in_edge_iterator> boost::in_edges	(	typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	v,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

Returns the set of edges incoming to a particular vertex.

The vertex

Parameters

v	must be local to the processor executing this routine.

References BOOST_ASSERT, in_edges(), boost::spirit::x3::unicode::inherited, boost::xpressive::make_pair, boost::iterators::make_transform_iterator(), PBGL_DISTRIB_ADJLIST_TYPE_CONFIG, and vertex_in_edges.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

std::pair<typename adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, undirectedS , VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::in_edge_iterator, typename adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, undirectedS , VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::in_edge_iterator> boost::in_edges	(	typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	v,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References BOOST_ASSERT, boost::xpressive::make_pair, boost::iterators::make_transform_iterator(), out_edges(), PBGL_DISTRIB_ADJLIST_TYPE_CONFIG, and boost::locale::period::marks::second.

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( in_parallel , _t)> boost::in_parallel

(

const PType &

p

)

template<class Graph , class Vertex >

bool boost::in_vertex_set	(	Graph &	g,
		Vertex	v
	)

References boost::algorithm::find(), boost::detail::vertex_iterator, and vertices().

template<class UndirectedGraph >

std::pair<typename graph_traits<UndirectedGraph>::vertex_descriptor, typename graph_traits<UndirectedGraph>::vertex_descriptor> boost::incident ( typename graph_traits< UndirectedGraph >::edge_descriptor  e, UndirectedGraph &  g  )

inline

References boost::xpressive::make_pair, source(), and target().

template<class Graph >

std::pair<typename graph_traits<Graph>::out_edge_iterator, typename graph_traits<Graph>::out_edge_iterator> boost::incident_edges ( typename graph_traits< Graph >::vertex_descriptor  u, Graph &  g  )

inline

References out_edges().

template<typename VP , typename EP , typename GP >

std::pair< typename undirected_graph<VP,EP,GP>::out_edge_iterator, typename undirected_graph<VP,EP,GP>::out_edge_iterator> boost::incident_edges ( typename undirected_graph< VP, EP, GP >::vertex_descriptor  v, undirected_graph< VP, EP, GP > const &  g  )

inline

References out_edges().

template<typename Vertex , typename Graph >

incident_from_predicate<Vertex, Graph> boost::incident_from ( Vertex  u, const Graph &  g  )

inline

Referenced by is_adj_dispatch().

template<typename Vertex , typename Graph >

incident_on_predicate<Vertex, Graph> boost::incident_on ( Vertex  u, const Graph &  g  )

inline

template<typename Vertex , typename Graph >

incident_to_predicate<Vertex, Graph> boost::incident_to ( Vertex  u, const Graph &  g  )

inline

Referenced by is_adj_dispatch().

template<class EdgeListGraph , class DisjointSets >

void boost::incremental_components	(	EdgeListGraph &	g,
		DisjointSets &	ds
	)

References edges(), end, source(), and target().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( index_in_heap_map , _t)> boost::index_in_heap_map

(

const PType &

p

)

Referenced by boost::detail::core_numbers_dispatch().

template<typename Graph , typename Vertex >

graph_traits<Graph>::degree_size_type boost::influence ( const Graph &  g, Vertex  v  )

inline

References degree_centrality(), and measure_influence().

template<typename CharT >

BOOST_LOG_OPEN_NAMESPACE BOOST_LOG_SETUP_API void boost::init_from_settings

(

basic_settings_section< CharT > const &

setts

)

The function initializes the logging library from a settings container.

Parameters

setts

Library settings container

Throws: An std::exception-based exception if the provided settings are not valid.

template<typename CharT >

BOOST_LOG_OPEN_NAMESPACE BOOST_LOG_SETUP_API void boost::init_from_stream

(

std::basic_istream< CharT > &

strm

)

The function initializes the logging library from a stream containing logging settings.

Parameters

strm	Stream, that provides library settings

Throws: An std::exception-based exception if the read data cannot be interpreted as the library settings

template<class VertexListGraph , class DisjointSets >

void boost::initialize_incremental_components	(	VertexListGraph &	G,
		DisjointSets &	ds
	)

References boost::detail::vertex_iterator, and vertices().

template<class SinglePassRange1 , class SinglePassRange2 , class Value >

Value boost::inner_product ( const SinglePassRange1 &  rng1, const SinglePassRange2 &  rng2, Value  init  )

inline

References boost::asio::begin, BOOST_ASSERT, BOOST_RANGE_CONCEPT_ASSERT, end, inner_product(), and boost::range_detail::inner_product_precondition().

Referenced by boost::phoenix::impl::inner_product::operator()(), boost::accumulators::impl::non_coherent_weighted_tail_mean_impl< Sample, Weight, LeftRight >::result(), and boost::accumulators::impl::weighted_tail_variate_means_impl< Sample, Weight, Impl, LeftRight, VariateType >::result().

template<class SinglePassRange1 , class SinglePassRange2 , class Value , class BinaryOperation1 , class BinaryOperation2 >

Value boost::inner_product ( const SinglePassRange1 &  rng1, const SinglePassRange2 &  rng2, Value  init, BinaryOperation1  op1, BinaryOperation2  op2  )

inline

References boost::asio::begin, BOOST_ASSERT, BOOST_RANGE_CONCEPT_ASSERT, end, and boost::range_detail::inner_product_precondition().

Referenced by inner_product(), and boost::lambda::ll::inner_product::operator()().

template<typename T >

int boost::integer_log2

(

T

x

)

References boost::detail::integer_log2_impl(), n, and boost::program_options::value().

Referenced by boost::random::detail::generate_int_float_pair(), boost::random::independent_bits_engine< Engine, w, boost::multiprecision::number< Backend, ExpressionTemplates > >::operator()(), and boost::random::independent_bits_engine< Engine, w, UIntType >::operator()().

bool boost::intersects ( double  x1, double  y1, double  x2, double  y2, double  a1, double  b1, double  a2, double  b2, double  epsilon = 0.000001  )

inline

References boost::xpressive::a1, boost::spirit::ascii::alpha, beta, BOOST_PREVENT_MACRO_SUBSTITUTION, BOOST_USING_STD_MAX, BOOST_USING_STD_MIN, boost::math::tools::epsilon, boost::numeric::ublas::detail::lower_bound(), boost::accumulators::extract::max, boost::accumulators::extract::min, swap, and boost::numeric::ublas::detail::upper_bound().

Referenced by is_straight_line_drawing(), and boost::date_time::period< point_rep, duration_rep >::merge().

template<class Visitor , class Rest , class T , class Graph , class Tag >

void boost::invoke_visitors ( std::pair< Visitor, Rest > &  vlist, T  x, Graph &  g, Tag  tag  )

inline

References boost::detail::invoke_dispatch(), and boost::detail::type.

Referenced by boost::dfs_visitor<>::back_edge(), boost::neighbor_bfs_visitor< Visitors >::black_source(), boost::neighbor_bfs_visitor< Visitors >::black_target(), boost::bfs_visitor<>::black_target(), boost::neighbor_bfs_visitor< Visitors >::discover_vertex(), boost::bfs_visitor<>::discover_vertex(), boost::dfs_visitor<>::discover_vertex(), boost::bellman_visitor< edge_predecessor_recorder< PredEdgeMap, on_edge_relaxed > >::edge_minimized(), boost::bellman_visitor< edge_predecessor_recorder< PredEdgeMap, on_edge_relaxed > >::edge_not_minimized(), boost::bellman_visitor< edge_predecessor_recorder< PredEdgeMap, on_edge_relaxed > >::edge_not_relaxed(), boost::astar_visitor< Visitors >::edge_not_relaxed(), boost::dijkstra_visitor< Visitors >::edge_not_relaxed(), boost::bellman_visitor< edge_predecessor_recorder< PredEdgeMap, on_edge_relaxed > >::edge_relaxed(), boost::astar_visitor< Visitors >::edge_relaxed(), boost::dijkstra_visitor< Visitors >::edge_relaxed(), boost::bellman_visitor< edge_predecessor_recorder< PredEdgeMap, on_edge_relaxed > >::examine_edge(), boost::mas_visitor< Visitors >::examine_edge(), boost::bfs_visitor<>::examine_edge(), boost::dfs_visitor<>::examine_edge(), boost::neighbor_bfs_visitor< Visitors >::examine_in_edge(), boost::neighbor_bfs_visitor< Visitors >::examine_out_edge(), boost::neighbor_bfs_visitor< Visitors >::examine_vertex(), boost::bfs_visitor<>::examine_vertex(), boost::dfs_visitor<>::finish_edge(), boost::mas_visitor< Visitors >::finish_vertex(), boost::neighbor_bfs_visitor< Visitors >::finish_vertex(), boost::bfs_visitor<>::finish_vertex(), boost::dfs_visitor<>::finish_vertex(), boost::dfs_visitor<>::forward_or_cross_edge(), boost::neighbor_bfs_visitor< Visitors >::gray_source(), boost::neighbor_bfs_visitor< Visitors >::gray_target(), boost::bfs_visitor<>::gray_target(), boost::neighbor_bfs_visitor< Visitors >::initialize_vertex(), boost::mas_visitor< Visitors >::initialize_vertex(), boost::bfs_visitor<>::initialize_vertex(), boost::dfs_visitor<>::initialize_vertex(), boost::bfs_visitor<>::non_tree_edge(), boost::neighbor_bfs_visitor< Visitors >::non_tree_in_edge(), boost::neighbor_bfs_visitor< Visitors >::non_tree_out_edge(), boost::mas_visitor< Visitors >::start_vertex(), boost::dfs_visitor<>::start_vertex(), boost::bfs_visitor<>::tree_edge(), boost::dfs_visitor<>::tree_edge(), boost::neighbor_bfs_visitor< Visitors >::tree_in_edge(), and boost::neighbor_bfs_visitor< Visitors >::tree_out_edge().

template<class Visitor , class T , class Graph , class Tag >

void boost::invoke_visitors ( Visitor &  v, T  x, Graph &  g, Tag    )

inline

References boost::detail::invoke_dispatch(), and boost::detail::type.

template<typename Integer >

integer_range<Integer> boost::irange	(	Integer	first,
		Integer	last
	)

References BOOST_ASSERT, boost::xpressive::first, and last.

Referenced by boost::geometry::dispatch::svg_map_range< Linestring, model::linestring< detail::svg::svg_point_type > >::apply().

template<typename Integer , typename StepSize >

strided_integer_range<Integer> boost::irange	(	Integer	first,
		Integer	last,
		StepSize	step_size
	)

References BOOST_ASSERT, boost::xpressive::first, and last.

template<typename Graph , typename MateMap , typename VertexIndexMap >

bool boost::is_a_matching	(	const Graph &	g,
		MateMap	mate,
		VertexIndexMap
	)

References vertices().

Referenced by is_a_matching(), and boost::maximum_cardinality_matching_verifier< Graph, MateMap, VertexIndexMap >::verify_matching().

template<typename Graph , typename MateMap >

bool boost::is_a_matching ( const Graph &  g, MateMap  mate  )

inline

References is_a_matching(), and vertex_index.

template<class Graph , class Vertex >

bool boost::is_adj_dispatch	(	Graph &	g,
		Vertex	a,
		Vertex	b,
		bidirectional_tag
	)

References adjacent_vertices(), boost::algorithm::find(), boost::fusion::find_if(), in_edges(), incident_from(), incident_to(), and out_edges().

Referenced by is_adj_dispatch(), and is_adjacent().

template<class Graph , class Vertex >

bool boost::is_adj_dispatch	(	Graph &	g,
		Vertex	a,
		Vertex	b,
		directed_tag
	)

References adjacent_vertices(), boost::algorithm::find(), boost::fusion::find_if(), incident_to(), and out_edges().

template<class Graph , class Vertex >

bool boost::is_adj_dispatch	(	Graph &	g,
		Vertex	a,
		Vertex	b,
		undirected_tag
	)

References is_adj_dispatch().

template<class Graph , class Vertex >

bool boost::is_adjacent	(	Graph &	g,
		Vertex	a,
		Vertex	b
	)

References is_adj_dispatch().

template<typename Graph , typename IndexMap , typename PartitionMap >

bool boost::is_bipartite	(	const Graph &	graph,
		const IndexMap	index_map,
		PartitionMap	partition_map
	)

Checks a given graph for bipartiteness and fills the given color map with white and black according to the bipartition.

If the graph is not bipartite, the contents of the color map are undefined. Runs in linear time in the size of the graph, if access to the property maps is in constant time.

Parameters

graph	The given graph.
index_map	An index map associating vertices with an index.
partition_map	A color map to fill with the bipartition.

Returns

true if and only if the given graph is bipartite.

General types and variables

Declare dfs visitor

Call dfs

References boost::detail::check_bipartition(), boost::detail::colorize_bipartition(), depth_first_search(), boost::sinks::event_log::error, make_dfs_visitor(), boost::xpressive::make_pair, put_property(), vertex_index_map(), and visitor().

Referenced by is_bipartite().

template<typename Graph , typename IndexMap >

bool boost::is_bipartite	(	const Graph &	graph,
		const IndexMap	index_map
	)

Checks a given graph for bipartiteness.

Parameters

graph	The given graph.
index_map	An index map associating vertices with an index.

Returns

true if and only if the given graph is bipartite.

References is_bipartite(), and num_vertices().

template<typename Graph >

bool boost::is_bipartite

(

const Graph &

graph

)

Checks a given graph for bipartiteness.

The graph must have an internal vertex_index property. Runs in linear time in the size of the graph, if access to the property maps is in constant time.

Parameters

graph

The given graph.

Returns

true if and only if the given graph is bipartite.

References is_bipartite(), and vertex_index.

template<typename VertexListGraph , typename VertexColorMap >

bool boost::is_connected ( const VertexListGraph &  g, VertexColorMap  color  )

inline

References is_reachable(), put(), vertices(), and white().

template<typename T >

bool boost::is_default_param ( const T &  )

inline

Referenced by boost::detail::edmonds_karp_dispatch2< param_not_found >::apply(), boost::detail::edmonds_karp_dispatch1< param_not_found >::apply(), copy_component(), copy_graph(), boost::detail::dag_sp_dispatch1(), boost::detail::dijkstra_dispatch1(), boost::detail::dijkstra_no_color_map_dispatch1(), dijkstra_shortest_paths(), kruskal_minimum_spanning_tree(), and boost::detail::transitive_closure_dispatch().

bool boost::is_default_param ( const param_not_found &  )

inline

template<typename ParentMap >

bool boost::is_descendant ( typename property_traits< ParentMap >::value_type  x, typename property_traits< ParentMap >::value_type  y, ParentMap  parent  )

inline

template<typename Graph >

bool boost::is_directed

(

const Graph &

)

Return true if the given graph is directed.

References boost::detail::is_directed().

Referenced by add_vertex(), and boost::connects_predicate< Vertex, Graph >::operator()().

template<typename Graph , typename ForwardIterator , typename VertexIndexMap >

bool boost::is_kuratowski_subgraph	(	const Graph &	g,
		ForwardIterator	begin,
		ForwardIterator	end,
		VertexIndexMap	vm
	)

References add_edge(), boost::asio::begin, boost::detail::contract_edge(), count, empty(), end, isomorphism(), boost::detail::neighbors(), num_vertices(), size(), source(), target(), boost::detail::tg_k_3_3, boost::detail::tg_k_5, and vertices().

Referenced by is_kuratowski_subgraph().

template<typename Graph , typename ForwardIterator >

bool boost::is_kuratowski_subgraph	(	const Graph &	g,
		ForwardIterator	begin,
		ForwardIterator	end
	)

References is_kuratowski_subgraph(), and vertex_index.

template<typename Lockable >

bool boost::is_locked_by_this_thread

(

testable_mutex< Lockable > const &

mtx

)

Overloaded function used to check if the mutex is locked when it is testable and do nothing otherwise.

This function is used usually to assert the pre-condition when the function can only be called when the mutex must be locked by the current thread.

References boost::testable_mutex< Lockable >::is_locked_by_this_thread().

Referenced by BOOST_THREAD_DCL_MOVABLE_BEG(), boost::lock_guard< Mutex >::lock_guard(), boost::unique_lock< Lockable >::unique_lock(), and boost::upgrade_lock< Mutex >::upgrade_lock().

template<typename Lockable >

bool boost::is_locked_by_this_thread

(

Lockable const &

)

template<class Iterator , class T >

bool boost::is_null ( void_ptr_iterator< Iterator, T >  i )

inline

template<class I , class F , class S >

bool boost::is_null ( const ptr_map_iterator< I, F, S > &  i )

inline

Referenced by boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::back(), boost::algorithm::find_iterator< IteratorT >::eof(), boost::algorithm::split_iterator< IteratorT >::eof(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::front(), boost::date_time::period< point_rep, duration_rep >::is_after(), boost::date_time::period< point_rep, duration_rep >::is_before(), and boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::unique().

template<typename IncidenceGraph , typename VertexColorMap >

bool boost::is_reachable ( typename graph_traits< IncidenceGraph >::vertex_descriptor  x, typename graph_traits< IncidenceGraph >::vertex_descriptor  y, const IncidenceGraph &  g, VertexColorMap  color  )

inline

References depth_first_visit(), and boost::polygon::y().

Referenced by is_connected().

template<typename Graph >

bool boost::is_self_loop	(	typename graph_traits< Graph >::edge_descriptor	e,
		const Graph &	g
	)

References source(), and target().

template<typename Graph , typename GridPositionMap , typename VertexIndexMap >

bool boost::is_straight_line_drawing	(	const Graph &	g,
		GridPositionMap	drawing,
		VertexIndexMap
	)

References boost::xpressive::after(), boost::xpressive::before(), bucket_sort(), edges(), intersects(), boost::fusion::make_tuple(), next(), prior(), boost::asio::s, source(), swap, boost::flyweights::t, target(), boost::flyweights::x, and boost::polygon::y().

Referenced by is_straight_line_drawing().

template<typename Graph , typename GridPositionMap >

bool boost::is_straight_line_drawing	(	const Graph &	g,
		GridPositionMap	drawing
	)

References is_straight_line_drawing(), and vertex_index.

template<typename Graph >

bool boost::is_undirected

(

const Graph &

g

)

Return true if the given graph is undirected.

References boost::detail::is_directed().

Referenced by boost::detail::graph::brandes_betweenness_centrality_impl(), boost::graph::parallel::detail::brandes_betweenness_centrality_impl(), boost::detail::can_extend_graph(), boost::graph::distributed::crauser_et_al_shortest_paths(), boost::erdos_renyi_iterator< RandomGenerator, Graph >::erdos_renyi_iterator(), floyd_warshall_all_pairs_shortest_paths(), johnson_all_pairs_shortest_paths(), boost::graph::parallel::detail::non_distributed_brandes_betweenness_centrality_impl(), boost::mesh_iterator< Graph >::operator++(), relax(), boost::graph_test< Graph >::test_add_edge(), vf2_graph_iso(), boost::detail::vf2_subgraph_morphism(), and write_graphviz().

template<typename Graph1 , typename Graph2 , typename IsoMapping , typename Invariant1 , typename Invariant2 , typename IndexMap1 , typename IndexMap2 >

bool boost::isomorphism	(	const Graph1 &	G1,
		const Graph2 &	G2,
		IsoMapping	f,
		Invariant1	invariant1,
		Invariant2	invariant2,
		std::size_t	max_invariant,
		IndexMap1	index_map1,
		IndexMap2	index_map2
	)

References BOOST_CONCEPT_ASSERT(), BOOST_STATIC_ASSERT(), count_vertices(), and boost::program_options::value().

Referenced by is_kuratowski_subgraph(), and boost::graph::detail::isomorphism_impl< Graph1, Graph2 >::operator()().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( vertex_isomorphism , _t)> boost::isomorphism_map

(

const PType &

p

)

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( iterations , _t)> boost::iterations

(

const PType &

p

)

Referenced by boost::graph::distributed::fleischer_hendrickson_pinar_strong_components().

template<class Graph , class IndexMap , class DomTreePredMap >

void boost::iterative_bit_vector_dominator_tree	(	const Graph &	g,
		const typename graph_traits< Graph >::vertex_descriptor &	entry,
		const IndexMap &	indexMap,
		DomTreePredMap	domTreePredMap
	)

Muchnick.

p. 182, 184

using iterative bit vector analysis

References boost::asio::begin, BOOST_CONCEPT_ASSERT(), boost::fusion::clear(), end, in_edges(), boost::xpressive::insert, boost::geometry::index::inserter(), make_iterator_property_map(), N, num_vertices(), boost::multiprecision::backends::p, put(), boost::asio::s, boost::range::set_intersection(), size(), source(), swap, T, boost::flyweights::t, Vertex, and vertices().

Referenced by iterative_bit_vector_dominator_tree().

template<class Graph , class DomTreePredMap >

void boost::iterative_bit_vector_dominator_tree	(	const Graph &	g,
		const typename graph_traits< Graph >::vertex_descriptor &	entry,
		DomTreePredMap	domTreePredMap
	)

References iterative_bit_vector_dominator_tree(), and vertex_index.

template<typename Graph , typename VertexIndexMap >

graph_traits<Graph>::vertices_size_type boost::ith_bandwidth	(	typename graph_traits< Graph >::vertex_descriptor	i,
		const Graph &	g,
		VertexIndexMap	index
	)

References abs(), boost::geometry::math::abs(), boost::asio::b, BOOST_PREVENT_MACRO_SUBSTITUTION, BOOST_USING_STD_MAX, end, boost::multiprecision::backends::i, boost::accumulators::extract::max, out_edges(), target(), and boost::detail::vertices_size_type.

Referenced by ith_bandwidth(), and profile().

template<typename Graph >

graph_traits<Graph>::vertices_size_type boost::ith_bandwidth	(	typename graph_traits< Graph >::vertex_descriptor	i,
		const Graph &	g
	)

References ith_bandwidth(), and vertex_index.

template<typename Graph , typename VertexIndexMap >

graph_traits<Graph>::vertices_size_type boost::ith_wavefront	(	typename graph_traits< Graph >::vertex_descriptor	i,
		const Graph &	g,
		VertexIndexMap	index
	)

References boost::asio::b, boost::multiprecision::backends::i, num_vertices(), out_edges(), target(), and vertices().

Referenced by aver_wavefront(), ith_wavefront(), max_wavefront(), and rms_wavefront().

template<typename Graph >

graph_traits<Graph>::vertices_size_type boost::ith_wavefront	(	typename graph_traits< Graph >::vertex_descriptor	i,
		const Graph &	g
	)

References ith_wavefront(), and vertex_index.

template<class VertexAndEdgeListGraph , class DistanceMatrix , class VertexID , class Weight , typename BinaryPredicate , typename BinaryFunction , typename Infinity , class DistanceZero >

bool boost::johnson_all_pairs_shortest_paths	(	VertexAndEdgeListGraph &	g1,
		DistanceMatrix &	D,
		VertexID	id1,
		Weight	w1,
		const BinaryPredicate &	compare,
		const BinaryFunction &	combine,
		const Infinity &	inf,
		DistanceZero	zero
	)

References a, add_edge(), boost::asio::b, bellman_ford_shortest_paths(), BOOST_CONCEPT_ASSERT(), boost::iostreams::combine(), dijkstra_shortest_paths(), edge_weight, edge_weight2, edges(), boost::multiprecision::backends::i, boost::iostreams::gzip::magic::id2, is_undirected(), num_vertices(), put(), boost::asio::s, source(), target(), boost::program_options::value(), vertex_distance, vertex_index, boost::detail::vertex_iterator, vertices(), and boost::detail::vertices_size_type.

Referenced by johnson_all_pairs_shortest_paths(), boost::detail::johnson_dispatch(), and boost::detail::graph::kamada_kawai_spring_layout_impl< Topology, Graph, PositionMap, WeightMap, EdgeOrSideLength, Done, VertexIndexMap, DistanceMatrix, SpringStrengthMatrix, PartialDerivativeMap >::run().

template<class VertexAndEdgeListGraph , class DistanceMatrix , class VertexID , class Weight , class DistanceZero >

bool boost::johnson_all_pairs_shortest_paths	(	VertexAndEdgeListGraph &	g1,
		DistanceMatrix &	D,
		VertexID	id1,
		Weight	w1,
		DistanceZero	zero
	)

References johnson_all_pairs_shortest_paths(), and boost::accumulators::extract::max.

template<class VertexAndEdgeListGraph , class DistanceMatrix , class P , class T , class R >

bool boost::johnson_all_pairs_shortest_paths	(	VertexAndEdgeListGraph &	g,
		DistanceMatrix &	D,
		const bgl_named_params< P, T, R > &	params
	)

References choose_const_pmap(), edge_weight, get_param(), boost::detail::johnson_dispatch(), and vertex_index.

template<class VertexAndEdgeListGraph , class DistanceMatrix >

bool boost::johnson_all_pairs_shortest_paths	(	VertexAndEdgeListGraph &	g,
		DistanceMatrix &	D
	)

References edge_weight, boost::detail::johnson_dispatch(), and vertex_index.

template<typename Topology , typename Graph , typename PositionMap , typename WeightMap , typename T , bool EdgeOrSideLength, typename Done , typename VertexIndexMap , typename DistanceMatrix , typename SpringStrengthMatrix , typename PartialDerivativeMap >

bool boost::kamada_kawai_spring_layout	(	const Graph &	g,
		PositionMap	position,
		WeightMap	weight,
		const Topology &	topology,
		detail::graph::edge_or_side< EdgeOrSideLength, T >	edge_or_side_length,
		Done	done,
		typename property_traits< WeightMap >::value_type	spring_constant,
		VertexIndexMap	index,
		DistanceMatrix	distance,
		SpringStrengthMatrix	spring_strength,
		PartialDerivativeMap	partial_derivatives
	)

Kamada-Kawai spring layout for undirected graphs.

This algorithm performs graph layout (in two dimensions) for connected, undirected graphs. It operates by relating the layout of graphs to a dynamic spring system and minimizing the energy within that system. The strength of a spring between two vertices is inversely proportional to the square of the shortest distance (in graph terms) between those two vertices. Essentially, vertices that are closer in the graph-theoretic sense (i.e., by following edges) will have stronger springs and will therefore be placed closer together.

Prior to invoking this algorithm, it is recommended that the vertices be placed along the vertices of a regular n-sided polygon.

Parameters

g	(IN) must be a model of Vertex List Graph, Edge List Graph, and Incidence Graph and must be undirected.
position	(OUT) must be a model of Lvalue Property Map, where the value type is a class containing fields x and y that will be set to the x and y coordinates of each vertex.
weight	(IN) must be a model of Readable Property Map, which provides the weight of each edge in the graph g.
topology	(IN) must be a topology object (see topology.hpp), which provides operations on points and differences between them.
edge_or_side_length	(IN) provides either the unit length e of an edge in the layout or the length of a side s of the display area, and must be either boost::edge_length(e) or boost::side_length(s), respectively.
done	(IN) is a 4-argument function object that is passed the current value of delta_p (i.e., the energy of vertex p), the vertex p, the graph g, and a boolean flag indicating whether delta_p is the maximum energy in the system (when true) or the energy of the vertex being moved. Defaults to layout_tolerance instantiated over the value type of the weight map.
spring_constant	(IN) is the constant multiplied by each spring's strength. Larger values create systems with more energy that can take longer to stabilize; smaller values create systems with less energy that stabilize quickly but do not necessarily result in pleasing layouts. The default value is 1.
index	(IN) is a mapping from vertices to index values between 0 and num_vertices(g). The default is get(vertex_index,g).
distance	(UTIL/OUT) will be used to store the distance from every vertex to every other vertex, which is computed in the first stages of the algorithm. This value's type must be a model of BasicMatrix with value type equal to the value type of the weight map. The default is a vector of vectors.
spring_strength	(UTIL/OUT) will be used to store the strength of the spring between every pair of vertices. This value's type must be a model of BasicMatrix with value type equal to the value type of the weight map. The default is a vector of vectors.
partial_derivatives	(UTIL) will be used to store the partial derivates of each vertex with respect to the x and y coordinates. This must be a Read/Write Property Map whose value type is a pair with both types equivalent to the value type of the weight map. The default is an iterator property map.

Returns

true if layout was successful or false if a negative weight cycle was detected.

References BOOST_STATIC_ASSERT(), and boost::program_options::value().

Referenced by kamada_kawai_spring_layout().

template<typename Topology , typename Graph , typename PositionMap , typename WeightMap , typename T , bool EdgeOrSideLength, typename Done , typename VertexIndexMap >

bool boost::kamada_kawai_spring_layout	(	const Graph &	g,
		PositionMap	position,
		WeightMap	weight,
		const Topology &	topology,
		detail::graph::edge_or_side< EdgeOrSideLength, T >	edge_or_side_length,
		Done	done,
		typename property_traits< WeightMap >::value_type	spring_constant,
		VertexIndexMap	index
	)

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References distance(), kamada_kawai_spring_layout(), make_iterator_property_map(), n, and num_vertices().

template<typename Topology , typename Graph , typename PositionMap , typename WeightMap , typename T , bool EdgeOrSideLength, typename Done >

bool boost::kamada_kawai_spring_layout	(	const Graph &	g,
		PositionMap	position,
		WeightMap	weight,
		const Topology &	topology,
		detail::graph::edge_or_side< EdgeOrSideLength, T >	edge_or_side_length,
		Done	done,
		typename property_traits< WeightMap >::value_type	spring_constant
	)

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References kamada_kawai_spring_layout(), and vertex_index.

template<typename Topology , typename Graph , typename PositionMap , typename WeightMap , typename T , bool EdgeOrSideLength, typename Done >

bool boost::kamada_kawai_spring_layout	(	const Graph &	g,
		PositionMap	position,
		WeightMap	weight,
		const Topology &	topology,
		detail::graph::edge_or_side< EdgeOrSideLength, T >	edge_or_side_length,
		Done	done
	)

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References kamada_kawai_spring_layout().

template<typename Topology , typename Graph , typename PositionMap , typename WeightMap , typename T , bool EdgeOrSideLength>

bool boost::kamada_kawai_spring_layout	(	const Graph &	g,
		PositionMap	position,
		WeightMap	weight,
		const Topology &	topology,
		detail::graph::edge_or_side< EdgeOrSideLength, T >	edge_or_side_length
	)

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References kamada_kawai_spring_layout(), and vertex_index.

template<class Graph , class OutputIterator , class ColorMap , class DegreeMap , typename VertexIndexMap >

OutputIterator boost::king_ordering	(	const Graph &	g,
		std::deque< typename graph_traits< Graph >::vertex_descriptor >	vertex_queue,
		OutputIterator	permutation,
		ColorMap	color,
		DegreeMap	degree,
		VertexIndexMap	index_map
	)

References breadth_first_visit(), boost::multiprecision::backends::i, num_vertices(), put(), boost::asio::s, Vertex, vertices(), boost::detail::vertices_size_type, and white().

Referenced by king_ordering().

template<class Graph , class OutputIterator , class ColorMap , class DegreeMap , typename VertexIndexMap >

OutputIterator boost::king_ordering	(	const Graph &	g,
		typename graph_traits< Graph >::vertex_descriptor	s,
		OutputIterator	permutation,
		ColorMap	color,
		DegreeMap	degree,
		VertexIndexMap	index_map
	)

References king_ordering().

template<class Graph , class OutputIterator , class ColorMap , class DegreeMap , class VertexIndexMap >

OutputIterator boost::king_ordering	(	const Graph &	G,
		OutputIterator	permutation,
		ColorMap	color,
		DegreeMap	degree,
		VertexIndexMap	index_map
	)

References BGL_FORALL_VERTICES_T, depth_first_visit(), boost::graph::has_no_vertices(), boost::multiprecision::backends::i, king_ordering(), put(), Vertex, and white().

template<typename Graph , typename OutputIterator , typename VertexIndexMap >

OutputIterator boost::king_ordering	(	const Graph &	G,
		OutputIterator	permutation,
		VertexIndexMap	index_map
	)

References boost::graph::has_no_vertices(), king_ordering(), make_iterator_property_map(), and num_vertices().

template<typename Graph , typename OutputIterator >

OutputIterator boost::king_ordering ( const Graph &  G, OutputIterator  permutation  )

inline

References king_ordering(), and vertex_index.

template<class Graph , class DFSVisitor , class ComponentsMap , class DiscoverTime , class FinishTime , class ColorMap >

property_traits<ComponentsMap>::value_type boost::kosaraju_strong_components	(	Graph &	G,
		ComponentsMap	c,
		FinishTime	finish_time,
		ColorMap	color
	)

References BOOST_CONCEPT_ASSERT(), depth_first_search(), depth_first_visit(), boost::multiprecision::backends::i, make_dfs_visitor(), num_vertices(), put(), stamp_times(), transpose_graph(), Vertex, vertices(), and white().

template<class Graph , class OutputIterator >

void boost::kruskal_minimum_spanning_tree ( const Graph &  g, OutputIterator  spanning_tree_edges  )

inline

References edge_weight, boost::detail::kruskal_mst_impl(), make_iterator_property_map(), n, num_vertices(), pred_map, rank_map(), and vertex_index.

template<class Graph , class OutputIterator , class P , class T , class R >

void boost::kruskal_minimum_spanning_tree ( const Graph &  g, OutputIterator  spanning_tree_edges, const bgl_named_params< P, T, R > &  params  )

inline

References choose_const_pmap(), choose_param(), choose_pmap(), edge_weight, get_param(), is_default_param(), boost::detail::kruskal_mst_impl(), make_iterator_property_map(), n, num_vertices(), pred_map, rank_map(), vertex_index, vertex_predecessor, and vertex_rank.

template<typename G , typename L , typename S >

bool boost::label_vertex ( typename labeled_graph< G, L, S >::vertex_descriptor  v, typename labeled_graph< G, L, S >::label_type const  l, labeled_graph< G, L, S > &  g  )

inline

template<typename ForwardIter >

ForwardIter boost::last_max_element	(	ForwardIter	first,
		ForwardIter	last
	)

References boost::detail::basic_last_max_element().

template<typename ForwardIter , class BinaryPredicate >

ForwardIter boost::last_max_element	(	ForwardIter	first,
		ForwardIter	last,
		BinaryPredicate	comp
	)

References boost::detail::basic_last_max_element().

template<typename ForwardIter >

ForwardIter boost::last_min_element	(	ForwardIter	first,
		ForwardIter	last
	)

References boost::detail::basic_last_min_element().

template<typename ForwardIter , class BinaryPredicate >

ForwardIter boost::last_min_element	(	ForwardIter	first,
		ForwardIter	last,
		BinaryPredicate	comp
	)

References boost::detail::basic_last_min_element().

template<typename ForwardIter >

std::pair<ForwardIter,ForwardIter> boost::last_min_first_max_element	(	ForwardIter	first,
		ForwardIter	last
	)

References boost::detail::basic_last_min_first_max_element().

template<typename ForwardIter , class BinaryPredicate >

std::pair<ForwardIter,ForwardIter> boost::last_min_first_max_element ( ForwardIter  first, ForwardIter  last, BinaryPredicate  comp  )

inline

References boost::detail::basic_last_min_first_max_element().

template<typename ForwardIter >

std::pair<ForwardIter,ForwardIter> boost::last_min_last_max_element	(	ForwardIter	first,
		ForwardIter	last
	)

References boost::detail::basic_last_min_last_max_element().

template<typename ForwardIter , class BinaryPredicate >

std::pair<ForwardIter,ForwardIter> boost::last_min_last_max_element ( ForwardIter  first, ForwardIter  last, BinaryPredicate  comp  )

inline

References boost::detail::basic_last_min_last_max_element().

template<typename IntType >

IntType boost::lcm	(	IntType	n,
		IntType	m
	)

References boost::math::lcm().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( learning_constant_range , _t)> boost::learning_constant_range

(

const PType &

p

)

template<class Graph , class IndexMap , class TimeMap , class PredMap , class VertexVector , class DomTreePredMap >

void boost::lengauer_tarjan_dominator_tree	(	const Graph &	g,
		const typename graph_traits< Graph >::vertex_descriptor &	entry,
		const IndexMap &	indexMap,
		TimeMap	dfnumMap,
		PredMap	parentMap,
		VertexVector &	verticesByDFNum,
		DomTreePredMap	domTreePredMap
	)

Unlike lengauer_tarjan_dominator_tree_without_dfs, dfs is run in this function and the result is written to dfnumMap, parentMap, vertices.

If the result of dfs required after this algorithm, this function can eliminate the need of rerunning dfs.

References BOOST_CONCEPT_ASSERT(), depth_first_visit(), lengauer_tarjan_dominator_tree_without_dfs(), make_dfs_visitor(), make_iterator_property_map(), boost::xpressive::make_pair, boost::accumulators::extract::max, num_vertices(), record_predecessors(), and boost::detail::stamp_times_with_vertex_vector().

Referenced by lengauer_tarjan_dominator_tree().

template<class Graph , class DomTreePredMap >

void boost::lengauer_tarjan_dominator_tree	(	const Graph &	g,
		const typename graph_traits< Graph >::vertex_descriptor &	entry,
		DomTreePredMap	domTreePredMap
	)

Use vertex_index as IndexMap and make dfnumMap, parentMap, verticesByDFNum internally.

If we don't need the result of dfs (dfnumMap, parentMap, verticesByDFNum), this function would be more convenient one.

References lengauer_tarjan_dominator_tree(), make_iterator_property_map(), num_vertices(), Vertex, and vertex_index.

template<class Graph , class IndexMap , class TimeMap , class PredMap , class VertexVector , class DomTreePredMap >

void boost::lengauer_tarjan_dominator_tree_without_dfs	(	const Graph &	g,
		const typename graph_traits< Graph >::vertex_descriptor &	entry,
		const IndexMap &	,
		TimeMap	dfnumMap,
		PredMap	parentMap,
		VertexVector &	verticesByDFNum,
		DomTreePredMap	domTreePredMap
	)

Build dominator tree using Lengauer-Tarjan algorithm.

It takes O((V+E)log(V+E)) time.

Precondition

dfnumMap, parentMap and verticesByDFNum have dfs results corresponding indexMap. If dfs has already run before, this function would be good for saving computations.

Unreachable nodes must be masked as graph_traits<Graph>::null_vertex in parentMap.

Unreachable nodes must be masked as (std::numeric_limits<VerticesSizeType>::max)() in dfnumMap.

Parameters

domTreePredMap

[out] : immediate dominator map (parent map in dom. tree)

Note

reference Appel. p. 452~453. algorithm 19.9, 19.10.

Todo:

: Optimization in Finding Dominators in Practice, Loukas Georgiadis

References BOOST_CONCEPT_ASSERT(), boost::multiprecision::backends::i, n, num_vertices(), put(), boost::detail::dominator_visitor< Graph, IndexMap, TimeMap, PredMap, DomTreePredMap >::samedomMap, Vertex, and visitor().

Referenced by lengauer_tarjan_dominator_tree().

template<class OptionalPointee >

bool boost::less_pointees ( OptionalPointee const &  x, OptionalPointee const &  y  )

inline

Referenced by boost::less_pointees_t< OptionalPointee >::operator()(), and operator<().

template<typename Target , typename Source >

Target boost::lexical_cast ( const Source &  arg )

inline

References boost::conversion::detail::throw_bad_cast(), and boost::conversion::detail::try_lexical_convert().

template<typename Target >

Target boost::lexical_cast ( const char *  chars, std::size_t  count  )

inline

References count, and lexical_cast().

template<typename Target >

Target boost::lexical_cast ( const unsigned char *  chars, std::size_t  count  )

inline

References count, and lexical_cast().

template<typename Target >

Target boost::lexical_cast ( const signed char *  chars, std::size_t  count  )

inline

References count, and lexical_cast().

template<typename Target >

Target boost::lexical_cast ( const wchar_t *  chars, std::size_t  count  )

inline

References count, and lexical_cast().

template<typename Target >

Target boost::lexical_cast ( const char16_t *  chars, std::size_t  count  )

inline

References count, and lexical_cast().

template<typename Target >

Target boost::lexical_cast ( const char32_t *  chars, std::size_t  count  )

inline

References count.

Referenced by lexical_cast().

template<typename Target , typename Source >

Target boost::lexical_cast

(

Source

arg

)

References BOOST_DEDUCED_TYPENAME, and boost::conversion::detail::throw_bad_cast().

Referenced by boost::BOOST_RT_PARAM_NAMESPACE::interpret_argument_value_impl< T >::_(), boost::geometry::detail::coordinate_cast< CoordinateType >::apply(), boost::math::detail::bessel_i0(), boost::math::detail::bessel_i1(), boost::math::constants::detail::convert_from_string(), boost::program_options::typed_value< T, charT >::default_value(), boost::multiprecision::backends::eval_convert_to(), boost::date_time::fixed_string_to_int(), boost::spirit::lex::lexertl::detail::generate_cpp_state_table(), boost::itest::manager::generic_return(), boost::program_options::typed_value< T, charT >::implicit_value(), boost::math::kurtosis(), boost::math::kurtosis_excess(), boost::math::tools::make_big_value(), boost::date_time::month_str_to_ushort(), boost::xpressive::op::as< T >::operator()(), boost::multiprecision::concepts::number_backend_float_architype::operator=(), boost::basic_filter_factory< CharT, AttributeValueT >::parse_argument(), boost::date_time::parse_date(), boost::date_time::time_input_facet< time_type, CharT, InItrT >::parse_frac_type(), boost::date_time::parse_undelimited_date(), boost::date_time::parse_undelimited_time_duration(), boost::detail::read_value(), boost::math::skewness(), boost::multiprecision::backends::cpp_dec_float< Digits10, ExponentType, Allocator >::str(), boost::date_time::str_from_delimited_time_duration(), boost::date_time::var_string_to_int(), and write_graphml().

template<typename T >

local_property<T> boost::local ( T  x )

inline

References boost::flyweights::x.

Referenced by boost::chrono::BOOST_SCOPED_ENUM_DECLARE_BEGIN(), boost::graph::distributed::hohberg_vertex_processor< Graph >::echo_phase(), boost::graph::distributed::hohberg_vertex_processor< Graph >::fill_edge_map(), boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), get(), boost::graph::distributed::hohberg_detail::infimum(), boost::graph::distributed::detail::initialize_min_in_weights(), boost::graph::distributed::hohberg_vertex_processor< Graph >::num_starting_bicomponents(), boost::property_reduce< vertex_color_t >::apply< Color >::operator()(), boost::graph::distributed::hohberg_vertex_processor< Graph >::operator()(), boost::graph::distributed::cc_detail::parallel_connected_components(), put(), boost::property_tree::info_parser::read_info(), boost::property_tree::ini_parser::read_ini(), boost::graph::distributed::delta_stepping_impl< Graph, PredecessorMap, DistanceMap, EdgeWeightMap >::run(), boost::graph::parallel::detail::betweenness_centrality_delta_stepping_impl< Graph, DistanceMap, IncomingMap, EdgeWeightMap, PathCountMap >::run(), boost::numeric::odeint::same_size_impl< mpi_state< InnerState1 >, mpi_state< InnerState2 > >::same_size(), and boost::graph::distributed::hohberg_vertex_processor< Graph >::start_naming_phase().

template<typename Key , typename Value >

void boost::local_put ( dummy_property_map  , const Key &  , const Value &    )

inline

Referenced by boost::graph::distributed::hohberg_vertex_processor< Graph >::fill_edge_map(), boost::graph::detail::initialize_global_index_map(), and boost::graph::distributed::detail::parallel_dfs< DistributedGraph, ColorMap, ParentMap, ExploreMap, VertexIndexMap, DFSVisitor >::run().

template<typename MutexType1 , typename MutexType2 >

void boost::lock	(	MutexType1 &	m1,
		MutexType2 &	m2
	)

References boost::detail::lock_impl().

Referenced by boost::sources::basic_composite_logger< CharT, FinalT, ThreadingModelT, FeaturesT >::add_attribute(), boost::sources::basic_composite_logger< CharT, FinalT, ThreadingModelT, FeaturesT >::assign(), atomic_load(), atomic_store(), BOOST_THREAD_DCL_MOVABLE_BEG(), boost::sources::basic_channel_logger< BaseT, ChannelT >::channel(), boost::sinks::asynchronous_sink< SinkBackendT, QueueingStrategyT >::consume(), boost::sinks::bounded_fifo_queue< MaxQueueSizeV, OverflowStrategyT >::dequeue_ready(), boost::sinks::unbounded_ordering_queue< OrderT >::dequeue_ready(), boost::sinks::bounded_ordering_queue< OrderT, MaxQueueSizeV, OverflowStrategyT >::dequeue_ready(), boost::interprocess::ipcdetail::sync_handles::destroy_handle(), boost::interprocess::ipcdetail::sync_handles::destroy_syncs_in_range(), boost::sinks::bounded_fifo_queue< MaxQueueSizeV, OverflowStrategyT >::enqueue(), boost::sinks::unbounded_ordering_queue< OrderT >::enqueue(), boost::sinks::bounded_ordering_queue< OrderT, MaxQueueSizeV, OverflowStrategyT >::enqueue(), boost::sinks::basic_sink_frontend::feed_record(), boost::sinks::basic_formatting_sink_frontend< CharT >::feed_record(), boost::sinks::asynchronous_sink< SinkBackendT, QueueingStrategyT >::flush(), boost::attributes::mutable_constant< T, MutexT, ScopedWriteLockT, ScopedReadLockT >::impl::get(), boost::detail::shared_state< Rp >::get(), boost::detail::shared_state< T & >::get(), boost::detail::shared_state< void >::get(), boost::sources::basic_composite_logger< CharT, FinalT, ThreadingModelT, FeaturesT >::get_attributes(), boost::detail::shared_state_base::get_exception_ptr(), boost::interprocess::message_queue_t< VoidPointer >::get_num_msg(), boost::detail::shared_state< Rp >::get_sh(), boost::detail::shared_state< T & >::get_sh(), boost::detail::shared_state< void >::get_sh(), boost::attributes::mutable_constant< T, MutexT, ScopedWriteLockT, ScopedReadLockT >::impl::get_value(), boost::sinks::basic_formatting_sink_frontend< CharT >::getloc(), boost::detail::shared_state_base::has_exception(), boost::detail::shared_state_base::has_value(), boost::sinks::basic_formatting_sink_frontend< CharT >::imbue(), boost::sinks::bounded_fifo_queue< MaxQueueSizeV, OverflowStrategyT >::interrupt_dequeue(), boost::sinks::unbounded_ordering_queue< OrderT >::interrupt_dequeue(), boost::sinks::bounded_ordering_queue< OrderT, MaxQueueSizeV, OverflowStrategyT >::interrupt_dequeue(), boost::detail::shared_state_base::make_ready(), make_unique_locks(), boost::detail::shared_state_base::mark_exceptional_finish(), boost::detail::shared_state< Rp >::mark_finished_with_result(), boost::detail::shared_state< T & >::mark_finished_with_result(), boost::detail::shared_state< void >::mark_finished_with_result(), boost::interprocess::ipcdetail::sync_handles::obtain_mutex(), boost::interprocess::ipcdetail::sync_handles::obtain_semaphore(), boost::sources::basic_composite_logger< CharT, FinalT, ThreadingModelT, FeaturesT >::open_record(), boost::synchronized_value< T, Lockable >::operator<(), boost::synchronized_value< T, Lockable >::operator<=(), boost::synchronized_value< T, Lockable >::operator=(), boost::synchronized_value< T, Lockable >::operator==(), boost::synchronized_value< T, Lockable >::operator>(), boost::synchronized_value< T, Lockable >::operator>=(), boost::spirit::scoped_lock_parser< MutexT, ParserT >::parse(), boost::sources::basic_composite_logger< CharT, FinalT, ThreadingModelT, FeaturesT >::push_record(), boost::statechart::fifo_worker< Allocator >::queue_work_item(), boost::detail::range_lock_guard< Iterator >::range_lock_guard(), boost::detail::shared_state_base::register_external_waiter(), boost::sources::basic_composite_logger< CharT, FinalT, ThreadingModelT, FeaturesT >::remove_all_attributes(), boost::sources::basic_composite_logger< CharT, FinalT, ThreadingModelT, FeaturesT >::remove_attribute(), boost::detail::shared_state_base::remove_external_waiter(), boost::sinks::basic_sink_frontend::reset_exception_handler(), boost::sinks::basic_sink_frontend::reset_filter(), boost::sinks::basic_formatting_sink_frontend< CharT >::reset_formatter(), boost::attributes::mutable_constant< T, MutexT, ScopedWriteLockT, ScopedReadLockT >::impl::set(), boost::sources::basic_composite_logger< CharT, FinalT, ThreadingModelT, FeaturesT >::set_attributes(), boost::promise< R >::set_exception(), boost::promise< R & >::set_exception(), boost::promise< void >::set_exception(), boost::sinks::basic_sink_frontend::set_exception_handler(), boost::sources::basic_exception_handler_logger< BaseT >::set_exception_handler(), boost::sinks::basic_sink_frontend::set_filter(), boost::sinks::basic_formatting_sink_frontend< CharT >::set_formatter(), boost::promise< R >::set_value(), boost::promise< R & >::set_value(), boost::promise< void >::set_value(), boost::detail::shared_state_base::set_wait_callback(), boost::sinks::asynchronous_sink< SinkBackendT, QueueingStrategyT >::stop(), boost::sources::basic_composite_logger< CharT, FinalT, ThreadingModelT, FeaturesT >::swap(), boost::synchronized_value< T, Lockable >::swap(), synchronize(), boost::sinks::bounded_fifo_queue< MaxQueueSizeV, OverflowStrategyT >::try_dequeue(), boost::sinks::unbounded_ordering_queue< OrderT >::try_dequeue(), boost::sinks::bounded_ordering_queue< OrderT, MaxQueueSizeV, OverflowStrategyT >::try_dequeue(), boost::sinks::unbounded_ordering_queue< OrderT >::try_dequeue_ready(), boost::sinks::bounded_ordering_queue< OrderT, MaxQueueSizeV, OverflowStrategyT >::try_dequeue_ready(), boost::sinks::bounded_fifo_queue< MaxQueueSizeV, OverflowStrategyT >::try_enqueue(), boost::sinks::unbounded_ordering_queue< OrderT >::try_enqueue(), boost::sinks::bounded_ordering_queue< OrderT, MaxQueueSizeV, OverflowStrategyT >::try_enqueue(), boost::sinks::basic_sink_frontend::try_feed_record(), boost::sinks::basic_formatting_sink_frontend< CharT >::try_feed_record(), boost::barrier::wait(), boost::detail::shared_state_base::wait(), boost::sinks::basic_sink_frontend::will_consume(), with_lock_guard(), boost::promise< R >::~promise(), boost::promise< R & >::~promise(), and boost::promise< void >::~promise().

template<typename MutexType1 , typename MutexType2 >

void boost::lock	(	const MutexType1 &	m1,
		MutexType2 &	m2
	)

References boost::detail::lock_impl().

template<typename MutexType1 , typename MutexType2 >

void boost::lock	(	MutexType1 &	m1,
		const MutexType2 &	m2
	)

References boost::detail::lock_impl().

template<typename MutexType1 , typename MutexType2 >

void boost::lock	(	const MutexType1 &	m1,
		const MutexType2 &	m2
	)

References boost::detail::lock_impl().

template<typename MutexType1 , typename MutexType2 , typename MutexType3 >

void boost::lock	(	MutexType1 &	m1,
		MutexType2 &	m2,
		MutexType3 &	m3
	)

References boost::detail::lock_helper().

template<typename MutexType1 , typename MutexType2 , typename MutexType3 , typename MutexType4 >

void boost::lock	(	MutexType1 &	m1,
		MutexType2 &	m2,
		MutexType3 &	m3,
		MutexType4 &	m4
	)

References boost::detail::lock_helper().

template<typename MutexType1 , typename MutexType2 , typename MutexType3 , typename MutexType4 , typename MutexType5 >

void boost::lock	(	MutexType1 &	m1,
		MutexType2 &	m2,
		MutexType3 &	m3,
		MutexType4 &	m4,
		MutexType5 &	m5
	)

References boost::detail::lock_helper().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( lookahead , _t)> boost::lookahead

(

const PType &

p

)

Referenced by boost::graph::distributed::eager_dijkstra_shortest_paths().

template<typename Graph >

std::pair<typename boost::graph_traits<Graph>::edge_descriptor, bool> boost::lookup_edge	(	typename boost::graph_traits< Graph >::vertex_descriptor	src,
		typename boost::graph_traits< Graph >::vertex_descriptor	tgt,
		const Graph &	g,
		typename boost::enable_if< is_adjacency_matrix< Graph >, int >::type	= 0
	)

References edge().

Referenced by boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::augment_direct_paths(), boost::detail::count_edges(), boost::detail::extend_clique(), boost::detail::is_connected_to_clique(), and boost::tsp_tour_len_visitor< Graph, WeightMap, OutIter, Length >::visit_vertex().

template<typename Graph >

std::pair<typename boost::graph_traits<Graph>::edge_descriptor, bool> boost::lookup_edge	(	typename boost::graph_traits< Graph >::vertex_descriptor	src,
		typename boost::graph_traits< Graph >::vertex_descriptor	tgt,
		const Graph &	g,
		typename boost::disable_if< is_adjacency_matrix< Graph >, int >::type	= 0
	)

References it, boost::xpressive::make_pair, out_edges(), and target().

template<typename Graph , typename ColorMap , typename NextEdge >

void boost::loop_erased_random_walk	(	const Graph &	g,
		typename boost::graph_traits< Graph >::vertex_descriptor	s,
		NextEdge	next_edge,
		ColorMap	color,
		std::vector< typename boost::graph_traits< Graph >::vertex_descriptor > &	path
	)

References BOOST_ASSERT, boost::algorithm::find(), gray(), it, put(), boost::flyweights::t, target(), and white().

Referenced by boost::detail::random_spanning_tree_internal().

template<typename T >

int boost::lowest_bit

(

T

x

)

Referenced by boost::dynamic_bitset< Block, Allocator >::find_next().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( vertex_lowpoint , _t)> boost::lowpoint_map

(

const PType &

p

)

template<class R , class F >

_bi::af0<R, F> boost::make_adaptable

(

F

f

)

template<class R , class A1 , class F >

_bi::af1<R, A1, F> boost::make_adaptable

(

F

f

)

template<class R , class A1 , class A2 , class F >

_bi::af2<R, A1, A2, F> boost::make_adaptable

(

F

f

)

template<class R , class A1 , class A2 , class A3 , class F >

_bi::af3<R, A1, A2, A3, F> boost::make_adaptable

(

F

f

)

template<class R , class A1 , class A2 , class A3 , class A4 , class F >

_bi::af4<R, A1, A2, A3, A4, F> boost::make_adaptable

(

F

f

)

template<class UniquePairAssociativeContainer >

associative_property_map<UniquePairAssociativeContainer> boost::make_assoc_property_map

(

UniquePairAssociativeContainer &

c

)

References boost::multiprecision::backends::c.

template<class UniquePairAssociativeContainer >

const_associative_property_map<UniquePairAssociativeContainer> boost::make_assoc_property_map

(

const UniquePairAssociativeContainer &

c

)

References boost::multiprecision::backends::c.

template<class Visitors >

astar_visitor<Visitors> boost::make_astar_visitor

(

Visitors

vis

)

Referenced by astar_search(), astar_search_no_init(), astar_search_no_init_tree(), and astar_search_tree().

template<typename ValueT , typename FunT >

attribute_value_ordering< ValueT, FunT > boost::make_attr_ordering ( attribute_name const &  name, FunT const &  fun  )

inline

The function constructs a log record ordering predicate.

template<typename FunT >

aux::make_attr_ordering_type< FunT >::type boost::make_attr_ordering ( attribute_name const &  name, FunT const &  fun  )

inline

The function constructs a log record ordering predicate.

template<class Visitors >

bellman_visitor<Visitors> boost::make_bellman_visitor

(

Visitors

vis

)

template<class Visitors >

bfs_visitor<Visitors> boost::make_bfs_visitor

(

Visitors

vis

)

Referenced by boost::detail::bfs_dispatch< ColorMap >::apply(), boost::detail::bfs_dispatch< param_not_found >::apply(), breadth_first_visit(), edmonds_karp_max_flow(), boost::graph_as_tree< Graph, ParentMap, Node, ChIt >::graph_as_tree(), boost::graph::detail::breadth_first_search_impl< Graph, Source >::operator()(), boost::detail::gursoy_shortest< dummy_property_map >::run(), sloan_ordering(), and sloan_start_end_vertices().

template<typename Graph , typename PlanarEmbedding , typename EdgeIndexMap , typename AddEdgeVisitor >

void boost::make_biconnected_planar	(	Graph &	g,
		PlanarEmbedding	embedding,
		EdgeIndexMap	em,
		AddEdgeVisitor &	vis
	)

References articulation_points(), biconnected_components(), num_edges(), source(), and target().

Referenced by make_biconnected_planar().

template<typename Graph , typename PlanarEmbedding , typename EdgeIndexMap >

void boost::make_biconnected_planar ( Graph &  g, PlanarEmbedding  embedding, EdgeIndexMap  em  )

inline

References make_biconnected_planar().

template<typename Graph , typename PlanarEmbedding >

void boost::make_biconnected_planar ( Graph &  g, PlanarEmbedding  embedding  )

inline

References edge_index, and make_biconnected_planar().

template<class FPMap , class GPMap >

compose_property_map<FPMap, GPMap> boost::make_compose_property_map ( const FPMap &  f, const GPMap &  g  )

inline

template<typename Graph , typename VertexIndexMap , typename AddEdgeVisitor >

void boost::make_connected	(	Graph &	g,
		VertexIndexMap	vm,
		AddEdgeVisitor &	vis
	)

References bucket_sort(), connected_components(), boost::filesystem::detail::copy(), next(), num_vertices(), and vertices().

Referenced by make_connected().

template<typename Graph , typename VertexIndexMap >

void boost::make_connected ( Graph &  g, VertexIndexMap  vm  )

inline

References make_connected().

template<typename Graph >

void boost::make_connected ( Graph &  g )

inline

References make_connected(), and vertex_index.

template<typename Key , typename Value >

constant_property_map<Key, Value> boost::make_constant_property ( const Value &  value )

inline

References boost::program_options::value().

template<typename Key , typename Value >

constant_writable_property_map<Key, Value> boost::make_constant_writable_property ( const Value &  value )

inline

References boost::program_options::value().

template<class PropertyGraph , class RandomAccessContainer >

iterator_property_map< typename RandomAccessContainer::iterator, typename property_map<PropertyGraph, vertex_index_t>::type, typename RandomAccessContainer::value_type, typename RandomAccessContainer::reference > boost::make_container_vertex_map ( RandomAccessContainer &  c, const PropertyGraph &  g  )

inline

References BOOST_ASSERT, make_iterator_vertex_map(), and num_vertices().

template<class RandomAccessContainer >

iterator_property_map< typename RandomAccessContainer::iterator, identity_property_map, typename RandomAccessContainer::value_type, typename RandomAccessContainer::reference > boost::make_container_vertex_map ( RandomAccessContainer &  c )

inline

References make_iterator_vertex_map().

template<class Visitors >

core_numbers_visitor<Visitors> boost::make_core_numbers_visitor

(

Visitors

vis

)

Referenced by core_numbers(), and weighted_core_numbers().

template<typename Graph >

degree_property_map<Graph> boost::make_degree_map ( const Graph &  g )

inline

template<class Visitors >

dfs_visitor<Visitors> boost::make_dfs_visitor

(

Visitors

vis

)

Referenced by boost::detail::bicomp_dispatch3< PredecessorMap >::apply(), boost::detail::bicomp_dispatch3< param_not_found >::apply(), find_odd_cycle(), if(), is_bipartite(), kosaraju_strong_components(), lengauer_tarjan_dominator_tree(), boost::graph::detail::depth_first_search_impl< Graph >::operator()(), boost::detail::rec_two_graphs_common_spanning_trees(), and undirected_dfs().

template<class Visitors >

dijkstra_visitor<Visitors> boost::make_dijkstra_visitor

(

Visitors

vis

)

Referenced by dag_shortest_paths(), boost::detail::dijkstra_dispatch2(), boost::detail::dijkstra_no_color_map_dispatch2(), boost::detail::gursoy_shortest< EdgeWeightMap >::run(), and successive_shortest_path_nonnegative_weights().

template<typename Graph >

attributes_writer<typename property_map<Graph, edge_attribute_t>::const_type> boost::make_edge_attributes_writer

(

const Graph &

g

)

References edge_attribute.

Referenced by boost::detail::write_graphviz_subgraph().

template<class EdgeIter >

edge_list<EdgeIter> boost::make_edge_list ( EdgeIter  first, EdgeIter  last  )

inline

References boost::xpressive::first, and last.

template<typename HandlerT >

lazy_enable_if< aux::has_exception_types< HandlerT >, aux::make_self_contained_exception_handler< exception_handler, HandlerT >>::type boost::make_exception_handler ( HandlerT const &  handler )

inline

template<typename HandlerT >

lazy_enable_if< aux::has_exception_types< HandlerT >, aux::make_self_contained_exception_handler< nothrow_exception_handler, HandlerT >>::type boost::make_exception_handler ( HandlerT const &  handler, std::nothrow_t const &    )

inline

nop boost::make_exception_suppressor ( )

inline

The function creates an empty exception handler that effectively suppresses any exception.

template<class E >

exceptional_ptr boost::make_exceptional ( BOOST_FWD_REF(E)  ex )

inline

exceptional_ptr boost::make_exceptional ( exception_ptr  ex )

inline

exceptional_ptr boost::make_exceptional ( )

inline

template<typename T >

unique_future<T> boost::make_exceptional_future

(

exception_ptr

ex

)

References boost::multiprecision::backends::p.

template<typename T , typename E >

unique_future<T> boost::make_exceptional_future

(

E

ex

)

References boost::multiprecision::backends::p.

template<typename T >

unique_future<T> boost::make_exceptional_future

(

)

References boost::multiprecision::backends::p.

template<typename T >

unique_future<T> boost::make_exceptional_future_if_invalid

(

BOOST_THREAD_FWD_REF(unique_future< T >)

fut

)

References move().

template<typename T >

shared_future<T> boost::make_exceptional_future_if_invalid

(

shared_future< T >

fut

)

template<typename Graph , typename EdgePredicate >

filtered_graph<Graph, EdgePredicate> boost::make_filtered_graph ( Graph &  g, EdgePredicate  ep  )

inline

Referenced by if(), boost::detail::rec_two_graphs_common_spanning_trees(), boost::graph_test< Graph >::test_add_edge(), boost::graph_test< Graph >::test_add_vertex(), boost::graph_test< Graph >::test_clear_vertex(), and boost::graph_test< Graph >::test_remove_edge().

template<typename Graph , typename EdgePredicate , typename VertexPredicate >

filtered_graph<Graph, EdgePredicate, VertexPredicate> boost::make_filtered_graph ( Graph &  g, EdgePredicate  ep, VertexPredicate  vp  )

inline

template<typename Graph , typename EdgePredicate >

filtered_graph<const Graph, EdgePredicate> boost::make_filtered_graph ( const Graph &  g, EdgePredicate  ep  )

inline

template<typename Graph , typename EdgePredicate , typename VertexPredicate >

filtered_graph<const Graph, EdgePredicate, VertexPredicate> boost::make_filtered_graph ( const Graph &  g, EdgePredicate  ep, VertexPredicate  vp  )

inline

template<typename Key , typename Func >

function_property_map<Func, Key> boost::make_function_property_map

(

const Func &

f

)

Referenced by astar_search_no_init_tree().

template<typename Key , typename Ret , typename Func >

function_property_map<Func, Key, Ret> boost::make_function_property_map

(

const Func &

f

)

template<typename T >

unique_future<typename decay<T>::type> boost::make_future

(

BOOST_THREAD_FWD_REF(T)

value

)

References boost::multiprecision::backends::p.

template<class Rp , class Fp >

BOOST_THREAD_DCL_MOVABLE_BEG (R) detail unique_future<Rp> boost::make_future_deferred_shared_state

(

BOOST_THREAD_FWD_REF(Fp)

f

)

Referenced by BOOST_THREAD_DCL_MOVABLE_BEG().

template<typename GAttrMap , typename NAttrMap , typename EAttrMap >

graph_attributes_writer<GAttrMap, NAttrMap, EAttrMap> boost::make_graph_attributes_writer	(	const GAttrMap &	g_attr,
		const NAttrMap &	n_attr,
		const EAttrMap &	e_attr
	)

Referenced by boost::detail::write_graphviz_subgraph().

template<typename Graph >

graph_attributes_writer<typename graph_property<Graph, graph_graph_attribute_t>::type, typename graph_property<Graph, graph_vertex_attribute_t>::type, typename graph_property<Graph, graph_edge_attribute_t>::type> boost::make_graph_attributes_writer

(

const Graph &

g

)

References get_property(), graph_edge_attribute, graph_graph_attribute, and graph_vertex_attribute.

template<typename PositionMap , typename Topology , typename Graph >

grid_force_pairs<Topology, PositionMap> boost::make_grid_force_pairs ( const Topology &  topology, const PositionMap &  position, const Graph &  g  )

inline

Referenced by fruchterman_reingold_force_directed_layout().

template<typename IndexIterator , typename Distribution , typename Graph >

boost::transform_iterator<index_to_vertex_func<Distribution, Graph>, IndexIterator> boost::make_index_to_vertex_iterator	(	IndexIterator	it,
		const Distribution &	dist,
		const Graph &	g
	)

References boost::iterators::make_transform_iterator().

template<typename Compare , typename ReadablePropertyMap >

indirect_cmp<ReadablePropertyMap, Compare> boost::make_indirect_cmp	(	const Compare &	cmp,
		ReadablePropertyMap	pmap
	)

References boost::multiprecision::backends::p.

template<class Fun >

indirect_fun<Fun> boost::make_indirect_fun ( Fun  f )

inline

template<typename ReadablePropertyMap >

indirect_pmap<ReadablePropertyMap> boost::make_indirect_pmap

(

ReadablePropertyMap

pmap

)

template<class RAIter , class ID >

iterator_property_map< RAIter, ID, typename std::iterator_traits<RAIter>::value_type, typename std::iterator_traits<RAIter>::reference> boost::make_iterator_property_map ( RAIter  iter, ID  id  )

inline

Referenced by boost::detail::strong_comp_dispatch2< param_not_found >::apply(), boost::detail::edmonds_karp_dispatch2< param_not_found >::apply(), boost::detail::strong_comp_dispatch1< param_not_found >::apply(), boost::detail::edmonds_karp_dispatch1< param_not_found >::apply(), boost::detail::udfs_dispatch< param_not_found >::apply(), boost::detail::bicomp_dispatch3< param_not_found >::apply(), boost::detail::neighbor_bfs_dispatch< param_not_found >::apply(), boost::detail::bicomp_dispatch2< param_not_found >::apply(), boost::detail::bicomp_dispatch1< param_not_found >::apply(), boost::detail::base_state< Graph1, Graph2, IndexMap1, IndexMap2 >::base_state(), betweenness_centrality_clustering(), boykov_kolmogorov_max_flow(), boost::detail::graph::brandes_betweenness_centrality_dispatch2(), boost::graph::parallel::detail::brandes_betweenness_centrality_dispatch2(), boost::detail::vertex_property_map_generator_helper< Graph, IndexMap, Value, true >::build(), boost::graph::distributed::connected_components(), copy_component(), copy_graph(), core_numbers(), boost::graph::distributed::crauser_et_al_shortest_paths(), cuthill_mckee_ordering(), boost::detail::cycle_canceling_dispatch1(), boost::detail::cycle_canceling_dispatch2(), boost::detail::dag_sp_dispatch1(), boost::detail::dijkstra_dispatch1(), boost::detail::dijkstra_no_color_map_dispatch1(), boost::graph::distributed::eager_dijkstra_shortest_paths(), boost::graph::distributed::hohberg_biconnected_components(), iterative_bit_vector_dominator_tree(), kamada_kawai_spring_layout(), king_ordering(), kruskal_minimum_spanning_tree(), lengauer_tarjan_dominator_tree(), make_iterator_vertex_map(), maximum_cycle_mean(), metric_tsp_approx_from_vertex(), minimum_cycle_mean(), boost::detail::graph::non_distributed_brandes_betweenness_centrality_dispatch2(), boost::detail::graph::brandes_unweighted_shortest_paths::operator()(), boost::graph::page_rank(), boost::graph::detail::parallel_dijkstra_impl< ::boost::param_not_found >::run(), boost::detail::fr_force_directed_layout< param_not_found >::run(), sequential_vertex_coloring(), smallest_last_vertex_ordering(), boost::detail::sort_vertices(), boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(), boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(), boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(), boost::detail::transitive_closure_dispatch(), and boost::graph::distributed::tsin_depth_first_visit().

template<class RAIter , class Value , class ID >

iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map ( RAIter  iter, ID  id, Value    )

inline

template<typename IteratorT >

iterator_range< IteratorT > boost::make_iterator_range ( IteratorT  Begin, IteratorT  End  )

inline

iterator_range construct helper

Construct an iterator_range from a pair of iterators

Parameters

Begin	A begin iterator
End	An end iterator

Returns

iterator_range object

Referenced by as_array(), boost::ptr_container_detail::ptr_set_adapter_base< Key, std::set< void *, void_ptr_indirect_fun< Compare, Key >, Allocator >, CloneAllocator, Ordered >::equal_range(), boost::ptr_container_detail::ptr_map_adapter_base< T, VoidPtrMultiMap, CloneAllocator, Ordered >::equal_range(), boost::algorithm::find_iterator< IteratorT >::find_iterator(), boost::range_detail::make_range(), boost::iterator_range_detail::make_range_impl(), boost::numeric::odeint::detail::make_split_range(), boost::accumulators::detail::make_tail_range(), boost::xpressive::op::as< T >::operator()(), boost::assign_detail::operator<<(), boost::accumulators::impl::tail_variate_means_impl< Sample, Impl, LeftRight, VariateTag >::result(), boost::accumulators::impl::weighted_tail_variate_means_impl< Sample, Weight, Impl, LeftRight, VariateType >::result(), boost::accumulators::impl::weighted_density_impl< Sample, Weight >::result(), boost::accumulators::impl::density_impl< Sample >::result(), boost::accumulators::impl::p_square_cumulative_distribution_impl< Sample >::result(), boost::accumulators::impl::weighted_p_square_cumulative_distribution_impl< Sample, Weight >::result(), and boost::algorithm::split_iterator< IteratorT >::split_iterator().

template<class ForwardRange >

iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type > boost::make_iterator_range ( ForwardRange &  r )

inline

iterator_range construct helper

Construct an iterator_range from a Range containing the begin and end iterators.

template<class ForwardRange >

iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type > boost::make_iterator_range ( const ForwardRange &  r )

inline

template<class Range >

iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<Range>::type > boost::make_iterator_range ( Range &  r, BOOST_DEDUCED_TYPENAME range_difference< Range >::type  advance_begin, BOOST_DEDUCED_TYPENAME range_difference< Range >::type  advance_end  )

inline

References boost::iterator_range_detail::make_range_impl().

template<class Range >

iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<const Range>::type > boost::make_iterator_range ( const Range &  r, BOOST_DEDUCED_TYPENAME range_difference< Range >::type  advance_begin, BOOST_DEDUCED_TYPENAME range_difference< Range >::type  advance_end  )

inline

References boost::iterator_range_detail::make_range_impl().

template<typename IteratorT , typename IntegerT >

iterator_range<IteratorT> boost::make_iterator_range_n ( IteratorT  first, IntegerT  n  )

inline

References boost::xpressive::first, and next().

template<class PropertyGraph , class RandomAccessIterator >

iterator_property_map< RandomAccessIterator, typename property_map<PropertyGraph, vertex_index_t>::type, typename std::iterator_traits<RandomAccessIterator>::value_type, typename std::iterator_traits<RandomAccessIterator>::reference > boost::make_iterator_vertex_map ( RandomAccessIterator  iter, const PropertyGraph &  g  )

inline

References make_iterator_property_map(), and vertex_index.

Referenced by make_container_vertex_map().

template<class RandomAccessIterator >

iterator_property_map< RandomAccessIterator, identity_property_map, typename std::iterator_traits<RandomAccessIterator>::value_type, typename std::iterator_traits<RandomAccessIterator>::reference > boost::make_iterator_vertex_map ( RandomAccessIterator  iter )

inline

References make_iterator_property_map().

template<class Name >

label_writer<Name> boost::make_label_writer ( Name  n )

inline

References n.

template<class E >

leda_edge_property_map<E, E&, leda::edge_array<E>*> boost::make_leda_edge_property_map

(

leda::edge_array< E > &

a

)

template<class E >

leda_edge_property_map<E, const E&, const leda::edge_map<E>*> boost::make_leda_edge_property_map

(

const leda::edge_map< E > &

a

)

template<class E >

leda_edge_property_map<E, E&, leda::edge_map<E>*> boost::make_leda_edge_property_map

(

leda::edge_map< E > &

a

)

template<class E >

leda_node_property_map<E, const E&, const leda::node_array<E>*> boost::make_leda_node_property_map

(

const leda::node_array< E > &

a

)

template<class E >

leda_node_property_map<E, E&, leda::node_array<E>*> boost::make_leda_node_property_map

(

leda::node_array< E > &

a

)

template<class E >

leda_node_property_map<E, const E&, const leda::node_map<E>*> boost::make_leda_node_property_map

(

const leda::node_map< E > &

a

)

template<class E >

leda_node_property_map<E, E&, leda::node_map<E>*> boost::make_leda_node_property_map

(

leda::node_map< E > &

a

)

template<class E >

leda_edge_property_map<E, const E&, const leda::edge_array<E>*> boost::make_leda_node_property_map

(

const leda::node_array< E > &

a

)

template<class T1 , class T2 >

std::pair<T1,T2> boost::make_list	(	const T1 &	t1,
		const T2 &	t2
	)

References boost::xpressive::make_pair.

template<class T1 , class T2 , class T3 >

std::pair<T1,std::pair<T2,T3> > boost::make_list	(	const T1 &	t1,
		const T2 &	t2,
		const T3 &	t3
	)

References boost::xpressive::make_pair.

template<class T1 , class T2 , class T3 , class T4 >

std::pair<T1,std::pair<T2,std::pair<T3,T4> > > boost::make_list	(	const T1 &	t1,
		const T2 &	t2,
		const T3 &	t3,
		const T4 &	t4
	)

References boost::xpressive::make_pair.

template<class T1 , class T2 , class T3 , class T4 , class T5 >

std::pair<T1,std::pair<T2,std::pair<T3,std::pair<T4,T5> > > > boost::make_list	(	const T1 &	t1,
		const T2 &	t2,
		const T3 &	t3,
		const T4 &	t4,
		const T5 &	t5
	)

References boost::xpressive::make_pair.

template<typename DistributedGraph >

local_subgraph<DistributedGraph> boost::make_local_subgraph ( DistributedGraph &  g )

inline

template<typename Lockable >

lock_guard<Lockable> boost::make_lock_guard

(

Lockable &

mtx

)

template<typename Lockable >

lock_guard<Lockable> boost::make_lock_guard	(	Lockable &	mtx,
		adopt_lock_t
	)

template<class Visitors >

mas_visitor<Visitors> boost::make_mas_visitor

(

Visitors

vis

)

Referenced by boost::graph::detail::mas_dispatch< WeightMap >::apply(), and boost::graph::detail::mas_dispatch< boost::param_not_found >::apply().

template<typename Graph , typename PlanarEmbedding , typename VertexIndexMap , typename EdgeIndexMap , typename AddEdgeVisitor >

void boost::make_maximal_planar	(	Graph &	g,
		PlanarEmbedding	embedding,
		VertexIndexMap	vm,
		EdgeIndexMap	em,
		AddEdgeVisitor &	vis
	)

References planar_face_traversal(), and visitor().

Referenced by make_maximal_planar().

template<typename Graph , typename PlanarEmbedding , typename VertexIndexMap , typename EdgeIndexMap >

void boost::make_maximal_planar	(	Graph &	g,
		PlanarEmbedding	embedding,
		VertexIndexMap	vm,
		EdgeIndexMap	em
	)

References make_maximal_planar().

template<typename Graph , typename PlanarEmbedding , typename VertexIndexMap >

void boost::make_maximal_planar	(	Graph &	g,
		PlanarEmbedding	embedding,
		VertexIndexMap	vm
	)

References edge_index, and make_maximal_planar().

template<typename Graph , typename PlanarEmbedding >

void boost::make_maximal_planar	(	Graph &	g,
		PlanarEmbedding	embedding
	)

References make_maximal_planar(), and vertex_index.

template<typename Graph , typename MembershipMap >

membership_filtered_graph_traits<Graph, MembershipMap>::graph_type boost::make_membership_filtered_graph	(	const Graph &	graph,
		MembershipMap &	membership_map
	)

template<class It >

move_iterator<It> boost::make_move_iterator ( const It &  it )

inline

Returns: move_iterator<It>(i).

References it.

Referenced by boost::container::list< T, Allocator >::operator=(), boost::container::slist< T, Allocator >::operator=(), boost::container::deque< T, Allocator >::operator=(), and boost::container::stable_vector< T, Allocator >::operator=().

template<class Visitors >

neighbor_bfs_visitor<Visitors> boost::make_neighbor_bfs_visitor

(

Visitors

vis

)

Referenced by boost::detail::neighbor_bfs_dispatch< ColorMap >::apply(), boost::detail::neighbor_bfs_dispatch< param_not_found >::apply(), and neighbor_breadth_first_visit().

template<typename Lock >

nested_strict_lock<Lock> boost::make_nested_strict_lock

(

Lock &

lk

)

template<typename Key , typename Value >

null_property_map<Key, Value> boost::make_null_property ( )

inline

template<typename IndexMap >

one_bit_color_map<IndexMap> boost::make_one_bit_color_map ( std::size_t  n, const IndexMap &  index_map  )

inline

References n.

template<class T >

optional<T> boost::make_optional ( T const &  v )

inline

template<class T >

optional<T> boost::make_optional ( bool  cond, T const &  v  )

inline

template<typename PropertyMapFirst , typename PropertyMapSecond >

property_map_equivalent<PropertyMapFirst, PropertyMapSecond> boost::make_property_map_equivalent	(	const PropertyMapFirst	property_map1,
		const PropertyMapSecond	property_map2
	)

template<typename PropMap >

property_map_function<PropMap> boost::make_property_map_function

(

const PropMap &

pm

)

References boost::locale::period::pm().

template<class PropertyMap , class Iterator >

property_map_iterator_generator<PropertyMap, Iterator>::type boost::make_property_map_iterator	(	PropertyMap	pmap,
		Iterator	iter
	)

Referenced by boost::graph::distributed::detail::initialize_min_in_weights(), and boost::graph::distributed::detail::initialize_min_out_weights().

template<typename T >

unique_future<typename decay<T>::type> boost::make_ready_future

(

BOOST_THREAD_FWD_REF(T)

value

)

References boost::multiprecision::backends::p.

template<typename T >

unique_future<T> boost::make_ready_future

(

exception_ptr

ex

)

References boost::multiprecision::backends::p.

template<typename T , typename T1 >

unique_future<T> boost::make_ready_no_decay_future

(

T1

value

)

References boost::multiprecision::backends::p.

template<class B , bool b>

basic_regex<B> boost::make_regex ( const ATL::CSimpleStringT< B, b > &  s, ::boost::regex_constants::syntax_option_type  f = boost::regex_constants::normal  )

inline

template<class B , bool b>

regex_iterator<B const*> boost::make_regex_iterator ( const ATL::CSimpleStringT< B, b > &  s, const basic_regex< B > &  e, ::boost::regex_constants::match_flag_type  f = boost::regex_constants::match_default  )

inline

template<class charT , class traits >

regex_iterator<const charT*, charT, traits> boost::make_regex_iterator ( const charT *  p, const basic_regex< charT, traits > &  e, regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

References boost::multiprecision::backends::p.

template<class charT , class traits , class ST , class SA >

regex_iterator<typename std::basic_string<charT, ST, SA>::const_iterator, charT, traits> boost::make_regex_iterator ( const std::basic_string< charT, ST, SA > &  p, const basic_regex< charT, traits > &  e, regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

template<class B , bool b>

regex_token_iterator<B const*> boost::make_regex_token_iterator ( const ATL::CSimpleStringT< B, b > &  s, const basic_regex< B > &  e, int  sub = 0, ::boost::regex_constants::match_flag_type  f = boost::regex_constants::match_default  )

inline

References boost::numeric::interval_lib::sub().

template<class B , bool b>

regex_token_iterator<B const*> boost::make_regex_token_iterator ( const ATL::CSimpleStringT< B, b > &  s, const basic_regex< B > &  e, const std::vector< int > &  subs, ::boost::regex_constants::match_flag_type  f = boost::regex_constants::match_default  )

inline

template<class B , bool b, std::size_t N>

regex_token_iterator<B const*> boost::make_regex_token_iterator ( const ATL::CSimpleStringT< B, b > &  s, const basic_regex< B > &  e, const int(&)  subs[N], ::boost::regex_constants::match_flag_type  f = boost::regex_constants::match_default  )

inline

template<class charT , class traits >

regex_token_iterator<const charT*, charT, traits> boost::make_regex_token_iterator ( const charT *  p, const basic_regex< charT, traits > &  e, int  submatch = 0, regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

References boost::multiprecision::backends::p.

template<class charT , class traits , class ST , class SA >

regex_token_iterator<typename std::basic_string<charT, ST, SA>::const_iterator, charT, traits> boost::make_regex_token_iterator ( const std::basic_string< charT, ST, SA > &  p, const basic_regex< charT, traits > &  e, int  submatch = 0, regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

template<class charT , class traits , std::size_t N>

regex_token_iterator<const charT*, charT, traits> boost::make_regex_token_iterator ( const charT *  p, const basic_regex< charT, traits > &  e, const int(&)  submatch[N], regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

References boost::multiprecision::backends::p.

template<class charT , class traits , class ST , class SA , std::size_t N>

regex_token_iterator<typename std::basic_string<charT, ST, SA>::const_iterator, charT, traits> boost::make_regex_token_iterator ( const std::basic_string< charT, ST, SA > &  p, const basic_regex< charT, traits > &  e, const int(&)  submatch[N], regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

template<class charT , class traits >

regex_token_iterator<const charT*, charT, traits> boost::make_regex_token_iterator ( const charT *  p, const basic_regex< charT, traits > &  e, const std::vector< int > &  submatch, regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

References boost::multiprecision::backends::p.

template<class charT , class traits , class ST , class SA >

regex_token_iterator<typename std::basic_string<charT, ST, SA>::const_iterator, charT, traits> boost::make_regex_token_iterator ( const std::basic_string< charT, ST, SA > &  p, const basic_regex< charT, traits > &  e, const std::vector< int > &  submatch, regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

template<class BidirectionalGraph >

reverse_graph<BidirectionalGraph> boost::make_reverse_graph ( const BidirectionalGraph &  g )

inline

template<class BidirectionalGraph >

reverse_graph<BidirectionalGraph, BidirectionalGraph&> boost::make_reverse_graph ( BidirectionalGraph &  g )

inline

template<class RAIter , class ID >

safe_iterator_property_map< RAIter, ID, typename boost::detail::iterator_traits<RAIter>::value_type, typename boost::detail::iterator_traits<RAIter>::reference> boost::make_safe_iterator_property_map ( RAIter  iter, std::size_t  n, ID  id  )

inline

Referenced by boost::detail::isomorphism_algo< Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2 >::isomorphism_algo(), and boost::detail::isomorphism_algo< Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2 >::test_isomorphism().

template<class RAIter , class Value , class ID >

safe_iterator_property_map<RAIter, ID, Value, Value&> boost::make_safe_iterator_property_map ( RAIter  iter, std::size_t  n, ID  id, Value    )

inline

template<class T >

boost::detail::sp_if_array<T>::type boost::make_shared ( std::size_t  size )

inline

References boost::shared_ptr< T >::_internal_get_untyped_deleter(), A1, boost::xpressive::a1, boost::xpressive::a2, boost::xpressive::s1, boost::fusion::size(), and boost::detail::type.

Referenced by boost::dynamic_properties::property(), and boost::dynamic_type_dispatcher::register_type().

template<class T >

boost::detail::sp_if_size_array<T>::type boost::make_shared ( )

inline

References boost::shared_ptr< T >::_internal_get_untyped_deleter(), A1, boost::xpressive::a1, boost::xpressive::a2, N, boost::xpressive::s1, boost::fusion::size(), and boost::detail::type.

template<class T >

boost::detail::sp_if_array<T>::type boost::make_shared ( std::size_t  size, const typename boost::detail::array_inner< T >::type &  value  )

inline

References boost::shared_ptr< T >::_internal_get_untyped_deleter(), A1, boost::xpressive::a1, boost::xpressive::a2, boost::xpressive::s1, size(), boost::fusion::size(), boost::detail::type, and boost::program_options::value().

template<class T >

boost::detail::sp_if_size_array<T>::type boost::make_shared ( const typename boost::detail::array_inner< T >::type &  value )

inline

References boost::shared_ptr< T >::_internal_get_untyped_deleter(), A1, boost::xpressive::a1, boost::xpressive::a2, N, boost::xpressive::s1, boost::fusion::size(), boost::detail::type, and boost::program_options::value().

template<class T , class... Args>

boost::detail::sp_if_not_array< T >::type boost::make_shared

(

Args &&...

args

)

References boost::shared_ptr< T >::_internal_get_untyped_deleter(), boost::detail::sp_ms_deleter< T >::address(), boost::python::args(), BOOST_SP_MSD, boost::detail::sp_ms_deleter< T >::set_initialized(), boost::detail::sp_enable_shared_from_this(), and T.

template<class T , class IndexMap >

shared_array_property_map<T, IndexMap> boost::make_shared_array_property_map	(	size_t	n,
		const T &	,
		const IndexMap &	index
	)

References n.

Referenced by boost::detail::map_maker_helper< false, Graph, ArgPack, Value, PM >::make_map(), boost::detail::make_degree_invariant< G, Index >::operator()(), boost::graph::detail::isomorphism_impl< Graph1, Graph2 >::operator()(), and smallest_last_vertex_ordering().

template<typename T >

shared_future<typename decay<T>::type> boost::make_shared_future

(

BOOST_THREAD_FWD_REF(T)

value

)

References boost::multiprecision::backends::p.

shared_future<void> boost::make_shared_future ( )

inline

References boost::promise< void >::get_future(), and boost::multiprecision::backends::p.

template<class T >

boost::detail::sp_if_array<T>::type boost::make_shared_noinit ( std::size_t  size )

inline

References boost::shared_ptr< T >::_internal_get_untyped_deleter(), A1, boost::xpressive::a1, boost::xpressive::a2, boost::xpressive::s1, boost::fusion::size(), and boost::detail::type.

template<class T >

boost::detail::sp_if_size_array<T>::type boost::make_shared_noinit ( )

inline

References boost::shared_ptr< T >::_internal_get_untyped_deleter(), A1, boost::xpressive::a1, boost::xpressive::a2, N, boost::xpressive::s1, boost::fusion::size(), and boost::detail::type.

template<class T >

boost::detail::sp_if_not_array< T >::type boost::make_shared_noinit

(

)

References boost::shared_ptr< T >::_internal_get_untyped_deleter(), boost::detail::sp_ms_deleter< T >::address(), BOOST_SP_MSD, boost::detail::sp_ms_deleter< T >::set_initialized(), boost::detail::sp_enable_shared_from_this(), and T.

template<typename KeyType , typename ValueType >

static_property_map<ValueType, KeyType> boost::make_static_property_map

(

const ValueType &

v

)

template<typename Lockable >

strict_lock<Lockable> boost::make_strict_lock

(

Lockable &

mtx

)

template<class Type , class Iterator , class TokenizerFunc >

token_iterator_generator<TokenizerFunc,Iterator,Type>::type boost::make_token_iterator	(	Iterator	begin,
		Iterator	end,
		const TokenizerFunc &	fun
	)

template<typename PM , typename Func >

transform_value_property_map<Func, PM> boost::make_transform_value_property_map	(	const Func &	f,
		const PM &	pm
	)

References boost::locale::period::pm().

template<typename Ret , typename PM , typename Func >

transform_value_property_map<Func, PM, Ret> boost::make_transform_value_property_map	(	const Func &	f,
		const PM &	pm
	)

References boost::locale::period::pm().

template<typename Graph , typename WeightMap , typename OutIter , typename Length >

tsp_tour_len_visitor<Graph, WeightMap, OutIter, Length> boost::make_tsp_tour_len_visitor ( Graph const &  g, OutIter  iter, Length &  l, WeightMap  map  )

inline

template<typename OutIter >

tsp_tour_visitor<OutIter> boost::make_tsp_tour_visitor ( OutIter  iter )

inline

template<typename IndexMap >

two_bit_color_map<IndexMap> boost::make_two_bit_color_map ( std::size_t  n, const IndexMap &  index_map  )

inline

References n.

Referenced by boost::detail::bfs_dispatch< param_not_found >::apply(), boost::graph::st_connected(), and boost::graph::distributed::st_connected().

template<class InputIterator >

u32regex boost::make_u32regex ( InputIterator  i, InputIterator  j, boost::regex_constants::syntax_option_type  opt  )

inline

References boost::detail::const, and boost::re_detail::do_make_u32regex().

u32regex boost::make_u32regex ( const char *  p, boost::regex_constants::syntax_option_type  opt = boost::regex_constants::perl  )

inline

References boost::detail::const, and boost::re_detail::do_make_u32regex().

u32regex boost::make_u32regex ( const unsigned char *  p, boost::regex_constants::syntax_option_type  opt = boost::regex_constants::perl  )

inline

References boost::detail::const, and boost::re_detail::do_make_u32regex().

u32regex boost::make_u32regex ( const wchar_t *  p, boost::regex_constants::syntax_option_type  opt = boost::regex_constants::perl  )

inline

References boost::detail::const, and boost::re_detail::do_make_u32regex().

u32regex boost::make_u32regex ( const UChar *  p, boost::regex_constants::syntax_option_type  opt = boost::regex_constants::perl  )

inline

References boost::detail::const, and boost::re_detail::do_make_u32regex().

template<class C , class T , class A >

u32regex boost::make_u32regex ( const std::basic_string< C, T, A > &  s, boost::regex_constants::syntax_option_type  opt = boost::regex_constants::perl  )

inline

References boost::detail::const, and boost::re_detail::do_make_u32regex().

u32regex boost::make_u32regex ( const U_NAMESPACE_QUALIFIER UnicodeString &  s, boost::regex_constants::syntax_option_type  opt = boost::regex_constants::perl  )

inline

References boost::detail::const, and boost::re_detail::do_make_u32regex().

u32regex_iterator<const char*> boost::make_u32regex_iterator ( const char *  p, const u32regex &  e, regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

References boost::multiprecision::backends::p.

u32regex_iterator<const wchar_t*> boost::make_u32regex_iterator ( const wchar_t *  p, const u32regex &  e, regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

References boost::multiprecision::backends::p.

u32regex_iterator<const UChar*> boost::make_u32regex_iterator ( const UChar *  p, const u32regex &  e, regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

References boost::multiprecision::backends::p.

template<class charT , class Traits , class Alloc >

u32regex_iterator<typename std::basic_string<charT, Traits, Alloc>::const_iterator> boost::make_u32regex_iterator ( const std::basic_string< charT, Traits, Alloc > &  p, const u32regex &  e, regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

u32regex_iterator<const UChar*> boost::make_u32regex_iterator ( const U_NAMESPACE_QUALIFIER UnicodeString &  s, const u32regex &  e, regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

u32regex_token_iterator<const char*> boost::make_u32regex_token_iterator ( const char *  p, const u32regex &  e, int  submatch = 0, regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

References boost::multiprecision::backends::p.

u32regex_token_iterator<const wchar_t*> boost::make_u32regex_token_iterator ( const wchar_t *  p, const u32regex &  e, int  submatch = 0, regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

References boost::multiprecision::backends::p.

u32regex_token_iterator<const UChar*> boost::make_u32regex_token_iterator ( const UChar *  p, const u32regex &  e, int  submatch = 0, regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

References boost::multiprecision::backends::p.

template<class charT , class Traits , class Alloc >

u32regex_token_iterator<typename std::basic_string<charT, Traits, Alloc>::const_iterator> boost::make_u32regex_token_iterator ( const std::basic_string< charT, Traits, Alloc > &  p, const u32regex &  e, int  submatch = 0, regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

u32regex_token_iterator<const UChar*> boost::make_u32regex_token_iterator ( const U_NAMESPACE_QUALIFIER UnicodeString &  s, const u32regex &  e, int  submatch = 0, regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

template<std::size_t N>

u32regex_token_iterator<const char*> boost::make_u32regex_token_iterator ( const char *  p, const u32regex &  e, const int(&)  submatch[N], regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

References boost::multiprecision::backends::p.

template<std::size_t N>

u32regex_token_iterator<const wchar_t*> boost::make_u32regex_token_iterator ( const wchar_t *  p, const u32regex &  e, const int(&)  submatch[N], regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

References boost::multiprecision::backends::p.

template<std::size_t N>

u32regex_token_iterator<const UChar*> boost::make_u32regex_token_iterator ( const UChar *  p, const u32regex &  e, const int(&)  submatch[N], regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

References boost::multiprecision::backends::p.

template<class charT , class Traits , class Alloc , std::size_t N>

u32regex_token_iterator<typename std::basic_string<charT, Traits, Alloc>::const_iterator> boost::make_u32regex_token_iterator ( const std::basic_string< charT, Traits, Alloc > &  p, const u32regex &  e, const int(&)  submatch[N], regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

template<std::size_t N>

u32regex_token_iterator<const UChar*> boost::make_u32regex_token_iterator ( const U_NAMESPACE_QUALIFIER UnicodeString &  s, const u32regex &  e, const int(&)  submatch[N], regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

u32regex_token_iterator<const char*> boost::make_u32regex_token_iterator ( const char *  p, const u32regex &  e, const std::vector< int > &  submatch, regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

References boost::multiprecision::backends::p.

u32regex_token_iterator<const wchar_t*> boost::make_u32regex_token_iterator ( const wchar_t *  p, const u32regex &  e, const std::vector< int > &  submatch, regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

References boost::multiprecision::backends::p.

u32regex_token_iterator<const UChar*> boost::make_u32regex_token_iterator ( const UChar *  p, const u32regex &  e, const std::vector< int > &  submatch, regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

References boost::multiprecision::backends::p.

template<class charT , class Traits , class Alloc >

u32regex_token_iterator<typename std::basic_string<charT, Traits, Alloc>::const_iterator> boost::make_u32regex_token_iterator ( const std::basic_string< charT, Traits, Alloc > &  p, const u32regex &  e, const std::vector< int > &  submatch, regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

u32regex_token_iterator<const UChar*> boost::make_u32regex_token_iterator ( const U_NAMESPACE_QUALIFIER UnicodeString &  s, const u32regex &  e, const std::vector< int > &  submatch, regex_constants::match_flag_type  m = regex_constants::match_default  )

inline

template<class T >

boost::detail::up_if_array<T>::type boost::make_unique ( std::size_t  size )

inline

References size(), and boost::detail::type.

Referenced by boost::wave::cpplexer::lex_token< PositionT >::set_position(), boost::wave::cpplexer::lex_token< PositionT >::set_token_id(), and boost::wave::cpplexer::lex_token< PositionT >::set_value().

template<class T >

boost::detail::up_if_not_array<T>::type boost::make_unique ( )

inline

References T.

template<class T , class... Args>

boost::detail::up_if_not_array<T>::type boost::make_unique ( Args &&...  args )

inline

References boost::python::args(), and T.

template<class T >

boost::detail::up_if_not_array<T>::type boost::make_unique ( typename add_rvalue_reference< T >::type  value )

inline

References boost::fusion::move(), and T.

template<typename Lockable >

unique_lock<Lockable> boost::make_unique_lock

(

Lockable &

mtx

)

template<typename Lockable >

unique_lock<Lockable> boost::make_unique_lock	(	Lockable &	mtx,
		adopt_lock_t
	)

References adopt_lock.

template<typename Lockable >

unique_lock<Lockable> boost::make_unique_lock	(	Lockable &	mtx,
		defer_lock_t
	)

References defer_lock.

template<typename Lockable >

unique_lock<Lockable> boost::make_unique_lock	(	Lockable &	mtx,
		try_to_lock_t
	)

References try_to_lock.

template<typename... Lockable>

std::tuple<unique_lock<Lockable> ...> boost::make_unique_locks

(

Lockable &...

mtx

)

References adopt_lock, and lock().

template<class T >

boost::detail::up_if_array<T>::type boost::make_unique_noinit ( std::size_t  size )

inline

References size(), and boost::detail::type.

template<class T >

boost::detail::up_if_not_array<T>::type boost::make_unique_noinit ( )

inline

References T.

template<typename T , typename IndexMap >

vector_property_map<T, IndexMap> boost::make_vector_property_map

(

IndexMap

index

)

template<typename Graph >

attributes_writer<typename property_map<Graph, vertex_attribute_t>::const_type> boost::make_vertex_attributes_writer

(

const Graph &

g

)

References vertex_attribute.

Referenced by boost::detail::write_graphviz_subgraph().

template<typename Graph , typename Set >

vertex_subset_complement_filter<Graph, Set>::type boost::make_vertex_subset_complement_filter ( Graph &  g, const Set &  s  )

inline

References boost::multiprecision::backends::p.

template<typename Graph , typename Set >

vertex_subset_compliment_filter<Graph, Set>::type boost::make_vertex_subset_compliment_filter ( Graph &  g, const Set &  s  )

inline

References boost::multiprecision::backends::p.

template<typename Graph , typename Set >

vertex_subset_filter<Graph, Set>::type boost::make_vertex_subset_filter ( Graph &  g, const Set &  s  )

inline

References boost::multiprecision::backends::p.

template<class Arg , class Fun >

void_ptr_indirect_fun<Fun,Arg> boost::make_void_ptr_indirect_fun ( Fun  f )

inline

template<typename Graph , typename MateMap , typename VertexIndexMap , template< typename, typename, typename > class AugmentingPathFinder, template< typename, typename > class InitialMatchingFinder, template< typename, typename, typename > class MatchingVerifier>

bool boost::matching	(	const Graph &	g,
		MateMap	mate,
		VertexIndexMap	vm
	)

Referenced by checked_edmonds_maximum_cardinality_matching(), and edmonds_maximum_cardinality_matching().

template<typename Graph , typename MateMap , typename VertexIndexMap >

graph_traits<Graph>::vertices_size_type boost::matching_size	(	const Graph &	g,
		MateMap	mate,
		VertexIndexMap	vm
	)

References vertices().

Referenced by matching_size(), and boost::maximum_cardinality_matching_verifier< Graph, MateMap, VertexIndexMap >::verify_matching().

template<typename Graph , typename MateMap >

graph_traits<Graph>::vertices_size_type boost::matching_size ( const Graph &  g, MateMap  mate  )

inline

References matching_size(), and vertex_index.

template<typename VP , typename EP , typename GP >

directed_graph<VP,EP,GP>::edge_index_type boost::max_edge_index

(

directed_graph< VP, EP, GP > const &

g

)

template<typename VP , typename EP , typename GP >

undirected_graph<VP,EP,GP>::edge_index_type boost::max_edge_index

(

undirected_graph< VP, EP, GP > const &

g

)

template<typename PType >

bgl_named_params<boost::reference_wrapper<PType>, BOOST_PP_CAT( max_priority_queue , _t)> boost::max_priority_queue

(

PType &

p

)

Referenced by boost::detail::stoer_wagner_min_cut().

template<typename VP , typename EP , typename GP >

directed_graph<VP,EP,GP>::vertex_index_type boost::max_vertex_index

(

directed_graph< VP, EP, GP > const &

g

)

template<typename VP , typename EP , typename GP >

undirected_graph<VP,EP,GP>::vertex_index_type boost::max_vertex_index

(

undirected_graph< VP, EP, GP > const &

g

)

template<typename Graph , typename VertexIndexMap >

graph_traits<Graph>::vertices_size_type boost::max_wavefront	(	const Graph &	g,
		VertexIndexMap	index
	)

References boost::asio::b, BOOST_PREVENT_MACRO_SUBSTITUTION, BOOST_USING_STD_MAX, end, boost::multiprecision::backends::i, ith_wavefront(), boost::accumulators::extract::max, and vertices().

Referenced by max_wavefront().

template<typename Graph >

graph_traits<Graph>::vertices_size_type boost::max_wavefront

(

const Graph &

g

)

References max_wavefront(), and vertex_index.

template<class Graph , class WeightMap , class MASVisitor , class VertexAssignmentMap , class KeyedUpdatablePriorityQueue >

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

References BOOST_CONCEPT_ASSERT(), boost::asio::error::invalid_argument, boost::detail::maximum_adjacency_search(), n, num_vertices(), and boost::detail::vertices_size_type.

Referenced by boost::graph::detail::mas_dispatch< WeightMap >::apply(), boost::graph::detail::mas_dispatch< boost::param_not_found >::apply(), and boost::detail::stoer_wagner_min_cut().

template<typename Graph , typename P , typename T , typename R >

void boost::maximum_adjacency_search	(	const Graph &	g,
		const bgl_named_params< P, T, R > &	params
	)

References boost::graph::detail::mas_dispatch< WeightMap >::apply(), BOOST_GRAPH_DECLARE_CONVERTED_PARAMETERS, edge_weight, and get_param().

template<typename FloatTraits , typename Graph , typename VertexIndexMap , typename EdgeWeightMap , typename EdgeIndexMap >

FloatTraits::value_type boost::maximum_cycle_mean ( const Graph &  g, VertexIndexMap  vim, EdgeWeightMap  ewm, EdgeIndexMap  eim, std::vector< typename graph_traits< Graph >::edge_descriptor > *  pcc = 0, FloatTraits  ft = FloatTraits()  )

inline

References make_iterator_property_map(), maximum_cycle_ratio(), and num_edges().

Referenced by maximum_cycle_mean().

template<typename Graph , typename VertexIndexMap , typename EdgeWeightMap , typename EdgeIndexMap >

double boost::maximum_cycle_mean ( const Graph &  g, VertexIndexMap  vim, EdgeWeightMap  ewm, EdgeIndexMap  eim, std::vector< typename graph_traits< Graph >::edge_descriptor > *  pcc = 0  )

inline

References maximum_cycle_mean().

template<typename FloatTraits , typename Graph , typename VertexIndexMap , typename EdgeWeight1Map , typename EdgeWeight2Map >

FloatTraits::value_type boost::maximum_cycle_ratio ( const Graph &  g, VertexIndexMap  vim, EdgeWeight1Map  ew1m, EdgeWeight2Map  ew2m, std::vector< typename graph_traits< Graph >::edge_descriptor > *  pcc = 0, FloatTraits  = FloatTraits()  )

inline

Referenced by maximum_cycle_mean(), and maximum_cycle_ratio().

template<typename Graph , typename VertexIndexMap , typename EdgeWeight1Map , typename EdgeWeight2Map >

double boost::maximum_cycle_ratio ( const Graph &  g, VertexIndexMap  vim, EdgeWeight1Map  ew1m, EdgeWeight2Map  ew2m, std::vector< typename graph_traits< Graph >::edge_descriptor > *  pcc = 0  )

inline

References maximum_cycle_ratio().

template<typename GraphFirst , typename GraphSecond , typename VertexIndexMapFirst , typename VertexIndexMapSecond , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename SubGraphCallback >

void boost::mcgregor_common_subgraphs	(	const GraphFirst &	graph1,
		const GraphSecond &	graph2,
		const VertexIndexMapFirst	vindex_map1,
		const VertexIndexMapSecond	vindex_map2,
		EdgeEquivalencePredicate	edges_equivalent,
		VertexEquivalencePredicate	vertices_equivalent,
		bool	only_connected_subgraphs,
		SubGraphCallback	user_callback
	)

References boost::detail::mcgregor_common_subgraphs_internal_init().

template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback >

void boost::mcgregor_common_subgraphs	(	const GraphFirst &	graph1,
		const GraphSecond &	graph2,
		bool	only_connected_subgraphs,
		SubGraphCallback	user_callback
	)

References boost::detail::mcgregor_common_subgraphs_internal_init(), and vertex_index.

template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback , typename Param , typename Tag , typename Rest >

void boost::mcgregor_common_subgraphs	(	const GraphFirst &	graph1,
		const GraphSecond &	graph2,
		bool	only_connected_subgraphs,
		SubGraphCallback	user_callback,
		const bgl_named_params< Param, Tag, Rest > &	params
	)

References choose_const_pmap(), choose_param(), get_param(), boost::detail::mcgregor_common_subgraphs_internal_init(), vertex_index, vertex_index1, and vertex_index2.

template<typename GraphFirst , typename GraphSecond , typename VertexIndexMapFirst , typename VertexIndexMapSecond , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename SubGraphCallback >

void boost::mcgregor_common_subgraphs_maximum	(	const GraphFirst &	graph1,
		const GraphSecond &	graph2,
		const VertexIndexMapFirst	vindex_map1,
		const VertexIndexMapSecond	vindex_map2,
		EdgeEquivalencePredicate	edges_equivalent,
		VertexEquivalencePredicate	vertices_equivalent,
		bool	only_connected_subgraphs,
		SubGraphCallback	user_callback
	)

References boost::detail::mcgregor_common_subgraphs_internal_init().

Referenced by mcgregor_common_subgraphs_maximum().

template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback >

void boost::mcgregor_common_subgraphs_maximum	(	const GraphFirst &	graph1,
		const GraphSecond &	graph2,
		bool	only_connected_subgraphs,
		SubGraphCallback	user_callback
	)

References mcgregor_common_subgraphs_maximum(), and vertex_index.

template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback , typename Param , typename Tag , typename Rest >

void boost::mcgregor_common_subgraphs_maximum	(	const GraphFirst &	graph1,
		const GraphSecond &	graph2,
		bool	only_connected_subgraphs,
		SubGraphCallback	user_callback,
		const bgl_named_params< Param, Tag, Rest > &	params
	)

References choose_const_pmap(), choose_param(), get_param(), mcgregor_common_subgraphs_maximum(), vertex_index, vertex_index1, and vertex_index2.

template<typename GraphFirst , typename GraphSecond , typename VertexIndexMapFirst , typename VertexIndexMapSecond , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename SubGraphCallback >

void boost::mcgregor_common_subgraphs_maximum_unique	(	const GraphFirst &	graph1,
		const GraphSecond &	graph2,
		const VertexIndexMapFirst	vindex_map1,
		const VertexIndexMapSecond	vindex_map2,
		EdgeEquivalencePredicate	edges_equivalent,
		VertexEquivalencePredicate	vertices_equivalent,
		bool	only_connected_subgraphs,
		SubGraphCallback	user_callback
	)

References boost::detail::mcgregor_common_subgraphs_internal_init().

Referenced by mcgregor_common_subgraphs_maximum_unique().

template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback >

void boost::mcgregor_common_subgraphs_maximum_unique	(	const GraphFirst &	graph1,
		const GraphSecond &	graph2,
		bool	only_connected_subgraphs,
		SubGraphCallback	user_callback
	)

References mcgregor_common_subgraphs_maximum_unique(), and vertex_index.

template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback , typename Param , typename Tag , typename Rest >

void boost::mcgregor_common_subgraphs_maximum_unique	(	const GraphFirst &	graph1,
		const GraphSecond &	graph2,
		bool	only_connected_subgraphs,
		SubGraphCallback	user_callback,
		const bgl_named_params< Param, Tag, Rest > &	params
	)

References choose_const_pmap(), choose_param(), get_param(), mcgregor_common_subgraphs_maximum_unique(), vertex_index, vertex_index1, and vertex_index2.

template<typename GraphFirst , typename GraphSecond , typename VertexIndexMapFirst , typename VertexIndexMapSecond , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename SubGraphCallback >

void boost::mcgregor_common_subgraphs_unique	(	const GraphFirst &	graph1,
		const GraphSecond &	graph2,
		const VertexIndexMapFirst	vindex_map1,
		const VertexIndexMapSecond	vindex_map2,
		EdgeEquivalencePredicate	edges_equivalent,
		VertexEquivalencePredicate	vertices_equivalent,
		bool	only_connected_subgraphs,
		SubGraphCallback	user_callback
	)

References boost::detail::mcgregor_common_subgraphs_internal_init().

Referenced by mcgregor_common_subgraphs_unique().

template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback >

void boost::mcgregor_common_subgraphs_unique	(	const GraphFirst &	graph1,
		const GraphSecond &	graph2,
		bool	only_connected_subgraphs,
		SubGraphCallback	user_callback
	)

References mcgregor_common_subgraphs_unique(), and vertex_index.

template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback , typename Param , typename Tag , typename Rest >

void boost::mcgregor_common_subgraphs_unique	(	const GraphFirst &	graph1,
		const GraphSecond &	graph2,
		bool	only_connected_subgraphs,
		SubGraphCallback	user_callback,
		const bgl_named_params< Param, Tag, Rest > &	params
	)

References choose_const_pmap(), choose_param(), get_param(), mcgregor_common_subgraphs_unique(), vertex_index, vertex_index1, and vertex_index2.

template<typename Graph , typename ClusteringMap >

property_traits<ClusteringMap>::value_type boost::mean_clustering_coefficient ( const Graph &  g, ClusteringMap  cm  )

inline

References BOOST_CONCEPT_ASSERT(), end, boost::multiprecision::backends::i, num_vertices(), Vertex, and vertices().

template<typename Graph , typename DistanceMap , typename Measure , typename Combinator >

Measure::result_type boost::mean_geodesic ( const Graph &  g, DistanceMap  dist, Measure  measure, Combinator  combine  )

inline

References BOOST_CONCEPT_ASSERT(), and n.

Referenced by all_mean_geodesics(), and mean_geodesic().

template<typename Graph , typename DistanceMap , typename Measure >

Measure::result_type boost::mean_geodesic ( const Graph &  g, DistanceMap  dist, Measure  measure  )

inline

References BOOST_CONCEPT_ASSERT(), and mean_geodesic().

template<typename Graph , typename DistanceMap >

double boost::mean_geodesic ( const Graph &  g, DistanceMap  dist  )

inline

References mean_geodesic(), and measure_mean_geodesic().

template<typename T , typename Graph , typename DistanceMap >

T boost::mean_geodesic ( const Graph &  g, DistanceMap  dist  )

inline

References mean_geodesic().

template<typename Graph , typename DistanceMap >

closeness_measure< Graph, typename property_traits<DistanceMap>::value_type, double, detail::reciprocal<double> > boost::measure_closeness ( const Graph &  , DistanceMap    )

inline

Referenced by closeness_centrality().

template<typename T , typename Graph , typename DistanceMap >

closeness_measure< Graph, typename property_traits<DistanceMap>::value_type, T, detail::reciprocal<T> > boost::measure_closeness ( const Graph &  , DistanceMap    )

inline

template<typename T , typename Graph , typename DistanceMap , typename Reciprocal >

closeness_measure< Graph, typename property_traits<DistanceMap>::value_type, T, Reciprocal> boost::measure_closeness ( const Graph &  , DistanceMap    )

inline

template<typename Graph , typename DistanceMap >

mean_graph_distance_measure<Graph, typename property_traits<DistanceMap>::value_type> boost::measure_graph_mean_geodesic ( const Graph &  , DistanceMap    )

inline

References T.

Referenced by small_world_distance().

template<typename Graph >

influence_measure<Graph> boost::measure_influence ( const Graph &  )

inline

Referenced by all_degree_centralities(), all_influence_values(), degree_centrality(), and influence().

template<typename Graph , typename DistanceMap >

mean_geodesic_measure<Graph, typename property_traits<DistanceMap>::value_type, double> boost::measure_mean_geodesic ( const Graph &  , DistanceMap    )

inline

Referenced by mean_geodesic().

template<typename T , typename Graph , typename DistanceMap >

mean_geodesic_measure<Graph, typename property_traits<DistanceMap>::value_type, T> boost::measure_mean_geodesic ( const Graph &  , DistanceMap    )

inline

References T.

template<typename Graph >

prestige_measure<Graph> boost::measure_prestige ( const Graph &  )

inline

Referenced by all_prestige_values(), and prestige().

template<class R , class T >

_mfi::dm<R, T> boost::mem_fn

(

R T::*

f

)

Referenced by boost::detail::function::BOOST_JOIN().

template<class S , class T >

mem_fun_t<S,T> boost::mem_fun ( S(T::*)()  f )

inline

template<class S , class T , class A >

mem_fun1_t<S,T,A> boost::mem_fun ( S(T::*)(A)  f )

inline

template<class S , class T >

const_mem_fun_t<S,T> boost::mem_fun ( S(T::*)() const  f )

inline

template<class S , class T , class A >

const_mem_fun1_t<S,T,A> boost::mem_fun ( S(T::*)(A) const  f )

inline

template<class S , class T >

mem_fun_ref_t<S,T> boost::mem_fun_ref ( S(T::*)()  f )

inline

template<class S , class T , class A >

mem_fun1_ref_t<S,T,A> boost::mem_fun_ref ( S(T::*)(A)  f )

inline

template<class S , class T >

const_mem_fun_ref_t<S,T> boost::mem_fun_ref ( S(T::*)() const  f )

inline

template<class S , class T , class A >

const_mem_fun1_ref_t<S,T,A> boost::mem_fun_ref ( S(T::*)(A) const  f )

inline

template<typename VertexListGraph , typename TSPVertexVisitor >

void boost::metric_tsp_approx	(	VertexListGraph &	g,
		TSPVertexVisitor	vis
	)

References edge_weight, boost::xpressive::first, metric_tsp_approx_from_vertex(), vertex_index, and vertices().

template<typename VertexListGraph , typename Weightmap , typename VertexIndexMap , typename TSPVertexVisitor >

void boost::metric_tsp_approx	(	VertexListGraph &	g,
		Weightmap	w,
		TSPVertexVisitor	vis
	)

References boost::xpressive::first, metric_tsp_approx_from_vertex(), vertex_index, and vertices().

template<typename VertexListGraph , typename WeightMap , typename VertexIndexMap , typename TSPVertexVisitor >

void boost::metric_tsp_approx	(	VertexListGraph &	g,
		WeightMap	w,
		VertexIndexMap	id,
		TSPVertexVisitor	vis
	)

References boost::xpressive::first, metric_tsp_approx_from_vertex(), and vertices().

template<typename VertexListGraph , typename WeightMap , typename TSPVertexVisitor >

void boost::metric_tsp_approx_from_vertex	(	VertexListGraph &	g,
		typename graph_traits< VertexListGraph >::vertex_descriptor	start,
		WeightMap	w,
		TSPVertexVisitor	vis
	)

References vertex_index.

Referenced by metric_tsp_approx(), metric_tsp_approx_tour(), and metric_tsp_approx_tour_from_vertex().

template<typename VertexListGraph , typename WeightMap , typename VertexIndexMap , typename TSPVertexVisitor >

void boost::metric_tsp_approx_from_vertex	(	const VertexListGraph &	g,
		typename graph_traits< VertexListGraph >::vertex_descriptor	start,
		WeightMap	weightmap,
		VertexIndexMap	indexmap,
		TSPVertexVisitor	vis
	)

References add_edge(), boost::PreorderTraverser< Node, Tree >::begin(), BOOST_CONCEPT_ASSERT(), curr, boost::PreorderTraverser< Node, Tree >::end(), boost::xpressive::first, make_iterator_property_map(), next(), num_vertices(), prim_minimum_spanning_tree(), root_vertex(), boost::flyweights::t, traverse_tree(), Vertex, vertex_index, vertex_index_map(), vertices(), and weight_map().

template<typename VertexListGraph , typename OutputIterator >

void boost::metric_tsp_approx_tour	(	VertexListGraph &	g,
		OutputIterator	o
	)

References edge_weight, boost::xpressive::first, metric_tsp_approx_from_vertex(), vertex_index, and vertices().

template<typename VertexListGraph , typename WeightMap , typename OutputIterator >

void boost::metric_tsp_approx_tour	(	VertexListGraph &	g,
		WeightMap	w,
		OutputIterator	o
	)

References boost::xpressive::first, metric_tsp_approx_from_vertex(), and vertices().

template<typename VertexListGraph , typename OutputIterator >

void boost::metric_tsp_approx_tour_from_vertex	(	VertexListGraph &	g,
		typename graph_traits< VertexListGraph >::vertex_descriptor	start,
		OutputIterator	o
	)

References edge_weight, metric_tsp_approx_from_vertex(), and vertex_index.

template<typename VertexListGraph , typename WeightMap , typename OutputIterator >

void boost::metric_tsp_approx_tour_from_vertex	(	VertexListGraph &	g,
		typename graph_traits< VertexListGraph >::vertex_descriptor	start,
		WeightMap	w,
		OutputIterator	o
	)

References metric_tsp_approx_from_vertex(), and vertex_index.

template<typename FloatTraits , typename Graph , typename VertexIndexMap , typename EdgeWeightMap , typename EdgeIndexMap >

FloatTraits::value_type boost::minimum_cycle_mean ( const Graph &  g, VertexIndexMap  vim, EdgeWeightMap  ewm, EdgeIndexMap  eim, std::vector< typename graph_traits< Graph >::edge_descriptor > *  pcc = 0, FloatTraits  ft = FloatTraits()  )

inline

References make_iterator_property_map(), minimum_cycle_ratio(), and num_edges().

Referenced by minimum_cycle_mean().

template<typename Graph , typename VertexIndexMap , typename EdgeWeightMap , typename EdgeIndexMap >

double boost::minimum_cycle_mean ( const Graph &  g, VertexIndexMap  vim, EdgeWeightMap  ewm, EdgeIndexMap  eim, std::vector< typename graph_traits< Graph >::edge_descriptor > *  pcc = 0  )

inline

References minimum_cycle_mean().

template<typename FloatTraits , typename Graph , typename VertexIndexMap , typename EdgeWeight1Map , typename EdgeWeight2Map >

FloatTraits::value_type boost::minimum_cycle_ratio	(	const Graph &	g,
		VertexIndexMap	vim,
		EdgeWeight1Map	ew1m,
		EdgeWeight2Map	ew2m,
		std::vector< typename graph_traits< Graph >::edge_descriptor > *	pcc = 0,
		FloatTraits	= FloatTraits()
	)

Referenced by minimum_cycle_mean(), and minimum_cycle_ratio().

template<typename Graph , typename VertexIndexMap , typename EdgeWeight1Map , typename EdgeWeight2Map >

double boost::minimum_cycle_ratio ( const Graph &  g, VertexIndexMap  vim, EdgeWeight1Map  ew1m, EdgeWeight2Map  ew2m, std::vector< typename graph_traits< Graph >::edge_descriptor > *  pcc = 0  )

inline

References minimum_cycle_ratio().

template<class Graph , class DegreeMap , class InversePermutationMap , class PermutationMap , class SuperNodeMap , class VertexIndexMap >

void boost::minimum_degree_ordering	(	Graph &	G,
		DegreeMap	degree,
		InversePermutationMap	inverse_perm,
		PermutationMap	perm,
		SuperNodeMap	supernode_size,
		int	delta,
		VertexIndexMap	vertex_index_map
	)

References num_vertices().

template<typename T >

tuple< T const&, T const& > boost::minmax	(	T const &	a,
		T const &	b
	)

References cref(), and boost::fusion::make_tuple().

template<typename T , class BinaryPredicate >

tuple< T const&, T const& > boost::minmax	(	T const &	a,
		T const &	b,
		BinaryPredicate	comp
	)

References cref(), and boost::fusion::make_tuple().

template<typename ForwardIter >

std::pair<ForwardIter,ForwardIter> boost::minmax_element	(	ForwardIter	first,
		ForwardIter	last
	)

References boost::detail::basic_minmax_element().

Referenced by first_min_first_max_element().

template<typename ForwardIter , class BinaryPredicate >

std::pair<ForwardIter,ForwardIter> boost::minmax_element	(	ForwardIter	first,
		ForwardIter	last,
		BinaryPredicate	comp
	)

References boost::detail::basic_minmax_element().

template<typename I , typename O >

O boost::move	(	I	f,
		I	l,
		O	result
	)

Effects: Moves elements in the range [first,last) into the range [result,result + (last - first)) starting from first and proceeding to last.

For each non-negative integer n < (last-first), performs *(result + n) = boost::move (*(first + n)).

Effects: result + (last - first).

Requires: result shall not be in the range [first,last).

Complexity: Exactly last - first move assignments.

Referenced by add_scoped_logger_attribute(), add_scoped_thread_attribute(), boost::optional_detail::optional_base< T >::assign(), async(), boost::executors::basic_thread_pool::basic_thread_pool(), boost::BasicLock< Lk >::BOOST_CONCEPT_USAGE(), BOOST_THREAD_DCL_MOVABLE_BEG(), boost::container::deque< T, Allocator >::erase(), boost::container::vector< Value, container_detail::static_storage_allocator< Value, Capacity > >::erase(), boost::detail::future_deferred_shared_state< Rp, Fp >::execute(), boost::detail::future_deferred_shared_state< void, Fp >::execute(), boost::detail::future_async_shared_state< void, Fp >::future_async_shared_state(), boost::detail::future_async_shared_state< Rp &, Fp >::future_async_shared_state(), boost::detail::shared_state< Rp >::get(), boost::unique_future< R >::get_or(), boost::shared_future< R >::get_or(), boost::unordered::unordered_set< T, H, P, A >::insert(), boost::unordered::unordered_map< sync_id, void * >::insert(), boost::container::map< const sync_id *, umap_type::iterator, address_less >::insert(), boost::container::flat_map< Key, T, Compare, Allocator >::insert(), boost::unordered::unordered_multiset< T, H, P, A >::insert(), boost::unordered::unordered_multimap< K, T, H, P, A >::insert(), boost::circular_buffer_space_optimized< T, Alloc >::insert(), boost::container::multimap< Key, T, Compare, Allocator, MultiMapOptions >::insert(), boost::container::flat_multimap< Key, T, Compare, Allocator >::insert(), boost::circular_buffer< Sample >::insert(), boost::circular_buffer< Sample >::linearize(), make_exceptional_future_if_invalid(), boost::detail::shared_state< Rp >::mark_finished_with_result(), boost::detail::shared_state< Rp >::mark_finished_with_result_internal(), boost::optional_detail::types_when_isnt_ref< T >::move(), move_backward(), boost::nested_strict_lock< Lock >::nested_strict_lock(), boost::concurrent::queue_back_view< Queue >::nonblocking_push(), boost::sync_bounded_queue< ValueType >::nonblocking_push_back(), boost::sync_queue< ValueType >::nonblocking_push_back(), boost::concurrent::detail::queue_adaptor_movable_only< Queue >::nonblocking_push_back(), boost::concurrent::detail::queue_adaptor_copyable_and_movable< Queue >::nonblocking_push_back(), boost::icl::operator&(), boost::expressions::format_date_time_terminal< T, FallbackPolicyT, CharT >::operator()(), boost::expressions::wrapped_formatter_terminal< FunT, CharT >::operator()(), boost::expressions::format_named_scope_terminal< FallbackPolicyT, CharT >::operator()(), boost::expressions::char_decorator_terminal< SubactorT, ImplT >::operator()(), boost::optional< status >::operator*(), boost::icl::operator+(), boost::container::operator+(), boost::icl::operator-(), operator<<(), boost::interprocess::file_mapping::operator=(), boost::interprocess::file_lock::operator=(), boost::interprocess::xsi_named_mutex::operator=(), boost::interprocess::basic_managed_heap_memory< CharType, AllocationAlgorithm, IndexType >::operator=(), boost::interprocess::basic_managed_external_buffer< CharType, AllocationAlgorithm, IndexType >::operator=(), boost::interprocess::shared_memory_object::operator=(), boost::interprocess::windows_shared_memory::operator=(), boost::interprocess::xsi_shared_memory::operator=(), boost::externally_locked< Stream &, RecursiveMutex >::operator=(), boost::intrusive::bs_set_impl< ValueTraits, Compare, SizeType, ConstantTimeSize, HeaderHolder >::operator=(), boost::intrusive::sg_set_impl< ValueTraits, Compare, SizeType, FloatingPoint, HeaderHolder >::operator=(), boost::intrusive::splay_set_impl< ValueTraits, Compare, SizeType, ConstantTimeSize, HeaderHolder >::operator=(), boost::intrusive::avl_set_impl< ValueTraits, Compare, SizeType, ConstantTimeSize, HeaderHolder >::operator=(), boost::intrusive::set_impl< ValueTraits, Compare, SizeType, ConstantTimeSize, HeaderHolder >::operator=(), boost::icl::split_interval_map< DomainT, CodomainT, Traits, Compare, Combine, Section, Interval, Alloc >::operator=(), boost::coroutines::push_coroutine< Arg >::operator=(), boost::intrusive::treap_set_impl< ValueTraits, VoidOrKeyComp, VoidOrPrioComp, SizeType, ConstantTimeSize, HeaderHolder >::operator=(), boost::icl::interval_map< DomainT, CodomainT, Traits, Compare, Combine, Section, Interval, Alloc >::operator=(), boost::icl::split_interval_set< DomainT, Compare, Interval, Alloc >::operator=(), boost::icl::separate_interval_set< DomainT, Compare, Interval, Alloc >::operator=(), boost::intrusive::splaytree_impl< ValueTraits, Compare, SizeType, ConstantTimeSize, HeaderHolder >::operator=(), boost::intrusive::rbtree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::operator=(), boost::intrusive::avltree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::operator=(), boost::icl::interval_set< DomainT, Compare, Interval, Alloc >::operator=(), boost::interprocess::basic_managed_mapped_file< CharType, AllocationAlgorithm, IndexType >::operator=(), boost::interprocess::basic_managed_windows_shared_memory< CharType, AllocationAlgorithm, IndexType >::operator=(), boost::interprocess::mapped_region::operator=(), boost::interprocess::basic_managed_xsi_shared_memory< CharType, AllocationAlgorithm, IndexType >::operator=(), boost::interprocess::basic_managed_shared_memory< CharType, AllocationAlgorithm, IndexType >::operator=(), boost::intrusive::unordered_set_impl< ValueTraits, Hash, Equal, SizeType, BucketTraits, BoolFlags >::operator=(), boost::unique_lock< Lockable >::operator=(), boost::icl::interval_base_set< split_interval_set< DomainT, Compare, Interval, Alloc >, DomainT, Compare, Interval, Alloc >::operator=(), boost::back_move_insert_iterator< C >::operator=(), boost::scoped_thread< CallableThread >::operator=(), boost::icl::map< DomainT, CodomainT, Traits, Compare, Combine, Section, Alloc >::operator=(), boost::dynamic_bitset< Block, Allocator >::operator=(), boost::container::set< Key, Compare, Allocator, SetOptions >::operator=(), boost::container::flat_set< Key, Compare, Allocator >::operator=(), boost::icl::interval_base_map< interval_map< DomainT, CodomainT, Traits, Compare, Combine, Section, Interval, Alloc >, DomainT, CodomainT, Traits, Compare, Combine, Section, Interval, Alloc >::operator=(), boost::front_move_insert_iterator< C >::operator=(), boost::coroutines::push_coroutine< Arg & >::operator=(), boost::container::map< const sync_id *, umap_type::iterator, address_less >::operator=(), boost::move_insert_iterator< C >::operator=(), boost::intrusive::sgtree_impl< ValueTraits, Compare, SizeType, FloatingPoint, HeaderHolder >::operator=(), boost::container::flat_map< Key, T, Compare, Allocator >::operator=(), boost::container::static_vector< Value, Capacity >::operator=(), boost::container::list< T, Allocator >::operator=(), boost::container::slist< T, Allocator >::operator=(), boost::coroutines::push_coroutine< void >::operator=(), boost::intrusive::bs_set< T, O1, O2, O3, O4, O5 >::operator=(), boost::intrusive::avl_set< T, O1, O2, O3, O4, O5 >::operator=(), boost::intrusive::set< T, O1, O2, O3, O4, O5 >::operator=(), boost::intrusive::sg_set< T, O1, O2, O3, O4, O5 >::operator=(), boost::intrusive::splay_set< T, O1, O2, O3, O4, O5 >::operator=(), boost::intrusive::treap_set< T, O1, O2, O3, O4, O5 >::operator=(), boost::intrusive::rbtree< T, O1, O2, O3, O4, O5 >::operator=(), boost::intrusive::avltree< T, O1, O2, O3, O4, O5 >::operator=(), boost::intrusive::bs_multiset_impl< ValueTraits, Compare, SizeType, ConstantTimeSize, HeaderHolder >::operator=(), boost::intrusive::multiset_impl< ValueTraits, Compare, SizeType, ConstantTimeSize, HeaderHolder >::operator=(), boost::intrusive::avl_multiset_impl< ValueTraits, Compare, SizeType, ConstantTimeSize, HeaderHolder >::operator=(), boost::intrusive::sg_multiset_impl< ValueTraits, Compare, SizeType, FloatingPoint, HeaderHolder >::operator=(), boost::intrusive::splay_multiset_impl< ValueTraits, Compare, SizeType, ConstantTimeSize, HeaderHolder >::operator=(), boost::intrusive::splaytree< T, O1, O2, O3, O4, O5 >::operator=(), boost::intrusive::treap_multiset_impl< ValueTraits, VoidOrKeyComp, VoidOrPrioComp, SizeType, ConstantTimeSize, HeaderHolder >::operator=(), boost::container::container_detail::scoped_allocator_adaptor_base< OuterAlloc, InnerAllocs... >::operator=(), boost::coroutines::pull_coroutine< R >::operator=(), boost::container::stable_vector< T, Allocator >::operator=(), boost::upgrade_lock< Mutex >::operator=(), boost::container::multiset< Key, Compare, Allocator, MultiSetOptions >::operator=(), boost::container::vector< Value, container_detail::static_storage_allocator< Value, Capacity > >::operator=(), boost::container::flat_multiset< Key, Compare, Allocator >::operator=(), boost::optional< status >::operator=(), boost::intrusive::bs_multiset< T, O1, O2, O3, O4, O5 >::operator=(), boost::intrusive::multiset< T, O1, O2, O3, O4, O5 >::operator=(), boost::intrusive::avl_multiset< T, O1, O2, O3, O4, O5 >::operator=(), boost::intrusive::sg_multiset< T, O1, O2, O3, O4, O5 >::operator=(), boost::intrusive::splay_multiset< T, O1, O2, O3, O4, O5 >::operator=(), boost::intrusive::sgtree< T, O1, O2, O3, O4, O5 >::operator=(), boost::container::container_detail::scoped_allocator_adaptor_base< OuterAlloc >::operator=(), boost::intrusive::treap_multiset< T, O1, O2, O3, O4, O5 >::operator=(), boost::container::multimap< Key, T, Compare, Allocator, MultiMapOptions >::operator=(), boost::coroutines::pull_coroutine< R & >::operator=(), boost::intrusive::unordered_set< T, O1, O2, O3, O4, O5, O6, O7, O8, O9, O10 >::operator=(), boost::intrusive::treap< T, O1, O2, O3, O4, O5 >::operator=(), boost::container::scoped_allocator_adaptor< InnerAllocs...>::operator=(), boost::intrusive::unordered_multiset_impl< ValueTraits, Hash, Equal, SizeType, BucketTraits, BoolFlags >::operator=(), boost::container::flat_multimap< Key, T, Compare, Allocator >::operator=(), boost::coroutines::pull_coroutine< void >::operator=(), boost::unique_future< R >::operator=(), boost::intrusive::list< thread_context, intrusive::base_hook< thread_context_hook_t >, intrusive::constant_time_size< false > >::operator=(), boost::shared_future< R >::operator=(), boost::intrusive::unordered_multiset< T, O1, O2, O3, O4, O5, O6, O7, O8, O9, O10 >::operator=(), boost::intrusive::bstree< T, O1, O2, O3, O4, O5 >::operator=(), boost::intrusive::slist< T, O1, O2, O3, O4, O5, O6 >::operator=(), boost::intrusive::hashtable< T, O1, O2, O3, O4, O5, O6, O7, O8, O9, O10 >::operator=(), boost::packaged_task< R >::operator=(), operator>>(), boost::icl::operator^(), boost::icl::operator|(), boost::optional< status >::optional(), boost::optional_detail::optional_base< T >::optional_base(), boost::optional_detail::swap_selector< false >::optional_swap(), boost::expressions::aux::date_time_formatter_generator_traits_impl< posix_time::ptime, CharT >::parse(), boost::expressions::aux::date_time_formatter_generator_traits< local_time::local_date_time_base< TimeT, TimeZoneT >, CharT, VoidT >::parse(), boost::expressions::aux::date_formatter_generator_traits_impl< gregorian::date, CharT >::parse(), boost::expressions::aux::time_duration_formatter_generator_traits_impl< posix_time::hours, CharT >::parse(), boost::expressions::aux::date_duration_formatter_generator_traits_impl< DateDurationT, CharT >::parse(), boost::sync_bounded_queue< ValueType >::push(), boost::sync_queue< ValueType >::push(), boost::concurrent::queue_back_view< Queue >::push(), boost::sync_bounded_queue< ValueType >::push_back(), boost::sync_queue< ValueType >::push_back(), boost::concurrent::detail::queue_adaptor_movable_only< Queue >::push_back(), boost::concurrent::detail::queue_adaptor_copyable_and_movable< Queue >::push_back(), boost::multi_index::detail::sequenced_index< SuperMeta, TagList >::push_back(), boost::multi_index::detail::random_access_index< SuperMeta, TagList >::push_back(), boost::circular_buffer_space_optimized< T, Alloc >::push_back(), boost::circular_buffer< Sample >::push_back(), boost::multi_index::detail::sequenced_index< SuperMeta, TagList >::push_front(), boost::multi_index::detail::random_access_index< SuperMeta, TagList >::push_front(), boost::circular_buffer_space_optimized< T, Alloc >::push_front(), boost::circular_buffer< Sample >::push_front(), boost::sources::basic_composite_logger< CharT, FinalT, ThreadingModelT, FeaturesT >::push_record(), boost::sources::basic_composite_logger< CharT, FinalT, single_thread_model, FeaturesT >::push_record(), boost::sources::basic_exception_handler_logger< BaseT >::push_record_unlocked(), boost::sources::basic_logger< CharT, FinalT, ThreadingModelT >::push_record_unlocked(), boost::circular_buffer_space_optimized< T, Alloc >::rinsert(), boost::circular_buffer< Sample >::rinsert(), boost::attributes::mutable_constant< T, MutexT, ScopedWriteLockT, ScopedReadLockT >::impl::set(), boost::attributes::mutable_constant< channel_type >::set(), boost::attributes::mutable_constant< T, void, void, void >::impl::set(), boost::attributes::mutable_constant< T, void, void, void >::set(), boost::promise< R >::set_value(), boost::detail::shared_state< Rp >::set_value_at_thread_exit(), boost::promise< R >::set_value_at_thread_exit(), boost::executors::executor_ref< Executor >::submit(), boost::executors::executor::submit(), boost::executors::executor_adaptor< Executor >::submit(), boost::user_scheduler::submit(), boost::executors::generic_executor_ref::submit(), boost::move_detail::swap(), boost::synchronized_value< T, Lockable >::synchronized_value(), boost::sync_bounded_queue< ValueType >::try_push(), boost::sync_queue< ValueType >::try_push(), boost::concurrent::queue_back_view< Queue >::try_push(), boost::sync_bounded_queue< ValueType >::try_push_back(), boost::sync_queue< ValueType >::try_push_back(), boost::concurrent::detail::queue_adaptor_movable_only< Queue >::try_push_back(), boost::concurrent::detail::queue_adaptor_copyable_and_movable< Queue >::try_push_back(), boost::sync_queue< work >::underlying_queue(), uninitialized_move(), boost::cb_details::uninitialized_move_if_noexcept_impl(), boost::optional< status >::value(), boost::optional< status >::value_or(), boost::optional< status >::value_or_eval(), boost::concurrent::queue_back_view< Queue >::wait_push(), boost::sync_bounded_queue< ValueType >::wait_push_back(), boost::sync_queue< ValueType >::wait_push_back(), boost::concurrent::detail::queue_adaptor_movable_only< Queue >::wait_push_back(), boost::concurrent::detail::queue_adaptor_copyable_and_movable< Queue >::wait_push_back(), boost::nested_strict_lock< Lock >::~nested_strict_lock(), boost::aux::record_pump< LoggerT >::~record_pump(), and boost::upgrade_to_unique_lock< Mutex >::~upgrade_to_unique_lock().

template<class T >

typename ::boost::move_detail::remove_reference<T>::type&& boost::move ( T &&  t )

inline

References boost::flyweights::t, and boost::detail::type.

Referenced by boost::move_detail::swap().

template<typename I , typename O >

O boost::move_backward	(	I	f,
		I	l,
		O	result
	)

Effects: Moves elements in the range [first,last) into the range [result - (last-first),result) starting from last - 1 and proceeding to first.

For each positive integer n <= (last - first), performs *(result - n) = boost::move(*(last - n)).

Requires: result shall not be in the range [first,last).

Returns: result - (last - first).

Complexity: Exactly last - first assignments.

References move().

Referenced by boost::container::deque< T, Allocator >::erase().

template<class T >

typename ::boost::move_detail::enable_if_c< ::boost::move_detail::is_nothrow_move_constructible_or_uncopyable<T>::value, T&&>::type boost::move_if_noexcept

(

T &

x

)

References boost::fusion::move(), and boost::flyweights::x.

Referenced by boost::circular_buffer< Sample >::erase(), boost::circular_buffer< Sample >::linearize(), boost::circular_buffer< Sample >::rerase(), and boost::circular_buffer< Sample >::rotate().

template<class T >

typename ::boost::move_detail::enable_if_c< !::boost::move_detail::is_nothrow_move_constructible_or_uncopyable<T>::value, const T&>::type boost::move_if_noexcept

(

T &

x

)

References boost::flyweights::x.

template<class T >

T&& boost::move_if_not_lvalue_reference ( typename::boost::move_detail::remove_reference< T >::type &  t )

inline

References T, and boost::flyweights::t.

template<class T >

T&& boost::move_if_not_lvalue_reference ( typename::boost::move_detail::remove_reference< T >::type &&  t )

inline

References BOOST_STATIC_ASSERT(), T, boost::flyweights::t, and boost::program_options::value().

template<typename C >

move_insert_iterator<C> boost::move_inserter ( C &  x, typename C::iterator  it  )

inline

Returns: move_insert_iterator<C>(x, it).

References it, and boost::flyweights::x.

template<typename EnumType >

EnumType boost::native_value ( EnumType  e )

inline

template<class VertexListGraph , class P , class T , class R >

void boost::neighbor_breadth_first_search	(	const VertexListGraph &	g,
		typename graph_traits< VertexListGraph >::vertex_descriptor	s,
		const bgl_named_params< P, T, R > &	params
	)

References boost::detail::neighbor_bfs_dispatch< ColorMap >::apply(), get_param(), and vertex_color.

template<class IncidenceGraph , class P , class T , class R >

void boost::neighbor_breadth_first_visit	(	IncidenceGraph &	g,
		typename graph_traits< IncidenceGraph >::vertex_descriptor	s,
		const bgl_named_params< P, T, R > &	params
	)

References choose_param(), choose_pmap(), get_param(), graph_visitor, make_neighbor_bfs_visitor(), boost::detail::neighbor_bfs_impl(), ref(), and vertex_color.

template<class T >

T* boost::new_clone ( const T &  r )

inline

References BOOST_ASSERT, and T.

Referenced by boost::heap_clone_allocator::allocate_clone(), and new_clone().

template<class T >

T* boost::new_clone ( const T *  r )

inline

References new_clone().

template<typename T , typename CA , typename A >

ptr_deque<T,CA,A>* boost::new_clone ( const ptr_deque< T, CA, A > &  r )

inline

template<typename T , typename CA , typename A >

ptr_vector<T,CA,A>* boost::new_clone ( const ptr_vector< T, CA, A > &  r )

inline

template<typename T , typename CA , typename A >

ptr_list<T,CA,A>* boost::new_clone ( const ptr_list< T, CA, A > &  r )

inline

template<typename K , typename C , typename CA , typename A >

ptr_set<K,C,CA,A>* boost::new_clone ( const ptr_set< K, C, CA, A > &  r )

inline

template<typename K , typename C , typename CA , typename A >

ptr_multiset<K,C,CA,A>* boost::new_clone ( const ptr_multiset< K, C, CA, A > &  r )

inline

template<class K , class T , class C , class CA , class A >

ptr_map<K,T,C,CA,A>* boost::new_clone ( const ptr_map< K, T, C, CA, A > &  r )

inline

template<class K , class T , class C , class CA , class A >

ptr_multimap<K,T,C,CA,A>* boost::new_clone ( const ptr_multimap< K, T, C, CA, A > &  r )

inline

template<typename K , typename H , typename P , typename CA , typename A >

ptr_unordered_set<K,H,P,CA,A>* boost::new_clone ( const ptr_unordered_set< K, H, P, CA, A > &  r )

inline

template<class K , class T , class H , class P , class CA , class A >

ptr_unordered_map<K,T,H,P,CA,A>* boost::new_clone ( const ptr_unordered_map< K, T, H, P, CA, A > &  r )

inline

template<typename K , typename H , typename P , typename CA , typename A >

ptr_unordered_multiset<K,H,P,CA,A>* boost::new_clone ( const ptr_unordered_multiset< K, H, P, CA, A > &  r )

inline

template<typename T , size_t size, typename CA >

ptr_array<T,size,CA>* boost::new_clone ( const ptr_array< T, size, CA > &  r )

inline

References boost::ptr_array< T, N, CloneAllocator >::clone().

template<class K , class T , class H , class P , class CA , class A >

ptr_unordered_multimap<K,T,H,P,CA,A>* boost::new_clone ( const ptr_unordered_multimap< K, T, H, P, CA, A > &  r )

inline

template<typename T , typename CA , typename A >

ptr_circular_buffer<T,CA,A>* boost::new_clone ( const ptr_circular_buffer< T, CA, A > &  r )

inline

template<class T >

T boost::next ( T  x )

inline

References boost::flyweights::x.

Referenced by boost::multi_index::detail::sequenced_index< SuperMeta, TagList >::begin(), boost::multi_index::detail::hashed_index< KeyFromValue, Hash, Pred, SuperMeta, TagList, Category >::begin(), boost::re_detail::bubble_down_one(), boost::spirit::karma::char_set< CharEncoding, Tag, no_attribute >::char_set(), boost::spirit::qi::char_set< CharEncoding, no_attribute, no_case >::char_set(), boost::spirit::qi::char_set< CharEncoding, no_attribute, true >::char_set(), boost::wave::util::macromap< ContextT >::collect_arguments(), boost::iostreams::detail::chain_base< chain< Mode, Ch, Tr, Alloc >, Ch, Tr, Alloc, Mode >::component_type(), boost::wave::util::macromap< ContextT >::concat_tokensequence(), boost::lockfree::detail::ringbuffer_base< T >::consume_one(), boost::multi_index::detail::sequenced_index< SuperMeta, TagList >::delete_all_nodes_(), boost::msm::back::state_machine< A0, A1, A2, A3, A4 >::handle_defer_helper< StateType, typename enable_if< typename::boost::msm::back::has_fsm_deferred_events< StateType >::type, int >::type >::do_post_handle_deferred(), boost::date_time::date_facet< time_type::date_type, CharT, OutItrT >::do_put_special(), boost::triangulation_visitor< Graph, VertexIndexMap, AddEdgeVisitor >::end_face(), boost::geometry::range::erase(), boost::container::deque< T, Allocator >::erase(), boost::circular_buffer< Sample >::erase(), boost::graph_detail::erase_if_dispatch(), boost::wave::grammars::expression_grammar_gen< TokenT >::evaluate(), boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::extract_kuratowski_subgraph(), find_odd_cycle(), boost::spirit::lex::lexertl::functor< Token, FunctorData, Iterator, SupportsActors, SupportsState >::get_next(), boost::attributes::counter< T >::impl_generic::get_value(), boost::algorithm::is_sorted_until(), is_straight_line_drawing(), boost::intrusive::circular_list_algorithms< NodeTraits >::link_after(), boost::detail::lock_impl(), make_connected(), boost::spirit::x3::make_context(), make_iterator_range_n(), boost::detail::make_K_3_3(), boost::detail::make_K_5(), boost::spirit::x3::detail::make_unique_context(), boost::spirit::x3::make_unique_context(), metric_tsp_approx_from_vertex(), boost::multi_index::detail::ordered_index< KeyFromValue, Compare, SuperMeta, TagList, Category >::modify_rollback_(), boost::numeric::RoundEven< S >::nearbyint(), num_triangles_on_vertex(), boost::escaped_list_separator< Char, Traits >::operator()(), boost::char_separator< Char, Tr >::operator()(), boost::char_delimiters_separator< Char, Tr >::operator()(), boost::re_detail::file_iterator::operator++(), boost::re_detail::directory_iterator::operator++(), boost::spirit::fixed_loop< ParserT, ExactT >::parse(), boost::spirit::kleene_star< S >::parse(), boost::spirit::positive< S >::parse(), boost::spirit::finite_loop< ParserT, MinT, MaxT >::parse(), boost::spirit::infinite_loop< ParserT, MinT >::parse(), boost::re_detail::basic_regex_parser< charT, traits >::parse_perl_extension(), planar_canonical_ordering(), planar_face_traversal(), boost::lockfree::detail::ringbuffer_base< T >::push(), boost::filesystem::detail::recur_dir_itr_imp::push_directory(), boost::date_time::date_generator_formatter< time_type::date_type, CharT >::put_first_kday(), boost::date_time::date_generator_formatter< time_type::date_type, CharT >::put_kday_after(), boost::date_time::date_generator_formatter< time_type::date_type, CharT >::put_kday_before(), boost::date_time::date_generator_formatter< time_type::date_type, CharT >::put_last_kday(), boost::date_time::date_generator_formatter< time_type::date_type, CharT >::put_nth_kday(), boost::date_time::date_generator_formatter< time_type::date_type, CharT >::put_partial_date(), boost::date_time::period_formatter< CharT >::put_period(), boost::date_time::special_values_formatter< CharT >::put_special(), radius_and_diameter(), random_edge(), boost::detail::random_spanning_tree_internal(), random_vertex(), boost::re_detail::re_is_set_member(), boost::iostreams::symmetric_filter< detail::bzip2_decompressor_impl< Alloc >, Alloc >::read(), boost::iostreams::code_converter< Device, Codecvt, Alloc >::read(), boost::undirected_graph< VertexProp, EdgeProp, GraphProp >::remove_edge_and_renumber_indices(), boost::directed_graph< VertexProp, EdgeProp, GraphProp >::remove_edge_and_renumber_indices(), boost::wave::util::impl::remove_placeholders(), boost::undirected_graph< VertexProp, EdgeProp, GraphProp >::remove_vertex_and_renumber_indices(), boost::directed_graph< VertexProp, EdgeProp, GraphProp >::remove_vertex_and_renumber_indices(), boost::multi_index::detail::ordered_index< KeyFromValue, Compare, SuperMeta, TagList, Category >::replace_(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::resize(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::resize(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::rresize(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::rresize(), transitive_closure(), boost::wave::util::impl::trim_replacement_list(), boost::cb_details::uninitialized_copy(), boost::cb_details::uninitialized_fill_n_with_alloc(), boost::intrusive::circular_list_algorithms< NodeTraits >::unique(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::unique(), boost::intrusive::circular_list_algorithms< NodeTraits >::unlink(), wait_for_any(), boost::iostreams::basic_line_filter< Ch, Alloc >::write(), boost::iostreams::code_converter< Device, Codecvt, Alloc >::write(), and boost::object_pool< T, UserAllocator >::~object_pool().

template<class T , class Distance >

T boost::next ( T  x, Distance  n  )

inline

References boost::next_prior_detail::next_impl2< T, Distance >::call().

template<class Iterator , class T >

void boost::non_const_lvalue_iterator_test	(	Iterator	i,
		T	v1,
		T	v2
	)

References BOOST_STATIC_ASSERT(), BOOST_TEST, T, boost::sinks::v4, and boost::program_options::value().

template<typename ProcessGroup , typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename IncomingMap , typename DistanceMap , typename DependencyMap , typename PathCountMap , typename VertexIndexMap , typename Buffer >

void boost::non_distributed_brandes_betweenness_centrality	(	const ProcessGroup &	pg,
		const Graph &	g,
		CentralityMap	centrality,
		EdgeCentralityMap	edge_centrality_map,
		IncomingMap	incoming,
		DistanceMap	distance,
		DependencyMap	dependency,
		PathCountMap	path_count,
		VertexIndexMap	vertex_index,
		Buffer	sources
	)

References boost::graph::parallel::detail::non_distributed_brandes_betweenness_centrality_impl().

Referenced by boost::detail::graph::non_distributed_brandes_betweenness_centrality_dispatch2().

template<typename ProcessGroup , typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename IncomingMap , typename DistanceMap , typename DependencyMap , typename PathCountMap , typename VertexIndexMap , typename WeightMap , typename Buffer >

void boost::non_distributed_brandes_betweenness_centrality	(	const ProcessGroup &	pg,
		const Graph &	g,
		CentralityMap	centrality,
		EdgeCentralityMap	edge_centrality_map,
		IncomingMap	incoming,
		DistanceMap	distance,
		DependencyMap	dependency,
		PathCountMap	path_count,
		VertexIndexMap	vertex_index,
		WeightMap	weight_map,
		Buffer	sources
	)

References boost::graph::parallel::detail::non_distributed_brandes_betweenness_centrality_impl().

template<typename ProcessGroup , typename Graph , typename Param , typename Tag , typename Rest >

void boost::non_distributed_brandes_betweenness_centrality	(	const ProcessGroup &	pg,
		const Graph &	g,
		const bgl_named_params< Param, Tag, Rest > &	params
	)

References choose_const_pmap(), choose_param(), edge_centrality, edge_weight, get_param(), ref(), boost::detail::graph::non_distributed_brandes_betweenness_centrality_dispatch1< WeightMap >::run(), and vertex_centrality.

template<typename ProcessGroup , typename Graph , typename CentralityMap >

void boost::non_distributed_brandes_betweenness_centrality	(	const ProcessGroup &	pg,
		const Graph &	g,
		CentralityMap	centrality
	)

References boost::detail::graph::non_distributed_brandes_betweenness_centrality_dispatch2(), and ref().

template<typename ProcessGroup , typename Graph , typename CentralityMap , typename Buffer >

void boost::non_distributed_brandes_betweenness_centrality	(	const ProcessGroup &	pg,
		const Graph &	g,
		CentralityMap	centrality,
		Buffer	sources
	)

References boost::detail::graph::non_distributed_brandes_betweenness_centrality_dispatch2().

template<typename ProcessGroup , typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename Buffer >

void boost::non_distributed_brandes_betweenness_centrality	(	const ProcessGroup &	pg,
		const Graph &	g,
		CentralityMap	centrality,
		EdgeCentralityMap	edge_centrality_map,
		Buffer	sources
	)

References boost::detail::graph::non_distributed_brandes_betweenness_centrality_dispatch2().

template<class ParentIterator >

void boost::normalize_components	(	ParentIterator	first,
		ParentIterator	last
	)

References current, and last.

template<class Predicate >

unary_negate<Predicate> boost::not1

(

const Predicate &

pred

)

Referenced by boost::container::basic_string< CharT, Traits, Allocator >::find_first_not_of(), boost::container::basic_string< CharT, Traits, Allocator >::find_last_not_of(), and transitive_closure().

template<class Predicate >

unary_negate<Predicate> boost::not1

(

Predicate &

pred

)

template<class Predicate >

binary_negate<Predicate> boost::not2

(

const Predicate &

pred

)

template<class Predicate >

binary_negate<Predicate> boost::not2

(

Predicate &

pred

)

BOOST_THREAD_DECL void boost::notify_all_at_thread_exit	(	condition_variable &	cond,
		unique_lock< mutex >	lk
	)

long boost::num_edges ( sgb_const_graph_ptr  g )

inline

template<class BidirectionalGraph , class GRef >

reverse_graph<BidirectionalGraph>::edges_size_type boost::num_edges ( const reverse_graph< BidirectionalGraph, GRef > &  g )

inline

References boost::reverse_graph< BidirectionalGraph, GraphRef >::m_g, and num_edges().

template<class EdgeIter , class T , class D , class Cat >

std::size_t boost::num_edges

(

const edge_list< EdgeIter, T, D, Cat > &

el

)

References boost::edge_list< EdgeIter, T, D, Cat >::m_num_edges.

template<typename G , typename EP , typename VP >

filtered_graph<G, EP, VP>::edges_size_type boost::num_edges

(

const filtered_graph< G, EP, VP > &

g

)

References boost::filtered_graph_base< Graph >::m_g, and num_edges().

template<class vtype , class etype >

graph_traits< leda::GRAPH<vtype,etype> >::edges_size_type boost::num_edges

(

const leda::GRAPH< vtype, etype > &

g

)

template<typename VP , typename EP , typename GP >

undirected_graph<VP,EP,GP>::edges_size_type boost::num_edges ( undirected_graph< VP, EP, GP > const &  g )

inline

template<typename VP , typename EP , typename GP >

directed_graph<VP,EP,GP>::edges_size_type boost::num_edges ( directed_graph< VP, EP, GP > const &  g )

inline

template<typename G >

subgraph<G>::edges_size_type boost::num_edges

(

const subgraph< G > &

g

)

References boost::subgraph< Graph >::m_graph, and num_edges().

graph_traits<leda::graph>::edges_size_type boost::num_edges

(

const leda::graph &

g

)

template<typename G , typename L , typename S >

labeled_graph<G,L,S>::edges_size_type boost::num_edges ( labeled_graph< G, L, S > const &  g )

inline

References num_edges().

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::edges_size_type boost::num_edges ( const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g )

inline

template<typename D , typename VP , typename EP , typename GP , typename A >

adjacency_matrix<D,VP,EP,GP,A>::edges_size_type boost::num_edges

(

const adjacency_matrix< D, VP, EP, GP, A > &

g

)

References boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator >::m_num_edges.

Referenced by boost::compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::assign(), boost::compressed_sparse_row_graph< bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::assign(), betweenness_centrality_clustering(), boost::concepts::BOOST_concept(), boost::compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::compressed_sparse_row_graph(), boost::compressed_sparse_row_graph< bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::compressed_sparse_row_graph(), boost::DistributedEdgeListGraphConcept< G >::const_constraints(), boost::directed_graph< VertexProp, EdgeProp, GraphProp >::directed_graph(), edge_from_index(), boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::extract_kuratowski_subgraph(), boost::detail::graph::mutate_graph_impl< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > >::finish_building_graph(), make_biconnected_planar(), maximum_cycle_mean(), minimum_cycle_mean(), num_edges(), planar_face_traversal(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::push_relabel(), random_edge(), boost::serialization::save(), boost::detail::parallel::save_edges(), boost::graph_test< Graph >::test_add_edge(), boost::graph_test< Graph >::test_edge_list_graph(), boost::graph_test< Graph >::test_remove_edge(), boost::undirected_graph< VertexProp, EdgeProp, GraphProp >::undirected_graph(), verify_isomorphism(), vf2_graph_iso(), boost::detail::vf2_subgraph_morphism(), write_dimacs_max_flow(), and write_graphviz().

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

EdgeIndex boost::num_edges ( const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g )

inline

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::edges_size_type boost::num_edges

(

const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &

g

)

References num_edges().

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, undirectedS , VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::edges_size_type boost::num_edges

(

const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &

g

)

template<typename Graph , typename Vertex >

graph_traits<Graph>::degree_size_type boost::num_paths_through_vertex ( const Graph &  g, Vertex  v  )

inline

References adjacent_vertices(), BOOST_CONCEPT_ASSERT(), boost::fusion::distance(), end, boost::multiprecision::backends::i, and boost::detail::possible_edges().

Referenced by clustering_coefficient().

template<typename Graph , typename Vertex >

graph_traits<Graph>::degree_size_type boost::num_triangles_on_vertex ( const Graph &  g, Vertex  v  )

inline

References adjacent_vertices(), BOOST_CONCEPT_ASSERT(), count, boost::detail::count_edges(), end, boost::multiprecision::backends::i, and next().

Referenced by clustering_coefficient().

template<typename V , typename D , typename P , typename B >

vertex_list_graph_archetype<V,D,P,B>::vertices_size_type boost::num_vertices

(

const vertex_list_graph_archetype< V, D, P, B > &

)

template<class EdgeList , class Alloc >

std::vector<EdgeList, Alloc>::size_type boost::num_vertices

(

const std::vector< EdgeList, Alloc > &

v

)

long boost::num_vertices ( sgb_const_graph_ptr  g )

inline

template<class BidirectionalGraph , class GRef >

graph_traits<BidirectionalGraph>::vertices_size_type boost::num_vertices ( const reverse_graph< BidirectionalGraph, GRef > &  g )

inline

References boost::reverse_graph< BidirectionalGraph, GraphRef >::m_g, and num_vertices().

template<typename G , typename EP , typename VP >

filtered_graph<G, EP, VP>::vertices_size_type boost::num_vertices

(

const filtered_graph< G, EP, VP > &

g

)

References boost::filtered_graph_base< Graph >::m_g, and num_vertices().

template<class vtype , class etype >

graph_traits< leda::GRAPH<vtype,etype> >::vertices_size_type boost::num_vertices

(

const leda::GRAPH< vtype, etype > &

g

)

template<typename VP , typename EP , typename GP >

undirected_graph<VP,EP,GP>::vertices_size_type boost::num_vertices ( undirected_graph< VP, EP, GP > const &  g )

inline

template<typename VP , typename EP , typename GP >

directed_graph<VP,EP,GP>::vertices_size_type boost::num_vertices ( directed_graph< VP, EP, GP > const &  g )

inline

template<typename G >

subgraph<G>::vertices_size_type boost::num_vertices

(

const subgraph< G > &

g

)

References boost::subgraph< Graph >::m_graph, and num_vertices().

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::degree_size_type boost::num_vertices ( const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g )

inline

References num_vertices().

graph_traits<leda::graph>::vertices_size_type boost::num_vertices

(

const leda::graph &

g

)

template<typename G , typename L , typename S >

labeled_graph<G,L,S>::vertices_size_type boost::num_vertices ( labeled_graph< G, L, S > const &  g )

inline

References num_vertices().

template<typename D , typename VP , typename EP , typename GP , typename A >

adjacency_matrix<D,VP,EP,GP,A>::vertices_size_type boost::num_vertices

(

const adjacency_matrix< D, VP, EP, GP, A > &

g

)

References boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator >::m_vertex_set.

Referenced by add_vertices(), all_clustering_coefficients(), boost::detail::all_cycles_from_vertex(), all_mean_geodesics(), boost::detail::strong_comp_dispatch2< param_not_found >::apply(), boost::detail::edmonds_karp_dispatch2< param_not_found >::apply(), boost::detail::strong_comp_dispatch1< param_not_found >::apply(), boost::detail::edmonds_karp_dispatch1< param_not_found >::apply(), boost::detail::udfs_dispatch< param_not_found >::apply(), boost::detail::copy_graph_impl< 2 >::apply(), boost::detail::bicomp_dispatch3< param_not_found >::apply(), boost::detail::neighbor_bfs_dispatch< param_not_found >::apply(), boost::detail::bicomp_dispatch2< param_not_found >::apply(), boost::detail::bicomp_dispatch1< param_not_found >::apply(), boost::detail::bfs_dispatch< param_not_found >::apply(), boost::compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::assign(), boost::compressed_sparse_row_graph< bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::assign(), aver_wavefront(), boost::detail::base_state< Graph1, Graph2, IndexMap1, IndexMap2 >::base_state(), boost::bc_clustering_threshold< T >::bc_clustering_threshold(), bellman_ford_shortest_paths(), boost::detail::biconnected_components_impl(), boost::concepts::BOOST_concept(), boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::boyer_myrvold_impl(), boykov_kolmogorov_max_flow(), boost::detail::graph::brandes_betweenness_centrality_dispatch2(), boost::detail::vertex_property_map_generator_helper< Graph, IndexMap, Value, true >::build(), boost::detail::default_color_map_generator_helper< Graph, IndexMap, true >::build(), boost::hawick_circuits_detail::call_hawick_circuits(), central_point_dominance(), chrobak_payne_straight_line_drawing(), circle_graph_layout(), boost::compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::compressed_sparse_row_graph(), boost::compressed_sparse_row_graph< bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::compressed_sparse_row_graph(), connected_components(), boost::DistributedVertexListGraphConcept< G >::const_constraints(), copy_component(), copy_graph(), core_numbers(), boost::detail::core_numbers_dispatch(), boost::detail::core_numbers_impl(), cuthill_mckee_ordering(), cycle_canceling(), boost::detail::cycle_canceling_dispatch1(), boost::detail::cycle_canceling_dispatch2(), dag_shortest_paths(), boost::detail::dag_sp_dispatch1(), boost::detail::dijkstra_dispatch1(), boost::detail::dijkstra_no_color_map_dispatch1(), dijkstra_shortest_paths(), dijkstra_shortest_paths_no_color_map_no_init(), dijkstra_shortest_paths_no_init(), edge_connectivity(), boost::detail::RecordEdgeMapAndCycleVertex< PredEdgeMap, Vertex >::edge_not_minimized(), edges(), boost::triangulation_visitor< Graph, VertexIndexMap, AddEdgeVisitor >::end_face(), boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::extract_kuratowski_subgraph(), find_odd_cycle(), boost::detail::mas_min_cut_visitor< ParityMap, WeightMap, IndexMap >::finish_vertex(), fruchterman_reingold_force_directed_layout(), generate_random_graph(), generate_random_graph1(), boost::grid_force_pairs< Topology, PositionMap >::grid_force_pairs(), gursoy_atun_layout(), gursoy_atun_refine(), gursoy_atun_step(), is_bipartite(), is_kuratowski_subgraph(), boost::detail::isomorphism_algo< Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2 >::isomorphism_algo(), boost::detail::isomorphism_impl(), iterative_bit_vector_dominator_tree(), ith_wavefront(), johnson_all_pairs_shortest_paths(), kamada_kawai_spring_layout(), king_ordering(), kosaraju_strong_components(), kruskal_minimum_spanning_tree(), boost::detail::kruskal_mst_impl(), lengauer_tarjan_dominator_tree(), lengauer_tarjan_dominator_tree_without_dfs(), make_connected(), make_container_vertex_map(), boost::detail::map_maker_helper< false, Graph, ArgPack, Value, PM >::make_map(), boost::detail::maximum_adjacency_search(), maximum_adjacency_search(), boost::detail::mcgregor_common_subgraphs_internal_init(), mean_clustering_coefficient(), metric_tsp_approx_from_vertex(), minimum_degree_ordering(), num_vertices(), boost::mean_geodesic_measure< Graph, DistanceType, ResultType, Divides >::operator()(), boost::mean_graph_distance_measure< Graph, DistanceType >::operator()(), boost::detail::graph::brandes_unweighted_shortest_paths::operator()(), boost::GraphPrinter< Graph, no_property, E >::operator()(), boost::detail::make_degree_invariant< G, Index >::operator()(), boost::graph::detail::isomorphism_impl< Graph1, Graph2 >::operator()(), boost::detail::unique_subgraph_interceptor< GraphFirst, GraphSecond, VertexIndexMapFirst, VertexIndexMapSecond, SubGraphCallback >::operator()(), boost::detail::maximum_subgraph_interceptor< GraphFirst, GraphSecond, VertexIndexMapFirst, VertexIndexMapSecond, SubGraphCallback >::operator()(), boost::detail::unique_maximum_subgraph_interceptor< GraphFirst, GraphSecond, VertexIndexMapFirst, VertexIndexMapSecond, SubGraphCallback >::operator()(), boost::compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::edge_iterator::operator++(), planar_canonical_ordering(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::push_relabel(), boost::detail::r_c_shortest_paths_dispatch(), boost::detail::random_spanning_tree_internal(), random_vertex(), boost::detail::rec_two_graphs_common_spanning_trees(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::relabel_distance(), relative_betweenness_centrality(), rms_wavefront(), boost::detail::graph::kamada_kawai_spring_layout_impl< Topology, Graph, PositionMap, WeightMap, EdgeOrSideLength, Done, VertexIndexMap, DistanceMatrix, SpringStrengthMatrix, PartialDerivativeMap >::run(), boost::detail::fr_force_directed_layout< param_not_found >::run(), boost::serialization::save(), scale_graph(), sequential_vertex_coloring(), sloan_ordering(), sloan_start_end_vertices(), smallest_last_vertex_ordering(), boost::detail::sort_vertices(), stoer_wagner_min_cut(), boost::detail::state< Graph1, Graph2, IndexMap1, IndexMap2, EdgeEquivalencePredicate, VertexEquivalencePredicate, SubGraphIsoMapCallback, problem_selection >::success(), boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(), boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(), boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(), boost::graph_test< Graph >::test_add_edge(), boost::graph_test< Graph >::test_add_vertex(), boost::graph_test< Graph >::test_clear_vertex(), boost::detail::isomorphism_algo< Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2 >::test_isomorphism(), boost::graph_test< Graph >::test_remove_edge(), boost::graph_test< Graph >::test_vertex_list_graph(), transitive_closure(), boost::detail::transitive_closure_dispatch(), verify_isomorphism(), boost::maximum_cardinality_matching_verifier< Graph, MateMap, VertexIndexMap >::verify_matching(), vertices(), vf2_graph_iso(), boost::detail::vf2_subgraph_morphism(), warren_transitive_closure(), write_dimacs_max_flow(), and write_graphviz().

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

Vertex boost::num_vertices ( const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g )

inline

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::vertices_size_type boost::num_vertices

(

const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &

g

)

Returns the number of vertices local to this processor.

Note that although this routine matches a valid expression of a VertexListGraph, it does not meet the semantic requirements of VertexListGraph because it returns only a count of local vertices (not all vertices).

References num_vertices().

template<class T , multiprecision::expression_template_option ExpressionTemplates>

multiprecision::number<T, ExpressionTemplates> boost::numerator ( const rational< multiprecision::number< T, ExpressionTemplates > > &  a )

inline

References a.

Referenced by boost::random::detail::generate_uniform_real().

template<typename Target , typename Source >

Target boost::numeric_cast ( Source  arg )

inline

References boost::filesystem::path_traits::convert().

Referenced by boost::geometry::strategy::distance::detail::compute_pythagoras< I, T >::apply(), boost::geometry::strategy::distance::detail::compute_pythagoras_point_box< I >::apply(), boost::geometry::strategy::distance::detail::compute_pythagoras_box_box< I >::apply(), boost::geometry::strategy::distance::detail::compute_pythagoras< 0, T >::apply(), boost::geometry::detail::conversion::point_to_box< Point, Box, Index, Dimension, DimensionCount >::apply(), boost::geometry::strategy::transform::ublas_transformer< CalculationType, 2, 2 >::apply(), boost::geometry::strategy::distance::pythagoras< CalculationType >::apply(), boost::geometry::strategy::centroid::bashein_detmer< Point, PointOfSegment, CalculationType >::apply(), boost::geometry::strategy::transform::ublas_transformer< CalculationType, 3, 3 >::apply(), boost::geometry::strategy::distance::pythagoras_point_box< CalculationType >::apply(), boost::geometry::strategy::distance::pythagoras_box_box< CalculationType >::apply(), boost::geometry::math::detail::round< Result, Source, ResultIsInteger, SourceIsInteger >::apply(), boost::geometry::math::detail::round< Result, Source, true, false >::apply(), boost::geometry::policies::relate::segments_intersection_points< ReturnType >::assign(), boost::geometry::detail::degree_radian_converter< 0, Geometry >::get(), boost::geometry::segment_ratio< Type >::initialize(), boost::geometry::strategy::centroid::bashein_detmer< Point, PointOfSegment, CalculationType >::result(), boost::geometry::detail::degree_radian_converter< 0, Geometry >::set(), and boost::geometry::strategy::transform::detail::transform_coordinates< Src, Dst, D, N, F >::transform().

template<class T >

T boost::numeric_limits_max ( T  )

inline

References boost::accumulators::extract::max.

boost::operator safe_bool

(

)

const

References empty().

bool boost::operator!

(

)

const

References empty().

Referenced by BOOST_THREAD_DCL_MOVABLE_BEG().

template<class Graph , class Resource_Container >

bool boost::operator!= ( const r_c_shortest_paths_label< Graph, Resource_Container > &  l1, const r_c_shortest_paths_label< Graph, Resource_Container > &  l2  )

inline

References boost::r_c_shortest_paths_label< Graph, Resource_Container >::b_is_valid.

bool boost::operator!= ( const blank &  , const blank &    )

inline

template<class _Tp , class _Sequence >

bool boost::operator!=	(	const queue< _Tp, _Sequence > &	__x,
		const queue< _Tp, _Sequence > &	__y
	)

template<class T >

bool boost::operator!= ( scoped_array< T > const &  p, boost::detail::sp_nullptr_t    )

inline

References boost::scoped_array< T >::get().

template<class T >

bool boost::operator!= ( boost::detail::sp_nullptr_t  , scoped_array< T > const &  p  )

inline

References boost::multiprecision::backends::p.

template<class T >

bool boost::operator!= ( scoped_ptr< T > const &  p, boost::detail::sp_nullptr_t    )

inline

References boost::scoped_ptr< T >::get().

template<class T >

bool boost::operator!= ( boost::detail::sp_nullptr_t  , scoped_ptr< T > const &  p  )

inline

References boost::multiprecision::backends::p.

bool boost::operator!= ( type_info_wrapper const &  left, type_info_wrapper const &  right  )

inline

Inequality operator.

References boost::bimaps::support::left, and boost::icl::right().

template<class Base >

boolean_archetype boost::operator!=	(	const equality_comparable_archetype< Base > &	,
		const equality_comparable_archetype< Base > &
	)

template<class Base1 , class Base2 >

boolean_archetype boost::operator!=	(	const equality_comparable2_first_archetype< Base1 > &	,
		const equality_comparable2_second_archetype< Base2 > &
	)

template<class RandomAccessIterator , class traits , class Allocator >

bool boost::operator!= ( const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &  s, const sub_match< RandomAccessIterator > &  m  )

inline

References boost::asio::s, and boost::sub_match< BidiIterator >::str().

template<class T , class U >

bool boost::operator!= ( intrusive_ptr< T > const &  a, intrusive_ptr< U > const &  b  )

inline

References boost::intrusive_ptr< T >::get().

template<class T , class U >

bool boost::operator!= ( intrusive_ptr< T > const &  a, U *  b  )

inline

References boost::asio::b, and boost::intrusive_ptr< T >::get().

template<class T , class U >

bool boost::operator!= ( T *  a, intrusive_ptr< U > const &  b  )

inline

References boost::intrusive_ptr< T >::get().

template<class RandomAccessIterator , class traits , class Allocator >

bool boost::operator!= ( const sub_match< RandomAccessIterator > &  m, const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &  s  )

inline

References boost::sub_match< BidiIterator >::str().

template<class T >

bool boost::operator!= ( intrusive_ptr< T > const &  p, boost::detail::sp_nullptr_t    )

inline

References boost::intrusive_ptr< T >::get().

template<class T >

bool boost::operator!= ( shared_array< T > const &  a, shared_array< T > const &  b  )

inline

References a, and boost::asio::b.

template<class RandomAccessIterator >

bool boost::operator!= ( const sub_match< RandomAccessIterator > &  m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *  s  )

inline

References boost::sub_match< BidiIterator >::str().

template<class T >

bool boost::operator!= ( boost::detail::sp_nullptr_t  , intrusive_ptr< T > const &  p  )

inline

References boost::multiprecision::backends::p.

template<class T >

bool boost::operator!= ( shared_array< T > const &  p, boost::detail::sp_nullptr_t    )

inline

References boost::shared_array< T >::get().

template<class T >

bool boost::operator!= ( boost::detail::sp_nullptr_t  , shared_array< T > const &  p  )

inline

References boost::multiprecision::backends::p.

template<class RandomAccessIterator >

bool boost::operator!= ( typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *  s, const sub_match< RandomAccessIterator > &  m  )

inline

References boost::sub_match< BidiIterator >::str().

template<typename charT , typename traits >

bool boost::operator!= ( basic_string_ref< charT, traits >  x, basic_string_ref< charT, traits >  y  )

inline

References boost::basic_string_ref< charT, traits >::compare(), and boost::basic_string_ref< charT, traits >::size().

template<typename charT , typename traits , typename Allocator >

bool boost::operator!= ( basic_string_ref< charT, traits >  x, const std::basic_string< charT, traits, Allocator > &  y  )

inline

References boost::polygon::y().

template<typename charT , typename traits , typename Allocator >

bool boost::operator!= ( const std::basic_string< charT, traits, Allocator > &  x, basic_string_ref< charT, traits >  y  )

inline

References boost::flyweights::x.

template<class BaseFirst , class BaseSecond , class Tag >

boolean_archetype boost::operator!=	(	const not_equal_op_first_archetype< BaseFirst, Tag > &	,
		const not_equal_op_second_archetype< BaseSecond, Tag > &
	)

template<typename charT , typename traits >

bool boost::operator!= ( basic_string_ref< charT, traits >  x, const charT *  y  )

inline

References boost::polygon::y().

template<typename charT , typename traits >

bool boost::operator!= ( const charT *  x, basic_string_ref< charT, traits >  y  )

inline

References boost::flyweights::x.

template<class RandomAccessIterator >

bool boost::operator!= ( const sub_match< RandomAccessIterator > &  m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &  s  )

inline

References boost::sub_match< BidiIterator >::length(), boost::asio::s, and boost::sub_match< BidiIterator >::str().

template<class RandomAccessIterator >

bool boost::operator!= ( typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &  s, const sub_match< RandomAccessIterator > &  m  )

inline

References boost::sub_match< BidiIterator >::length(), boost::asio::s, and boost::sub_match< BidiIterator >::str().

template<class T , std::size_t N>

bool boost::operator!=	(	const array< T, N > &	x,
		const array< T, N > &	y
	)

References boost::polygon::y().

template<typename Block , typename Allocator >

bool boost::operator!= ( const dynamic_bitset< Block, Allocator > &  a, const dynamic_bitset< Block, Allocator > &  b  )

inline

References boost::asio::b.

template<typename T , typename TagT , typename U >

bool boost::operator!= ( value_ref< T, TagT > const &  left, U const &  right  )

inline

References boost::fusion::not_equal_to().

template<typename U , typename T , typename TagT >

bool boost::operator!= ( U const &  left, value_ref< T, TagT > const &  right  )

inline

References boost::fusion::not_equal_to().

template<typename T1 , typename TagT1 , typename T2 , typename TagT2 >

bool boost::operator!= ( value_ref< T1, TagT1 > const &  left, value_ref< T2, TagT2 > const &  right  )

inline

template<class IteratorT , class ForwardRange >

BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_<boost::is_base_and_derived<iterator_range_detail::iterator_range_tag, ForwardRange> >, bool >::type boost::operator!= ( const ForwardRange &  l, const iterator_range< IteratorT > &  r  )

inline

References boost::iterator_range_detail::equal().

template<class Iterator1T , class Iterator2T >

bool boost::operator!= ( const iterator_range< Iterator1T > &  l, const iterator_range< Iterator2T > &  r  )

inline

References boost::iterator_range_detail::equal().

template<class IteratorT , class ForwardRange >

BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_<boost::is_base_and_derived<iterator_range_detail::iterator_range_tag, ForwardRange> >, bool >::type boost::operator!= ( const iterator_range< IteratorT > &  l, const ForwardRange &  r  )

inline

References boost::iterator_range_detail::equal().

template<class T , class U >

bool boost::operator!= ( shared_ptr< T > const &  a, shared_ptr< U > const &  b  )

inline

References a, and boost::asio::b.

bool boost::operator!= ( const function_base &  f, detail::function::useless_clear_type *    )

inline

References boost::function_base::empty().

bool boost::operator!= ( detail::function::useless_clear_type *  , const function_base &  f  )

inline

References boost::function_base::empty().

template<class T >

bool boost::operator!= ( shared_ptr< T > const &  p, boost::detail::sp_nullptr_t    )

inline

template<class T >

bool boost::operator!= ( boost::detail::sp_nullptr_t  , shared_ptr< T > const &  p  )

inline

References boost::multiprecision::backends::p.

template<typename Functor >

typename ::boost::enable_if_c<(::boost::type_traits::ice_not< (::boost::is_integral< Functor >::value)>::value), bool >::type boost::operator!=	(	const function_base &	f,
		Functor	g
	)

References function_equal().

template<typename Functor >

typename ::boost::enable_if_c<(::boost::type_traits::ice_not< (::boost::is_integral< Functor >::value)>::value), bool >::type boost::operator!=	(	Functor	g,
		const function_base &	f
	)

References function_equal().

template<typename Functor >

typename ::boost::enable_if_c<(::boost::type_traits::ice_not< (::boost::is_integral< Functor >::value)>::value), bool >::type boost::operator!=	(	const function_base &	f,
		reference_wrapper< Functor >	g
	)

template<typename Functor >

typename ::boost::enable_if_c<(::boost::type_traits::ice_not< (::boost::is_integral< Functor >::value)>::value), bool >::type boost::operator!=	(	reference_wrapper< Functor >	g,
		const function_base &	f
	)

template<typename T , typename L >

bool boost::operator!=	(	synchronized_value< T, L > const &	lhs,
		synchronized_value< T, L > const &	rhs
	)

template<typename T , typename L >

bool boost::operator!=	(	T const &	lhs,
		synchronized_value< T, L > const &	rhs
	)

template<class T >

bool boost::operator!= ( optional< T > const &  x, optional< T > const &  y  )

inline

References boost::polygon::y().

template<class T >

bool boost::operator!= ( optional< T > const &  x, T const &  y  )

inline

References boost::polygon::y().

template<class T >

bool boost::operator!= ( T const &  x, optional< T > const &  y  )

inline

References boost::polygon::y().

template<class T >

bool boost::operator!= ( optional< T > const &  x, none_t    )

inline

template<class T >

bool boost::operator!= ( none_t  , optional< T > const &  y  )

inline

References boost::polygon::y().

template<class T , class Alloc >

bool boost::operator!= ( const circular_buffer_space_optimized< T, Alloc > &  lhs, const circular_buffer_space_optimized< T, Alloc > &  rhs  )

inline

Test two space optimized circular buffers for non-equality.

template<class T , multiprecision::expression_template_option ExpressionTemplates, class Arithmetic >

boost::enable_if<boost::is_arithmetic<Arithmetic>, bool>::type boost::operator!=	(	const rational< multiprecision::number< T, ExpressionTemplates > > &	a,
		const Arithmetic &	b
	)

References a, and boost::asio::b.

template<class T , multiprecision::expression_template_option ExpressionTemplates, class Arithmetic >

boost::enable_if<boost::is_arithmetic<Arithmetic>, bool>::type boost::operator!=	(	const Arithmetic &	b,
		const rational< multiprecision::number< T, ExpressionTemplates > > &	a
	)

References a, and boost::asio::b.

template<class T , class Alloc >

bool boost::operator!= ( const circular_buffer< T, Alloc > &  lhs, const circular_buffer< T, Alloc > &  rhs  )

inline

Compare two circular_buffers element-by-element to determine if they are non-equal.

Parameters

lhs	The circular_buffer to compare.
rhs	The circular_buffer to compare.

Returns

!(lhs == rhs)

Exceptions

Nothing.

Complexity

Linear (in the size of the circular_buffers).

Iterator Invalidation

Does not invalidate any iterators.

See also

operator==(const circular_buffer<T,Alloc>&, const circular_buffer<T,Alloc>&)

template<class Base >

modable_archetype<Base> boost::operator%	(	const modable_archetype< Base > &	,
		const modable_archetype< Base > &
	)

template<class Return , class BaseFirst , class BaseSecond >

Return boost::operator%	(	const mod_op_first_archetype< Return, BaseFirst > &	,
		const mod_op_second_archetype< Return, BaseSecond > &
	)

template<typename Block , typename Allocator >

dynamic_bitset< Block, Allocator > boost::operator&	(	const dynamic_bitset< Block, Allocator > &	b1,
		const dynamic_bitset< Block, Allocator > &	b2
	)

References boost::asio::b, and boost::polygon::y().

template<class Base >

multipliable_archetype<Base> boost::operator*	(	const multipliable_archetype< Base > &	,
		const multipliable_archetype< Base > &
	)

template<class Return , class BaseFirst , class BaseSecond >

Return boost::operator*	(	const time_op_first_archetype< Return, BaseFirst > &	,
		const time_op_second_archetype< Return, BaseSecond > &
	)

template<typename IntType >

rational<IntType> boost::operator+ ( const rational< IntType > &  r )

inline

template<class Base >

addable_archetype<Base> boost::operator+	(	const addable_archetype< Base > &	,
		const addable_archetype< Base > &
	)

template<class Return , class BaseFirst , class BaseSecond >

Return boost::operator+	(	const plus_op_first_archetype< Return, BaseFirst > &	,
		const plus_op_second_archetype< Return, BaseSecond > &
	)

template<class RandomAccessIterator , class traits , class Allocator >

std::basic_string<typename re_detail::regex_iterator_traits<RandomAccessIterator>::value_type, traits, Allocator> boost::operator+ ( const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &  s, const sub_match< RandomAccessIterator > &  m  )

inline

References boost::sub_match< BidiIterator >::length().

template<class RandomAccessIterator , class traits , class Allocator >

std::basic_string<typename re_detail::regex_iterator_traits<RandomAccessIterator>::value_type, traits, Allocator> boost::operator+ ( const sub_match< RandomAccessIterator > &  m, const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &  s  )

inline

References boost::sub_match< BidiIterator >::length().

template<class RandomAccessIterator >

std::basic_string<typename re_detail::regex_iterator_traits<RandomAccessIterator>::value_type> boost::operator+ ( typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *  s, const sub_match< RandomAccessIterator > &  m  )

inline

References boost::sub_match< BidiIterator >::length().

template<class RandomAccessIterator >

std::basic_string<typename re_detail::regex_iterator_traits<RandomAccessIterator>::value_type> boost::operator+ ( const sub_match< RandomAccessIterator > &  m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *  s  )

inline

References boost::sub_match< BidiIterator >::length().

template<class RandomAccessIterator >

std::basic_string<typename re_detail::regex_iterator_traits<RandomAccessIterator>::value_type> boost::operator+ ( typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &  s, const sub_match< RandomAccessIterator > &  m  )

inline

References boost::sub_match< BidiIterator >::length().

template<class RandomAccessIterator >

std::basic_string<typename re_detail::regex_iterator_traits<RandomAccessIterator>::value_type> boost::operator+ ( const sub_match< RandomAccessIterator > &  m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &  s  )

inline

References boost::sub_match< BidiIterator >::length().

template<class RandomAccessIterator >

std::basic_string<typename re_detail::regex_iterator_traits<RandomAccessIterator>::value_type> boost::operator+ ( const sub_match< RandomAccessIterator > &  m1, const sub_match< RandomAccessIterator > &  m2  )

inline

References boost::sub_match< BidiIterator >::length().

template<class T >

random_access_iterator_archetype<T> boost::operator+	(	typename random_access_iterator_archetype< T >::difference_type	,
		const random_access_iterator_archetype< T > &	x
	)

References boost::flyweights::x.

template<class T >

mutable_random_access_iterator_archetype<T> boost::operator+	(	typename mutable_random_access_iterator_archetype< T >::difference_type	,
		const mutable_random_access_iterator_archetype< T > &	x
	)

References boost::flyweights::x.

template<typename IntType >

rational<IntType> boost::operator- ( const rational< IntType > &  r )

inline

template<class Base >

subtractable_archetype<Base> boost::operator-	(	const subtractable_archetype< Base > &	,
		const subtractable_archetype< Base > &
	)

template<class Return , class BaseFirst , class BaseSecond >

Return boost::operator-	(	const subtract_op_first_archetype< Return, BaseFirst > &	,
		const subtract_op_second_archetype< Return, BaseSecond > &
	)

template<typename Block , typename Allocator >

dynamic_bitset< Block, Allocator > boost::operator-	(	const dynamic_bitset< Block, Allocator > &	b1,
		const dynamic_bitset< Block, Allocator > &	b2
	)

References boost::asio::b, and boost::polygon::y().

template<class Base >

dividable_archetype<Base> boost::operator/	(	const dividable_archetype< Base > &	,
		const dividable_archetype< Base > &
	)

template<class Return , class BaseFirst , class BaseSecond >

Return boost::operator/	(	const divide_op_first_archetype< Return, BaseFirst > &	,
		const divide_op_second_archetype< Return, BaseSecond > &
	)

template<class _Tp , class _Seq >

bool boost::operator< ( const queue< _Tp, _Seq > &  , const queue< _Tp, _Seq > &    )

inline

template<typename T , typename U >

bool boost::operator<	(	unsafe_pair< T, U > const &	x,
		unsafe_pair< T, U > const &	y
	)

References boost::xpressive::make_pair, and boost::polygon::y().

template<class _Tp , class _Sequence >

bool boost::operator<	(	const queue< _Tp, _Sequence > &	__x,
		const queue< _Tp, _Sequence > &	__y
	)

References boost::queue< _Tp, _Sequence >::c.

bool boost::operator< ( const blank &  , const blank &    )

inline

template<class Graph , class Resource_Container >

bool boost::operator< ( const r_c_shortest_paths_label< Graph, Resource_Container > &  l1, const r_c_shortest_paths_label< Graph, Resource_Container > &  l2  )

inline

References boost::r_c_shortest_paths_label< Graph, Resource_Container >::b_is_valid, and boost::r_c_shortest_paths_label< Graph, Resource_Container >::cumulated_resource_consumption.

template<class RandomAccessIterator , class traits , class Allocator >

bool boost::operator< ( const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &  s, const sub_match< RandomAccessIterator > &  m  )

inline

References boost::sub_match< BidiIterator >::compare().

template<class Base >

boolean_archetype boost::operator<	(	const less_than_comparable_archetype< Base > &	,
		const less_than_comparable_archetype< Base > &
	)

template<class Base >

boolean_archetype boost::operator<	(	const comparable_archetype< Base > &	,
		const comparable_archetype< Base > &
	)

template<class RandomAccessIterator , class traits , class Allocator >

bool boost::operator< ( const sub_match< RandomAccessIterator > &  m, const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &  s  )

inline

template<class T , class U >

bool boost::operator< ( weak_ptr< T > const &  a, weak_ptr< U > const &  b  )

inline

References boost::asio::b.

template<class RandomAccessIterator >

bool boost::operator< ( const sub_match< RandomAccessIterator > &  m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *  s  )

inline

template<class T >

bool boost::operator< ( intrusive_ptr< T > const &  a, intrusive_ptr< T > const &  b  )

inline

template<class T >

bool boost::operator< ( shared_array< T > const &  a, shared_array< T > const &  b  )

inline

References boost::asio::b.

template<class RandomAccessIterator >

bool boost::operator< ( typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *  s, const sub_match< RandomAccessIterator > &  m  )

inline

References boost::sub_match< BidiIterator >::str().

template<class BaseFirst , class BaseSecond , class Tag >

boolean_archetype boost::operator<	(	const less_than_op_first_archetype< BaseFirst, Tag > &	,
		const less_than_op_second_archetype< BaseSecond, Tag > &
	)

template<typename charT , typename traits >

bool boost::operator< ( basic_string_ref< charT, traits >  x, basic_string_ref< charT, traits >  y  )

inline

References boost::polygon::y().

template<class RandomAccessIterator >

bool boost::operator< ( const sub_match< RandomAccessIterator > &  m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &  s  )

inline

References boost::asio::s.

template<typename charT , typename traits , typename Allocator >

bool boost::operator< ( basic_string_ref< charT, traits >  x, const std::basic_string< charT, traits, Allocator > &  y  )

inline

References boost::polygon::y().

template<typename charT , typename traits , typename Allocator >

bool boost::operator< ( const std::basic_string< charT, traits, Allocator > &  x, basic_string_ref< charT, traits >  y  )

inline

References boost::flyweights::x, and boost::polygon::y().

template<typename charT , typename traits >

bool boost::operator< ( basic_string_ref< charT, traits >  x, const charT *  y  )

inline

References boost::polygon::y().

template<typename charT , typename traits >

bool boost::operator< ( const charT *  x, basic_string_ref< charT, traits >  y  )

inline

References boost::flyweights::x, and boost::polygon::y().

template<class RandomAccessIterator >

bool boost::operator< ( typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &  s, const sub_match< RandomAccessIterator > &  m  )

inline

References boost::asio::s, and boost::sub_match< BidiIterator >::str().

template<class T , std::size_t N>

bool boost::operator<	(	const array< T, N > &	x,
		const array< T, N > &	y
	)

References boost::algorithm::lexicographical_compare(), and boost::polygon::y().

Referenced by boost::rational< IntType >::operator>().

template<typename T , typename TagT , typename U >

bool boost::operator< ( value_ref< T, TagT > const &  left, U const &  right  )

inline

References boost::fusion::less(), and boost::icl::right().

template<typename U , typename T , typename TagT >

bool boost::operator< ( U const &  left, value_ref< T, TagT > const &  right  )

inline

References boost::fusion::less(), and boost::icl::right().

template<typename T1 , typename TagT1 , typename T2 , typename TagT2 >

bool boost::operator< ( value_ref< T1, TagT1 > const &  left, value_ref< T2, TagT2 > const &  right  )

inline

References boost::icl::right().

template<class IteratorT , class ForwardRange >

BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_<boost::is_base_and_derived<iterator_range_detail::iterator_range_tag, ForwardRange> >, bool >::type boost::operator< ( const ForwardRange &  l, const iterator_range< IteratorT > &  r  )

inline

References boost::iterator_range_detail::less_than().

template<class Iterator1T , class Iterator2T >

bool boost::operator< ( const iterator_range< Iterator1T > &  l, const iterator_range< Iterator2T > &  r  )

inline

References boost::iterator_range_detail::less_than().

template<class IteratorT , class ForwardRange >

BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_<boost::is_base_and_derived<iterator_range_detail::iterator_range_tag, ForwardRange> >, bool >::type boost::operator< ( const iterator_range< IteratorT > &  l, const ForwardRange &  r  )

inline

References boost::iterator_range_detail::less_than().

template<class T , class U >

bool boost::operator< ( shared_ptr< T > const &  a, shared_ptr< U > const &  b  )

inline

References boost::asio::b.

template<typename T , typename L >

bool boost::operator<	(	T const &	lhs,
		synchronized_value< T, L > const &	rhs
	)

template<class T >

bool boost::operator< ( optional< T > const &  x, optional< T > const &  y  )

inline

References less_pointees(), and boost::polygon::y().

template<class T >

bool boost::operator< ( optional< T > const &  x, T const &  y  )

inline

References less_pointees(), and boost::polygon::y().

template<class T >

bool boost::operator< ( T const &  x, optional< T > const &  y  )

inline

References less_pointees(), and boost::polygon::y().

template<class T >

bool boost::operator< ( optional< T > const &  x, none_t    )

inline

References less_pointees().

template<typename Block , typename Allocator >

bool boost::operator<	(	const dynamic_bitset< Block, Allocator > &	a,
		const dynamic_bitset< Block, Allocator > &	b
	)

References boost::asio::b.

template<class T >

bool boost::operator< ( none_t  , optional< T > const &  y  )

inline

References less_pointees(), and boost::polygon::y().

template<class T , class Alloc >

bool boost::operator< ( const circular_buffer_space_optimized< T, Alloc > &  lhs, const circular_buffer_space_optimized< T, Alloc > &  rhs  )

inline

Lexicographical comparison.

References boost::algorithm::lexicographical_compare().

template<class T , class Alloc >

bool boost::operator< ( const circular_buffer< T, Alloc > &  lhs, const circular_buffer< T, Alloc > &  rhs  )

inline

Compare two circular_buffers element-by-element to determine if the left one is lesser than the right one.

Parameters

lhs	The circular_buffer to compare.
rhs	The circular_buffer to compare.

Returns

std::lexicographical_compare(lhs.begin(), lhs.end(), rhs.begin(), rhs.end())

Exceptions

Nothing.

Complexity

Linear (in the size of the circular_buffers).

Iterator Invalidation

Does not invalidate any iterators.

References boost::algorithm::lexicographical_compare().

template<typename IteratorT , typename Elem , typename Traits >

std::basic_ostream<Elem,Traits>& boost::operator<< ( std::basic_ostream< Elem, Traits > &  Os, const iterator_range< IteratorT > &  r  )

inline

iterator_range output operator

Output the range to an ostream. Elements are outputted in a sequence without separators.

References boost::iterator_range_detail::iterator_range_base< IteratorT, BOOST_DEDUCED_TYPENAME iterator_range_detail::pure_iterator_traversal< IteratorT >::type >::begin(), BOOST_DEDUCED_TYPENAME, boost::filesystem::detail::copy(), boost::iterator_range_detail::iterator_range_base< IteratorT, BOOST_DEDUCED_TYPENAME iterator_range_detail::pure_iterator_traversal< IteratorT >::type >::end(), and boost::detail::type.

template<class Ch , class Tr , class Alloc >

std::basic_ostream<Ch, Tr>& boost::operator<<	(	std::basic_ostream< Ch, Tr > &	os,
		const basic_format< Ch, Tr, Alloc > &	f
	)

References boost::basic_format< Ch, Tr, Alloc >::exceptions(), boost::multiprecision::backends::i, boost::basic_format< Ch, Tr, Alloc >::str(), throw_exception(), and boost::io::too_few_args_bit.

template<class E >

E const& boost::operator<< ( E const &  x, tuple< > const &  v  )

inline

References boost::flyweights::x.

template<typename CharT , typename TraitsT >

std::basic_ostream< CharT, TraitsT >& boost::operator<< ( std::basic_ostream< CharT, TraitsT > &  strm, bounded_dump_manip const &  manip  )

inline

The operator outputs binary data to a stream.

References boost::aux::dump_data(), and size().

template<typename CharT , typename TraitsT >

std::basic_ostream< CharT, TraitsT >& boost::operator<< ( std::basic_ostream< CharT, TraitsT > &  strm, dump_manip const &  manip  )

inline

The operator outputs binary data to a stream.

References boost::aux::dump_data().

template<typename CharT , typename TraitsT , typename AllocatorT , typename T , typename TagT >

basic_formatting_ostream< CharT, TraitsT, AllocatorT >& boost::operator<< ( basic_formatting_ostream< CharT, TraitsT, AllocatorT > &  strm, to_log_manip< T, TagT >  manip  )

inline

template<typename CharT , typename TraitsT , typename T , typename TagT >

std::basic_ostream< CharT, TraitsT >& boost::operator<< ( std::basic_ostream< CharT, TraitsT > &  strm, to_log_manip< T, TagT >  manip  )

inline

template<typename OStream >

OStream& boost::operator<<	(	OStream &	os,
		caller_context_t const &	ctx
	)

References boost::caller_context_t::filename, boost::caller_context_t::func, boost::bimaps::support::left, boost::caller_context_t::lineno, and boost::icl::right().

template<class E , class Tag1 , class T1 >

E const& boost::operator<< ( E const &  x, tuple< error_info< Tag1, T1 > > const &  v  )

inline

template<typename CharT , typename T >

basic_wrap_stringstream<CharT>& boost::operator<< ( basic_wrap_stringstream< CharT > &  targ, T const &  t  )

inline

References boost::flyweights::t.

template<typename CharT , typename RefT >

basic_record_ostream< CharT >& boost::operator<< ( basic_record_ostream< CharT > &  strm, add_value_manip< RefT > const &  manip  )

inline

The operator attaches an attribute value to the log record.

References boost::record::attribute_values(), boost::basic_record_ostream< CharT >::get_record(), boost::attribute_value_set::insert(), and boost::program_options::value().

template<class E , class Tag1 , class T1 , class Tag2 , class T2 >

E const& boost::operator<< ( E const &  x, tuple< error_info< Tag1, T1 >, error_info< Tag2, T2 > > const &  v  )

inline

template<class E , class Tag1 , class T1 , class Tag2 , class T2 , class Tag3 , class T3 >

E const& boost::operator<< ( E const &  x, tuple< error_info< Tag1, T1 >, error_info< Tag2, T2 >, error_info< Tag3, T3 > > const &  v  )

inline

template<class E , class Tag1 , class T1 , class Tag2 , class T2 , class Tag3 , class T3 , class Tag4 , class T4 >

E const& boost::operator<< ( E const &  x, tuple< error_info< Tag1, T1 >, error_info< Tag2, T2 >, error_info< Tag3, T3 >, error_info< Tag4, T4 > > const &  v  )

inline

template<typename CharT >

basic_wrap_stringstream<CharT>& boost::operator<< ( basic_wrap_stringstream< CharT > &  targ, basic_wrap_stringstream< CharT > &  src  )

inline

References boost::basic_wrap_stringstream< CharT >::str().

template<typename Stream , typename RecursiveMutex , typename T >

const stream_guard<Stream, RecursiveMutex>& boost::operator<< ( const stream_guard< Stream, RecursiveMutex > &  lck, T  arg  )

inline

References boost::stream_guard< Stream, RecursiveMutex >::get().

template<typename Stream , typename RecursiveMutex >

const stream_guard<Stream, RecursiveMutex>& boost::operator<< ( const stream_guard< Stream, RecursiveMutex > &  lck, Stream &(*)(Stream &)  arg  )

inline

References boost::stream_guard< Stream, RecursiveMutex >::get().

template<typename Stream , typename RecursiveMutex , typename T >

stream_guard<Stream, RecursiveMutex> boost::operator<< ( externally_locked_stream< Stream, RecursiveMutex > &  mtx, T  arg  )

inline

References boost::stream_guard< Stream, RecursiveMutex >::get(), and move().

template<typename Stream , typename RecursiveMutex >

stream_guard<Stream, RecursiveMutex> boost::operator<< ( externally_locked_stream< Stream, RecursiveMutex > &  mtx, Stream &(*)(Stream &)  arg  )

inline

References boost::stream_guard< Stream, RecursiveMutex >::get(), and move().

template<typename CharT , typename TraitsT >

BOOST_LOG_API std::basic_ostream< CharT, TraitsT >& boost::operator<<	(	std::basic_ostream< CharT, TraitsT > &	strm,
		attribute_name const &	name
	)

template<class E , class Tag , class T >

enable_if<exception_detail::derives_boost_exception<E>,E const &>::type boost::operator<< ( E const &  x, error_info< Tag, T > const &  v  )

inline

References boost::exception_detail::set_info(), and boost::flyweights::x.

template<class E , class T , class Y >

std::basic_ostream<E, T>& boost::operator<<	(	std::basic_ostream< E, T > &	os,
		intrusive_ptr< Y > const &	p
	)

References boost::intrusive_ptr< T >::get().

template<class Graph , class VP , class EP >

std::ostream& boost::operator<<	(	std::ostream &	out,
		const GraphPrinter< Graph, VP, EP > &	gp
	)

output stream for writing a graph

References out.

template<class charT , class traits >

std::basic_ostream<charT, traits>& boost::operator<< ( std::basic_ostream< charT, traits > &  os, const basic_string_ref< charT, traits > &  str  )

inline

References boost::detail::insert_aligned(), size(), and str().

template<class charT , class traits , class RandomAccessIterator >

std::basic_ostream<charT, traits>& boost::operator<<	(	std::basic_ostream< charT, traits > &	os,
		const sub_match< RandomAccessIterator > &	s
	)

template<typename CharT , typename TraitsT , typename T , typename TagT >

std::basic_ostream< CharT, TraitsT >& boost::operator<< ( std::basic_ostream< CharT, TraitsT > &  strm, value_ref< T, TagT > const &  val  )

inline

Stream output operator.

References bind_output(), and boost::phoenix::val().

template<typename CharT , typename TraitsT , typename AllocatorT , typename T , typename TagT >

basic_formatting_ostream< CharT, TraitsT, AllocatorT >& boost::operator<< ( basic_formatting_ostream< CharT, TraitsT, AllocatorT > &  strm, value_ref< T, TagT > const &  val  )

inline

Log formatting operator.

References boost::phoenix::val().

template<typename CharT , typename StrmTraitsT , typename LitTraitsT >

std::basic_ostream< CharT, StrmTraitsT >& boost::operator<< ( std::basic_ostream< CharT, StrmTraitsT > &  strm, basic_string_literal< CharT, LitTraitsT > const &  lit  )

inline

Output operator.

References boost::basic_string_literal< CharT, TraitsT >::c_str(), boost::aux::insert_aligned(), size(), and boost::basic_string_literal< CharT, TraitsT >::size().

template<typename CharT , typename Traits , typename Block , typename Allocator >

std::basic_ostream<CharT, Traits>& boost::operator<<	(	std::basic_ostream< CharT, Traits > &	os,
		const dynamic_bitset< Block, Allocator > &	b
	)

template<typename IntType >

std::ostream& boost::operator<<	(	std::ostream &	os,
		const rational< IntType > &	r
	)

template<typename ValueType >

sync_queue<ValueType>& boost::operator<<	(	sync_queue< ValueType > &	sbq,
		ValueType const &	elem
	)

References boost::sync_queue< ValueType >::push_back().

template<typename ValueType >

sync_queue<ValueType>& boost::operator<<	(	sync_queue< ValueType > &	sbq,
		BOOST_THREAD_RV_REF(ValueType)	elem
	)

References move(), and boost::sync_queue< ValueType >::push_back().

template<class charT , class traits , class BidiIterator , class Allocator >

std::basic_ostream<charT, traits>& boost::operator<<	(	std::basic_ostream< charT, traits > &	os,
		const match_results< BidiIterator, Allocator > &	s
	)

References boost::asio::s.

template<class charT , class traits , class traits2 >

std::basic_ostream<charT, traits>& boost::operator<<	(	std::basic_ostream< charT, traits > &	os,
		const basic_regex< charT, traits2 > &	e
	)

template<typename CharT , typename TraitsT , typename AllocatorT , typename T >

basic_formatting_ostream< CharT, TraitsT, AllocatorT >& boost::operator<< ( basic_formatting_ostream< CharT, TraitsT, AllocatorT > &  strm, T const &  value  )

inline

References boost::program_options::value().

template<typename CharT , typename TraitsT , typename AllocatorT , typename T >

basic_formatting_ostream< CharT, TraitsT, AllocatorT >& boost::operator<< ( basic_formatting_ostream< CharT, TraitsT, AllocatorT > &&  strm, T &  value  )

inline

References boost::program_options::value().

template<typename CharT , typename TraitsT , typename AllocatorT , typename T >

basic_formatting_ostream< CharT, TraitsT, AllocatorT >& boost::operator<< ( basic_formatting_ostream< CharT, TraitsT, AllocatorT > &&  strm, T const &  value  )

inline

References boost::program_options::value().

template<typename CharT , typename TraitsT , typename AllocatorT , typename T >

basic_formatting_ostream< CharT, TraitsT, AllocatorT >& boost::operator<< ( basic_formatting_ostream< CharT, TraitsT, AllocatorT > &  strm, T &  value  )

inline

References boost::program_options::value().

template<typename ValueType >

sync_bounded_queue<ValueType>& boost::operator<<	(	sync_bounded_queue< ValueType > &	sbq,
		BOOST_THREAD_RV_REF(ValueType)	elem
	)

References move(), and boost::sync_bounded_queue< ValueType >::push_back().

template<typename ValueType >

sync_bounded_queue<ValueType>& boost::operator<<	(	sync_bounded_queue< ValueType > &	sbq,
		ValueType const &	elem
	)

References boost::sync_bounded_queue< ValueType >::push_back().

template<class E , class T , class Y >

std::basic_ostream<E, T>& boost::operator<<	(	std::basic_ostream< E, T > &	os,
		shared_ptr< Y > const &	p
	)

template<typename OStream , typename T , typename L >

OStream& boost::operator<< ( OStream &  os, synchronized_value< T, L > const &  rhs  )

inline

References boost::synchronized_value< T, Lockable >::save().

template<class CharType , class CharTrait , class T >

std::basic_ostream< CharType, CharTrait > & boost::operator<< ( std::basic_ostream< CharType, CharTrait > &  out, optional< T > const &  v  )

inline

References out.

template<typename Ch , typename Tr , typename Block , typename Alloc >

std::basic_ostream<Ch, Tr>& boost::operator<<	(	std::basic_ostream< Ch, Tr > &	os,
		const dynamic_bitset< Block, Alloc > &	b
	)

References boost::asio::b, BOOST_CATCH, BOOST_CATCH_END, BOOST_DYNAMIC_BITSET_CTYPE_FACET, BOOST_DYNAMIC_BITSET_WIDEN_CHAR, BOOST_RETHROW, BOOST_TRY, boost::asio::error::eof, boost::regex_constants::failbit, boost::multiprecision::backends::i, boost::bimaps::support::left, boost::iostreams::bzip2::ok, and boost::multiprecision::width().

bool boost::operator<= ( const blank &  , const blank &    )

inline

template<class _Tp , class _Sequence >

bool boost::operator<=	(	const queue< _Tp, _Sequence > &	__x,
		const queue< _Tp, _Sequence > &	__y
	)

template<class Graph , class Resource_Container >

bool boost::operator<= ( const r_c_shortest_paths_label< Graph, Resource_Container > &  l1, const r_c_shortest_paths_label< Graph, Resource_Container > &  l2  )

inline

References boost::r_c_shortest_paths_label< Graph, Resource_Container >::b_is_valid.

bool boost::operator<= ( type_info_wrapper const &  left, type_info_wrapper const &  right  )

inline

Ordering operator.

References boost::bimaps::support::left, and boost::icl::right().

template<class RandomAccessIterator , class traits , class Allocator >

bool boost::operator<= ( const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &  s, const sub_match< RandomAccessIterator > &  m  )

inline

References boost::sub_match< BidiIterator >::compare().

template<class Base >

boolean_archetype boost::operator<=	(	const comparable_archetype< Base > &	,
		const comparable_archetype< Base > &
	)

template<class RandomAccessIterator , class traits , class Allocator >

bool boost::operator<= ( const sub_match< RandomAccessIterator > &  m, const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &  s  )

inline

template<class RandomAccessIterator >

bool boost::operator<= ( const sub_match< RandomAccessIterator > &  m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *  s  )

inline

template<class RandomAccessIterator >

bool boost::operator<= ( typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *  s, const sub_match< RandomAccessIterator > &  m  )

inline

References boost::sub_match< BidiIterator >::str().

template<class BaseFirst , class BaseSecond , class Tag >

boolean_archetype boost::operator<=	(	const less_equal_op_first_archetype< BaseFirst, Tag > &	,
		const less_equal_op_second_archetype< BaseSecond, Tag > &
	)

template<class RandomAccessIterator >

bool boost::operator<= ( const sub_match< RandomAccessIterator > &  m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &  s  )

inline

References boost::asio::s.

template<class RandomAccessIterator >

bool boost::operator<= ( typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &  s, const sub_match< RandomAccessIterator > &  m  )

inline

References boost::asio::s, and boost::sub_match< BidiIterator >::str().

template<typename charT , typename traits >

bool boost::operator<= ( basic_string_ref< charT, traits >  x, basic_string_ref< charT, traits >  y  )

inline

References boost::polygon::y().

template<class T , std::size_t N>

bool boost::operator<=	(	const array< T, N > &	x,
		const array< T, N > &	y
	)

References boost::flyweights::x, and boost::polygon::y().

template<typename charT , typename traits , typename Allocator >

bool boost::operator<= ( basic_string_ref< charT, traits >  x, const std::basic_string< charT, traits, Allocator > &  y  )

inline

References boost::polygon::y().

template<typename charT , typename traits , typename Allocator >

bool boost::operator<= ( const std::basic_string< charT, traits, Allocator > &  x, basic_string_ref< charT, traits >  y  )

inline

References boost::flyweights::x, and boost::polygon::y().

template<typename charT , typename traits >

bool boost::operator<= ( basic_string_ref< charT, traits >  x, const charT *  y  )

inline

References boost::polygon::y().

template<typename charT , typename traits >

bool boost::operator<= ( const charT *  x, basic_string_ref< charT, traits >  y  )

inline

References boost::flyweights::x, and boost::polygon::y().

template<typename Block , typename Allocator >

bool boost::operator<= ( const dynamic_bitset< Block, Allocator > &  a, const dynamic_bitset< Block, Allocator > &  b  )

inline

References boost::asio::b.

template<typename T , typename TagT , typename U >

bool boost::operator<= ( value_ref< T, TagT > const &  left, U const &  right  )

inline

References boost::fusion::less_equal(), and boost::icl::right().

template<typename U , typename T , typename TagT >

bool boost::operator<= ( U const &  left, value_ref< T, TagT > const &  right  )

inline

References boost::fusion::less_equal(), and boost::icl::right().

template<typename T1 , typename TagT1 , typename T2 , typename TagT2 >

bool boost::operator<= ( value_ref< T1, TagT1 > const &  left, value_ref< T2, TagT2 > const &  right  )

inline

References boost::icl::right().

template<class IteratorT , class ForwardRange >

BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_<boost::is_base_and_derived<iterator_range_detail::iterator_range_tag, ForwardRange> >, bool >::type boost::operator<= ( const ForwardRange &  l, const iterator_range< IteratorT > &  r  )

inline

References boost::iterator_range_detail::less_or_equal_than().

template<class Iterator1T , class Iterator2T >

bool boost::operator<= ( const iterator_range< Iterator1T > &  l, const iterator_range< Iterator2T > &  r  )

inline

References boost::iterator_range_detail::less_or_equal_than().

template<class IteratorT , class ForwardRange >

BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_<boost::is_base_and_derived<iterator_range_detail::iterator_range_tag, ForwardRange> >, bool >::type boost::operator<= ( const iterator_range< IteratorT > &  l, const ForwardRange &  r  )

inline

References boost::iterator_range_detail::less_or_equal_than().

template<typename T , typename L >

bool boost::operator<=	(	T const &	lhs,
		synchronized_value< T, L > const &	rhs
	)

template<class T >

bool boost::operator<= ( optional< T > const &  x, optional< T > const &  y  )

inline

References boost::flyweights::x, and boost::polygon::y().

template<class T >

bool boost::operator<= ( optional< T > const &  x, T const &  y  )

inline

References boost::flyweights::x, and boost::polygon::y().

template<class T >

bool boost::operator<= ( T const &  x, optional< T > const &  y  )

inline

References boost::flyweights::x, and boost::polygon::y().

template<class T >

bool boost::operator<= ( optional< T > const &  x, none_t  y  )

inline

References boost::flyweights::x, and boost::polygon::y().

template<class T >

bool boost::operator<= ( none_t  x, optional< T > const &  y  )

inline

References boost::flyweights::x, and boost::polygon::y().

template<class T , class Alloc >

bool boost::operator<= ( const circular_buffer_space_optimized< T, Alloc > &  lhs, const circular_buffer_space_optimized< T, Alloc > &  rhs  )

inline

Lexicographical comparison.

template<class T , class Alloc >

bool boost::operator<= ( const circular_buffer< T, Alloc > &  lhs, const circular_buffer< T, Alloc > &  rhs  )

inline

Compare two circular_buffers element-by-element to determine if the left one is lesser or equal to the right one.

Parameters

lhs	The circular_buffer to compare.
rhs	The circular_buffer to compare.

Returns

!(rhs < lhs)

Exceptions

Nothing.

Complexity

Linear (in the size of the circular_buffers).

Iterator Invalidation

Does not invalidate any iterators.

See also

operator<(const circular_buffer<T,Alloc>&, const circular_buffer<T,Alloc>&)

template<class _Tp , class _Seq >

bool boost::operator== ( const queue< _Tp, _Seq > &  , const queue< _Tp, _Seq > &    )

inline

template<int I>

bool boost::operator==	(	arg< I > const &	,
		arg< I > const &
	)

bool boost::operator== ( const blank &  , const blank &    )

inline

template<class Graph , class Resource_Container >

bool boost::operator== ( const r_c_shortest_paths_label< Graph, Resource_Container > &  l1, const r_c_shortest_paths_label< Graph, Resource_Container > &  l2  )

inline

References boost::r_c_shortest_paths_label< Graph, Resource_Container >::b_is_valid, and boost::r_c_shortest_paths_label< Graph, Resource_Container >::cumulated_resource_consumption.

template<class _Tp , class _Sequence >

bool boost::operator==	(	const queue< _Tp, _Sequence > &	__x,
		const queue< _Tp, _Sequence > &	__y
	)

References boost::queue< _Tp, _Sequence >::c.

template<class T >

bool boost::operator== ( scoped_array< T > const &  p, boost::detail::sp_nullptr_t    )

inline

References boost::scoped_array< T >::get().

template<class T >

bool boost::operator== ( boost::detail::sp_nullptr_t  , scoped_array< T > const &  p  )

inline

References boost::multiprecision::backends::p.

template<class T >

bool boost::operator== ( scoped_ptr< T > const &  p, boost::detail::sp_nullptr_t    )

inline

References boost::scoped_ptr< T >::get().

template<class T >

bool boost::operator== ( boost::detail::sp_nullptr_t  , scoped_ptr< T > const &  p  )

inline

References boost::multiprecision::backends::p.

template<class Base >

boolean_archetype boost::operator==	(	const equality_comparable_archetype< Base > &	,
		const equality_comparable_archetype< Base > &
	)

template<class Base1 , class Base2 >

boolean_archetype boost::operator==	(	const equality_comparable2_first_archetype< Base1 > &	,
		const equality_comparable2_second_archetype< Base2 > &
	)

template<class RandomAccessIterator , class traits , class Allocator >

bool boost::operator== ( const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &  s, const sub_match< RandomAccessIterator > &  m  )

inline

References boost::asio::s, and boost::sub_match< BidiIterator >::str().

template<class T , class U >

bool boost::operator== ( intrusive_ptr< T > const &  a, intrusive_ptr< U > const &  b  )

inline

References boost::intrusive_ptr< T >::get().

template<class T , class U >

bool boost::operator== ( intrusive_ptr< T > const &  a, U *  b  )

inline

References boost::asio::b, and boost::intrusive_ptr< T >::get().

template<class T , class U >

bool boost::operator== ( T *  a, intrusive_ptr< U > const &  b  )

inline

References boost::intrusive_ptr< T >::get().

template<class RandomAccessIterator , class traits , class Allocator >

bool boost::operator== ( const sub_match< RandomAccessIterator > &  m, const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &  s  )

inline

References boost::sub_match< BidiIterator >::str().

template<class T >

bool boost::operator== ( intrusive_ptr< T > const &  p, boost::detail::sp_nullptr_t    )

inline

References boost::intrusive_ptr< T >::get().

template<class T >

bool boost::operator== ( boost::detail::sp_nullptr_t  , intrusive_ptr< T > const &  p  )

inline

References boost::multiprecision::backends::p.

template<class T >

bool boost::operator== ( shared_array< T > const &  a, shared_array< T > const &  b  )

inline

References a, and boost::asio::b.

template<class RandomAccessIterator >

bool boost::operator== ( const sub_match< RandomAccessIterator > &  m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *  s  )

inline

References boost::sub_match< BidiIterator >::str().

template<typename charT , typename traits >

bool boost::operator== ( basic_string_ref< charT, traits >  x, basic_string_ref< charT, traits >  y  )

inline

References boost::basic_string_ref< charT, traits >::compare(), and boost::basic_string_ref< charT, traits >::size().

template<class T >

bool boost::operator== ( shared_array< T > const &  p, boost::detail::sp_nullptr_t    )

inline

References boost::shared_array< T >::get().

template<typename charT , typename traits , typename Allocator >

bool boost::operator== ( basic_string_ref< charT, traits >  x, const std::basic_string< charT, traits, Allocator > &  y  )

inline

References boost::polygon::y().

template<class T >

bool boost::operator== ( boost::detail::sp_nullptr_t  , shared_array< T > const &  p  )

inline

References boost::multiprecision::backends::p.

template<typename charT , typename traits , typename Allocator >

bool boost::operator== ( const std::basic_string< charT, traits, Allocator > &  x, basic_string_ref< charT, traits >  y  )

inline

References boost::flyweights::x.

template<typename charT , typename traits >

bool boost::operator== ( basic_string_ref< charT, traits >  x, const charT *  y  )

inline

References boost::polygon::y().

template<class RandomAccessIterator >

bool boost::operator== ( typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *  s, const sub_match< RandomAccessIterator > &  m  )

inline

References boost::sub_match< BidiIterator >::str().

template<typename charT , typename traits >

bool boost::operator== ( const charT *  x, basic_string_ref< charT, traits >  y  )

inline

References boost::flyweights::x.

template<class BaseFirst , class BaseSecond , class Tag >

boolean_archetype boost::operator==	(	const equal_op_first_archetype< BaseFirst, Tag > &	,
		const equal_op_second_archetype< BaseSecond, Tag > &
	)

template<class RandomAccessIterator >

bool boost::operator== ( const sub_match< RandomAccessIterator > &  m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &  s  )

inline

References boost::sub_match< BidiIterator >::length(), boost::asio::s, and boost::sub_match< BidiIterator >::str().

template<class RandomAccessIterator >

bool boost::operator== ( typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &  s, const sub_match< RandomAccessIterator > &  m  )

inline

References boost::sub_match< BidiIterator >::length(), boost::asio::s, and boost::sub_match< BidiIterator >::str().

template<class T , std::size_t N>

bool boost::operator==	(	const array< T, N > &	x,
		const array< T, N > &	y
	)

References boost::array< T, N >::begin(), boost::array< T, N >::end(), and boost::algorithm::detail::equal().

template<typename T , typename TagT , typename U >

bool boost::operator== ( value_ref< T, TagT > const &  left, U const &  right  )

inline

References boost::fusion::equal_to().

template<typename U , typename T , typename TagT >

bool boost::operator== ( U const &  left, value_ref< T, TagT > const &  right  )

inline

References boost::fusion::equal_to().

template<typename T1 , typename TagT1 , typename T2 , typename TagT2 >

bool boost::operator== ( value_ref< T1, TagT1 > const &  left, value_ref< T2, TagT2 > const &  right  )

inline

template<class IteratorT , class ForwardRange >

BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_<is_base_and_derived<iterator_range_detail::iterator_range_tag, ForwardRange> >, bool >::type boost::operator== ( const ForwardRange &  l, const iterator_range< IteratorT > &  r  )

inline

References boost::iterator_range_detail::equal().

template<class Iterator1T , class Iterator2T >

bool boost::operator== ( const iterator_range< Iterator1T > &  l, const iterator_range< Iterator2T > &  r  )

inline

References boost::iterator_range_detail::equal().

template<class IteratorT , class ForwardRange >

BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_<boost::is_base_and_derived<iterator_range_detail::iterator_range_tag, ForwardRange> >, bool >::type boost::operator== ( const iterator_range< IteratorT > &  l, const ForwardRange &  r  )

inline

References boost::iterator_range_detail::equal().

template<class T , class U >

bool boost::operator== ( shared_ptr< T > const &  a, shared_ptr< U > const &  b  )

inline

References a, and boost::asio::b.

bool boost::operator== ( const function_base &  f, detail::function::useless_clear_type *    )

inline

References boost::function_base::empty().

bool boost::operator== ( detail::function::useless_clear_type *  , const function_base &  f  )

inline

References boost::function_base::empty().

template<class T >

bool boost::operator== ( shared_ptr< T > const &  p, boost::detail::sp_nullptr_t    )

inline

template<class T >

bool boost::operator== ( boost::detail::sp_nullptr_t  , shared_ptr< T > const &  p  )

inline

References boost::multiprecision::backends::p.

template<typename Functor >

typename ::boost::enable_if_c<(::boost::type_traits::ice_not< (::boost::is_integral< Functor >::value)>::value), bool >::type boost::operator==	(	const function_base &	f,
		Functor	g
	)

References function_equal().

template<typename Functor >

typename ::boost::enable_if_c<(::boost::type_traits::ice_not< (::boost::is_integral< Functor >::value)>::value), bool >::type boost::operator==	(	Functor	g,
		const function_base &	f
	)

References function_equal().

template<typename Functor >

typename ::boost::enable_if_c<(::boost::type_traits::ice_not< (::boost::is_integral< Functor >::value)>::value), bool >::type boost::operator==	(	const function_base &	f,
		reference_wrapper< Functor >	g
	)

template<typename Functor >

typename ::boost::enable_if_c<(::boost::type_traits::ice_not< (::boost::is_integral< Functor >::value)>::value), bool >::type boost::operator==	(	reference_wrapper< Functor >	g,
		const function_base &	f
	)

template<typename T , typename L >

bool boost::operator==	(	T const &	lhs,
		synchronized_value< T, L > const &	rhs
	)

template<class T >

bool boost::operator== ( optional< T > const &  x, optional< T > const &  y  )

inline

References equal_pointees().

template<class T >

bool boost::operator== ( optional< T > const &  x, T const &  y  )

inline

References equal_pointees().

template<class T >

bool boost::operator== ( T const &  x, optional< T > const &  y  )

inline

References equal_pointees().

template<class T >

bool boost::operator== ( optional< T > const &  x, none_t    )

inline

References boost::flyweights::x.

template<typename Block , typename Allocator >

bool boost::operator==	(	const dynamic_bitset< Block, Allocator > &	a,
		const dynamic_bitset< Block, Allocator > &	b
	)

template<class T >

bool boost::operator== ( none_t  , optional< T > const &  y  )

inline

References boost::polygon::y().

template<class T , class Alloc >

bool boost::operator== ( const circular_buffer_space_optimized< T, Alloc > &  lhs, const circular_buffer_space_optimized< T, Alloc > &  rhs  )

inline

Test two space optimized circular buffers for equality.

References boost::circular_buffer< T, Alloc >::begin(), boost::circular_buffer< T, Alloc >::end(), boost::algorithm::detail::equal(), and boost::circular_buffer< T, Alloc >::size().

template<class T , multiprecision::expression_template_option ExpressionTemplates, class Arithmetic >

boost::enable_if<boost::is_arithmetic<Arithmetic>, bool>::type boost::operator==	(	const rational< multiprecision::number< T, ExpressionTemplates > > &	a,
		const Arithmetic &	b
	)

References a, and boost::asio::b.

template<class T , multiprecision::expression_template_option ExpressionTemplates, class Arithmetic >

boost::enable_if<boost::is_arithmetic<Arithmetic>, bool>::type boost::operator==	(	const Arithmetic &	b,
		const rational< multiprecision::number< T, ExpressionTemplates > > &	a
	)

References a, and boost::asio::b.

template<class T , class Alloc >

bool boost::operator== ( const circular_buffer< T, Alloc > &  lhs, const circular_buffer< T, Alloc > &  rhs  )

inline

Compare two circular_buffers element-by-element to determine if they are equal.

Parameters

lhs	The circular_buffer to compare.
rhs	The circular_buffer to compare.

Returns

lhs.size() == rhs.size() && std::equal(lhs.begin(), lhs.end(), rhs.begin())

Exceptions

Nothing.

Complexity

Linear (in the size of the circular_buffers).

Iterator Invalidation

Does not invalidate any iterators.

References boost::circular_buffer< T, Alloc >::begin(), boost::circular_buffer< T, Alloc >::end(), boost::algorithm::detail::equal(), and boost::circular_buffer< T, Alloc >::size().

bool boost::operator> ( const blank &  , const blank &    )

inline

template<class Graph , class Resource_Container >

bool boost::operator> ( const r_c_shortest_paths_label< Graph, Resource_Container > &  l1, const r_c_shortest_paths_label< Graph, Resource_Container > &  l2  )

inline

References boost::r_c_shortest_paths_label< Graph, Resource_Container >::b_is_valid, and boost::r_c_shortest_paths_label< Graph, Resource_Container >::cumulated_resource_consumption.

template<class _Tp , class _Sequence >

bool boost::operator>	(	const queue< _Tp, _Sequence > &	__x,
		const queue< _Tp, _Sequence > &	__y
	)

bool boost::operator> ( type_info_wrapper const &  left, type_info_wrapper const &  right  )

inline

Ordering operator.

References boost::bimaps::support::left, and boost::icl::right().

template<class RandomAccessIterator , class traits , class Allocator >

bool boost::operator> ( const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &  s, const sub_match< RandomAccessIterator > &  m  )

inline

References boost::sub_match< BidiIterator >::str().

template<class RandomAccessIterator , class traits , class Allocator >

bool boost::operator> ( const sub_match< RandomAccessIterator > &  m, const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &  s  )

inline

References boost::sub_match< BidiIterator >::str().

template<class Base >

boolean_archetype boost::operator>	(	const comparable_archetype< Base > &	,
		const comparable_archetype< Base > &
	)

template<class RandomAccessIterator >

bool boost::operator> ( const sub_match< RandomAccessIterator > &  m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *  s  )

inline

References boost::sub_match< BidiIterator >::str().

template<class RandomAccessIterator >

bool boost::operator> ( typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *  s, const sub_match< RandomAccessIterator > &  m  )

inline

References boost::sub_match< BidiIterator >::str().

template<class BaseFirst , class BaseSecond , class Tag >

boolean_archetype boost::operator>	(	const greater_than_op_first_archetype< BaseFirst, Tag > &	,
		const greater_than_op_second_archetype< BaseSecond, Tag > &
	)

template<class RandomAccessIterator >

bool boost::operator> ( const sub_match< RandomAccessIterator > &  m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &  s  )

inline

References boost::sub_match< BidiIterator >::length(), boost::asio::s, and boost::sub_match< BidiIterator >::str().

template<typename charT , typename traits >

bool boost::operator> ( basic_string_ref< charT, traits >  x, basic_string_ref< charT, traits >  y  )

inline

References boost::basic_string_ref< charT, traits >::compare().

template<class RandomAccessIterator >

bool boost::operator> ( typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &  s, const sub_match< RandomAccessIterator > &  m  )

inline

References boost::sub_match< BidiIterator >::length(), boost::asio::s, and boost::sub_match< BidiIterator >::str().

template<typename charT , typename traits , typename Allocator >

bool boost::operator> ( basic_string_ref< charT, traits >  x, const std::basic_string< charT, traits, Allocator > &  y  )

inline

References boost::polygon::y().

template<typename charT , typename traits , typename Allocator >

bool boost::operator> ( const std::basic_string< charT, traits, Allocator > &  x, basic_string_ref< charT, traits >  y  )

inline

References boost::flyweights::x.

template<typename charT , typename traits >

bool boost::operator> ( basic_string_ref< charT, traits >  x, const charT *  y  )

inline

References boost::polygon::y().

template<typename charT , typename traits >

bool boost::operator> ( const charT *  x, basic_string_ref< charT, traits >  y  )

inline

References boost::flyweights::x.

template<class T , std::size_t N>

bool boost::operator>	(	const array< T, N > &	x,
		const array< T, N > &	y
	)

References boost::flyweights::x.

template<typename Block , typename Allocator >

bool boost::operator> ( const dynamic_bitset< Block, Allocator > &  a, const dynamic_bitset< Block, Allocator > &  b  )

inline

References a.

template<typename T , typename TagT , typename U >

bool boost::operator> ( value_ref< T, TagT > const &  left, U const &  right  )

inline

References boost::fusion::greater().

template<typename U , typename T , typename TagT >

bool boost::operator> ( U const &  left, value_ref< T, TagT > const &  right  )

inline

References boost::fusion::greater().

template<typename T1 , typename TagT1 , typename T2 , typename TagT2 >

bool boost::operator> ( value_ref< T1, TagT1 > const &  left, value_ref< T2, TagT2 > const &  right  )

inline

template<class IteratorT , class ForwardRange >

BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_<boost::is_base_and_derived<iterator_range_detail::iterator_range_tag, ForwardRange> >, bool >::type boost::operator> ( const ForwardRange &  l, const iterator_range< IteratorT > &  r  )

inline

References boost::iterator_range_detail::greater_than().

template<class Iterator1T , class Iterator2T >

bool boost::operator> ( const iterator_range< Iterator1T > &  l, const iterator_range< Iterator2T > &  r  )

inline

References boost::iterator_range_detail::greater_than().

template<class IteratorT , class ForwardRange >

BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_<boost::is_base_and_derived<iterator_range_detail::iterator_range_tag, ForwardRange> >, bool >::type boost::operator> ( const iterator_range< IteratorT > &  l, const ForwardRange &  r  )

inline

References boost::iterator_range_detail::greater_than().

template<typename T , typename L >

bool boost::operator>	(	T const &	lhs,
		synchronized_value< T, L > const &	rhs
	)

template<class T >

bool boost::operator> ( optional< T > const &  x, optional< T > const &  y  )

inline

References boost::flyweights::x.

template<class T >

bool boost::operator> ( optional< T > const &  x, T const &  y  )

inline

References boost::flyweights::x.

template<class T >

bool boost::operator> ( T const &  x, optional< T > const &  y  )

inline

References boost::flyweights::x.

template<class T >

bool boost::operator> ( optional< T > const &  x, none_t  y  )

inline

References boost::flyweights::x.

template<class T >

bool boost::operator> ( none_t  x, optional< T > const &  y  )

inline

References boost::flyweights::x.

template<class T , class Alloc >

bool boost::operator> ( const circular_buffer_space_optimized< T, Alloc > &  lhs, const circular_buffer_space_optimized< T, Alloc > &  rhs  )

inline

Lexicographical comparison.

template<class T , class Alloc >

bool boost::operator> ( const circular_buffer< T, Alloc > &  lhs, const circular_buffer< T, Alloc > &  rhs  )

inline

Compare two circular_buffers element-by-element to determine if the left one is greater than the right one.

Parameters

lhs	The circular_buffer to compare.
rhs	The circular_buffer to compare.

Returns

rhs < lhs

Exceptions

Nothing.

Complexity

Linear (in the size of the circular_buffers).

Iterator Invalidation

Does not invalidate any iterators.

See also

operator<(const circular_buffer<T,Alloc>&, const circular_buffer<T,Alloc>&)

bool boost::operator>= ( const blank &  , const blank &    )

inline

template<class _Tp , class _Sequence >

bool boost::operator>=	(	const queue< _Tp, _Sequence > &	__x,
		const queue< _Tp, _Sequence > &	__y
	)

template<class Graph , class Resource_Container >

bool boost::operator>= ( const r_c_shortest_paths_label< Graph, Resource_Container > &  l1, const r_c_shortest_paths_label< Graph, Resource_Container > &  l2  )

inline

References boost::r_c_shortest_paths_label< Graph, Resource_Container >::b_is_valid.

bool boost::operator>= ( type_info_wrapper const &  left, type_info_wrapper const &  right  )

inline

Ordering operator.

References boost::bimaps::support::left, and boost::icl::right().

template<class RandomAccessIterator , class traits , class Allocator >

bool boost::operator>= ( const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &  s, const sub_match< RandomAccessIterator > &  m  )

inline

References boost::sub_match< BidiIterator >::str().

template<class RandomAccessIterator , class traits , class Allocator >

bool boost::operator>= ( const sub_match< RandomAccessIterator > &  m, const std::basic_string< typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type, traits, Allocator > &  s  )

inline

References boost::sub_match< BidiIterator >::str().

template<class Base >

boolean_archetype boost::operator>=	(	const comparable_archetype< Base > &	,
		const comparable_archetype< Base > &
	)

template<class RandomAccessIterator >

bool boost::operator>= ( const sub_match< RandomAccessIterator > &  m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *  s  )

inline

References boost::sub_match< BidiIterator >::str().

template<class RandomAccessIterator >

bool boost::operator>= ( typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const *  s, const sub_match< RandomAccessIterator > &  m  )

inline

References boost::sub_match< BidiIterator >::str().

template<class BaseFirst , class BaseSecond , class Tag >

boolean_archetype boost::operator>=	(	const greater_equal_op_first_archetype< BaseFirst, Tag > &	,
		const greater_equal_op_second_archetype< BaseSecond, Tag > &
	)

template<class RandomAccessIterator >

bool boost::operator>= ( const sub_match< RandomAccessIterator > &  m, typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &  s  )

inline

References boost::sub_match< BidiIterator >::length(), boost::asio::s, and boost::sub_match< BidiIterator >::str().

template<class RandomAccessIterator >

bool boost::operator>= ( typename re_detail::regex_iterator_traits< RandomAccessIterator >::value_type const &  s, const sub_match< RandomAccessIterator > &  m  )

inline

References boost::sub_match< BidiIterator >::length(), boost::asio::s, and boost::sub_match< BidiIterator >::str().

template<class T , std::size_t N>

bool boost::operator>=	(	const array< T, N > &	x,
		const array< T, N > &	y
	)

References boost::polygon::y().

template<typename charT , typename traits >

bool boost::operator>= ( basic_string_ref< charT, traits >  x, basic_string_ref< charT, traits >  y  )

inline

References boost::basic_string_ref< charT, traits >::compare().

template<typename charT , typename traits , typename Allocator >

bool boost::operator>= ( basic_string_ref< charT, traits >  x, const std::basic_string< charT, traits, Allocator > &  y  )

inline

References boost::polygon::y().

template<typename charT , typename traits , typename Allocator >

bool boost::operator>= ( const std::basic_string< charT, traits, Allocator > &  x, basic_string_ref< charT, traits >  y  )

inline

References boost::flyweights::x.

template<typename charT , typename traits >

bool boost::operator>= ( basic_string_ref< charT, traits >  x, const charT *  y  )

inline

References boost::polygon::y().

template<typename charT , typename traits >

bool boost::operator>= ( const charT *  x, basic_string_ref< charT, traits >  y  )

inline

References boost::flyweights::x.

template<typename Block , typename Allocator >

bool boost::operator>= ( const dynamic_bitset< Block, Allocator > &  a, const dynamic_bitset< Block, Allocator > &  b  )

inline

References boost::asio::b.

template<typename T , typename TagT , typename U >

bool boost::operator>= ( value_ref< T, TagT > const &  left, U const &  right  )

inline

References boost::fusion::greater_equal().

template<typename U , typename T , typename TagT >

bool boost::operator>= ( U const &  left, value_ref< T, TagT > const &  right  )

inline

References boost::fusion::greater_equal().

template<typename T1 , typename TagT1 , typename T2 , typename TagT2 >

bool boost::operator>= ( value_ref< T1, TagT1 > const &  left, value_ref< T2, TagT2 > const &  right  )

inline

template<class IteratorT , class ForwardRange >

BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_<boost::is_base_and_derived<iterator_range_detail::iterator_range_tag, ForwardRange> >, bool >::type boost::operator>= ( const ForwardRange &  l, const iterator_range< IteratorT > &  r  )

inline

References boost::iterator_range_detail::greater_or_equal_than().

template<class Iterator1T , class Iterator2T >

bool boost::operator>= ( const iterator_range< Iterator1T > &  l, const iterator_range< Iterator2T > &  r  )

inline

References boost::iterator_range_detail::greater_or_equal_than().

template<class IteratorT , class ForwardRange >

BOOST_DEDUCED_TYPENAME boost::enable_if< mpl::not_<boost::is_base_and_derived<iterator_range_detail::iterator_range_tag, ForwardRange> >, bool >::type boost::operator>= ( const iterator_range< IteratorT > &  l, const ForwardRange &  r  )

inline

References boost::iterator_range_detail::greater_or_equal_than().

template<typename T , typename L >

bool boost::operator>=	(	T const &	lhs,
		synchronized_value< T, L > const &	rhs
	)

template<class T >

bool boost::operator>= ( optional< T > const &  x, optional< T > const &  y  )

inline

References boost::polygon::y().

template<class T >

bool boost::operator>= ( optional< T > const &  x, T const &  y  )

inline

References boost::polygon::y().

template<class T >

bool boost::operator>= ( T const &  x, optional< T > const &  y  )

inline

References boost::polygon::y().

template<class T >

bool boost::operator>= ( optional< T > const &  x, none_t  y  )

inline

References boost::polygon::y().

template<class T >

bool boost::operator>= ( none_t  x, optional< T > const &  y  )

inline

References boost::polygon::y().

template<class T , class Alloc >

bool boost::operator>= ( const circular_buffer_space_optimized< T, Alloc > &  lhs, const circular_buffer_space_optimized< T, Alloc > &  rhs  )

inline

Lexicographical comparison.

template<class T , class Alloc >

bool boost::operator>= ( const circular_buffer< T, Alloc > &  lhs, const circular_buffer< T, Alloc > &  rhs  )

inline

Compare two circular_buffers element-by-element to determine if the left one is greater or equal to the right one.

Parameters

lhs	The circular_buffer to compare.
rhs	The circular_buffer to compare.

Returns

!(lhs < rhs)

Exceptions

Nothing.

Complexity

Linear (in the size of the circular_buffers).

Iterator Invalidation

Does not invalidate any iterators.

See also

operator<(const circular_buffer<T,Alloc>&, const circular_buffer<T,Alloc>&)

template<class Tag , class Value , class Next >

std::istream& boost::operator>>	(	std::istream &	in,
		property< Tag, Value, Next > &	p
	)

References boost::flyweights::in, boost::property< Tag, T, Base >::m_base, and boost::property< Tag, T, Base >::m_value.

template<class CharType , class CharTrait , class T >

std::basic_istream<CharType, CharTrait>& boost::operator>> ( std::basic_istream< CharType, CharTrait > &  in, optional< T > &  v  )

inline

References boost::regex_constants::failbit, boost::flyweights::in, none, T, and boost::flyweights::x.

template<class Tag , class Value >

std::istream& boost::operator>>	(	std::istream &	in,
		property< Tag, Value, no_property > &	p
	)

References boost::flyweights::in, and boost::property< Tag, T, Base >::m_value.

std::istream& boost::operator>> ( std::istream &  in, no_property &    )

inline

References boost::flyweights::in.

template<typename Stream , typename RecursiveMutex , typename T >

const stream_guard<Stream, RecursiveMutex>& boost::operator>> ( const stream_guard< Stream, RecursiveMutex > &  lck, T &  arg  )

inline

References boost::stream_guard< Stream, RecursiveMutex >::get().

template<typename Stream , typename RecursiveMutex , typename T >

stream_guard<Stream, RecursiveMutex> boost::operator>> ( externally_locked_stream< Stream, RecursiveMutex > &  mtx, T &  arg  )

inline

References boost::externally_locked< Stream &, RecursiveMutex >::get(), and move().

template<class Graph , class VP , class EP , class VPS , class EPS >

std::istream& boost::operator>>	(	std::istream &	in,
		GraphParser< Graph, VP, EP, VPS, EPS >	gp
	)

input stream for reading a graph

References boost::flyweights::in.

template<typename CharT , typename Traits , typename Block , typename Allocator >

std::basic_istream<CharT, Traits>& boost::operator>>	(	std::basic_istream< CharT, Traits > &	is,
		dynamic_bitset< Block, Allocator > &	b
	)

template<typename IntType >

std::istream& boost::operator>>	(	std::istream &	is,
		rational< IntType > &	r
	)

References boost::multiprecision::backends::c, and n.

template<typename ValueType >

sync_queue<ValueType>& boost::operator>>	(	sync_queue< ValueType > &	sbq,
		ValueType &	elem
	)

References boost::sync_queue< ValueType >::pull_front().

template<typename ValueType >

sync_bounded_queue<ValueType>& boost::operator>>	(	sync_bounded_queue< ValueType > &	sbq,
		ValueType &	elem
	)

References boost::sync_bounded_queue< ValueType >::pull_front().

template<typename IStream , typename T , typename L >

IStream& boost::operator>> ( IStream &  is, synchronized_value< T, L > const &  rhs  )

inline

References boost::synchronized_value< T, Lockable >::load().

template<typename Ch , typename Tr , typename Block , typename Alloc >

std::basic_istream<Ch, Tr>& boost::operator>>	(	std::basic_istream< Ch, Tr > &	is,
		dynamic_bitset< Block, Alloc > &	b
	)

References BOOST_CATCH, BOOST_CATCH_END, BOOST_DYNAMIC_BITSET_CTYPE_FACET, BOOST_DYNAMIC_BITSET_WIDEN_CHAR, BOOST_RETHROW, BOOST_TRY, boost::dynamic_bitset< Block, Allocator >::clear(), boost::asio::error::eof, boost::tuples::detail::eq(), boost::regex_constants::failbit, boost::dynamic_bitset< Block, Allocator >::max_size(), and boost::dynamic_bitset< Block, Allocator >::size().

template<class Backend , multiprecision::expression_template_option ExpressionTemplates>

std::istream& boost::operator>> ( std::istream &  is, rational< multiprecision::number< Backend, ExpressionTemplates > > &  r  )

inline

References boost::multiprecision::number< Backend, ExpressionTemplates >::assign(), boost::multiprecision::backends::c, boost::spirit::x3::hex, boost::spirit::x3::oct, and boost::xpressive::s1.

template<typename Block , typename Allocator >

dynamic_bitset< Block, Allocator > boost::operator^	(	const dynamic_bitset< Block, Allocator > &	b1,
		const dynamic_bitset< Block, Allocator > &	b2
	)

References boost::asio::b, and boost::polygon::y().

template<typename Block , typename Allocator >

dynamic_bitset< Block, Allocator > boost::operator|	(	const dynamic_bitset< Block, Allocator > &	b1,
		const dynamic_bitset< Block, Allocator > &	b2
	)

References boost::asio::b, and boost::polygon::y().

template<class Graph >

graph_traits<Graph>::vertex_descriptor boost::opposite ( typename graph_traits< Graph >::edge_descriptor  e, typename graph_traits< Graph >::vertex_descriptor  v, const Graph &  g  )

inline

References source(), and target().

Referenced by boost::geometry::policies::relate::segments_direction::segments_collinear().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( orig_to_copy , _t)> boost::orig_to_copy

(

const PType &

p

)

Referenced by boost::graph_test< Graph >::test_add_edge(), boost::graph_test< Graph >::test_add_vertex(), boost::graph_test< Graph >::test_clear_vertex(), and boost::graph_test< Graph >::test_remove_edge().

template<typename V , typename D , typename P , typename B >

incidence_graph_archetype<V,D,P,B>::degree_size_type boost::out_degree	(	const V &	,
		const incidence_graph_archetype< V, D, P, B > &
	)

template<typename V , typename D , typename P , typename B >

adjacency_graph_archetype<V,D,P,B>::degree_size_type boost::out_degree	(	const V &	,
		const adjacency_graph_archetype< V, D, P, B > &
	)

template<class EdgeList , class Alloc >

EdgeList::size_type boost::out_degree	(	typename EdgeList::value_type	v,
		const std::vector< EdgeList, Alloc > &	g
	)

template<typename V , typename D , typename P , typename B >

vertex_list_graph_archetype<V,D,P,B>::degree_size_type boost::out_degree	(	const V &	,
		const vertex_list_graph_archetype< V, D, P, B > &
	)

boost::graph_traits<sgb_graph_ptr>::degree_size_type boost::out_degree ( Vertex *  u, sgb_const_graph_ptr  g  )

inline

References boost::fusion::distance(), boost::multiprecision::backends::i, and out_edges().

template<class BidirectionalGraph , class GRef >

graph_traits<BidirectionalGraph>::degree_size_type boost::out_degree ( const typename graph_traits< BidirectionalGraph >::vertex_descriptor  u, const reverse_graph< BidirectionalGraph, GRef > &  g  )

inline

References in_degree(), and boost::reverse_graph< BidirectionalGraph, GraphRef >::m_g.

template<typename VP , typename EP , typename GP >

undirected_graph<VP,EP,GP>::degree_size_type boost::out_degree ( typename undirected_graph< VP, EP, GP >::vertex_descriptor  v, undirected_graph< VP, EP, GP > const &  g  )

inline

References out_degree().

template<typename G , typename EP , typename VP >

filtered_graph<G, EP, VP>::degree_size_type boost::out_degree	(	typename filtered_graph< G, EP, VP >::vertex_descriptor	u,
		const filtered_graph< G, EP, VP > &	g
	)

References n, and out_edges().

template<typename VP , typename EP , typename GP >

directed_graph<VP,EP,GP>::degree_size_type boost::out_degree ( typename directed_graph< VP, EP, GP >::vertex_descriptor  v, directed_graph< VP, EP, GP > const &  g  )

inline

References out_degree().

template<typename G >

graph_traits<G>::degree_size_type boost::out_degree	(	typename graph_traits< G >::vertex_descriptor	v,
		const subgraph< G > &	g
	)

References boost::subgraph< Graph >::m_graph, and out_degree().

template<class vtype , class etype >

graph_traits< leda::GRAPH<vtype,etype> >::degree_size_type boost::out_degree	(	typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor	u,
		const leda::GRAPH< vtype, etype > &	g
	)

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::degree_size_type boost::out_degree ( typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor  u, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g  )

inline

References out_degree(), and vertex_local.

template<typename G , typename L , typename S >

labeled_graph<G,L,S>::degree_size_type boost::out_degree ( typename labeled_graph< G, L, S >::vertex_descriptor  v, labeled_graph< G, L, S > const &  g  )

inline

References out_degree().

graph_traits<leda::graph>::degree_size_type boost::out_degree	(	graph_traits< leda::graph >::vertex_descriptor	u,
		const leda::graph &	g
	)

template<typename D , typename VP , typename EP , typename GP , typename A >

adjacency_matrix<D,VP,EP,GP,A>::degree_size_type boost::out_degree	(	typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor	u,
		const adjacency_matrix< D, VP, EP, GP, A > &	g
	)

References n, and out_edges().

Referenced by boost::concepts::BOOST_concept(), degree(), boost::degree_vertex_invariant< InDegreeMap, Graph >::degree_vertex_invariant(), boost::detail::mmd_impl< Graph, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, VertexIndexMap >::eliminate(), in_degree(), boost::detail::mmd_impl< Graph, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, VertexIndexMap >::mmd_impl(), boost::influence_measure< Graph >::operator()(), boost::unweighted_random_out_edge_gen< Graph, Gen >::operator()(), boost::weighted_random_out_edge_gen< Graph, WeightMap, Gen >::operator()(), boost::degree_vertex_invariant< InDegreeMap, Graph >::operator()(), boost::extra_greedy_matching< Graph, MateMap >::less_than_by_degree< PairSelector >::operator()(), boost::detail::vertex_in_out_degree_cmp< Graph >::operator()(), boost::detail::vertex_frequency_degree_cmp< Graph, FrequencyMap >::operator()(), out_degree(), random_out_edge(), boost::detail::read_dimacs_max_flow_internal(), smallest_last_vertex_ordering(), boost::detail::sort_vertices(), boost::graph_test< Graph >::test_add_vertex(), boost::graph_test< Graph >::test_clear_vertex(), boost::graph_test< Graph >::test_incidence_graph(), boost::triangulation_visitor< Graph, VertexIndexMap, AddEdgeVisitor >::triangulation_visitor(), and boost::detail::mmd_impl< Graph, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, VertexIndexMap >::update().

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

EdgeIndex boost::out_degree ( Vertex  v, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g  )

inline

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::degree_size_type boost::out_degree	(	typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	v,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

Return the number of edges outgoing from a particular vertex.

The vertex

Parameters

v	must be local to the processor executing this routine.

References BOOST_ASSERT, and out_degree().

template<typename V , typename D , typename P , typename B >

std::pair<typename incidence_graph_archetype<V,D,P,B>::out_edge_iterator, typename incidence_graph_archetype<V,D,P,B>::out_edge_iterator> boost::out_edges	(	const V &	,
		const incidence_graph_archetype< V, D, P, B > &
	)

References boost::xpressive::make_pair.

template<class EdgeList , class Alloc >

detail::val_out_edge_ret<EdgeList>::type boost::out_edges	(	typename EdgeList::value_type	v,
		const std::vector< EdgeList, Alloc > &	g
	)

References boost::asio::begin, and end.

std::pair<sgb_out_edge_iterator,sgb_out_edge_iterator> boost::out_edges ( Vertex *  u, sgb_const_graph_ptr    )

inline

References boost::xpressive::make_pair.

template<class BidirectionalGraph , class GRef >

std::pair<typename reverse_graph<BidirectionalGraph>::out_edge_iterator, typename reverse_graph<BidirectionalGraph>::out_edge_iterator> boost::out_edges ( const typename graph_traits< BidirectionalGraph >::vertex_descriptor  u, const reverse_graph< BidirectionalGraph, GRef > &  g  )

inline

References in_edges(), and boost::reverse_graph< BidirectionalGraph, GraphRef >::m_g.

template<typename G , typename EP , typename VP >

std::pair<typename filtered_graph<G, EP, VP>::out_edge_iterator, typename filtered_graph<G, EP, VP>::out_edge_iterator> boost::out_edges	(	typename filtered_graph< G, EP, VP >::vertex_descriptor	u,
		const filtered_graph< G, EP, VP > &	g
	)

References boost::filtered_graph< Graph, EdgePredicate, VertexPredicate >::m_edge_pred, boost::filtered_graph_base< Graph >::m_g, boost::filtered_graph< Graph, EdgePredicate, VertexPredicate >::m_vertex_pred, boost::xpressive::make_pair, boost::detail::out_edge_iterator, and out_edges().

template<typename VP , typename EP , typename GP >

std::pair< typename undirected_graph<VP,EP,GP>::out_edge_iterator, typename undirected_graph<VP,EP,GP>::out_edge_iterator> boost::out_edges ( typename undirected_graph< VP, EP, GP >::vertex_descriptor  v, undirected_graph< VP, EP, GP > const &  g  )

inline

References out_edges().

template<typename VP , typename EP , typename GP >

std::pair< typename directed_graph<VP,EP,GP>::out_edge_iterator, typename directed_graph<VP,EP,GP>::out_edge_iterator> boost::out_edges ( typename directed_graph< VP, EP, GP >::vertex_descriptor  v, directed_graph< VP, EP, GP > const &  g  )

inline

References out_edges().

template<class vtype , class etype >

std::pair< typename graph_traits< leda::GRAPH<vtype,etype> >::out_edge_iterator, typename graph_traits< leda::GRAPH<vtype,etype> >::out_edge_iterator > boost::out_edges ( typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor  u, const leda::GRAPH< vtype, etype > &  g  )

inline

References boost::xpressive::make_pair.

template<typename G >

std::pair<typename graph_traits<G>::out_edge_iterator, typename graph_traits<G>::out_edge_iterator> boost::out_edges	(	typename graph_traits< G >::vertex_descriptor	v,
		const subgraph< G > &	g
	)

References boost::subgraph< Graph >::m_graph, and out_edges().

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

std::pair<typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::out_edge_iterator, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::out_edge_iterator> boost::out_edges ( typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertex_descriptor  u, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g  )

inline

References it, boost::xpressive::make_pair, boost::accumulators::extract::max, and vertex_local.

template<typename G , typename L , typename S >

std::pair< typename labeled_graph<G,L,S>::out_edge_iterator, typename labeled_graph<G,L,S>::out_edge_iterator> boost::out_edges ( typename labeled_graph< G, L, S >::vertex_descriptor  v, labeled_graph< G, L, S > const &  g  )

inline

References out_edges().

std::pair< graph_traits<leda::graph>::out_edge_iterator, graph_traits<leda::graph>::out_edge_iterator > boost::out_edges ( graph_traits< leda::graph >::vertex_descriptor  u, const leda::graph &  g  )

inline

References boost::xpressive::make_pair.

template<typename VP , typename EP , typename GP , typename A >

std::pair<typename adjacency_matrix<directedS,VP,EP,GP,A>::out_edge_iterator, typename adjacency_matrix<directedS,VP,EP,GP,A>::out_edge_iterator> boost::out_edges	(	typename adjacency_matrix< directedS, VP, EP, GP, A >::vertex_descriptor	u,
		const adjacency_matrix< directedS, VP, EP, GP, A > &	g_
	)

References boost::xpressive::first, last, boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator >::m_vertex_set, boost::xpressive::make_pair, boost::asio::offset, boost::detail::out_edge_iterator, and boost::detail::vertices_size_type.

Referenced by add_vertex(), adjacent_vertices(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::adopt(), boost::detail::copy_graph_impl< 1 >::apply(), boost::detail::copy_graph_impl< 2 >::apply(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::augment_direct_paths(), boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::augment_matching(), boost::concepts::BOOST_concept(), breadth_first_visit(), boost::detail::can_wrap_path(), boost::undirected_graph< VertexProp, EdgeProp, GraphProp >::clear_vertex(), clear_vertex(), boost::detail::compute_in_degree_map(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::convert_preflow_to_flow(), boost::detail::core_numbers_impl(), dag_shortest_paths(), boost::detail::depth_first_visit_impl(), edge(), edge_connectivity(), edmonds_karp_max_flow(), boost::detail::extend_path(), boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::extract_kuratowski_subgraph(), boost::detail::bfs_king_visitor< OutputIterator, Buffer, Compare, PseudoDegreeMap, VecMap, VertexIndexMap >::finish_vertex(), boost::detail::tarjan_scc_visitor< ComponentMap, RootMap, DiscoverTime, Stack >::finish_vertex(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::global_distance_update(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::grow(), in_edges(), incident_edges(), is_adj_dispatch(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::is_flow(), ith_bandwidth(), ith_wavefront(), boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::kuratowski_walkup(), lookup_edge(), boost::detail::neighbor_bfs_impl(), out_degree(), out_edges(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::print_flow_values(), print_graph_dispatch(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::push_relabel(), boost::detail::r_c_shortest_paths_dispatch(), random_out_edge(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::relabel_distance(), boost::directed_graph< VertexProp, EdgeProp, GraphProp >::remove_edge(), boost::undirected_graph< VertexProp, EdgeProp, GraphProp >::remove_edge(), remove_edge(), boost::detail::parallel::remove_in_edge(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::remove_local_edge(), sloan_ordering(), boost::graph_test< Graph >::test_add_edge(), boost::graph_test< Graph >::test_incidence_graph(), and boost::detail::undir_dfv_impl().

template<typename VP , typename EP , typename GP , typename A >

std::pair< typename adjacency_matrix<undirectedS,VP,EP,GP,A>::out_edge_iterator, typename adjacency_matrix<undirectedS,VP,EP,GP,A>::out_edge_iterator> boost::out_edges	(	typename adjacency_matrix< undirectedS, VP, EP, GP, A >::vertex_descriptor	u,
		const adjacency_matrix< undirectedS, VP, EP, GP, A > &	g_
	)

References boost::xpressive::first, last, boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator >::m_matrix, boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator >::m_vertex_set, boost::xpressive::make_pair, boost::asio::offset, boost::detail::out_edge_iterator, and boost::detail::vertices_size_type.

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

std::pair<typename compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex>::out_edge_iterator, typename compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex>::out_edge_iterator> boost::out_edges ( Vertex  v, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g  )

inline

References it, and boost::xpressive::make_pair.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

std::pair<typename adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::out_edge_iterator, typename adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::out_edge_iterator> boost::out_edges	(	typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	v,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

Return the set of edges outgoing from a particular vertex.

The vertex

Parameters

v	must be local to the processor executing this routine.

References BOOST_ASSERT, boost::xpressive::make_pair, boost::iterators::make_transform_iterator(), out_edges(), and boost::locale::period::marks::second.

template<typename NumberMap >

paint_by_number_writer<NumberMap> boost::paint_by_number ( NumberMap  number )

inline

References boost::locale::flags::number.

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( parity_map , _t)> boost::parity_map

(

const PType &

p

)

template<typename CharT >

BOOST_LOG_SETUP_API filter boost::parse_filter	(	const CharT *	begin,
		const CharT *	end
	)

The function parses a filter from the sequence of characters.

Precondition

begin <= end, both pointers must not be NULL

Parameters

begin	Pointer to the first character of the sequence
end	Pointer to the after-the-last character of the sequence

Returns

A function object that can be used as a filter.

Throws: An std::exception-based exception, if a filter cannot be recognized in the character sequence.

Referenced by parse_filter().

template<typename CharT , typename TraitsT , typename AllocatorT >

filter boost::parse_filter ( std::basic_string< CharT, TraitsT, AllocatorT > const &  str )

inline

The function parses a filter from the string.

Parameters

str	A string that contains filter description

Returns

A function object that can be used as a filter.

Throws: An std::exception-based exception, if a filter cannot be recognized in the character sequence.

References boost::multiprecision::backends::p, and parse_filter().

template<typename CharT >

filter boost::parse_filter ( const CharT *  str )

inline

The function parses a filter from the string.

Precondition

str != NULL, str points to a zero-terminated string.

Parameters

str	A string that contains filter description.

Returns

A function object that can be used as a filter.

Throws: An std::exception-based exception, if a filter cannot be recognized in the character sequence.

References parse_filter().

template<typename CharT >

BOOST_LOG_SETUP_API basic_formatter< CharT > boost::parse_formatter	(	const CharT *	begin,
		const CharT *	end
	)

The function parses a formatter from the sequence of characters.

Precondition

begin <= end, both pointers must not be NULL

Parameters

begin	Pointer to the first character of the sequence
end	Pointer to the after-the-last character of the sequence

Returns

The parsed formatter.

Throws: An std::exception-based exception, if a formatter cannot be recognized in the character sequence.

Referenced by parse_formatter().

template<typename CharT , typename TraitsT , typename AllocatorT >

basic_formatter< CharT > boost::parse_formatter ( std::basic_string< CharT, TraitsT, AllocatorT > const &  str )

inline

The function parses a formatter from the string.

Parameters

str	A string that contains format description

Returns

The parsed formatter.

Throws: An std::exception-based exception, if a formatter cannot be recognized in the character sequence.

References boost::multiprecision::backends::p, and parse_formatter().

template<typename CharT >

basic_formatter< CharT > boost::parse_formatter ( const CharT *  str )

inline

The function parses a formatter from the string.

Precondition

str != NULL, str points to a zero-terminated string

Parameters

str	A string that contains format description.

Returns

The parsed formatter.

Throws: An std::exception-based exception, if a formatter cannot be recognized in the character sequence.

References parse_formatter().

template<typename CharT >

BOOST_LOG_OPEN_NAMESPACE BOOST_LOG_SETUP_API basic_settings< CharT > boost::parse_settings

(

std::basic_istream< CharT > &

strm

)

The function parses library settings from an input stream.

Parameters

strm	Stream, that provides library settings

Throws: An std::exception-based exception if the read data cannot be interpreted as the library settings

template<class SinglePassRange , class OutputIterator >

OutputIterator boost::partial_sum ( const SinglePassRange &  rng, OutputIterator  result  )

inline

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, end, and partial_sum().

Referenced by boost::phoenix::impl::partial_sum::operator()(), and boost::parallel::uneven_block::uneven_block().

template<class SinglePassRange , class OutputIterator , class BinaryOperation >

OutputIterator boost::partial_sum ( const SinglePassRange &  rng, OutputIterator  result, BinaryOperation  op  )

inline

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and end.

Referenced by boost::lambda::ll::partial_sum::operator()(), and partial_sum().

template<typename Graph , typename PlanarEmbedding , typename OutputIterator , typename VertexIndexMap >

void boost::planar_canonical_ordering	(	const Graph &	g,
		PlanarEmbedding	embedding,
		OutputIterator	ordering,
		VertexIndexMap	vm
	)

References adjacent_vertices(), next(), num_vertices(), boost::detail::PCO_ONE_NEIGHBOR_PROCESSED, boost::detail::PCO_PROCESSED, boost::detail::PCO_READY_TO_BE_PROCESSED, boost::detail::PCO_UNPROCESSED, prior(), source(), boost::filesystem::detail::status(), target(), vertices(), and boost::flyweights::x.

Referenced by planar_canonical_ordering().

template<typename Graph , typename PlanarEmbedding , typename OutputIterator >

void boost::planar_canonical_ordering	(	const Graph &	g,
		PlanarEmbedding	embedding,
		OutputIterator	ordering
	)

References planar_canonical_ordering(), and vertex_index.

template<typename Graph , typename PlanarEmbedding , typename Visitor , typename EdgeIndexMap >

void boost::planar_face_traversal	(	const Graph &	g,
		PlanarEmbedding	embedding,
		Visitor &	visitor,
		EdgeIndexMap	em
	)

References edges(), next(), num_edges(), put(), source(), target(), and vertices().

Referenced by make_maximal_planar(), and planar_face_traversal().

template<typename Graph , typename PlanarEmbedding , typename Visitor >

void boost::planar_face_traversal ( const Graph &  g, PlanarEmbedding  embedding, Visitor &  visitor  )

inline

References edge_index, and planar_face_traversal().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( polling , _t)> boost::polling

(

const PType &

p

)

Referenced by boost::graph::distributed::make_distributed_queue().

template<class Target , class Source >

Target boost::polymorphic_cast ( Source *  x )

inline

References boost::flyweights::x.

template<class Target , class Source >

Target boost::polymorphic_downcast ( Source *  x )

inline

References BOOST_ASSERT, and boost::flyweights::x.

template<typename U , BOOST_VARIANT_ENUM_PARAMS(typename T) >

add_pointer<U>::type boost::polymorphic_get ( boost::variant< BOOST_VARIANT_ENUM_PARAMS(T) > *  operand )

inline

References boost::detail::type.

template<typename U , BOOST_VARIANT_ENUM_PARAMS(typename T) >

add_pointer<const U>::type boost::polymorphic_get ( const boost::variant< BOOST_VARIANT_ENUM_PARAMS(T) > *  operand )

inline

References boost::detail::type.

template<typename U , BOOST_VARIANT_ENUM_PARAMS(typename T) >

add_reference<U>::type boost::polymorphic_get ( boost::variant< BOOST_VARIANT_ENUM_PARAMS(T) > &  operand )

inline

References throw_exception(), and boost::detail::type.

template<typename U , BOOST_VARIANT_ENUM_PARAMS(typename T) >

add_reference<const U>::type boost::polymorphic_get ( const boost::variant< BOOST_VARIANT_ENUM_PARAMS(T) > &  operand )

inline

References throw_exception(), and boost::detail::type.

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( vertex_predecessor , _t)> boost::predecessor_map

(

const PType &

p

)

Referenced by boost::detail::dijkstra_no_color_map_dispatch2(), find_odd_cycle(), and prim_minimum_spanning_tree().

template<typename Graph , typename Vertex >

graph_traits<Graph>::degree_size_type boost::prestige ( const Graph &  g, Vertex  v  )

inline

References degree_centrality(), and measure_prestige().

int BOOST_TEST_DECL boost::prg_exec_monitor_main	(	int(*)(int argc, char *argv[])	cpp_main,
		int	argc,
		char *	argv[]
	)

template<class VertexListGraph , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap >

void boost::prim_minimum_spanning_tree ( const VertexListGraph &  g, typename graph_traits< VertexListGraph >::vertex_descriptor  s, PredecessorMap  predecessor, DistanceMap  distance, WeightMap  weight, IndexMap  index_map, DijkstraVisitor  vis  )

inline

References boost::iostreams::combine(), compare(), dijkstra_shortest_paths(), and boost::accumulators::extract::max.

Referenced by metric_tsp_approx_from_vertex().

template<class VertexListGraph , class PredecessorMap , class P , class T , class R >

void boost::prim_minimum_spanning_tree ( const VertexListGraph &  g, PredecessorMap  p_map, const bgl_named_params< P, T, R > &  params  )

inline

References choose_const_pmap(), choose_param(), edge_weight, boost::xpressive::first, get_param(), boost::bgl_named_params< T, Tag, Base >::predecessor_map(), boost::detail::prim_mst_impl(), and vertices().

template<class VertexListGraph , class PredecessorMap >

void boost::prim_minimum_spanning_tree ( const VertexListGraph &  g, PredecessorMap  p_map  )

inline

References edge_weight, boost::xpressive::first, predecessor_map(), boost::detail::prim_mst_impl(), vertices(), and weight_map().

template<class EdgeListGraph , class Name >

void boost::print_edges	(	const EdgeListGraph &	G,
		Name	name
	)

References edges(), boost::iostreams::gzip::flags::name, source(), and target().

template<class EdgeListGraph , class VertexName , class EdgeName >

void boost::print_edges2	(	const EdgeListGraph &	G,
		VertexName	vname,
		EdgeName	ename
	)

References edges(), source(), and target().

template<class IncidenceGraph , class Name >

void boost::print_graph	(	const IncidenceGraph &	G,
		Name	name
	)

References print_graph_dispatch().

Referenced by print_graph().

template<class IncidenceGraph >

void boost::print_graph

(

const IncidenceGraph &

G

)

References print_graph(), and vertex_index.

template<class IncidenceGraph , class Name >

void boost::print_graph_dispatch	(	const IncidenceGraph &	G,
		Name	name,
		directed_tag
	)

References boost::iostreams::gzip::flags::name, boost::detail::out_edge_iterator, out_edges(), target(), and vertices().

Referenced by print_graph().

template<class IncidenceGraph , class Name >

void boost::print_graph_dispatch	(	const IncidenceGraph &	G,
		Name	name,
		undirected_tag
	)

References boost::iostreams::gzip::flags::name, boost::detail::out_edge_iterator, out_edges(), target(), and vertices().

template<class IncidenceGraph , class Name >

void boost::print_in_edges	(	const IncidenceGraph &	G,
		Name	name
	)

References boost::detail::in_edge_iterator, in_edges(), boost::iostreams::gzip::flags::name, source(), and vertices().

template<class VertexListGraph , class Name >

void boost::print_vertices	(	const VertexListGraph &	G,
		Name	name
	)

References vertices().

template<class T >

T boost::prior ( T  x )

inline

References boost::flyweights::x.

Referenced by boost::icl::map< DomainT, CodomainT, Traits, Compare, Combine, Section, Alloc >::add(), boost::icl::interval_base_set< SubType, DomainT, Compare, Interval, Alloc >::add_segment(), boost::iterator_range_detail::iterator_range_base< IteratorT, bidirectional_traversal_tag >::back(), boost::multi_index::detail::hashed_index< KeyFromValue, Hash, Pred, SuperMeta, TagList, Category >::begin(), boost::icl::contains(), boost::triangulation_visitor< Graph, VertexIndexMap, AddEdgeVisitor >::end_face(), boost::icl::interval_base_map< SubType, DomainT, CodomainT, Traits, Compare, Combine, Section, Interval, Alloc >::erase(), boost::icl::map< DomainT, CodomainT, Traits, Compare, Combine, Section, Alloc >::insert(), is_straight_line_drawing(), planar_canonical_ordering(), boost::graph_detail::push_dispatch(), and boost::icl::interval_base_set< SubType, DomainT, Compare, Interval, Alloc >::subtract().

template<class T , class Distance >

T boost::prior ( T  x, Distance  n  )

inline

References boost::next_prior_detail::prior_impl3< T, Distance >::call().

template<typename Graph , typename GraphRef >

graph::parallel::process_group_type<Graph>::type boost::process_group ( reverse_graph< Graph, GraphRef > const &  g )

inline

Retrieve the process group from a reverse graph.

References boost::reverse_graph< BidirectionalGraph, GraphRef >::m_g, and process_group().

template<typename Graph , typename EdgePredicate , typename VertexPredicate >

graph::parallel::process_group_type<Graph>::type boost::process_group ( filtered_graph< Graph, EdgePredicate, VertexPredicate > const &  g )

inline

Retrieve the process group from a filtered graph.

References boost::filtered_graph_base< Graph >::m_g, and process_group().

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

ProcessGroup boost::process_group

(

const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &

g

)

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

ProcessGroup boost::process_group

(

const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &

g

)

Referenced by boost::graph::distributed::boman_et_al_graph_coloring(), boost::graph::distributed::build_reverse_graph(), boost::graph::distributed::named_graph< Graph, Vertex, Edge, Config >::lazy_add_vertex::commit(), boost::graph::distributed::named_graph< Graph, Vertex, Edge, Config >::lazy_add_edge::commit(), boost::graph::distributed::named_graph< Graph, Vertex, Edge, Config >::lazy_add_edge_with_property::commit(), boost::graph::distributed::connected_components_ps(), boost::graph::distributed::detail::crauser_et_al_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap, MinOutWeightMap, MinInWeightMap >::do_synchronize(), boost::graph::distributed::hohberg_vertex_processor< Graph >::echo_phase(), boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), boost::graph::distributed::fleischer_hendrickson_pinar_strong_components_impl(), boost::graph::distributed::hohberg_biconnected_components(), boost::graph::distributed::hohberg_vertex_processor< Graph >::initialize_leader(), boost::graph::distributed::detail::initialize_min_in_weights(), boost::graph::distributed::number_components(), boost::graph::distributed::number_components_from_parents(), boost::is_local_vertex< DistributedGraph >::operator()(), boost::graph::distributed::hohberg_vertex_processor< Graph >::operator()(), boost::graph::distributed::page_rank_impl(), boost::detail::parallel_bfs_helper(), boost::graph::distributed::cc_detail::parallel_connected_components(), process_group(), boost::graph::distributed::detail::crauser_et_al_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap, MinOutWeightMap, MinInWeightMap >::receive_update(), boost::graph::distributed::cc_detail::request_parent_map_entries(), boost::graph::distributed::st_connected(), boost::graph::distributed::hohberg_vertex_processor< Graph >::start_naming_phase(), boost::graph::distributed::tsin_depth_first_visit(), write_graphviz(), boost::graph::distributed::named_graph< Graph, Vertex, Edge, Config >::lazy_add_edge::~lazy_add_edge(), boost::graph::distributed::named_graph< Graph, Vertex, Edge, Config >::lazy_add_edge_with_property::~lazy_add_edge_with_property(), and boost::graph::distributed::named_graph< Graph, Vertex, Edge, Config >::lazy_add_vertex::~lazy_add_vertex().

template<typename Graph , typename VertexIndexMap >

graph_traits<Graph>::vertices_size_type boost::profile	(	const Graph &	g,
		VertexIndexMap	index
	)

References boost::asio::b, end, boost::multiprecision::backends::i, ith_bandwidth(), and vertices().

Referenced by profile().

template<typename Graph >

graph_traits<Graph>::vertices_size_type boost::profile

(

const Graph &

g

)

References profile(), and vertex_index.

template<class F >

_bi::protected_bind_t<F> boost::protect

(

F

f

)

Referenced by boost::python::objects::make_instance_impl< T, Holder, make_ptr_instance< T, Holder > >::execute(), and boost::python::detail::make_iterator().

template<class Arg , class Result >

pointer_to_unary_function<Arg,Result> boost::ptr_fun ( Result(*)(Arg)  f )

inline

template<class Arg1 , class Arg2 , class Result >

pointer_to_binary_function<Arg1,Arg2,Result> boost::ptr_fun ( Result(*)(Arg1, Arg2)  f )

inline

template<class Graph , class CapacityEdgeMap , class ResidualCapacityEdgeMap , class ReverseEdgeMap , class VertexIndexMap >

property_traits<CapacityEdgeMap>::value_type boost::push_relabel_max_flow	(	Graph &	g,
		typename graph_traits< Graph >::vertex_descriptor	src,
		typename graph_traits< Graph >::vertex_descriptor	sink,
		CapacityEdgeMap	cap,
		ResidualCapacityEdgeMap	res,
		ReverseEdgeMap	rev,
		VertexIndexMap	index_map
	)

References BOOST_ASSERT.

Referenced by push_relabel_max_flow().

template<class Graph , class P , class T , class R >

detail::edge_capacity_value<Graph, P, T, R>::type boost::push_relabel_max_flow	(	Graph &	g,
		typename graph_traits< Graph >::vertex_descriptor	src,
		typename graph_traits< Graph >::vertex_descriptor	sink,
		const bgl_named_params< P, T, R > &	params
	)

References choose_const_pmap(), choose_pmap(), edge_capacity, edge_residual_capacity, edge_reverse, get_param(), push_relabel_max_flow(), and vertex_index.

template<class Graph >

property_traits< typename property_map<Graph, edge_capacity_t>::const_type >::value_type boost::push_relabel_max_flow	(	Graph &	g,
		typename graph_traits< Graph >::vertex_descriptor	src,
		typename graph_traits< Graph >::vertex_descriptor	sink
	)

References push_relabel_max_flow().

template<typename K , typename V >

void boost::put	(	null_property_map< K, V > &	,
		const K &	,
		const V &
	)

template<typename ProcessGroup , typename GlobalMap , typename StorageMap >

void boost::put ( one_bit_color_map< local_property_map< ProcessGroup, GlobalMap, StorageMap > > const &  pm, typename property_traits< GlobalMap >::key_type  key, one_bit_color_type  value  )

inline

References put(), and boost::program_options::value().

template<typename ProcessGroup , typename GlobalMap , typename StorageMap >

void boost::put ( two_bit_color_map< local_property_map< ProcessGroup, GlobalMap, StorageMap > > const &  pm, typename property_traits< GlobalMap >::key_type  key, two_bit_color_type  value  )

inline

References put(), and boost::program_options::value().

template<typename IndexMap >

void boost::put ( const one_bit_color_map< IndexMap > &  pm, typename property_traits< IndexMap >::key_type  key, one_bit_color_type  value  )

inline

References BOOST_ASSERT, BOOST_STATIC_CONSTANT(), boost::one_bit_color_map< IndexMap >::data, boost::shared_array< T >::get(), boost::multiprecision::backends::i, boost::one_bit_color_map< IndexMap >::index, and boost::one_bit_color_map< IndexMap >::n.

template<typename ProcessGroup , typename GlobalMap , typename StorageMap >

void boost::put ( const local_property_map< ProcessGroup, GlobalMap, StorageMap > &  pm, typename local_property_map< ProcessGroup, GlobalMap, StorageMap >::key_type const &  key, typename local_property_map< ProcessGroup, GlobalMap, StorageMap >::value_type const &  v  )

inline

References boost::local_property_map< ProcessGroup, GlobalMap, StorageMap >::base(), BOOST_ASSERT, boost::local_property_map< ProcessGroup, GlobalMap, StorageMap >::global(), boost::multiprecision::backends::p, boost::local_property_map< ProcessGroup, GlobalMap, StorageMap >::process_group(), process_id, and put().

template<typename IndexMap >

void boost::put ( const two_bit_color_map< IndexMap > &  pm, typename property_traits< IndexMap >::key_type  key, two_bit_color_type  value  )

inline

References BOOST_ASSERT, BOOST_STATIC_CONSTANT(), boost::two_bit_color_map< IndexMap >::data, boost::shared_array< T >::get(), boost::multiprecision::backends::i, boost::two_bit_color_map< IndexMap >::index, and boost::two_bit_color_map< IndexMap >::n.

template<typename ProcessGroup , typename GlobalMap , typename StorageMap >

void boost::put ( one_bit_color_map< parallel::distributed_property_map< ProcessGroup, GlobalMap, one_bit_color_map< StorageMap > > > const &  pm, typename property_traits< GlobalMap >::key_type  key, one_bit_color_type  value  )

inline

References put(), and boost::program_options::value().

template<typename ProcessGroup , typename GlobalMap , typename StorageMap >

void boost::put ( two_bit_color_map< parallel::distributed_property_map< ProcessGroup, GlobalMap, two_bit_color_map< StorageMap > > > const &  pm, typename property_traits< GlobalMap >::key_type  key, two_bit_color_type  value  )

inline

References put(), and boost::program_options::value().

template<typename Graph , typename P , typename N , typename C , typename Property , typename Key , typename Value >

void boost::put	(	Property	p,
		const graph_as_tree< Graph, P, N, C > &	g,
		const Key &	k,
		const Value &	val
	)

References boost::graph_as_tree_base< Graph, Node, ChIt, graph_as_tree< Graph, ParentMap, Node, ChIt > >::_g, and put().

template<typename K , typename V >

void boost::put	(	const writable_property_map_archetype< K, V > &	,
		const typename writable_property_map_archetype< K, V >::key_type &	,
		const typename writable_property_map_archetype< K, V >::value_type &
	)

template<typename G , typename P , typename V , typename Key >

void boost::put	(	P	p,
		property_graph_archetype< G, P, V > &	g,
		const Key &	key,
		const V &	value
	)

References boost::multiprecision::backends::p, and put().

template<typename Key , typename Value >

bool boost::put	(	const std::string &	name,
		dynamic_properties &	dp,
		const Key &	key,
		const Value &	value
	)

References boost::dynamic_properties::end(), boost::dynamic_properties::generate(), boost::shared_ptr< T >::get(), boost::multiprecision::backends::i, boost::dynamic_properties::insert(), boost::dynamic_properties::lower_bound(), and boost::iostreams::gzip::flags::name.

template<class PropertyMap , class Reference , class K , class V >

void boost::put ( const put_get_helper< Reference, PropertyMap > &  pa, K  k, const V &  v  )

inline

References boost::multiprecision::backends::pa.

void boost::put ( edge_length_t  , sgb_graph_ptr &  , const sgb_edge &  key, long  value  )

inline

References boost::sgb_edge::_arc, and boost::program_options::value().

template<class BidirectionalGraph , class GRef , class Property , class Key , class Value >

void boost::put	(	Property	p,
		reverse_graph< BidirectionalGraph, GRef > &	g,
		const Key &	k,
		const Value &	val
	)

References put().

template<typename G , typename EP , typename VP , typename Property , typename Key , typename Value >

void boost::put	(	Property	p,
		const filtered_graph< G, EP, VP > &	g,
		const Key &	k,
		const Value &	val
	)

References boost::filtered_graph_base< Graph >::m_g, and put().

template<class T , class Key , class Value >

void boost::put ( u_property< T >  , sgb_graph_ptr &  , const Key &  key, const Value &  value  )

inline

template<class T , class Key , class Value >

void boost::put ( v_property< T >  , sgb_graph_ptr &  , const Key &  key, const Value &  value  )

inline

template<class T , class Key , class Value >

void boost::put ( w_property< T >  , sgb_graph_ptr &  , const Key &  key, const Value &  value  )

inline

template<class T , class Key , class Value >

void boost::put ( x_property< T >  , sgb_graph_ptr &  , const Key &  key, const Value &  value  )

inline

template<class T , class Key , class Value >

void boost::put ( y_property< T >  , sgb_graph_ptr &  , const Key &  key, const Value &  value  )

inline

template<class T , class Key , class Value >

void boost::put ( z_property< T >  , sgb_graph_ptr &  , const Key &  key, const Value &  value  )

inline

template<class T , class Key , class Value >

void boost::put ( a_property< T >  , sgb_graph_ptr &  , const Key &  key, const Value &  value  )

inline

template<class T , class Key , class Value >

void boost::put ( b_property< T >  , sgb_graph_ptr &  , const Key &  key, const Value &  value  )

inline

template<typename VP , typename EP , typename GP , typename Property , typename Key , typename Value >

void boost::put ( Property  p, directed_graph< VP, EP, GP > &  g, Key const &  k, Value const &  v  )

inline

References put().

template<typename VP , typename EP , typename GP , typename Key , typename Value >

void boost::put ( vertex_all_t  , directed_graph< VP, EP, GP > &  g, Key const &  k, Value const &  v  )

inline

References put(), vertex_all, and vertex_index.

template<typename VP , typename EP , typename GP , typename Property , typename Key , typename Value >

void boost::put ( Property  p, undirected_graph< VP, EP, GP > &  g, Key const &  k, Value const &  v  )

inline

References put().

template<typename VP , typename EP , typename GP , typename Key , typename Value >

void boost::put ( edge_all_t  , directed_graph< VP, EP, GP > &  g, Key const &  k, Value const &  v  )

inline

References edge_all, edge_index, and put().

template<typename VP , typename EP , typename GP , typename Key , typename Value >

void boost::put ( vertex_all_t  , undirected_graph< VP, EP, GP > &  g, Key const &  k, Value const &  v  )

inline

References put(), vertex_all, and vertex_index.

template<typename VP , typename EP , typename GP , typename Key , typename Value >

void boost::put ( edge_all_t  , undirected_graph< VP, EP, GP > &  g, Key const &  k, Value const &  v  )

inline

References edge_all, edge_index, and put().

template<typename G , typename L , typename S , typename Prop , typename Key , typename Value >

void boost::put ( Prop  p, labeled_graph< G, L, S > &  g, Key const &  k, Value const &  v  )

inline

References put().

template<class vtype , class etype , class PropertyTag , class Key , class Value >

void boost::put ( PropertyTag  p, leda::GRAPH< vtype, etype > &  g, const Key &  key, const Value &  value  )

inline

References boost::multiprecision::backends::p, and put().

template<typename G , typename Property , typename Key , typename Value >

void boost::put	(	Property	p,
		subgraph< G > &	g,
		const Key &	k,
		const Value &	val
	)

References boost::phoenix::val().

template<typename D , typename VP , typename EP , typename GP , typename A , typename Tag >

void boost::put	(	Tag	tag,
		adjacency_matrix< D, VP, EP, GP, A > &	g,
		typename property_map< adjacency_matrix< D, VP, EP, GP, A >, Tag >::arg_type	a,
		typename property_map< adjacency_matrix< D, VP, EP, GP, A >, Tag >::single_const_type	val
	)

References boost::phoenix::val().

Referenced by boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::add_active_node(), boost::detail::add_edge_recur_up(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::lazy_add_edge::add_local_edge(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::add_remote_edge(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::adopt(), all_closeness_centralities(), all_clustering_coefficients(), all_degree_centralities(), all_eccentricities(), all_mean_geodesics(), boost::detail::dominator_visitor< Graph, IndexMap, TimeMap, PredMap, DomTreePredMap >::ancestor_with_lowest_semi_(), boost::detail::copy_graph_impl< 0 >::apply(), boost::detail::copy_graph_impl< 1 >::apply(), boost::detail::copy_graph_impl< 2 >::apply(), astar_search(), astar_search_no_init_tree(), astar_search_tree(), boost::detail::augment(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::augment(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::augment_direct_paths(), boost::planar_dfs_visitor< LowPointMap, DFSParentMap, DFSNumberMap, LeastAncestorMap, DFSParentEdgeMap, SizeType >::back_edge(), boost::detail::bridges_visitor< TreeMap, PredMap, DistMap, LowMap, Buffer >::back_edge(), boost::detail::biconnected_components_visitor< ComponentMap, DiscoverTimeMap, LowPointMap, PredecessorMap, OutputIterator, Stack, ArticulationVector, IndexMap, DFSVisitor >::back_edge(), boost::detail::bellman_dispatch2(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::bk_max_flow(), boost::detail::astar_bfs_visitor< AStarHeuristic, UniformCostVisitor, UpdatableQueue, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, BinaryFunction, BinaryPredicate >::black_target(), boost::concepts::BOOST_concept(), boost::detail::graph::brandes_betweenness_centrality_impl(), breadth_first_search(), breadth_first_visit(), color_edge(), boost::detail::compute_in_degree(), boost::detail::compute_in_degree_map(), boost::WritablePropertyMapConcept< PMap, Key >::constraints(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::convert_preflow_to_flow(), copy_edge_property(), boost::detail::graph_copy_visitor< NewGraph, Copy2OrigIndexMap, CopyVertex, CopyEdge >::copy_one_vertex(), copy_vertex_property(), boost::detail::core_numbers_impl(), create_condensation_graph(), cuthill_mckee_ordering(), cycle_canceling(), dag_shortest_paths(), depth_first_search(), boost::detail::depth_first_visit_impl(), dijkstra_shortest_paths(), dijkstra_shortest_paths_no_color_map(), boost::detail::tarjan_scc_visitor< ComponentMap, RootMap, DiscoverTime, Stack >::discover_vertex(), boost::detail::components_recorder< ComponentsMap >::discover_vertex(), boost::planar_dfs_visitor< LowPointMap, DFSParentMap, DFSNumberMap, LeastAncestorMap, DFSParentEdgeMap, SizeType >::discover_vertex(), boost::detail::bridges_visitor< TreeMap, PredMap, DistMap, LowMap, Buffer >::discover_vertex(), boost::detail::biconnected_components_visitor< ComponentMap, DiscoverTimeMap, LowPointMap, PredecessorMap, OutputIterator, Stack, ArticulationVector, IndexMap, DFSVisitor >::discover_vertex(), boost::detail::graph::divide_centrality_by_two(), boost::detail::graph::mutate_graph_impl< MutableGraph >::do_add_vertex(), boost::parallel::detail::maybe_put_in_lvalue_pm< true >::do_put(), edge_coloring(), boost::detail::graph::brandes_dijkstra_visitor< Graph, WeightMap, IncomingMap, DistanceMap, PathCountMap >::edge_not_relaxed(), boost::detail::graph::brandes_dijkstra_visitor< Graph, WeightMap, IncomingMap, DistanceMap, PathCountMap >::edge_relaxed(), edmonds_karp_max_flow(), boost::triangulation_visitor< Graph, VertexIndexMap, AddEdgeVisitor >::end_face(), fill_membership_map(), boost::greedy_matching< Graph, MateMap >::find_matching(), boost::extra_greedy_matching< Graph, MateMap >::find_matching(), boost::empty_matching< Graph, MateMap >::find_matching(), find_odd_cycle(), boost::detail::graph::mutate_graph_impl< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > >::finish_building_graph(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::finish_node(), boost::detail::bfs_king_visitor< OutputIterator, Buffer, Compare, PseudoDegreeMap, VecMap, VertexIndexMap >::finish_vertex(), boost::detail::tarjan_scc_visitor< ComponentMap, RootMap, DiscoverTime, Stack >::finish_vertex(), boost::detail::mas_min_cut_visitor< ParityMap, WeightMap, IndexMap >::finish_vertex(), boost::detail::bridges_visitor< TreeMap, PredMap, DistMap, LowMap, Buffer >::finish_vertex(), boost::planar_dfs_visitor< LowPointMap, DFSParentMap, DFSNumberMap, LeastAncestorMap, DFSParentEdgeMap, SizeType >::finish_vertex(), boost::detail::biconnected_components_visitor< ComponentMap, DiscoverTimeMap, LowPointMap, PredecessorMap, OutputIterator, Stack, ArticulationVector, IndexMap, DFSVisitor >::finish_vertex(), for(), fruchterman_reingold_force_directed_layout(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::gap(), boost::date_time::gather_month_strings(), boost::date_time::gather_weekday_strings(), boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::get_current_matching(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::get_next_active_node(), boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::get_vertex_state_map(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::global_distance_update(), boost::detail::astar_bfs_visitor< AStarHeuristic, UniformCostVisitor, UpdatableQueue, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, BinaryFunction, BinaryPredicate >::gray_target(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::grow(), gursoy_atun_layout(), gursoy_atun_step(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::has_sink_connect(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::has_source_connect(), if(), boost::detail::graph::init_centrality_map(), boost::detail::biconnected_components_visitor< ComponentMap, DiscoverTimeMap, LowPointMap, PredecessorMap, OutputIterator, Stack, ArticulationVector, IndexMap, DFSVisitor >::initialize_vertex(), boost::detail::mas_min_cut_visitor< ParityMap, WeightMap, IndexMap >::initialize_vertex(), boost::detail::bridges_visitor< TreeMap, PredMap, DistMap, LowMap, Buffer >::initialize_vertex(), boost::graph_detail::insert_labeled_vertex(), boost::detail::invert_cd_path(), is_connected(), iterative_bit_vector_dominator_tree(), johnson_all_pairs_shortest_paths(), king_ordering(), kosaraju_strong_components(), lengauer_tarjan_dominator_tree_without_dfs(), boost::subgraph< Graph >::local_add_edge(), boost::parallel::local_put(), loop_erased_random_walk(), boost::disjoint_sets< vertex_to_vsize_map_t, vertex_to_vertex_map_t >::make_set(), boost::detail::maximum_adjacency_search(), boost::detail::parallel::maybe_initialize_vertex_indices(), boost::detail::maybe_jitter_point(), boost::parallel::detail::maybe_put_impl(), boost::detail::mcgregor_common_subgraphs_internal(), boost::detail::mcgregor_common_subgraphs_internal_init(), boost::detail::mmd_impl< Graph, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, VertexIndexMap >::mmd_impl(), boost::detail::neighbor_bfs_helper(), boost::detail::neighbor_bfs_impl(), boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type< Graph, IncomingMap, DistanceMap, PathCountMap >::non_tree_edge(), boost::detail::darken_and_push< ColorMap >::operator()(), boost::detail::bipartition_colorize< PartitionMap >::operator()(), boost::detail::update_position_visitor< PositionMap, NodeDistanceMap, Topology, Graph >::operator()(), boost::detail::dominator_visitor< Graph, IndexMap, TimeMap, PredMap, DomTreePredMap >::operator()(), boost::detail::edge_copier< Graph1, Graph2 >::operator()(), boost::detail::vertex_copier< Graph1, Graph2 >::operator()(), boost::predecessor_recorder< PredecessorMap, Tag >::operator()(), boost::edge_predecessor_recorder< PredEdgeMap, on_edge_relaxed >::operator()(), boost::mutate_graph_impl< MutableGraph >::put_property< Key, ValueVector >::operator()(), boost::distance_recorder< DistanceMap, Tag >::operator()(), boost::time_stamper< TimeMap, TimeT, Tag >::operator()(), boost::detail::fr_apply_force< Topology, PositionMap, DisplacementMap, RepulsiveForce, Graph >::operator()(), boost::property_put< PropertyMap, EventTag >::operator()(), boost::detail::unique_subgraph_interceptor< GraphFirst, GraphSecond, VertexIndexMapFirst, VertexIndexMapSecond, SubGraphCallback >::operator()(), boost::detail::maximum_subgraph_interceptor< GraphFirst, GraphSecond, VertexIndexMapFirst, VertexIndexMapSecond, SubGraphCallback >::operator()(), boost::detail::unique_maximum_subgraph_interceptor< GraphFirst, GraphSecond, VertexIndexMapFirst, VertexIndexMapSecond, SubGraphCallback >::operator()(), boost::local_time::operator<<(), boost::posix_time::operator<<(), boost::gregorian::operator<<(), boost::chrono::operator<<(), planar_face_traversal(), boost::detail::base_state< Graph1, Graph2, IndexMap1, IndexMap2 >::pop(), boost::detail::base_state< Graph1, Graph2, IndexMap1, IndexMap2 >::push(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::push_flow(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::push_relabel(), boost::parallel::put(), put(), boost::detail::r_c_shortest_paths_dispatch(), random_graph_layout(), boost::detail::random_spanning_tree_internal(), boost::detail::rec_two_graphs_common_spanning_trees(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::relabel_distance(), relative_betweenness_centrality(), relax(), boost::detail::rotate_fan(), boost::detail::graph::kamada_kawai_spring_layout_impl< Topology, Graph, PositionMap, WeightMap, EdgeOrSideLength, Done, VertexIndexMap, DistanceMatrix, SpringStrengthMatrix, PartialDerivativeMap >::run(), scale_graph(), sequential_vertex_coloring(), boost::detail::graph::mutate_graph_impl< MutableGraph >::set_edge_property(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::set_edge_to_parent(), boost::detail::graph::mutate_graph_impl< MutableGraph >::set_graph_property(), boost::detail::graph::mutate_graph_impl< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > >::set_graph_property(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::set_no_parent(), boost::detail::graph::mutate_graph_impl< MutableGraph >::set_node_property(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::set_tree(), sloan_ordering(), smallest_last_vertex_ordering(), boost::planar_dfs_visitor< LowPointMap, DFSParentMap, DFSNumberMap, LeastAncestorMap, DFSParentEdgeMap, SizeType >::start_vertex(), successive_shortest_path_nonnegative_weights(), boost::graph_test< Graph >::test_vertex_property_graph(), boost::planar_dfs_visitor< LowPointMap, DFSParentMap, DFSNumberMap, LeastAncestorMap, DFSParentEdgeMap, SizeType >::tree_edge(), boost::detail::bridges_visitor< TreeMap, PredMap, DistMap, LowMap, Buffer >::tree_edge(), boost::detail::biconnected_components_visitor< ComponentMap, DiscoverTimeMap, LowPointMap, PredecessorMap, OutputIterator, Stack, ArticulationVector, IndexMap, DFSVisitor >::tree_edge(), boost::detail::astar_bfs_visitor< AStarHeuristic, UniformCostVisitor, UpdatableQueue, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, BinaryFunction, BinaryPredicate >::tree_edge(), boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type< Graph, IncomingMap, DistanceMap, PathCountMap >::tree_edge(), boost::triangulation_visitor< Graph, VertexIndexMap, AddEdgeVisitor >::triangulation_visitor(), boost::detail::undir_dfv_impl(), undirected_dfs(), boost::detail::graph::update_centrality(), and boost::edge_index_update_visitor< EdgeIndexMap >::visit_vertex_pair().

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , typename Tag >

void boost::put	(	Tag	tag,
		compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &	g,
		typename property_map< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, Tag >::key_type	k,
		typename lookup_one_property< typename property_map< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >, Tag >::plist_type, Tag >::type	val
	)

References boost::python::converter::registry::lookup(), and boost::phoenix::val().

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

void boost::put ( vertex_all_t  , compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g, Vertex  v, const VertexProperty &  val  )

inline

References put(), and vertex_all.

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

void boost::put ( edge_all_t  , compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g, const typename compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::edge_descriptor &  e, const EdgeProperty &  val  )

inline

References edge_all, and put().

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

void boost::put ( graph_all_t  , compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g, compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > *  , const GraphProperty &  val  )

inline

References boost::phoenix::val().

template<typename Property , typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename Key , typename Value >

void boost::put	(	Property	p,
		adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g,
		const Key &	key,
		const Value &	v
	)

References BOOST_ASSERT, local(), boost::detail::parallel::owner(), process_id, and put().

template<typename PropertyMap , typename EventTag >

property_put<PropertyMap, EventTag> boost::put_property ( PropertyMap  property_map, typename property_traits< PropertyMap >::value_type  value, EventTag    )

inline

Creates a property_put functor which just sets a given value to a vertex or edge.

Parameters

property_map	Given writeable property map
value	Fixed value of the map
tag	Event Filter

Returns

The functor.

References boost::program_options::value().

Referenced by find_odd_cycle(), and is_bipartite().

template<class Graph , class VertexIndexMap , class EdgeIndexMap , class Resource_Container , class Resource_Extension_Function , class Dominance_Function , class Label_Allocator , class Visitor >

void boost::r_c_shortest_paths	(	const Graph &	g,
		const VertexIndexMap &	vertex_index_map,
		const EdgeIndexMap &	edge_index_map,
		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,
		const Resource_Container &	rc,
		const Resource_Extension_Function &	ref,
		const Dominance_Function &	dominance,
		Label_Allocator	la,
		Visitor	vis
	)

References boost::detail::r_c_shortest_paths_dispatch().

template<class Graph , class VertexIndexMap , class EdgeIndexMap , class Resource_Container , class Resource_Extension_Function , class Dominance_Function , class Label_Allocator , class Visitor >

void boost::r_c_shortest_paths	(	const Graph &	g,
		const VertexIndexMap &	vertex_index_map,
		const EdgeIndexMap &	edge_index_map,
		typename graph_traits< Graph >::vertex_descriptor	s,
		typename graph_traits< Graph >::vertex_descriptor	t,
		std::vector< typename graph_traits< Graph >::edge_descriptor > &	pareto_optimal_solution,
		Resource_Container &	pareto_optimal_resource_container,
		const Resource_Container &	rc,
		const Resource_Extension_Function &	ref,
		const Dominance_Function &	dominance,
		Label_Allocator	la,
		Visitor	vis
	)

References boost::detail::r_c_shortest_paths_dispatch().

template<class Graph , class VertexIndexMap , class EdgeIndexMap , class Resource_Container , class Resource_Extension_Function , class Dominance_Function >

void boost::r_c_shortest_paths	(	const Graph &	g,
		const VertexIndexMap &	vertex_index_map,
		const EdgeIndexMap &	edge_index_map,
		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,
		const Resource_Container &	rc,
		const Resource_Extension_Function &	ref,
		const Dominance_Function &	dominance
	)

References boost::detail::r_c_shortest_paths_dispatch().

template<class Graph , class VertexIndexMap , class EdgeIndexMap , class Resource_Container , class Resource_Extension_Function , class Dominance_Function >

void boost::r_c_shortest_paths	(	const Graph &	g,
		const VertexIndexMap &	vertex_index_map,
		const EdgeIndexMap &	edge_index_map,
		typename graph_traits< Graph >::vertex_descriptor	s,
		typename graph_traits< Graph >::vertex_descriptor	t,
		std::vector< typename graph_traits< Graph >::edge_descriptor > &	pareto_optimal_solution,
		Resource_Container &	pareto_optimal_resource_container,
		const Resource_Container &	rc,
		const Resource_Extension_Function &	ref,
		const Dominance_Function &	dominance
	)

References boost::detail::r_c_shortest_paths_dispatch().

template<typename Graph , typename EccentricityMap >

property_traits<EccentricityMap>::value_type boost::radius ( const Graph &  g, EccentricityMap  ecc  )

inline

References radius_and_diameter().

Referenced by boost::geometry::strategy::area::huiller< PointOfSegment, CalculationType >::excess_sum::area(), boost::circle_topology< RandomNumberGenerator >::circle_topology(), radius_and_diameter(), and boost::sphere_topology< RandomNumberGenerator >::sphere_topology().

template<typename Graph , typename EccentricityMap >

std::pair<typename property_traits<EccentricityMap>::value_type, typename property_traits<EccentricityMap>::value_type> boost::radius_and_diameter ( const Graph &  g, EccentricityMap  ecc  )

inline

References BOOST_CONCEPT_ASSERT(), BOOST_PREVENT_MACRO_SUBSTITUTION, BOOST_USING_STD_MAX, BOOST_USING_STD_MIN, diameter(), end, boost::multiprecision::backends::i, boost::xpressive::make_pair, boost::accumulators::extract::max, boost::accumulators::extract::min, next(), radius(), Vertex, and vertices().

Referenced by diameter(), and radius().

template<class Iterator , class TrueVals >

void boost::random_access_readable_iterator_test	(	Iterator	i,
		int	N,
		TrueVals	vals
	)

References bidirectional_readable_iterator_test(), BOOST_TEST, boost::multiprecision::backends::c, boost::multiprecision::backends::i, and boost::flyweights::x.

template<class Graph , class RandomNumGen >

graph_traits<Graph>::edge_descriptor boost::random_edge	(	Graph &	g,
		RandomNumGen &	gen
	)

References edges(), boost::multiprecision::backends::i, n, next(), and num_edges().

template<typename Topology , typename Graph , typename PositionMap >

void boost::random_graph_layout	(	const Graph &	g,
		PositionMap	position_map,
		const Topology &	topology
	)

References BGL_FORALL_VERTICES_T, and put().

template<typename Graph , typename RandomNumGen >

graph_traits<Graph>::edge_descriptor boost::random_out_edge	(	Graph &	g,
		typename graph_traits< Graph >::vertex_descriptor	src,
		RandomNumGen &	gen
	)

References boost::fusion::advance(), boost::detail::degree_size_type, it, out_degree(), and out_edges().

Referenced by boost::unweighted_random_out_edge_gen< Graph, Gen >::operator()().

template<typename Graph , typename Gen , typename PredMap , typename ColorMap >

void boost::random_spanning_tree	(	const Graph &	g,
		Gen &	gen,
		typename graph_traits< Graph >::vertex_descriptor	root,
		PredMap	pred,
		static_property_map< double >	,
		ColorMap	color
	)

References boost::detail::random_spanning_tree_internal().

Referenced by random_spanning_tree().

template<typename Graph , typename Gen , typename PredMap , typename WeightMap , typename ColorMap >

void boost::random_spanning_tree	(	const Graph &	g,
		Gen &	gen,
		typename graph_traits< Graph >::vertex_descriptor	root,
		PredMap	pred,
		WeightMap	weight,
		ColorMap	color
	)

References boost::detail::random_spanning_tree_internal().

template<typename Graph , typename Gen , typename P , typename T , typename R >

void boost::random_spanning_tree	(	const Graph &	g,
		Gen &	gen,
		const bgl_named_params< P, T, R > &	params
	)

References BOOST_GRAPH_DECLARE_CONVERTED_PARAMETERS, boost::xpressive::first, random_spanning_tree(), and boost::graph::vertices().

template<class Graph , class RandomNumGen >

graph_traits<Graph>::vertex_descriptor boost::random_vertex	(	Graph &	g,
		RandomNumGen &	gen
	)

References boost::multiprecision::backends::i, n, next(), num_vertices(), and vertices().

Referenced by generate_random_graph(), and generate_random_graph1().

template<class Property , class G , class RandomGenerator >

void boost::randomize_property	(	G &	g,
		RandomGenerator &	rg
	)

References boost::detail::randomize_property().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( vertex_rank , _t)> boost::rank_map

(

const PType &

p

)

Referenced by kruskal_minimum_spanning_tree().

template<typename T , typename IntType >

T boost::rational_cast ( const rational< IntType > &src   BOOST_APPEND_EXPLICIT_TEMPLATE_TYPET )

inline

References T.

Referenced by boost::numeric::converter< double, rational< T >, Traits, OverflowHandler, Float2IntRounder, RawConverter, UserRangeChecker >::convert().

template<class C >

BOOST_DEDUCED_TYPENAME range_reverse_iterator<C>::type boost::rbegin ( C &  c )

inline

References BOOST_DEDUCED_TYPENAME, and end.

Referenced by const_rbegin(), boost::numeric::ublas::triangular_matrix< T, TRI, L, A >::const_iterator1::crbegin(), boost::numeric::ublas::matrix< T, L, A >::const_iterator1::crbegin(), boost::numeric::ublas::triangular_matrix< T, TRI, L, A >::const_iterator2::crbegin(), boost::numeric::ublas::matrix< T, L, A >::const_iterator2::crbegin(), boost::numeric::ublas::triangular_adaptor< M, TRI >::const_iterator1::crbegin(), boost::numeric::ublas::triangular_adaptor< M, TRI >::const_iterator2::crbegin(), boost::numeric::ublas::vector_of_vector< T, L, A >::const_iterator1::crbegin(), boost::numeric::ublas::vector_of_vector< T, L, A >::const_iterator2::crbegin(), boost::numeric::ublas::zero_matrix< T, ALLOC >::const_iterator1::crbegin(), boost::numeric::ublas::zero_matrix< T, ALLOC >::const_iterator2::crbegin(), boost::numeric::ublas::identity_matrix< T, ALLOC >::const_iterator1::crbegin(), boost::numeric::ublas::identity_matrix< T, ALLOC >::const_iterator2::crbegin(), boost::numeric::ublas::scalar_matrix< T, ALLOC >::const_iterator1::crbegin(), boost::numeric::ublas::scalar_matrix< T, ALLOC >::const_iterator2::crbegin(), boost::numeric::ublas::c_matrix< T, N, M >::const_iterator1::crbegin(), boost::numeric::ublas::c_matrix< T, N, M >::const_iterator2::crbegin(), boost::icl::elements_rbegin(), boost::detail::bfs_king_visitor< OutputIterator, Buffer, Compare, PseudoDegreeMap, VecMap, VertexIndexMap >::finish_vertex(), boost::icl::hull(), boost::icl::last(), boost::proto::functional::rbegin::operator()(), boost::foreach_detail_::rbegin(), and boost::icl::upper().

template<class C >

BOOST_DEDUCED_TYPENAME range_reverse_iterator<const C>::type boost::rbegin ( const C &  c )

inline

References BOOST_DEDUCED_TYPENAME, and end.

template<class EL , class VL , class D , class VP , class EP , class GP , class VPS , class EPS >

GraphParser<adjacency_list<EL,VL,D,VP,EP,GP>,VP,EP,VPS,EPS> boost::read	(	adjacency_list< EL, VL, D, VP, EP, GP > &	g,
		VPS	vps,
		EPS	eps
	)

graph parser for given subsets of internal vertex and edge properties

template<class EL , class VL , class D , class VP , class EP , class GP >

GraphParser<adjacency_list<EL,VL,D,VP,EP,GP>,VP,EP,VP,EP> boost::read

(

adjacency_list< EL, VL, D, VP, EP, GP > &

g

)

graph parser for all internal vertex and edge properties

template<class Graph , class CapacityMap , class ReverseEdgeMap >

int boost::read_dimacs_max_flow	(	Graph &	g,
		CapacityMap	capacity,
		ReverseEdgeMap	reverse_edge,
		typename graph_traits< Graph >::vertex_descriptor &	src,
		typename graph_traits< Graph >::vertex_descriptor &	sink,
		std::istream &	in = std::cin
	)

References boost::flyweights::in, and boost::detail::read_dimacs_max_flow_internal().

template<class Graph , class CapacityMap , class ReverseEdgeMap >

int boost::read_dimacs_min_cut	(	Graph &	g,
		CapacityMap	capacity,
		ReverseEdgeMap	reverse_edge,
		std::istream &	in = std::cin
	)

References boost::flyweights::in, and boost::detail::read_dimacs_max_flow_internal().

void BOOST_GRAPH_DECL boost::read_graphml	(	std::istream &	in,
		mutate_graph &	g,
		size_t	desired_idx
	)

Referenced by read_graphml().

template<typename MutableGraph >

void boost::read_graphml	(	std::istream &	in,
		MutableGraph &	g,
		dynamic_properties &	dp,
		size_t	desired_idx = 0
	)

References read_graphml().

template<typename MutableGraph >

bool boost::read_graphviz	(	const std::string &	data,
		MutableGraph &	graph,
		dynamic_properties &	dp,
		std::string const &	node_id = "node_id"
	)

References boost::spirit::ascii::graph.

Referenced by read_graphviz().

template<typename InputIterator , typename MutableGraph >

bool boost::read_graphviz	(	InputIterator	user_first,
		InputIterator	user_last,
		MutableGraph &	graph,
		dynamic_properties &	dp,
		std::string const &	node_id = "node_id"
	)

References boost::xpressive::first, last, and boost::spirit::make_multi_pass().

template<typename MutableGraph >

bool boost::read_graphviz	(	std::istream &	in,
		MutableGraph &	graph,
		dynamic_properties &	dp,
		std::string const &	node_id = "node_id"
	)

References read_graphviz().

template<class Iterator , class T >

void boost::readable_iterator_test	(	const Iterator	i1,
		T	v
	)

References BOOST_STATIC_ASSERT(), BOOST_TEST, readable_iterator_traversal_test(), T, and boost::program_options::value().

Referenced by bidirectional_readable_iterator_test(), and forward_readable_iterator_test().

template<class Iterator , class T >

void boost::readable_iterator_traversal_test	(	Iterator	i1,
		T	v,
		mpl::true_
	)

References BOOST_TEST, and T.

Referenced by readable_iterator_test().

template<class Iterator , class T >

void boost::readable_iterator_traversal_test	(	const Iterator	i1,
		T	v,
		mpl::false_
	)

template<class DistanceMap , class Tag >

distance_recorder<DistanceMap, Tag> boost::record_distances	(	DistanceMap	pa,
		Tag
	)

References boost::multiprecision::backends::pa.

Referenced by boost::detail::gursoy_shortest< EdgeWeightMap >::run(), boost::detail::gursoy_shortest< dummy_property_map >::run(), sloan_ordering(), and sloan_start_end_vertices().

template<class PredEdgeMap , class Tag >

edge_predecessor_recorder<PredEdgeMap, Tag> boost::record_edge_predecessors	(	PredEdgeMap	pa,
		Tag
	)

References boost::multiprecision::backends::pa.

Referenced by edmonds_karp_max_flow(), and successive_shortest_path_nonnegative_weights().

template<class PredecessorMap , class Tag >

predecessor_recorder<PredecessorMap, Tag> boost::record_predecessors	(	PredecessorMap	pa,
		Tag
	)

References boost::multiprecision::backends::pa.

Referenced by find_odd_cycle(), boost::graph_as_tree< Graph, ParentMap, Node, ChIt >::graph_as_tree(), and lengauer_tarjan_dominator_tree().

default_color_type boost::red ( default_color_type  )

inline

References red_color.

Referenced by boost::intrusive::rbtree_algorithms< NodeTraits >::erase(), boost::intrusive::rbtree_algorithms< NodeTraits >::init_header(), boost::intrusive::rbtree_algorithms< NodeTraits >::is_header(), boost::intrusive::detail::rbtree_node_checker< ValueTraits, NodePtrCompare, ExtraChecker >::operator()(), and sloan_ordering().

template<class T >

BOOST_FORCEINLINE reference_wrapper<T> BOOST_REF_CONST boost::ref

(

T &

t

)

Returns

reference_wrapper<T>(t)

Remarks

Does not throw.

References boost::flyweights::t.

Referenced by vex::abs(), boost::spirit::lex::reference< Subject, unused_type >::add_actions(), boost::xpressive::after(), boost::numeric::ublas::generalized_vector_of_vector< T, L, A >::append_element(), boost::random::detail::backward_compatible_uniform_01< UniformRandomNumberGenerator, RealType >::base(), boost::xpressive::before(), boost::detail::bfs_helper(), brandes_betweenness_centrality(), breadth_first_visit(), check_r_c_path(), boost::numeric::ublas::generalized_vector_of_vector< T, L, A >::clear(), boost::iostreams::detail::composite_filter< Filter1, Filter2, Mode >::close(), boost::spirit::lex::reference< Subject, unused_type >::collect(), boost::LvaluePropertyMapConcept< PMap, Key >::constraints(), boost::Mutable_LvaluePropertyMapConcept< PMap, Key >::constraints(), boost::BoostRegexConcept< Regex >::constraints(), boost::gil::detail::PixelIteratorIsMutableConcept< Iterator >::constraints(), boost::python::objects::class_cref_wrapper< Src, MakeInstance >::convert(), boost::numeric::odeint::implicit_euler_mtl4< ValueType, Resizer >::do_step(), boost::numeric::odeint::implicit_euler< ValueType, Resizer >::do_step(), boost::numeric::odeint::symplectic_nystroem_stepper_base< 5, 4, Coor, Momentum, Value, CoorDeriv, MomentumDeriv, Time, Algebra, Operations, Resizer >::do_step(), boost::numeric::odeint::explicit_stepper_base< euler< State, Value, Deriv, Time, Algebra, Operations, Resizer >, 1, State, Value, Deriv, Time, Algebra, Operations, Resizer >::do_step(), boost::numeric::odeint::explicit_error_stepper_fsal_base< runge_kutta_dopri5< State, Value, Deriv, Time, Algebra, Operations, Resizer >, 5, 5, 4, State, Value, Deriv, Time, Algebra, Operations, Resizer >::do_step(), boost::numeric::odeint::explicit_error_stepper_base< runge_kutta_cash_karp54_classic< State, Value, Deriv, Time, Algebra, Operations, Resizer >, 5, 5, 4, State, Value, Deriv, Time, Algebra, Operations, Resizer >::do_step(), boost::numeric::odeint::rosenbrock4< Value, Coefficients, Resizer >::do_step(), boost::numeric::odeint::modified_midpoint_dense_out< state_type, value_type, deriv_type, time_type, algebra_type, operations_type, resizer_type >::do_step(), boost::numeric::odeint::modified_midpoint< state_type, value_type, deriv_type, time_type, algebra_type, operations_type, resizer_type >::do_step_impl(), boost::numeric::odeint::runge_kutta4_classic< State, Value, Deriv, Time, Algebra, Operations, Resizer >::do_step_impl(), boost::numeric::odeint::runge_kutta_dopri5< State, Value, Deriv, Time, Algebra, Operations, Resizer >::do_step_impl(), boost::numeric::odeint::runge_kutta_cash_karp54_classic< State, Value, Deriv, Time, Algebra, Operations, Resizer >::do_step_impl(), boost::numeric::odeint::explicit_error_generic_rk< 6, 5, 5, 4, State, Value, Deriv, Time, Algebra, Operations, Resizer >::do_step_impl(), boost::numeric::odeint::explicit_generic_rk< 4, 4, State, Value, Deriv, Time, Algebra, Operations, Resizer >::do_step_impl(), boost::variate_generator< UniformRandomNumberGenerator *, distribution_type >::engine(), phoenix::impl::as_ptr< ClassT >::get(), boost::python::handle_exception(), boost::spirit::lex::reference< Subject, IdType >::id(), boost::numeric::odeint::rosenbrock4_dense_output< ControlledStepper >::initialize(), boost::numeric::odeint::dense_output_runge_kutta< Stepper, stepper_tag >::initialize(), boost::numeric::odeint::velocity_verlet< Coor, Velocity, Value, Acceleration, Time, TimeSq, Algebra, Operations, Resizer >::initialize(), boost::numeric::odeint::adams_bashforth< steps, state_type, value_type, deriv_type, time_type, algebra_type, operations_type, resizer_type >::initialize(), boost::numeric::odeint::bulirsch_stoer_dense_out< State, Value, Deriv, Time, Algebra, Operations, Resizer >::initialize(), boost::numeric::odeint::dense_output_runge_kutta< Stepper, explicit_controlled_stepper_fsal_tag >::initialize(), boost::numeric::ublas::generalized_vector_of_vector< T, L, A >::insert_element(), boost::xpressive::keep(), boost::phoenix::expression::reference< proto::_ >::make(), boost::detail::neighbor_bfs_helper(), neighbor_breadth_first_visit(), non_distributed_brandes_betweenness_centrality(), boost::graph::detail::breadth_first_search_impl< Graph, Source >::operator()(), boost::BOOST_RT_PARAM_NAMESPACE::environment::variable< T >::operator=(), boost::interprocess::weak_ptr< element_type, A, D >::operator=(), boost::xpressive::optional(), boost::spirit::traits::transform_attribute< iterator_range< Iterator > const, utree, karma::domain >::pre(), boost::unit_test::print_escaped(), boost::detail::r_c_shortest_paths_dispatch(), boost::iostreams::detail::composite_filter< Filter1, Filter2, Mode >::read(), boost::xpressive::repeat(), boost::numeric::ublas::generalized_vector_of_vector< T, L, A >::resize(), boost::iostreams::detail::composite_filter< Filter1, Filter2, Mode >::seek(), boost::detail::shared_state_base::set_wait_callback(), boost::spirit::lex::reference< Subject, IdType >::state(), boost::numeric::odeint::rosenbrock4_controller< Stepper >::try_step(), boost::numeric::odeint::bulirsch_stoer< State, Value, Deriv, Time, Algebra, Operations, Resizer >::try_step(), boost::numeric::odeint::controlled_runge_kutta< ErrorStepper, ErrorChecker, Resizer, explicit_error_stepper_tag >::try_step(), boost::numeric::odeint::controlled_runge_kutta< ErrorStepper, ErrorChecker, Resizer, explicit_error_stepper_fsal_tag >::try_step(), boost::spirit::lex::reference< Subject, IdType >::unique_id(), boost::interprocess::weak_ptr< element_type, A, D >::weak_ptr(), and boost::iostreams::detail::composite_filter< Filter1, Filter2, Mode >::write().

template<class T >

void boost::ref

(

T const &&

)

Remarks

Construction from a temporary object is disabled.

template<class OutputIterator , class Iterator , class Allocator , class Functor >

OutputIterator boost::regex_format ( OutputIterator  out, const match_results< Iterator, Allocator > &  m, Functor  fmt, match_flag_type  flags = format_all  )

inline

References boost::match_results< BidiIterator, Allocator >::format().

Referenced by boost::BoostRegexConcept< Regex >::constraints().

template<class Iterator , class Allocator , class Functor >

std::basic_string<typename match_results<Iterator, Allocator>::char_type> boost::regex_format ( const match_results< Iterator, Allocator > &  m, Functor  fmt, match_flag_type  flags = format_all  )

inline

References boost::match_results< BidiIterator, Allocator >::format().

template<class Predicate , class BidiIterator , class charT , class traits >

unsigned int boost::regex_grep ( Predicate  foo, BidiIterator  first, BidiIterator  last, const basic_regex< charT, traits > &  e, match_flag_type  flags = match_default  )

inline

References count, boost::regex_constants::failbit, boost::re_detail::perl_matcher< BidiIterator, Allocator, traits >::find(), boost::basic_regex< charT, traits >::flags(), boost::match_results< BidiIterator, Allocator >::length(), match_continuous, match_not_null, boost::locale::period::marks::second, boost::re_detail::perl_matcher< BidiIterator, Allocator, traits >::setf(), and boost::re_detail::perl_matcher< BidiIterator, Allocator, traits >::unsetf().

Referenced by regex_grep(), and regex_split().

template<class Predicate , class charT , class traits >

unsigned int boost::regex_grep ( Predicate  foo, const charT *  str, const basic_regex< charT, traits > &  e, match_flag_type  flags = match_default  )

inline

References regex_grep().

template<class Predicate , class ST , class SA , class charT , class traits >

unsigned int boost::regex_grep ( Predicate  foo, const std::basic_string< charT, ST, SA > &  s, const basic_regex< charT, traits > &  e, match_flag_type  flags = match_default  )

inline

References regex_grep().

template<class BidiIterator , class Allocator , class charT , class traits >

bool boost::regex_match	(	BidiIterator	first,
		BidiIterator	last,
		match_results< BidiIterator, Allocator > &	m,
		const basic_regex< charT, traits > &	e,
		match_flag_type	flags = match_default
	)

References boost::re_detail::perl_matcher< BidiIterator, Allocator, traits >::match().

template<class B , bool b, class A , class T >

bool boost::regex_match ( const ATL::CSimpleStringT< B, b > &  s, match_results< const B *, A > &  what, const basic_regex< B, T > &  e, boost::regex_constants::match_flag_type  f = boost::regex_constants::match_default  )

inline

References regex_match(), and boost::archive::what().

Referenced by boost::BaseRegexConcept< Regex >::constraints(), boost::RegexConcept< Regex >::constraints(), boost::re_detail::do_regex_match(), boost::algorithm::join_if(), boost::aux::match_traits< ExpressionT, boost_regex_expression_tag >::matches(), boost::aux::match_traits< ExpressionT, std_regex_expression_tag >::matches(), and regex_match().

template<class iterator , class charT , class traits >

bool boost::regex_match	(	iterator	first,
		iterator	last,
		const basic_regex< charT, traits > &	e,
		match_flag_type	flags = match_default
	)

References match_any, and regex_match().

template<class B , bool b, class T >

bool boost::regex_match ( const ATL::CSimpleStringT< B, b > &  s, const basic_regex< B, T > &  e, boost::regex_constants::match_flag_type  f = boost::regex_constants::match_default  )

inline

Referenced by regex_match().

template<class charT , class Allocator , class traits >

bool boost::regex_match ( const charT *  str, match_results< const charT *, Allocator > &  m, const basic_regex< charT, traits > &  e, match_flag_type  flags = match_default  )

inline

References regex_match().

template<class ST , class SA , class Allocator , class charT , class traits >

bool boost::regex_match ( const std::basic_string< charT, ST, SA > &  s, match_results< typename std::basic_string< charT, ST, SA >::const_iterator, Allocator > &  m, const basic_regex< charT, traits > &  e, match_flag_type  flags = match_default  )

inline

References regex_match().

template<class charT , class traits >

bool boost::regex_match ( const charT *  str, const basic_regex< charT, traits > &  e, match_flag_type  flags = match_default  )

inline

References match_any, and regex_match().

template<class ST , class SA , class charT , class traits >

bool boost::regex_match ( const std::basic_string< charT, ST, SA > &  s, const basic_regex< charT, traits > &  e, match_flag_type  flags = match_default  )

inline

References match_any, and regex_match().

template<class OutputIterator , class Iterator , class traits , class charT >

OutputIterator boost::regex_merge ( OutputIterator  out, Iterator  first, Iterator  last, const basic_regex< charT, traits > &  e, const charT *  fmt, match_flag_type  flags = match_default  )

inline

References regex_replace().

Referenced by regex_merge().

template<class OutputIterator , class Iterator , class traits , class charT >

OutputIterator boost::regex_merge ( OutputIterator  out, Iterator  first, Iterator  last, const basic_regex< charT, traits > &  e, const std::basic_string< charT > &  fmt, match_flag_type  flags = match_default  )

inline

References regex_merge().

template<class traits , class charT >

std::basic_string<charT> boost::regex_merge ( const std::basic_string< charT > &  s, const basic_regex< charT, traits > &  e, const charT *  fmt, match_flag_type  flags = match_default  )

inline

References regex_replace().

template<class traits , class charT >

std::basic_string<charT> boost::regex_merge ( const std::basic_string< charT > &  s, const basic_regex< charT, traits > &  e, const std::basic_string< charT > &  fmt, match_flag_type  flags = match_default  )

inline

References regex_replace().

template<class OutputIterator , class BidirectionalIterator , class traits , class charT , class Formatter >

OutputIterator boost::regex_replace	(	OutputIterator	out,
		BidirectionalIterator	first,
		BidirectionalIterator	last,
		const basic_regex< charT, traits > &	e,
		Formatter	fmt,
		match_flag_type	flags = match_default
	)

References boost::filesystem::detail::copy(), format_first_only, format_no_copy, boost::multiprecision::backends::i, and out.

template<class traits , class charT , class Formatter >

std::basic_string<charT> boost::regex_replace	(	const std::basic_string< charT > &	s,
		const basic_regex< charT, traits > &	e,
		Formatter	fmt,
		match_flag_type	flags = match_default
	)

References boost::multiprecision::backends::i, and regex_replace().

template<class OutputIterator , class BidirectionalIterator , class traits , class B , bool b>

OutputIterator boost::regex_replace	(	OutputIterator	out,
		BidirectionalIterator	first,
		BidirectionalIterator	last,
		const basic_regex< B, traits > &	e,
		const ATL::CSimpleStringT< B, b > &	fmt,
		match_flag_type	flags = match_default
	)

References regex_replace().

Referenced by boost::RegexConcept< Regex >::constraints(), boost::BoostRegexConcept< Regex >::constraints(), regex_merge(), and regex_replace().

template<class traits , class B , bool b>

ATL::CSimpleStringT<B, b> boost::regex_replace	(	const ATL::CSimpleStringT< B, b > &	s,
		const basic_regex< B, traits > &	e,
		const ATL::CSimpleStringT< B, b > &	fmt,
		match_flag_type	flags = match_default
	)

References boost::multiprecision::backends::i, and regex_replace().

Referenced by regex_replace().

template<class BidiIterator , class Allocator , class charT , class traits >

bool boost::regex_search	(	BidiIterator	first,
		BidiIterator	last,
		match_results< BidiIterator, Allocator > &	m,
		const basic_regex< charT, traits > &	e,
		match_flag_type	flags = match_default
	)

References regex_search().

template<class BidiIterator , class Allocator , class charT , class traits >

bool boost::regex_search	(	BidiIterator	first,
		BidiIterator	last,
		match_results< BidiIterator, Allocator > &	m,
		const basic_regex< charT, traits > &	e,
		match_flag_type	flags,
		BidiIterator	base
	)

References boost::regex_constants::failbit, boost::re_detail::perl_matcher< BidiIterator, Allocator, traits >::find(), and boost::basic_regex< charT, traits >::flags().

template<class charT , class Allocator , class traits >

bool boost::regex_search ( const charT *  str, match_results< const charT *, Allocator > &  m, const basic_regex< charT, traits > &  e, match_flag_type  flags = match_default  )

inline

References regex_search().

template<class ST , class SA , class Allocator , class charT , class traits >

bool boost::regex_search ( const std::basic_string< charT, ST, SA > &  s, match_results< typename std::basic_string< charT, ST, SA >::const_iterator, Allocator > &  m, const basic_regex< charT, traits > &  e, match_flag_type  flags = match_default  )

inline

References regex_search().

template<class B , bool b, class A , class T >

bool boost::regex_search ( const ATL::CSimpleStringT< B, b > &  s, match_results< const B *, A > &  what, const basic_regex< B, T > &  e, boost::regex_constants::match_flag_type  f = boost::regex_constants::match_default  )

inline

References regex_search(), and boost::archive::what().

Referenced by boost::BaseRegexConcept< Regex >::constraints(), boost::RegexConcept< Regex >::constraints(), boost::re_detail::do_regex_search(), boost::regex_iterator_implementation< BidirectionalIterator, charT, traits >::init(), boost::regex_token_iterator_implementation< BidirectionalIterator, charT, traits >::init(), boost::regex_iterator_implementation< BidirectionalIterator, charT, traits >::next(), boost::regex_token_iterator_implementation< BidirectionalIterator, charT, traits >::next(), and regex_search().

template<class B , bool b, class T >

bool boost::regex_search ( const ATL::CSimpleStringT< B, b > &  s, const basic_regex< B, T > &  e, boost::regex_constants::match_flag_type  f = boost::regex_constants::match_default  )

inline

Referenced by regex_search().

template<class BidiIterator , class charT , class traits >

bool boost::regex_search	(	BidiIterator	first,
		BidiIterator	last,
		const basic_regex< charT, traits > &	e,
		match_flag_type	flags = match_default
	)

References boost::regex_constants::failbit, boost::re_detail::perl_matcher< BidiIterator, Allocator, traits >::find(), boost::basic_regex< charT, traits >::flags(), and match_any.

template<class charT , class traits >

bool boost::regex_search ( const charT *  str, const basic_regex< charT, traits > &  e, match_flag_type  flags = match_default  )

inline

References regex_search().

template<class ST , class SA , class charT , class traits >

bool boost::regex_search ( const std::basic_string< charT, ST, SA > &  s, const basic_regex< charT, traits > &  e, match_flag_type  flags = match_default  )

inline

References regex_search().

template<class OutputIterator , class charT , class Traits1 , class Alloc1 , class Traits2 >

std::size_t boost::regex_split	(	OutputIterator	out,
		std::basic_string< charT, Traits1, Alloc1 > &	s,
		const basic_regex< charT, Traits2 > &	e,
		match_flag_type	flags,
		std::size_t	max_split
	)

References boost::multiprecision::backends::i, last, boost::basic_regex< charT, traits >::mark_count(), out, and regex_grep().

Referenced by regex_split().

template<class OutputIterator , class charT , class Traits1 , class Alloc1 , class Traits2 >

std::size_t boost::regex_split ( OutputIterator  out, std::basic_string< charT, Traits1, Alloc1 > &  s, const basic_regex< charT, Traits2 > &  e, match_flag_type  flags = match_default  )

inline

References regex_split().

template<class OutputIterator , class charT , class Traits1 , class Alloc1 >

std::size_t boost::regex_split ( OutputIterator  out, std::basic_string< charT, Traits1, Alloc1 > &  s  )

inline

References boost::re_detail::get_default_expression, match_default, and regex_split().

template<typename CharT >

BOOST_LOG_SETUP_API void boost::register_filter_factory	(	attribute_name const &	name,
		shared_ptr< filter_factory< CharT > > const &	factory
	)

The function registers a filter factory object for the specified attribute name.

The factory will be used to construct a filter during parsing the filter string.

Precondition

name != NULL && factory != NULL, name points to a zero-terminated string

Parameters

name	Attribute name to associate the factory with
factory	The filter factory

Referenced by register_filter_factory(), and register_simple_filter_factory().

template<typename FactoryT >

enable_if< is_base_and_derived< filter_factory< typename FactoryT::char_type >, FactoryT >>::type boost::register_filter_factory ( attribute_name const &  name, shared_ptr< FactoryT > const &  factory  )

inline

The function registers a filter factory object for the specified attribute name.

The factory will be used to construct a filter during parsing the filter string.

Precondition

name != NULL && factory != NULL, name points to a zero-terminated string

Parameters

name	Attribute name to associate the factory with
factory	The filter factory

References register_filter_factory().

template<typename CharT >

BOOST_LOG_SETUP_API void boost::register_formatter_factory	(	attribute_name const &	attr_name,
		shared_ptr< formatter_factory< CharT > > const &	factory
	)

The function registers a user-defined formatter factory.

The function registers a user-defined formatter factory. The registered factory function will be called when the formatter parser detects the specified attribute name in the formatter string.

Precondition

!!attr_name && !!factory.

Parameters

attr_name	Attribute name
factory	Pointer to the formatter factory

Referenced by register_formatter_factory(), and register_simple_formatter_factory().

template<typename FactoryT >

enable_if< is_base_and_derived< formatter_factory< typename FactoryT::char_type >, FactoryT >>::type boost::register_formatter_factory ( attribute_name const &  attr_name, shared_ptr< FactoryT > const &  factory  )

inline

The function registers a user-defined formatter factory.

The function registers a user-defined formatter factory. The registered factory function will be called when the formatter parser detects the specified attribute name in the formatter string.

Precondition

!!attr_name && !!factory.

Parameters

attr_name	Attribute name
factory	Pointer to the formatter factory

References register_formatter_factory().

template<typename AttributeValueT , typename CharT >

void boost::register_simple_filter_factory ( attribute_name const &  name )

inline

The function registers a simple filter factory object for the specified attribute name.

The factory will support attribute values of type AttributeValueT, which must support all relation operations, such as equality comparison and less/greater ordering, and also extraction from stream.

Precondition

name != NULL, name points to a zero-terminated string

Parameters

name	Attribute name to associate the factory with

References register_filter_factory().

template<typename AttributeValueT >

void boost::register_simple_filter_factory ( attribute_name const &  name )

inline

The function registers a simple filter factory object for the specified attribute name.

The factory will support attribute values of type AttributeValueT, which must support all relation operations, such as equality comparison and less/greater ordering, and also extraction from stream.

Precondition

name != NULL, name points to a zero-terminated string

Parameters

name	Attribute name to associate the factory with

References boost::iostreams::gzip::flags::name.

template<typename CharT , typename DescriptorT , template< typename > class ActorT>

void boost::register_simple_filter_factory ( expressions::attribute_keyword< DescriptorT, ActorT > const &  keyword )

inline

The function registers a simple filter factory object for the specified attribute keyword.

The factory will support attribute values described by the keyword. The values must support all relation operations, such as equality comparison and less/greater ordering, and also extraction from stream.

Precondition

name != NULL, name points to a zero-terminated string

Parameters

keyword

Attribute keyword to associate the factory with

References boost::expressions::attribute_keyword< DescriptorT, ActorT >::get_name().

template<typename AttributeValueT , typename CharT >

void boost::register_simple_formatter_factory ( attribute_name const &  attr_name )

inline

The function registers a simple formatter factory.

The function registers a simple formatter factory. The registered factory will generate formatters that will be equivalent to the log::expressions::attr formatter (i.e. that will use the native operator<< to format the attribute value). The factory does not use any arguments from the format string, if specified.

Precondition

!!attr_name.

Parameters

attr_name

Attribute name

References register_formatter_factory().

template<typename CharT >

BOOST_LOG_SETUP_API void boost::register_sink_factory	(	const char *	sink_name,
		shared_ptr< sink_factory< CharT > > const &	factory
	)

The function registers a factory for a custom sink.

The function registers a factory for a sink. The factory will be called to create sink instance when the parser discovers the specified sink type in the settings file. The factory must accept a map of parameters [parameter name -> parameter value] that it may use to initialize the sink. The factory must return a non-NULL pointer to the constructed sink instance.

Parameters

sink_name	The custom sink name. Must point to a zero-terminated sequence of characters, must not be NULL.
factory	Pointer to the custom sink factory. Must not be NULL.

Referenced by register_sink_factory().

template<typename CharT >

void boost::register_sink_factory ( std::string const &  sink_name, shared_ptr< sink_factory< CharT > > const &  factory  )

inline

The function registers a factory for a custom sink.

The function registers a factory for a sink. The factory will be called to create sink instance when the parser discovers the specified sink type in the settings file. The factory must accept a map of parameters [parameter name -> parameter value] that it may use to initialize the sink. The factory must return a non-NULL pointer to the constructed sink instance.

Parameters

sink_name	The custom sink name
factory	Pointer to the custom sink factory. Must not be NULL.

References boost::serialization::factory(), and register_sink_factory().

template<typename FactoryT >

enable_if< is_base_and_derived< sink_factory< typename FactoryT::char_type >, FactoryT >>::type boost::register_sink_factory ( const char *  sink_name, shared_ptr< FactoryT > const &  factory  )

inline

The function registers a factory for a custom sink.

The function registers a factory for a sink. The factory will be called to create sink instance when the parser discovers the specified sink type in the settings file. The factory must accept a map of parameters [parameter name -> parameter value] that it may use to initialize the sink. The factory must return a non-NULL pointer to the constructed sink instance.

Parameters

sink_name	The custom sink name. Must point to a zero-terminated sequence of characters, must not be NULL.
factory	Pointer to the custom sink factory. Must not be NULL.

References register_sink_factory().

template<typename FactoryT >

enable_if< is_base_and_derived< sink_factory< typename FactoryT::char_type >, FactoryT >>::type boost::register_sink_factory ( std::string const &  sink_name, shared_ptr< FactoryT > const &  factory  )

inline

The function registers a factory for a custom sink.

The function registers a factory for a sink. The factory will be called to create sink instance when the parser discovers the specified sink type in the settings file. The factory must accept a map of parameters [parameter name -> parameter value] that it may use to initialize the sink. The factory must return a non-NULL pointer to the constructed sink instance.

Parameters

sink_name	The custom sink name
factory	Pointer to the custom sink factory. Must not be NULL.

References boost::serialization::factory(), register_sink_factory(), and static_pointer_cast().

template<class T , class U >

T* boost::reinterpret_pointer_cast ( U *  ptr )

inline

References boost::python::ptr(), and T.

template<class T , class U >

shared_ptr<T> boost::reinterpret_pointer_cast

(

shared_ptr< U > const &

r

)

References E, boost::multiprecision::backends::p, and boost::detail::void.

template<typename Graph , typename CentralityMap >

void boost::relative_betweenness_centrality	(	const Graph &	g,
		CentralityMap	centrality
	)

Converts "absolute" betweenness centrality (as computed by the brandes_betweenness_centrality algorithm) in the centrality map into "relative" centrality.

The result is placed back into the given centrality map.

References n, num_vertices(), put(), boost::detail::vertex_iterator, and vertices().

template<class Graph , class WeightMap , class PredecessorMap , class DistanceMap , class BinaryFunction , class BinaryPredicate >

bool boost::relax	(	typename graph_traits< Graph >::edge_descriptor	e,
		const Graph &	g,
		const WeightMap &	w,
		PredecessorMap &	p,
		DistanceMap &	d,
		const BinaryFunction &	combine,
		const BinaryPredicate &	compare
	)

References boost::iostreams::combine(), compare(), is_undirected(), put(), source(), target(), boost::program_options::value(), and Vertex.

Referenced by astar_search_no_init_tree(), bellman_ford_shortest_paths(), boost::detail::astar_bfs_visitor< AStarHeuristic, UniformCostVisitor, UpdatableQueue, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, BinaryFunction, BinaryPredicate >::black_target(), dag_shortest_paths(), dijkstra_shortest_paths_no_color_map_no_init(), boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::examine_edge(), boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::gray_target(), boost::detail::astar_bfs_visitor< AStarHeuristic, UniformCostVisitor, UpdatableQueue, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, BinaryFunction, BinaryPredicate >::gray_target(), relax(), boost::graph::distributed::delta_stepping_impl< Graph, PredecessorMap, DistanceMap, EdgeWeightMap >::run(), boost::graph::parallel::detail::betweenness_centrality_delta_stepping_impl< Graph, DistanceMap, IncomingMap, EdgeWeightMap, PathCountMap >::run(), boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::tree_edge(), and boost::detail::astar_bfs_visitor< AStarHeuristic, UniformCostVisitor, UpdatableQueue, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, BinaryFunction, BinaryPredicate >::tree_edge().

template<class Graph , class WeightMap , class PredecessorMap , class DistanceMap >

bool boost::relax	(	typename graph_traits< Graph >::edge_descriptor	e,
		const Graph &	g,
		WeightMap	w,
		PredecessorMap	p,
		DistanceMap	d
	)

References relax().

template<class SinglePassRange , class OutputIterator , class Predicate >

OutputIterator boost::remove_copy_if ( const SinglePassRange &  rng, OutputIterator  out_it, Predicate  pred  )

inline

template function remove_copy_if

range-based version of the remove_copy_if std algorithm

Precondition

SinglePassRange is a model of the SinglePassRangeConcept

OutputIterator is a model of the OutputIteratorConcept

Predicate is a model of the PredicateConcept

InputIterator's value type is convertible to Predicate's argument type

out_it is not an iterator in the range rng

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and end.

Referenced by boost::wave::util::macromap< ContextT >::expand_macro(), boost::phoenix::impl::remove_copy_if::operator()(), and boost::lambda::ll::remove_copy_if::operator()().

template<class EdgeList , class Allocator >

void boost::remove_edge	(	typename EdgeList::value_type	u,
		typename EdgeList::value_type	v,
		std::vector< EdgeList, Allocator > &	g
	)

References boost::asio::begin, end, boost::multiprecision::backends::i, and boost::filesystem::detail::remove().

template<class EdgeList , class Allocator >

void boost::remove_edge	(	typename detail::val_edge< EdgeList >::type	e,
		std::vector< EdgeList, Allocator > &	g
	)

References boost::asio::begin, end, boost::multiprecision::backends::i, and boost::filesystem::detail::remove().

template<typename VP , typename EP , typename GP >

void boost::remove_edge ( typename undirected_graph< VP, EP, GP >::vertex_descriptor  u, typename undirected_graph< VP, EP, GP >::vertex_descriptor  v, undirected_graph< VP, EP, GP > &  g  )

inline

template<typename VP , typename EP , typename GP >

void boost::remove_edge ( typename directed_graph< VP, EP, GP >::vertex_descriptor  u, typename directed_graph< VP, EP, GP >::vertex_descriptor  v, directed_graph< VP, EP, GP > &  g  )

inline

template<typename VP , typename EP , typename GP >

void boost::remove_edge ( typename undirected_graph< VP, EP, GP >::edge_descriptor  e, undirected_graph< VP, EP, GP > &  g  )

inline

template<typename VP , typename EP , typename GP >

void boost::remove_edge ( typename directed_graph< VP, EP, GP >::edge_descriptor  e, directed_graph< VP, EP, GP > &  g  )

inline

template<typename VP , typename EP , typename GP >

void boost::remove_edge ( typename undirected_graph< VP, EP, GP >::edge_iterator  i, undirected_graph< VP, EP, GP > &  g  )

inline

template<typename VP , typename EP , typename GP >

void boost::remove_edge ( typename directed_graph< VP, EP, GP >::edge_iterator  i, directed_graph< VP, EP, GP > &  g  )

inline

template<class vtype , class etype >

void boost::remove_edge	(	typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor	u,
		typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor	v,
		leda::GRAPH< vtype, etype > &	g
	)

References boost::multiprecision::backends::i, out_edges(), and target().

template<class vtype , class etype >

void boost::remove_edge	(	typename graph_traits< leda::GRAPH< vtype, etype > >::edge_descriptor	e,
		leda::GRAPH< vtype, etype > &	g
	)

void boost::remove_edge	(	graph_traits< leda::graph >::vertex_descriptor	u,
		graph_traits< leda::graph >::vertex_descriptor	v,
		leda::graph &	g
	)

References boost::multiprecision::backends::i, out_edges(), and target().

template<typename G >

void boost::remove_edge	(	typename subgraph< G >::vertex_descriptor	u,
		typename subgraph< G >::vertex_descriptor	v,
		subgraph< G > &	g
	)

References boost::subgraph< Graph >::is_root(), boost::subgraph< Graph >::local_to_global(), and boost::detail::remove_edge_recur_up().

void boost::remove_edge	(	graph_traits< leda::graph >::edge_descriptor	e,
		leda::graph &	g
	)

template<typename G >

void boost::remove_edge	(	typename subgraph< G >::edge_descriptor	e,
		subgraph< G > &	g
	)

References BOOST_ASSERT, boost::subgraph< Graph >::find_edge(), boost::subgraph< Graph >::local_to_global(), boost::subgraph< Graph >::m_children, boost::subgraph< Graph >::m_graph, remove_edge(), boost::units::root(), and boost::subgraph< Graph >::root().

template<typename G , typename L , typename S >

void boost::remove_edge ( typename labeled_graph< G, L, S >::edge_descriptor  e, labeled_graph< G, L, S > &  g  )

inline

References remove_edge().

template<typename G , typename L , typename S >

void boost::remove_edge ( typename labeled_graph< G, L, S >::vertex_descriptor  u, typename labeled_graph< G, L, S >::vertex_descriptor  v, labeled_graph< G, L, S > &  g  )

inline

References remove_edge().

template<typename D , typename VP , typename EP , typename GP , typename A >

void boost::remove_edge	(	typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor	u,
		typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor	v,
		adjacency_matrix< D, VP, EP, GP, A > &	g
	)

References boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator >::get_edge(), boost::detail::get_edge_exists(), boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator >::m_num_edges, and boost::detail::set_edge_exists().

Referenced by betweenness_centrality_clustering(), boost::concepts::BOOST_concept(), boost::detail::children_remove_edge(), clear_vertex(), boost::parallel::detail::remove_in_edge_predicate< Graph, Predicate >::operator()(), boost::parallel::detail::remove_undirected_edge_predicate< Graph, Predicate >::operator()(), boost::undirected_graph< VertexProp, EdgeProp, GraphProp >::remove_edge(), boost::directed_graph< VertexProp, EdgeProp, GraphProp >::remove_edge(), remove_edge(), remove_edge_by_label(), remove_edge_if(), boost::detail::remove_edge_recur_down(), boost::detail::remove_edge_recur_up(), boost::detail::parallel::remove_in_edge(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::remove_local_edge(), and boost::graph_test< Graph >::test_remove_edge().

template<typename D , typename VP , typename EP , typename GP , typename A >

void boost::remove_edge	(	typename adjacency_matrix< D, VP, EP, GP, A >::edge_descriptor	e,
		adjacency_matrix< D, VP, EP, GP, A > &	g
	)

References remove_edge(), source(), and target().

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

void boost::remove_edge	(	typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::edge_descriptor	e,
		adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References BOOST_ASSERT, boost::detail::parallel::owner(), remove_edge(), boost::detail::parallel::remove_in_edge(), source(), target(), and boost::program_options::value().

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

void boost::remove_edge	(	typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	u,
		typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	v,
		adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References edge(), and remove_edge().

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

void boost::remove_edge ( typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::out_edge_iterator  ei, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &  g  )

inline

References remove_edge().

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

void boost::remove_edge ( typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, directedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::out_edge_iterator  ei, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, directedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &  g  )

inline

References BOOST_ASSERT, boost::detail::parallel::owner(), remove_edge(), and source().

template<typename VP , typename EP , typename GP >

void boost::remove_edge_and_renumber_indices ( typename directed_graph< VP, EP, GP >::edge_iterator  i, directed_graph< VP, EP, GP > &  g  )

inline

template<typename VP , typename EP , typename GP >

void boost::remove_edge_and_renumber_indices ( typename undirected_graph< VP, EP, GP >::edge_iterator  i, undirected_graph< VP, EP, GP > &  g  )

inline

template<typename G , typename L , typename S >

void boost::remove_edge_by_label ( typename labeled_graph< G, L, S >::label_type const &  u, typename labeled_graph< G, L, S >::label_type const &  v, labeled_graph< G, L, S > &  g  )

inline

References remove_edge().

template<class EdgeList , class Allocator , class Predicate >

void boost::remove_edge_if	(	Predicate	p,
		std::vector< EdgeList, Allocator > &	g
	)

References boost::asio::b, empty(), end, boost::xpressive::make_pair, and boost::multiprecision::backends::p.

template<typename VP , typename EP , typename GP , class Predicate >

void boost::remove_edge_if ( Predicate  pred, undirected_graph< VP, EP, GP > &  g  )

inline

References remove_edge_if().

template<typename VP , typename EP , typename GP , class Predicate >

void boost::remove_edge_if ( Predicate  pred, directed_graph< VP, EP, GP > &  g  )

inline

Referenced by boost::concepts::BOOST_concept(), and remove_edge_if().

template<typename Predicate , typename G >

void boost::remove_edge_if	(	Predicate	p,
		subgraph< G > &	g
	)

References edges(), boost::multiprecision::backends::p, and remove_edge().

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename Predicate >

void boost::remove_edge_if ( Predicate  predicate, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, directedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &  g  )

inline

References PBGL_DISTRIB_ADJLIST_TYPE_CONFIG, and remove_edge_if().

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename Predicate >

void boost::remove_edge_if ( Predicate  predicate, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &  g  )

inline

References PBGL_DISTRIB_ADJLIST_TYPE_CONFIG, and remove_edge_if().

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename Predicate >

void boost::remove_edge_if ( Predicate  predicate, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &  g  )

inline

References boost::graph_detail::erase_if(), and PBGL_DISTRIB_ADJLIST_TYPE_CONFIG.

template<typename VP , typename EP , typename GP , class Predicate >

void boost::remove_in_edge_if ( typename directed_graph< VP, EP, GP >::vertex_descriptor  v, Predicate  pred, directed_graph< VP, EP, GP > &  g  )

inline

Referenced by boost::concepts::BOOST_concept(), clear_in_edges(), and remove_in_edge_if().

template<typename VP , typename EP , typename GP , class Predicate >

void boost::remove_in_edge_if ( typename undirected_graph< VP, EP, GP >::vertex_descriptor  v, Predicate  pred, undirected_graph< VP, EP, GP > &  g  )

inline

References remove_in_edge_if().

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename Predicate >

void boost::remove_in_edge_if ( typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor  u, Predicate  predicate, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, bidirectionalS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &  g  )

inline

References BOOST_ASSERT, boost::graph_detail::erase_if(), PBGL_DISTRIB_ADJLIST_TYPE_CONFIG, and vertex_in_edges.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename Predicate >

void boost::remove_in_edge_if ( typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor  u, Predicate  predicate, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, undirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &  g  )

inline

References remove_out_edge_if().

template<typename VP , typename EP , typename GP , class Predicate >

void boost::remove_incident_edge_if ( typename undirected_graph< VP, EP, GP >::vertex_descriptor  v, Predicate  pred, undirected_graph< VP, EP, GP > &  g  )

inline

References remove_out_edge_if().

template<typename VP , typename EP , typename GP , class Predicate >

void boost::remove_out_edge_if ( typename directed_graph< VP, EP, GP >::vertex_descriptor  v, Predicate  pred, directed_graph< VP, EP, GP > &  g  )

inline

Referenced by boost::concepts::BOOST_concept(), clear_out_edges(), clear_vertex(), boost::detail::mmd_impl< Graph, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, VertexIndexMap >::eliminate(), remove_in_edge_if(), remove_incident_edge_if(), and remove_out_edge_if().

template<typename VP , typename EP , typename GP , class Predicate >

void boost::remove_out_edge_if ( typename undirected_graph< VP, EP, GP >::vertex_descriptor  v, Predicate  pred, undirected_graph< VP, EP, GP > &  g  )

inline

References remove_out_edge_if().

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename Predicate >

void boost::remove_out_edge_if ( typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor  u, Predicate  predicate, adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &  g  )

inline

References BOOST_ASSERT, and remove_out_edge_if().

template<class EdgeList , class Allocator >

void boost::remove_vertex	(	typename EdgeList::value_type	u,
		std::vector< EdgeList, Allocator > &	g
	)

References boost::asio::begin, clear_vertex(), boost::multiprecision::backends::i, and it.

template<typename VP , typename EP , typename GP >

void boost::remove_vertex ( typename undirected_graph< VP, EP, GP >::vertex_descriptor  v, undirected_graph< VP, EP, GP > &  g  )

inline

template<typename VP , typename EP , typename GP >

void boost::remove_vertex ( typename directed_graph< VP, EP, GP >::vertex_descriptor  v, directed_graph< VP, EP, GP > &  g  )

inline

template<class vtype , class etype >

void boost::remove_vertex	(	typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor	u,
		leda::GRAPH< vtype, etype > &	g
	)

void boost::remove_vertex	(	graph_traits< leda::graph >::vertex_descriptor	u,
		leda::graph &	g
	)

template<typename G , typename L , typename S >

void boost::remove_vertex ( typename labeled_graph< G, L, S >::label_type const &  l, labeled_graph< G, L, S > &  g  )

inline

template<typename D , typename VP , typename EP , typename GP , typename A >

void boost::remove_vertex ( typename adjacency_matrix< D, VP, EP, GP, A >::vertex_descriptor  , adjacency_matrix< D, VP, EP, GP, A > &    )

inline

References BOOST_ASSERT.

Referenced by boost::concepts::BOOST_concept(), boost::graph::remove_dangling_links(), boost::graph::distributed::remove_dangling_links(), boost::directed_graph< VertexProp, EdgeProp, GraphProp >::remove_vertex(), boost::undirected_graph< VertexProp, EdgeProp, GraphProp >::remove_vertex(), boost::labeled_graph< Graph, Label, Selector >::remove_vertex(), boost::labeled_graph< Graph *, Label, Selector >::remove_vertex(), and remove_vertex().

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

void boost::remove_vertex	(	typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertex_descriptor	u,
		adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

References BOOST_ASSERT, boost::graph_detail::iterator_stability(), and remove_vertex().

template<typename VP , typename EP , typename GP >

void boost::remove_vertex_and_renumber_indices ( typename directed_graph< VP, EP, GP >::vertex_iterator  i, directed_graph< VP, EP, GP > &  g  )

inline

template<typename VP , typename EP , typename GP >

void boost::remove_vertex_and_renumber_indices ( typename undirected_graph< VP, EP, GP >::vertex_iterator  i, undirected_graph< VP, EP, GP > &  g  )

inline

template<class C >

BOOST_DEDUCED_TYPENAME range_reverse_iterator<C>::type boost::rend ( C &  c )

inline

References boost::asio::begin, and BOOST_DEDUCED_TYPENAME.

Referenced by const_rend(), boost::numeric::ublas::triangular_matrix< T, TRI, L, A >::const_iterator1::crend(), boost::numeric::ublas::matrix< T, L, A >::const_iterator1::crend(), boost::numeric::ublas::triangular_matrix< T, TRI, L, A >::const_iterator2::crend(), boost::numeric::ublas::matrix< T, L, A >::const_iterator2::crend(), boost::numeric::ublas::triangular_adaptor< M, TRI >::const_iterator1::crend(), boost::numeric::ublas::triangular_adaptor< M, TRI >::const_iterator2::crend(), boost::numeric::ublas::vector_of_vector< T, L, A >::const_iterator1::crend(), boost::numeric::ublas::vector_of_vector< T, L, A >::const_iterator2::crend(), boost::numeric::ublas::zero_matrix< T, ALLOC >::const_iterator1::crend(), boost::numeric::ublas::zero_matrix< T, ALLOC >::const_iterator2::crend(), boost::numeric::ublas::identity_matrix< T, ALLOC >::const_iterator1::crend(), boost::numeric::ublas::identity_matrix< T, ALLOC >::const_iterator2::crend(), boost::numeric::ublas::scalar_matrix< T, ALLOC >::const_iterator1::crend(), boost::numeric::ublas::scalar_matrix< T, ALLOC >::const_iterator2::crend(), boost::numeric::ublas::c_matrix< T, N, M >::const_iterator1::crend(), boost::numeric::ublas::c_matrix< T, N, M >::const_iterator2::crend(), boost::icl::elements_rend(), boost::detail::bfs_king_visitor< OutputIterator, Buffer, Compare, PseudoDegreeMap, VecMap, VertexIndexMap >::finish_vertex(), boost::spirit::lex::lexertl::detail::generate_cpp_state_info(), boost::proto::functional::rend::operator()(), boost::foreach_detail_::rend(), and boost::wave::util::impl::trim_replacement_list().

template<class C >

BOOST_DEDUCED_TYPENAME range_reverse_iterator<const C>::type boost::rend ( const C &  c )

inline

References boost::asio::begin, and BOOST_DEDUCED_TYPENAME.

template<typename VP , typename EP , typename GP >

void boost::renumber_edge_indices ( directed_graph< VP, EP, GP > &  g )

inline

Referenced by boost::concepts::BOOST_concept().

template<typename VP , typename EP , typename GP >

void boost::renumber_edge_indices ( undirected_graph< VP, EP, GP > &  g )

inline

template<typename VP , typename EP , typename GP >

void boost::renumber_indices ( directed_graph< VP, EP, GP > &  g )

inline

template<typename VP , typename EP , typename GP >

void boost::renumber_indices ( undirected_graph< VP, EP, GP > &  g )

inline

template<typename VP , typename EP , typename GP >

void boost::renumber_vertex_indices ( directed_graph< VP, EP, GP > &  g )

inline

Referenced by boost::concepts::BOOST_concept().

template<typename VP , typename EP , typename GP >

void boost::renumber_vertex_indices ( undirected_graph< VP, EP, GP > &  g )

inline

int boost::report_errors ( )

inline

References BOOST_LIGHTWEIGHT_TEST_OSTREAM, boost::detail::report_errors_reminder::called_report_errors_function, boost::detail::report_errors_remind(), and boost::detail::test_errors().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( repulsive_force , _t)> boost::repulsive_force

(

const PType &

p

)

template<class TT >

void boost::require_boolean_expr

(

const TT &

t

)

References ignore_unused_variable_warning(), boost::flyweights::t, and boost::flyweights::x.

Referenced by BOOST_concept().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( edge_residual_capacity , _t)> boost::residual_capacity_map

(

const PType &

p

)

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( edge_reverse , _t)> boost::reverse_edge_map

(

const PType &

p

)

template<class Distance >

Distance::value_type boost::RLS_depth

(

Distance &

d

)

Referenced by sloan_start_end_vertices().

template<class Distance , class my_int >

Distance::value_type boost::RLS_max_width	(	Distance &	d,
		my_int	depth
	)

Referenced by sloan_start_end_vertices().

template<typename Graph , typename VertexIndexMap >

double boost::rms_wavefront	(	const Graph &	g,
		VertexIndexMap	index
	)

References boost::asio::b, end, boost::multiprecision::backends::i, ith_wavefront(), num_vertices(), pow(), boost::geometry::math::sqrt(), and vertices().

Referenced by rms_wavefront().

template<typename Graph >

double boost::rms_wavefront

(

const Graph &

g

)

References rms_wavefront(), and vertex_index.

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( vertex_root , _t)> boost::root_map

(

const PType &

p

)

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( root_vertex , _t)> boost::root_vertex

(

const PType &

p

)

Referenced by metric_tsp_approx_from_vertex(), and boost::detail::stoer_wagner_min_cut().

template<class Vertex , class DisjointSet >

bool boost::same_component ( Vertex  u, Vertex  v, DisjointSet &  ds  )

inline

template<typename FunT , typename AssigneeT >

BOOST_FORCEINLINE save_result_wrapper< FunT, AssigneeT > boost::save_result	(	FunT const &	fun,
		AssigneeT &	assignee
	)

template<typename Graph , typename PositionMap , typename Topology >

void boost::scale_graph	(	const Graph &	g,
		PositionMap	position,
		const Topology &	topology,
		typename Topology::point_type	upper_left,
		typename Topology::point_type	lower_right
	)

References BGL_FORALL_VERTICES_T, num_vertices(), put(), and vertices().

template<class VertexListGraph , class OrderPA , class ColorMap >

property_traits<ColorMap>::value_type boost::sequential_vertex_coloring	(	const VertexListGraph &	G,
		OrderPA	order,
		ColorMap	color
	)

References adjacent_vertices(), BOOST_PREVENT_MACRO_SUBSTITUTION, current, boost::multiprecision::backends::i, boost::spirit::x3::unicode::mark, boost::accumulators::extract::max, num_vertices(), put(), Vertex, boost::detail::vertex_iterator, and vertices().

Referenced by sequential_vertex_coloring().

template<class VertexListGraph , class ColorMap >

property_traits<ColorMap>::value_type boost::sequential_vertex_coloring	(	const VertexListGraph &	G,
		ColorMap	color
	)

References boost::fusion::distance(), make_iterator_property_map(), sequential_vertex_coloring(), boost::detail::vertex_iterator, and vertices().

template<class Archive >

void boost::serialize ( Archive &  , no_property &  , const unsigned  int  )

inline

template<class Archive , class Tag , class T , class Base >

void boost::serialize	(	Archive &	ar,
		property< Tag, T, Base > &	prop,
		const unsigned	int
	)

References boost::property< Tag, T, Base >::m_base, boost::property< Tag, T, Base >::m_value, and boost::serialization::make_nvp().

template<typename OEL , typename VL , typename D , typename VP , typename EP , typename GP , typename EL , typename Tag , typename Value >

void boost::set_property ( adjacency_list< OEL, VL, D, VP, EP, GP, EL > &  g, Tag  tag, Value const &  value  )

inline

References get_property_value(), and boost::program_options::value().

Referenced by boost::detail::graph::mutate_graph_impl< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > >::finish_building_graph(), and set_property().

template<typename BidirectionalGraph , typename GRef , typename Tag , typename Value >

void boost::set_property ( const reverse_graph< BidirectionalGraph, GRef > &  g, Tag  tag, const Value &  value  )

inline

References boost::reverse_graph< BidirectionalGraph, GraphRef >::m_g, and set_property().

template<typename VP , typename EP , typename GP , class Property , class Value >

void boost::set_property	(	directed_graph< VP, EP, GP > &	g,
		Property	p,
		Value	v
	)

References boost::multiprecision::backends::p, and set_property().

template<typename VP , typename EP , typename GP , class Property , class Value >

void boost::set_property ( undirected_graph< VP, EP, GP > &  g, Property  p, Value  v  )

inline

References boost::multiprecision::backends::p, and set_property().

template<typename D , typename VP , typename EP , typename GP , typename A , typename Tag , typename Value >

void boost::set_property ( adjacency_matrix< D, VP, EP, GP, A > &  g, Tag  tag, const Value &  value  )

inline

References get_property_value(), boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator >::m_property, and boost::program_options::value().

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex , class Tag , class Value >

void boost::set_property ( compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g, Tag  tag, const Value &  value  )

inline

References get_property_value(), and boost::program_options::value().

template<typename Property , typename PropertyMap >

void boost::set_property_map_role ( Property  p, PropertyMap  pm  )

inline

References boost::chrono::detail::reduce(), and template.

Referenced by boost::graph::distributed::crauser_et_al_shortest_paths(), boost::graph::distributed::delta_stepping_shortest_paths(), boost::graph::distributed::eager_dijkstra_shortest_paths(), boost::graph::distributed::detail::initialize_min_in_weights(), boost::graph::parallel::detail::brandes_shortest_paths< WeightMap >::operator()(), boost::detail::parallel_bfs_helper(), boost::graph::distributed::st_connected(), and boost::graph::distributed::tsin_depth_first_visit().

template<typename T >

boost::shared_ptr< T > boost::shared_from_raw

(

T *

p

)

References BOOST_ASSERT, and boost::multiprecision::backends::p.

template<typename T >

detail::graph::edge_or_side<false, T> boost::side_length ( T  x )

inline

States that the given quantity is a display area side length.

References boost::flyweights::x.

template<class SinglePassRange >

range_size<const SinglePassRange>::type boost::size ( const SinglePassRange &  rng )

inline

References boost::range_detail::range_calculate_size().

Referenced by boost::mpi::detail::all_to_all_impl(), boost::coroutines::basic_standard_stack_allocator< traitsT >::allocate(), boost::coroutines::basic_protected_stack_allocator< traitsT >::allocate(), boost::coroutines::basic_segmented_stack_allocator< traitsT >::allocate(), boost::iostreams::detail::bzip2_allocator< Alloc, Base >::allocate(), boost::iostreams::detail::zlib_allocator< Alloc, Base >::allocate(), allocate_shared(), boost::wave::util::SimpleStringStorage< E, A >::append(), boost::wave::util::AllocatorStringStorage< E, A >::append(), boost::wave::util::VectorStringStorage< E, A >::append(), boost::wave::util::flex_string< E, T, A, Storage >::append(), boost::geometry::detail::svg::svg_point< Point >::apply(), boost::geometry::detail::disjoint::disjoint_interrupt_policy::apply(), boost::geometry::detail::num_segments::range_count::apply(), boost::geometry::detail::simplify::simplify_range_insert::apply(), boost::geometry::dispatch::num_interior_rings< Polygon, polygon_tag >::apply(), boost::geometry::detail::num_points::range_count< AddForOpen >::apply(), boost::geometry::detail::remove_spikes::range_remove_spikes< Ring >::apply(), boost::geometry::strategy::convex_hull::detail::get_extremes< InputRange, RangeIterator, StrategyLess, StrategyGreater >::apply(), boost::geometry::dispatch::num_geometries< MultiGeometry, multi_tag >::apply(), boost::geometry::detail::area::ring_area< order_as_direction< geometry::point_order< Ring >::value >::value, geometry::closure< Ring >::value >::apply(), boost::geometry::detail::simplify::simplify_range< core_detail::closure::minimum_ring_size< geometry::closure< Ring >::value >::value >::apply(), boost::geometry::detail::wkt::wkt_range< Range, opening_parenthesis, closing_parenthesis >::apply(), boost::geometry::detail::correct::correct_ring< Ring, std::less< default_area_result< Ring >::type > >::apply(), boost::geometry::detail::equals::equals_by_collection< detail::equals::area_check >::apply(), boost::geometry::detail::conversion::range_to_range< LineString1, LineString2 >::apply(), boost::geometry::detail::simplify::simplify_multi< detail::simplify::simplify_polygon >::apply(), boost::geometry::detail::transform::transform_multi< dispatch::transform< boost::range_value< Multi1 >::type, boost::range_value< Multi2 >::type > >::apply(), boost::geometry::detail::conversion::multi_to_multi< Multi1, Multi2, convert< boost::range_value< Multi1 >::type, boost::range_value< Multi2 >::type, single_tag_of< tag< Multi1 >::type >::type, single_tag_of< tag< Multi2 >::type >::type, DimensionCount > >::apply(), boost::geometry::detail::wkt::multi_parser< MultiGeometry, detail::wkt::polygon_parser, detail::wkt::prefix_multipolygon >::apply(), boost::geometry::detail::wkt::multi_point_parser< MultiGeometry, detail::wkt::prefix_multipoint >::apply(), boost::geometry::detail::wkt::box_parser< Box >::apply(), boost::geometry::detail::wkt::segment_parser< Segment >::apply(), boost::wave::util::flex_string< E, T, A, Storage >::assign(), boost::geometry::range::at(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::at(), boost::wave::util::flex_string< E, T, A, Storage >::at(), boost::intrusive::sgtree_impl< ValueTraits, Compare, SizeType, FloatingPoint, HeaderHolder >::balance_factor(), boost::wave::util::CowString< Storage, Align >::begin(), boost::detail::mmd_impl< Graph, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, VertexIndexMap >::build_permutation(), boost::wave::util::CowString< Storage, Align >::c_str(), boost::wave::util::flex_string< E, T, A, Storage >::compare(), boost::xpressive::regex_compiler< BidiIter, RegexTraits, CompilerTraits >::compile(), boost::iostreams::mapped_file::const_end(), boost::wave::util::flex_string< E, T, A, Storage >::copy(), boost::iostreams::detail::copy_impl(), boost::wave::util::CowString< Storage, Align >::CowString(), boost::interprocess::ipcdetail::raw_mapped_region_creator::create_posix_mapped_region(), boost::wave::util::CowString< Storage, Align >::data(), boost::sinks::bounded_fifo_queue< MaxQueueSizeV, OverflowStrategyT >::dequeue_ready(), boost::sinks::bounded_ordering_queue< OrderT, MaxQueueSizeV, OverflowStrategyT >::dequeue_ready(), boost::graph::parallel::detail::do_brandes_sssp(), dump(), boost::dynamic_bitset< Block, Allocator >::empty(), boost::attribute_set::empty(), boost::wave::util::flex_string< E, T, A, Storage >::empty(), boost::iostreams::mapped_file::end(), boost::sinks::bounded_fifo_queue< MaxQueueSizeV, OverflowStrategyT >::enqueue(), boost::sinks::bounded_ordering_queue< OrderT, MaxQueueSizeV, OverflowStrategyT >::enqueue(), boost::geometry::range::erase(), boost::intrusive::sgtree_impl< ValueTraits, Compare, SizeType, FloatingPoint, HeaderHolder >::erase(), boost::wave::util::if_block_stack::exit_if_block(), boost::unit_test::basic_cstring< CharT >::find(), boost::wave::util::flex_string< E, T, A, Storage >::find(), boost::wave::util::flex_string< E, T, A, Storage >::find_last_not_of(), boost::date_time::find_match(), boost::dynamic_bitset< Block, Allocator >::find_next(), boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), boost::numeric::odeint::openmp_range_algebra::for_each1(), boost::numeric::odeint::openmp_nested_algebra< InnerAlgebra >::for_each1(), boost::numeric::odeint::openmp_range_algebra::for_each10(), boost::numeric::odeint::openmp_nested_algebra< InnerAlgebra >::for_each10(), boost::numeric::odeint::openmp_range_algebra::for_each11(), boost::numeric::odeint::openmp_nested_algebra< InnerAlgebra >::for_each11(), boost::numeric::odeint::openmp_range_algebra::for_each12(), boost::numeric::odeint::openmp_nested_algebra< InnerAlgebra >::for_each12(), boost::numeric::odeint::openmp_range_algebra::for_each13(), boost::numeric::odeint::openmp_nested_algebra< InnerAlgebra >::for_each13(), boost::numeric::odeint::openmp_range_algebra::for_each14(), boost::numeric::odeint::openmp_nested_algebra< InnerAlgebra >::for_each14(), boost::numeric::odeint::openmp_range_algebra::for_each15(), boost::numeric::odeint::openmp_nested_algebra< InnerAlgebra >::for_each15(), boost::numeric::odeint::openmp_range_algebra::for_each2(), boost::numeric::odeint::openmp_nested_algebra< InnerAlgebra >::for_each2(), boost::numeric::odeint::openmp_range_algebra::for_each3(), boost::numeric::odeint::openmp_nested_algebra< InnerAlgebra >::for_each3(), boost::numeric::odeint::openmp_range_algebra::for_each4(), boost::numeric::odeint::openmp_nested_algebra< InnerAlgebra >::for_each4(), boost::numeric::odeint::openmp_range_algebra::for_each5(), boost::numeric::odeint::openmp_nested_algebra< InnerAlgebra >::for_each5(), boost::numeric::odeint::openmp_range_algebra::for_each6(), boost::numeric::odeint::openmp_nested_algebra< InnerAlgebra >::for_each6(), boost::numeric::odeint::openmp_range_algebra::for_each7(), boost::numeric::odeint::openmp_nested_algebra< InnerAlgebra >::for_each7(), boost::numeric::odeint::openmp_range_algebra::for_each8(), boost::numeric::odeint::openmp_nested_algebra< InnerAlgebra >::for_each8(), boost::numeric::odeint::openmp_range_algebra::for_each9(), boost::numeric::odeint::openmp_nested_algebra< InnerAlgebra >::for_each9(), boost::mpi::detail::gather_impl(), boost::intrusive::pointer_plus_bits< boost::interprocess::offset_ptr< T, P, O, A >, NumBits >::get_bits(), boost::wave::util::if_block_stack::get_enclosing_status(), boost::wave::util::if_block_stack::get_if_block_depth(), boost::interprocess::windows_shared_memory::get_size(), boost::wave::util::if_block_stack::get_some_part_status(), boost::thread_attributes::get_stack_size(), boost::wave::util::if_block_stack::get_status(), boost::random::detail::real_alias_table< IntType, WeightType >::init_average(), boost::range_detail::inner_product_precondition(), boost::detail::insert_aligned(), boost::intrusive::sgtree_impl< ValueTraits, Compare, SizeType, FloatingPoint, HeaderHolder >::insert_before(), boost::interprocess::iunordered_set_index< MapConfig >::insert_commit(), boost::intrusive::sgtree_impl< ValueTraits, Compare, SizeType, FloatingPoint, HeaderHolder >::insert_equal(), boost::intrusive::sgtree_impl< ValueTraits, Compare, SizeType, FloatingPoint, HeaderHolder >::insert_unique_commit(), boost::wave::util::if_block_stack::is_inside_elsepart(), boost::wave::util::if_block_stack::is_inside_ifpart(), is_kuratowski_subgraph(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::is_null(), boost::dynamic_bitset< Block, Allocator >::is_proper_subset_of(), boost::dynamic_bitset< Block, Allocator >::is_subset_of(), iterative_bit_vector_dominator_tree(), boost::wave::util::flex_string< E, T, A, Storage >::length(), boost::mpi::intercommunicator::local_size(), boost::range_detail::make_end_strided_iterator(), make_shared(), boost::numeric::odeint::detail::make_split_range(), make_unique(), make_unique_noinit(), boost::geometry::svg_mapper< Point, SameScale >::map(), boost::interprocess::mapped_region::mapped_region(), boost::match_results< BidiIterator, Allocator >::maybe_assign(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::merge(), boost::numeric::odeint::openmp_range_algebra::norm_inf(), boost::numeric::odeint::openmp_nested_algebra< InnerAlgebra >::norm_inf(), boost::wave::cpplexer::impl::token_data< StringTypeT, PositionT >::operator delete(), boost::statechart::event< exception_thrown >::operator new(), boost::wave::cpplexer::impl::token_data< StringTypeT, PositionT >::operator new(), boost::statechart::simple_state< MostDerived, Context, InnerInitial, historyMode >::operator new(), boost::dynamic_bitset< Block, Allocator >::operator&=(), boost::proto::functional::size::operator()(), boost::graph::distributed::neighboring_tiles_force_pairs< PositionMap >::operator()(), boost::numeric::functional::min_assign< Left, Right, std_vector_tag, std_vector_tag >::operator()(), boost::numeric::functional::min_assign< Left, Right, std_valarray_tag, std_valarray_tag >::operator()(), boost::lambda::new_array< T >::operator()(), boost::numeric::functional::max_assign< Left, Right, std_vector_tag, std_vector_tag >::operator()(), boost::numeric::functional::max_assign< Left, Right, std_valarray_tag, std_valarray_tag >::operator()(), boost::numeric::functional::promote< To, From, std_vector_tag, std_vector_tag >::operator()(), boost::numeric::functional::promote< To, From, std_valarray_tag, std_valarray_tag >::operator()(), boost::numeric::functional::promote< bool, From, void, std_valarray_tag >::operator()(), boost::iterator_range_detail::iterator_range_base< IteratorT, random_access_traversal_tag >::operator()(), boost::numeric::operators::operator*(), boost::numeric::operators::operator+(), boost::ssca_iterator< RandomGenerator, Graph >::operator++(), boost::numeric::operators::operator+=(), boost::numeric::operators::operator-(), boost::dynamic_bitset< Block, Allocator >::operator-=(), boost::numeric::operators::operator/(), operator<<(), boost::wave::util::CowString< Storage, Align >::operator=(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::operator[](), boost::iterator_range_detail::iterator_range_base< IteratorT, random_access_traversal_tag >::operator[](), boost::dynamic_bitset< Block, Allocator >::operator^=(), boost::dynamic_bitset< Block, Allocator >::operator|=(), boost::graph::distributed::cc_detail::parallel_connected_components(), boost::geometry::range::pop_back(), boost::dynamic_bitset< Block, Allocator >::push_back(), boost::intrusive::sgtree_impl< ValueTraits, Compare, SizeType, FloatingPoint, HeaderHolder >::push_back(), boost::wave::util::flex_string< E, T, A, Storage >::push_back(), boost::intrusive::sgtree_impl< ValueTraits, Compare, SizeType, FloatingPoint, HeaderHolder >::push_front(), boost::geometry::detail::centroid::range_ok(), boost::wave::util::flex_string< E, T, A, Storage >::replace(), boost::wave::util::SimpleStringStorage< E, A >::reserve(), boost::wave::util::AllocatorStringStorage< E, A >::reserve(), boost::iostreams::detail::conversion_buffer< Codecvt, Alloc >::reset(), boost::numeric::odeint::resize_impl_sfinae< StateOut, StateIn, Enabler >::resize(), boost::numeric::odeint::resize_impl< openmp_state< T >, openmp_state< T > >::resize(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::resize(), boost::multiprecision::backends::cpp_int_base< MinBits, MaxBits, signed_magnitude, Checked, Allocator, false >::resize(), boost::wave::util::SimpleStringStorage< E, A >::resize(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::resize(), boost::wave::util::SmallStringOpt< Storage, threshold, Align >::resize(), boost::wave::util::CowString< Storage, Align >::resize(), boost::accumulators::impl::tail_quantile_impl< Sample, LeftRight >::result(), boost::accumulators::impl::weighted_tail_quantile_impl< Sample, Weight, LeftRight >::result(), boost::accumulators::impl::extended_p_square_quantile_impl< Sample, Impl1, Impl2 >::result(), boost::accumulators::impl::tail_variate_means_impl< Sample, Impl, LeftRight, VariateTag >::result(), boost::accumulators::impl::non_coherent_weighted_tail_mean_impl< Sample, Weight, LeftRight >::result(), boost::accumulators::impl::weighted_tail_variate_means_impl< Sample, Weight, Impl, LeftRight, VariateType >::result(), boost::accumulators::impl::non_coherent_tail_mean_impl< Sample, LeftRight >::result(), boost::accumulators::impl::weighted_peaks_over_threshold_prob_impl< Sample, Weight, LeftRight >::result(), boost::accumulators::impl::peaks_over_threshold_prob_impl< Sample, LeftRight >::result(), boost::unit_test::basic_cstring< CharT >::rfind(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::rresize(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::rresize(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::rset_capacity(), boost::numeric::odeint::same_size_impl_sfinae< State1, State2, Enabler >::same_size(), boost::numeric::odeint::same_size_impl< openmp_state< T >, openmp_state< T > >::same_size(), boost::mpi::detail::scatter_impl(), boost::re_detail::parser_buf< charT, traits >::seekoff(), boost::re_detail::parser_buf< charT, traits >::seekpos(), boost::graph::distributed::send_oob(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::set_capacity(), boost::thread_attributes::set_stack_size(), boost::interprocess::iunordered_set_index< MapConfig >::shrink_to_fit(), boost::chrono::duration_punct< CharT >::singular(), boost::sync_bounded_queue< ValueType >::size(), boost::sync_queue< ValueType >::size(), boost::wave::util::CowString< Storage, Align >::size(), boost::adaptors::slice(), boost::basic_format< Ch, Tr, Alloc >::str(), boost::unit_test::basic_cstring< CharT >::substr(), boost::wave::util::flex_string< E, T, A, Storage >::substr(), boost::geometry::svg(), boost::xpressive::detail::to_vector(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::transfer(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::transfer(), transitive_closure(), boost::mpi::detail::tree_reduce_impl(), boost::sinks::bounded_fifo_queue< MaxQueueSizeV, OverflowStrategyT >::try_dequeue(), boost::sinks::bounded_ordering_queue< OrderT, MaxQueueSizeV, OverflowStrategyT >::try_dequeue(), boost::sinks::bounded_ordering_queue< OrderT, MaxQueueSizeV, OverflowStrategyT >::try_dequeue_ready(), boost::sinks::bounded_fifo_queue< MaxQueueSizeV, OverflowStrategyT >::try_enqueue(), boost::sinks::bounded_ordering_queue< OrderT, MaxQueueSizeV, OverflowStrategyT >::try_enqueue(), boost::numeric::odeint::unsplit_impl< mpi_state< InnerState >, Target, typename boost::enable_if< boost::has_range_iterator< Target > >::type >::unsplit(), boost::numeric::odeint::unsplit_impl< openmp_state< typename TargetContainer::value_type >, TargetContainer >::unsplit(), and boost::wave::util::CowString< Storage, Align >::~CowString().

template<class Graph , class OutputIterator , class ColorMap , class DegreeMap , class PriorityMap , class Weight >

OutputIterator boost::sloan_ordering	(	Graph &	g,
		typename graph_traits< Graph >::vertex_descriptor	s,
		typename graph_traits< Graph >::vertex_descriptor	e,
		OutputIterator	permutation,
		ColorMap	color,
		DegreeMap	degree,
		PriorityMap	priority,
		Weight	W1,
		Weight	W2
	)

References black(), breadth_first_search(), degree(), green(), make_bfs_visitor(), num_vertices(), out_edges(), put(), record_distances(), red(), target(), Vertex, vertex_index, vertices(), boost::detail::vertices_size_type, visitor(), and white().

Referenced by sloan_ordering().

template<class Graph , class OutputIterator , class ColorMap , class DegreeMap , class PriorityMap >

OutputIterator boost::sloan_ordering	(	Graph &	g,
		typename graph_traits< Graph >::vertex_descriptor	s,
		typename graph_traits< Graph >::vertex_descriptor	e,
		OutputIterator	permutation,
		ColorMap	color,
		DegreeMap	degree,
		PriorityMap	priority
	)

References sloan_ordering(), WEIGHT1, and WEIGHT2.

template<class Graph , class OutputIterator , class Color , class Degree , class Priority , class Weight >

OutputIterator boost::sloan_ordering ( Graph &  G, OutputIterator  permutation, Color  color, Degree  degree, Priority  priority, Weight  W1, Weight  W2  )

inline

References boost::asio::s, sloan_ordering(), sloan_start_end_vertices(), and Vertex.

template<class Graph , class OutputIterator , class Color , class Degree , class Priority >

OutputIterator boost::sloan_ordering ( Graph &  G, OutputIterator  permutation, Color  color, Degree  degree, Priority  priority  )

inline

References sloan_ordering(), WEIGHT1, and WEIGHT2.

template<class Graph , class ColorMap , class DegreeMap >

graph_traits<Graph>::vertex_descriptor boost::sloan_start_end_vertices	(	Graph &	G,
		typename graph_traits< Graph >::vertex_descriptor &	s,
		ColorMap	color,
		DegreeMap	degree
	)

References breadth_first_search(), degree(), boost::multiprecision::backends::i, make_bfs_visitor(), boost::accumulators::extract::max, num_vertices(), record_distances(), RLS_depth(), RLS_max_width(), boost::asio::s, Vertex, vertex_index, vertices(), boost::detail::vertices_size_type, and visitor().

Referenced by sloan_ordering().

template<typename Graph , typename GeodesicMap , typename Measure >

Measure::result_type boost::small_world_distance ( const Graph &  g, GeodesicMap  geo, Measure  measure  )

inline

References BOOST_CONCEPT_ASSERT(), and boost::accumulators::extract::sum.

Referenced by small_world_distance().

template<typename Graph , typename GeodesicMap >

property_traits<GeodesicMap>::value_type boost::small_world_distance ( const Graph &  g, GeodesicMap  geo  )

inline

References measure_graph_mean_geodesic(), and small_world_distance().

template<class VertexListGraph , class Order , class Degree , class Marker >

void boost::smallest_last_vertex_ordering	(	const VertexListGraph &	G,
		Order	order,
		Degree	degree,
		Marker	marker
	)

References num_vertices(), Vertex, and vertex_index.

Referenced by smallest_last_vertex_ordering().

template<class VertexListGraph , class Order , class Degree , class Marker , class BucketSorter >

void boost::smallest_last_vertex_ordering	(	const VertexListGraph &	G,
		Order	order,
		Degree	degree,
		Marker	marker,
		BucketSorter &	degree_buckets
	)

References adjacent_vertices(), BOOST_PREVENT_MACRO_SUBSTITUTION, BOOST_USING_STD_MIN, boost::accumulators::extract::min, num_vertices(), out_degree(), put(), Vertex, boost::detail::vertex_iterator, and vertices().

template<class VertexListGraph , class Order >

void boost::smallest_last_vertex_ordering	(	const VertexListGraph &	G,
		Order	order
	)

References boost::detail::degree_size_type, make_shared_array_property_map(), num_vertices(), smallest_last_vertex_ordering(), and vertex_index.

template<class VertexListGraph >

std::vector<typename graph_traits<VertexListGraph>::vertex_descriptor> boost::smallest_last_vertex_ordering

(

const VertexListGraph &

G

)

References make_iterator_property_map(), num_vertices(), and smallest_last_vertex_ordering().

template<typename V , typename D , typename P , typename B >

V boost::source	(	const typename incidence_graph_archetype< V, D, P, B >::edge_descriptor &	,
		const incidence_graph_archetype< V, D, P, B > &
	)

template<class G , class EI , class T , class D >

edge_list_impl<G,EI,T,D>::vertex_descriptor boost::source	(	typename edge_list_impl< G, EI, T, D >::edge_descriptor	e,
		const edge_list_impl< G, EI, T, D > &
	)

References boost::edge_list_impl< G, EdgeIter, T, D >::edge_descriptor::_ptr.

template<class G , class EI , class T , class D >

edge_list_impl_ra<G,EI,T,D>::vertex_descriptor boost::source	(	typename edge_list_impl_ra< G, EI, T, D >::edge_descriptor	e,
		const edge_list_impl_ra< G, EI, T, D > &	g_
	)

template<class Edge , class BidirectionalGraph , class GRef >

graph_traits<BidirectionalGraph>::vertex_descriptor boost::source ( const detail::reverse_graph_edge_descriptor< Edge > &  e, const reverse_graph< BidirectionalGraph, GRef > &  g  )

inline

References boost::reverse_graph< BidirectionalGraph, GraphRef >::m_g, target(), and boost::detail::reverse_graph_edge_descriptor< EdgeDesc >::underlying_descx.

template<typename G >

filtered_graph_base<G>::vertex_descriptor boost::source	(	typename filtered_graph_base< G >::edge_descriptor	e,
		const filtered_graph_base< G > &	g
	)

References boost::filtered_graph_base< G >::m_g, and source().

template<typename VP , typename EP , typename GP >

undirected_graph<VP,EP,GP>::vertex_descriptor boost::source ( typename undirected_graph< VP, EP, GP >::edge_descriptor  e, undirected_graph< VP, EP, GP > const &  g  )

inline

References source().

template<class vtype , class etype >

graph_traits< leda::GRAPH<vtype,etype> >::vertex_descriptor boost::source	(	typename graph_traits< leda::GRAPH< vtype, etype > >::edge_descriptor	e,
		const leda::GRAPH< vtype, etype > &	g
	)

References source().

template<typename VP , typename EP , typename GP >

directed_graph<VP,EP,GP>::vertex_descriptor boost::source ( typename directed_graph< VP, EP, GP >::edge_descriptor  e, directed_graph< VP, EP, GP > const &  g  )

inline

References source().

template<class Directed , class Vertex , class OutEdgeListS , class VertexListS , class DirectedS , class VertexProperty , class EdgeProperty , class GraphProperty , class EdgeListS >

Vertex boost::source ( const detail::edge_base< Directed, Vertex > &  e, const adjacency_list< OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &    )

inline

Referenced by boost::BOOST_RT_PARAM_NAMESPACE::interpret_argument_value_impl< T >::_(), boost::BOOST_RT_PARAM_NAMESPACE::interpret_argument_value_impl< cstring >::_(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::lazy_add_edge::add_local_edge(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::add_remote_edge(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::adopt(), boost::geometry::detail::coordinate_cast< CoordinateType >::apply(), boost::geometry::detail::expand::point_loop< StrategyLess, StrategyGreater, 0, dimension< Point >::type::value >::apply(), boost::geometry::detail::transform::transform_box_or_segment::apply(), boost::geometry::detail::expand::indexed_loop< StrategyLess, StrategyGreater, Index, Dimension, DimensionCount >::apply(), boost::detail::copy_graph_impl< 0 >::apply(), boost::detail::copy_graph_impl< 1 >::apply(), boost::detail::copy_graph_impl< 2 >::apply(), boost::geometry::dispatch::convert< Geometry1, Geometry2, Tag, Tag, DimensionCount, true >::apply(), boost::detail::augment(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::augment(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::augment_direct_paths(), boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::augment_matching(), boost::planar_dfs_visitor< LowPointMap, DFSParentMap, DFSNumberMap, LeastAncestorMap, DFSParentEdgeMap, SizeType >::back_edge(), boost::detail::bridges_visitor< TreeMap, PredMap, DistMap, LowMap, Buffer >::back_edge(), boost::detail::biconnected_components_visitor< ComponentMap, DiscoverTimeMap, LowPointMap, PredecessorMap, OutputIterator, Stack, ArticulationVector, IndexMap, DFSVisitor >::back_edge(), bandwidth(), bellman_ford_shortest_paths(), boost::concepts::BOOST_concept(), boost::detail::graph::brandes_betweenness_centrality_impl(), boost::detail::can_extend_path(), check_r_c_path(), chrobak_payne_straight_line_drawing(), color_edge(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::lazy_add_edge::commit(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::lazy_add_edge_with_property::commit(), boost::DistributedEdgeListGraphConcept< G >::const_constraints(), boost::DistributedEdgeListGraphConcept< G >::constraints(), boost::range::copy_n(), boost::inv_adjacency_iterator< Graph, Vertex, InEdgeIter, Difference >::dereference(), edge(), edge_connectivity(), boost::detail::RecordEdgeMapAndCycleVertex< PredEdgeMap, Vertex >::edge_not_minimized(), boost::detail::graph::brandes_dijkstra_visitor< Graph, WeightMap, IncomingMap, DistanceMap, PathCountMap >::edge_not_relaxed(), boost::detail::graph::brandes_dijkstra_visitor< Graph, WeightMap, IncomingMap, DistanceMap, PathCountMap >::edge_relaxed(), edgesum(), boost::python::objects::dynamic_cast_generator< Source, Target >::execute(), boost::python::objects::implicit_cast_generator< Source, Target >::execute(), boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::extract_kuratowski_subgraph(), boost::detail::state< Graph1, Graph2, IndexMap1, IndexMap2, EdgeEquivalencePredicate, VertexEquivalencePredicate, SubGraphIsoMapCallback, problem_selection >::feasible(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::find_bottleneck(), boost::greedy_matching< Graph, MateMap >::find_matching(), boost::extra_greedy_matching< Graph, MateMap >::find_matching(), boost::detail::biconnected_components_visitor< ComponentMap, DiscoverTimeMap, LowPointMap, PredecessorMap, OutputIterator, Stack, ArticulationVector, IndexMap, DFSVisitor >::finish_vertex(), floyd_warshall_all_pairs_shortest_paths(), fruchterman_reingold_force_directed_layout(), generate_random_graph(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::grow(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::has_source_connect(), boost::grid_graph< Dimensions, VertexIndex, EdgeIndex >::in_edge_at(), in_edge_set(), incident(), incremental_components(), boost::grid_graph< Dimensions, VertexIndex, EdgeIndex >::index_of(), is_kuratowski_subgraph(), is_self_loop(), is_straight_line_drawing(), iterative_bit_vector_dominator_tree(), johnson_all_pairs_shortest_paths(), boost::detail::kruskal_mst_impl(), boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::kuratowski_walkup(), make_biconnected_planar(), boost::detail::neighbor_bfs_impl(), boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type< Graph, IncomingMap, DistanceMap, PathCountMap >::non_tree_edge(), boost::detail::graph_copy_visitor< NewGraph, Copy2OrigIndexMap, CopyVertex, CopyEdge >::non_tree_edge(), boost::parallel::detail::simple_trigger_t< Class, T, Result >::operator()(), boost::is_local_edge< DistributedGraph >::operator()(), boost::graph_test< Graph >::ignore_edges::operator()(), boost::detail::bipartition_colorize< PartitionMap >::operator()(), boost::incident_from_predicate< Vertex, Graph >::operator()(), boost::detail::parallel::source_migrated_t< VertexProcessorMap, Graph >::operator()(), boost::detail::in_edge_predicate< EdgePredicate, VertexPredicate, Graph >::operator()(), boost::detail::dominator_visitor< Graph, IndexMap, TimeMap, PredMap, DomTreePredMap >::operator()(), boost::detail::edge_predicate< EdgePredicate, VertexPredicate, Graph >::operator()(), boost::detail::parallel::source_or_target_migrated_t< VertexProcessorMap, Graph >::operator()(), boost::detail::bipartition_check< PartitionMap >::operator()(), boost::numeric::odeint::compute_operations::scale_sum_swap2< Fac1, Fac2 >::operator()(), boost::incident_on_predicate< Vertex, Graph >::operator()(), boost::GraphParser< Graph_t, VertexProperty, EdgeProperty, VertexPropertySubset, EdgePropertySubset >::operator()(), boost::connects_predicate< Vertex, Graph >::operator()(), boost::predecessor_recorder< PredecessorMap, Tag >::operator()(), boost::distance_recorder< DistanceMap, Tag >::operator()(), boost::EdgePrinter< Graph, E >::operator()(), boost::parallel::detail::remove_out_edge_predicate< Graph, Predicate >::operator()(), boost::parallel::detail::remove_in_edge_predicate< Graph, Predicate >::operator()(), boost::parallel::detail::remove_undirected_edge_predicate< Graph, Predicate >::operator()(), boost::units::quantity< Unit, Y >::operator/=(), boost::detail::MapReducedWeight< Graph, Weight, Distance, Reversed >::operator[](), opposite(), planar_canonical_ordering(), planar_face_traversal(), boost::detail::base_state< Graph1, Graph2, IndexMap1, IndexMap2 >::pop(), print_edges(), print_edges2(), print_in_edges(), boost::detail::base_state< Graph1, Graph2, IndexMap1, IndexMap2 >::push(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::push_flow(), relax(), remove_edge(), boost::detail::parallel::remove_in_edge(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::remove_local_edge(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::remove_local_edge_from_list(), boost::serialization::save(), boost::detail::parallel::save_edges(), boost::detail::parallel::save_in_edges(), source(), boost::bad_lexical_cast::source_type(), target(), boost::graph_test< Graph >::test_add_edge(), boost::graph_test< Graph >::test_adjacency_matrix(), boost::graph_test< Graph >::test_bidirectional_graph(), boost::graph_test< Graph >::test_edge_list_graph(), boost::graph_test< Graph >::test_incidence_graph(), boost::graph_test< Graph >::test_remove_edge(), boost::geometry::strategy::transform::detail::transform_coordinates< Src, Dst, D, N, F >::transform(), boost::planar_dfs_visitor< LowPointMap, DFSParentMap, DFSNumberMap, LeastAncestorMap, DFSParentEdgeMap, SizeType >::tree_edge(), boost::detail::bridges_visitor< TreeMap, PredMap, DistMap, LowMap, Buffer >::tree_edge(), boost::detail::biconnected_components_visitor< ComponentMap, DiscoverTimeMap, LowPointMap, PredecessorMap, OutputIterator, Stack, ArticulationVector, IndexMap, DFSVisitor >::tree_edge(), boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type< Graph, IncomingMap, DistanceMap, PathCountMap >::tree_edge(), boost::detail::graph_copy_visitor< NewGraph, Copy2OrigIndexMap, CopyVertex, CopyEdge >::tree_edge(), verify_isomorphism(), verify_vf2_subgraph_iso(), write_dimacs_max_flow(), write_graphml(), write_graphviz(), boost::detail::write_graphviz_subgraph(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::lazy_add_edge::~lazy_add_edge(), and boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::lazy_add_edge_with_property::~lazy_add_edge_with_property().

template<typename G >

graph_traits<G>::vertex_descriptor boost::source	(	typename graph_traits< G >::edge_descriptor	e,
		const subgraph< G > &	g
	)

References boost::subgraph< Graph >::m_graph, and source().

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::vertex_descriptor boost::source ( typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::edge_descriptor  e, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &    )

inline

graph_traits<leda::graph>::vertex_descriptor boost::source	(	graph_traits< leda::graph >::edge_descriptor	e,
		const leda::graph &	g
	)

References source().

template<typename G , typename L , typename S >

labeled_graph<G,L,S>::vertex_descriptor boost::source ( typename labeled_graph< G, L, S >::edge_descriptor  e, labeled_graph< G, L, S > const &  g  )

inline

References source().

template<typename D , typename VP , typename EP , typename GP , typename A , typename Dir , typename Vertex >

adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor boost::source	(	const detail::matrix_edge_desc_impl< Dir, Vertex > &	e,
		const adjacency_matrix< D, VP, EP, GP, A > &
	)

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

Vertex boost::source ( typename compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::edge_descriptor  e, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &    )

inline

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename Edge >

adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::vertex_descriptor boost::source	(	const detail::parallel::edge_descriptor< Edge > &	e,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

Returns the source of edge.

Parameters

e	in
g.

References boost::detail::parallel::edge_descriptor< Edge >::local, source(), boost::detail::parallel::edge_descriptor< Edge >::source_processor, and Vertex.

template<class TimeMap , class TimeT , class Tag >

time_stamper<TimeMap, TimeT, Tag> boost::stamp_times	(	TimeMap	pa,
		TimeT &	time_counter,
		Tag
	)

References boost::multiprecision::backends::pa.

Referenced by kosaraju_strong_components().

template<class T , class U >

T* boost::static_pointer_cast ( U *  ptr )

inline

References boost::python::ptr(), and T.

Referenced by register_sink_factory().

template<class T , class U >

intrusive_ptr<T> boost::static_pointer_cast

(

intrusive_ptr< U > const &

p

)

References boost::intrusive_ptr< T >::get(), and T.

template<class T , class U >

shared_ptr< T > boost::static_pointer_cast

(

shared_ptr< U > const &

r

)

References E, boost::multiprecision::backends::p, and boost::detail::void.

template<class UndirectedGraph , class WeightMap , class ParityMap , class VertexAssignmentMap , class KeyedUpdatablePriorityQueue , class IndexMap >

boost::property_traits<WeightMap>::value_type boost::stoer_wagner_min_cut	(	const UndirectedGraph &	g,
		WeightMap	weights,
		ParityMap	parities,
		VertexAssignmentMap	assignments,
		KeyedUpdatablePriorityQueue &	pq,
		IndexMap	index_map
	)

References BOOST_CONCEPT_ASSERT(), boost::asio::error::invalid_argument, n, num_vertices(), boost::detail::stoer_wagner_min_cut(), and boost::detail::vertices_size_type.

Referenced by boost::graph::detail::stoer_wagner_min_cut_impl< UndirectedGraph, WeightMap >::operator()().

template<class Ch , class Tr , class Alloc >

std::basic_string<Ch, Tr, Alloc> boost::str ( const basic_format< Ch, Tr, Alloc > &  f )

inline

References boost::basic_format< Ch, Tr, Alloc >::str().

Referenced by boost::polygon::polygon_45_set_data< Unit >::applyAdaptiveBoolean_(), boost::polygon::polygon_45_set_data< Unit >::applyAdaptiveUnary_(), boost::spirit::ast_parse(), boost::spirit::x3::traits::extract_c_string< String >::call(), boost::spirit::traits::extract_c_string< String >::call(), boost::wave::util::impl::to_string_helper< Src, Src >::call(), boost::spirit::ch_p(), boost::spirit::chseq_p(), boost::locale::dgettext(), boost::locale::dngettext(), boost::locale::dnpgettext(), boost::locale::dpgettext(), boost::wave::impl::pp_iterator_functor< ContextT >::ensure_is_last_on_line(), boost::wave::impl::pp_iterator_functor< ContextT >::extract_identifier(), boost::locale::fold_case(), boost::spirit::inhibit_case_parser_gen_base< 0 >::generate(), boost::itest::manager::generic_data_flow(), boost::itest::manager::generic_return(), boost::spirit::lex::lexertl::detail::string_lit< char >::get(), boost::spirit::traits::get_begin(), boost::spirit::traits::get_end(), boost::spirit::x3::traits::get_string_begin(), boost::spirit::x3::traits::get_string_end(), boost::numeric::odeint::get_version_string(), boost::locale::gettext(), boost::interprocess::interprocess_exception::interprocess_exception(), boost::wave::util::impl::is_special_macroname(), boost::units::detail::maybe_parenthesize(), boost::date_time::month_str_to_ushort(), boost::spirit::qi::grammar< Iterator, T1, T2, T3, T4 >::name(), boost::spirit::karma::grammar< OutputIterator, T1, T2, T3, T4 >::name(), boost::chrono::clock_string< system_clock, CharT >::name(), boost::spirit::qi::rule< Iterator, T1, T2, T3, T4 >::name(), boost::spirit::karma::rule< OutputIterator, T1, T2, T3, T4 >::name(), boost::spirit::x3::symbols< Char, T, Lookup, Filter >::name(), boost::spirit::qi::symbols< Char, T, Lookup, Filter >::name(), boost::spirit::karma::symbols< Attribute, T, Lookup, CharEncoding, Tag >::name(), boost::spirit::repository::karma::subrule< ID_, T1, T2 >::name(), boost::spirit::repository::qi::subrule< ID_, T1, T2 >::name(), boost::spirit::karma::symbols< Attribute, unused_type, Lookup, CharEncoding, Tag >::name(), boost::locale::ngettext(), boost::locale::normalize(), boost::locale::npgettext(), boost::expressions::format_date_time_terminal< T, FallbackPolicyT, CharT >::operator()(), boost::expressions::wrapped_formatter_terminal< FunT, CharT >::operator()(), boost::spirit::symbol_inserter< T, SetT >::operator()(), boost::expressions::format_named_scope_terminal< FallbackPolicyT, CharT >::operator()(), boost::expressions::char_decorator_terminal< SubactorT, ImplT >::operator()(), boost::spirit::symbol_inserter< T, SetT >::operator,(), boost::trivial::operator<<(), boost::unit_test::operator<<(), operator<<(), boost::wave::util::flex_string< E, T, A, Storage >::operator=(), boost::filesystem::operator>>(), boost::spirit::inhibit_case_parser_gen_base< 0 >::operator[](), boost::locale::pgettext(), boost::wave::impl::pp_iterator_functor< ContextT >::pp_directive(), boost::spirit::pt_parse(), boost::chrono::duration_put< CharT, OutputIterator >::put(), boost::chrono::time_point_put< CharT, OutputIterator >::put(), boost::chrono::time_point_put< CharT, OutputIterator >::put_epoch(), boost::chrono::duration_put< CharT, OutputIterator >::put_unit(), boost::chrono::clock_string< system_clock, CharT >::since(), boost::spirit::str_p(), boost::iostreams::test_filter_pair(), boost::locale::to_lower(), boost::units::detail::to_string_impl(), boost::locale::to_title(), boost::locale::to_upper(), and boost::locale::conv::utf_to_utf().

template<typename Container >

void boost::stringtok	(	Container &	l,
		std::string const &	s,
		char const *const	ws = " \t\n"
	)

References boost::multiprecision::backends::i, and isws().

template<class Graph , class ComponentMap , class P , class T , class R >

property_traits<ComponentMap>::value_type boost::strong_components ( const Graph &  g, ComponentMap  comp, const bgl_named_params< P, T, R > &params   BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, vertex_list_graph_tag  )

inline

References BOOST_STATIC_ASSERT(), get_param(), boost::detail::scc_helper1(), and boost::program_options::value().

template<class Graph , class ComponentMap >

property_traits<ComponentMap>::value_type boost::strong_components ( const Graph &  g, ComponentMap comp   BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, vertex_list_graph_tag  )

inline

References BOOST_STATIC_ASSERT(), strong_components(), and boost::program_options::value().

template<class Graph , class ComponentMap , class P , class T , class R >

property_traits<ComponentMap>::value_type boost::strong_components ( const Graph &  g, ComponentMap  comp, const bgl_named_params< P, T, R > &  BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, distributed_graph_tag  )

inline

References boost::graph::distributed::fleischer_hendrickson_pinar_strong_components().

Referenced by boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), strong_components(), and transitive_closure().

template<class Graph , class ComponentMap >

property_traits<ComponentMap>::value_type boost::strong_components ( const Graph &  g, ComponentMap comp   BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, distributed_graph_tag  )

inline

References boost::graph::distributed::fleischer_hendrickson_pinar_strong_components().

template<class Graph , class Capacity , class ResidualCapacity , class Reversed , class Pred , class Weight , class Distance , class Distance2 , class VertexIndex >

void boost::successive_shortest_path_nonnegative_weights	(	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	distance,
		Distance2	distance_prev
	)

References boost::detail::augment(), BGL_FORALL_EDGES_T, BGL_FORALL_VERTICES_T, dijkstra_shortest_paths(), distance_map(), make_dijkstra_visitor(), boost::detail::make_mapReducedWeight(), put(), record_edge_predecessors(), boost::detail::residual_graph(), vertex_index_map(), visitor(), and weight_map().

Referenced by successive_shortest_path_nonnegative_weights(), and boost::detail::successive_shortest_path_nonnegative_weights_dispatch3().

template<class Graph , class P , class T , class R >

void boost::successive_shortest_path_nonnegative_weights	(	Graph &	g,
		typename graph_traits< Graph >::vertex_descriptor	s,
		typename graph_traits< Graph >::vertex_descriptor	t,
		const bgl_named_params< P, T, R > &	params
	)

References choose_const_pmap(), choose_pmap(), edge_capacity, edge_residual_capacity, edge_reverse, edge_weight, get_param(), boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(), vertex_index, and vertex_predecessor.

template<class Graph >

void boost::successive_shortest_path_nonnegative_weights	(	Graph &	g,
		typename graph_traits< Graph >::vertex_descriptor	s,
		typename graph_traits< Graph >::vertex_descriptor	t
	)

References successive_shortest_path_nonnegative_weights().

template<typename Signature >

void boost::swap ( function< Signature > &  f1, function< Signature > &  f2  )

inline

template<class T1 , class T2 >

BOOST_GPU_ENABLED void boost::swap	(	T1 &	left,
		T2 &	right
	)

References boost_swap_impl::swap_impl().

template<typename T , typename CA , typename A >

void boost::swap ( ptr_deque< T, CA, A > &  l, ptr_deque< T, CA, A > &  r  )

inline

template<typename T , typename CA , typename A >

void boost::swap ( ptr_vector< T, CA, A > &  l, ptr_vector< T, CA, A > &  r  )

inline

template<typename T , typename CA , typename A >

void boost::swap ( ptr_list< T, CA, A > &  l, ptr_list< T, CA, A > &  r  )

inline

template<class T >

void boost::swap	(	optional< T > &	x,
		optional< T > &	y
	)

template<class _Tp , class _Sequence >

void boost::swap ( queue< _Tp, _Sequence > &  __x, queue< _Tp, _Sequence > &  __y  )

inline

References boost::queue< _Tp, _Sequence >::swap().

Referenced by boost::queue< vertex_descriptor >::swap().

template<class T >

void boost::swap ( scoped_array< T > &  a, scoped_array< T > &  b  )

inline

References a, and boost::asio::b.

template<typename K , typename C , typename CA , typename A >

void boost::swap ( ptr_set< K, C, CA, A > &  l, ptr_set< K, C, CA, A > &  r  )

inline

template<class T >

void boost::swap ( scoped_ptr< T > &  a, scoped_ptr< T > &  b  )

inline

References a, and boost::asio::b.

template<typename K , typename C , typename CA , typename A >

void boost::swap ( ptr_multiset< K, C, CA, A > &  l, ptr_multiset< K, C, CA, A > &  r  )

inline

template<typename T >

void boost::swap ( recursive_wrapper< T > &  lhs, recursive_wrapper< T > &  rhs  )

inline

template<typename K , typename T , typename C , typename CA , typename A >

void boost::swap ( ptr_map< K, T, C, CA, A > &  l, ptr_map< K, T, C, CA, A > &  r  )

inline

template<typename K , typename T , typename C , typename CA , typename A >

void boost::swap ( ptr_multimap< K, T, C, CA, A > &  l, ptr_multimap< K, T, C, CA, A > &  r  )

inline

void boost::swap ( type_info_wrapper &  left, type_info_wrapper &  right  )

inline

Free swap for type info wrapper.

References boost::bimaps::support::left, and boost::icl::right().

void boost::swap ( filter &  left, filter &  right  )

inline

References boost::bimaps::support::left, and boost::icl::right().

void boost::swap ( attribute &  left, attribute &  right  )

inline

The function swaps two attribute value factories.

References boost::bimaps::support::left, and boost::icl::right().

template<class T >

BOOST_GPU_ENABLED void boost::swap	(	initialized< T > &	lhs,
		initialized< T > &	rhs
	)

References boost::initialized< T >::swap().

void boost::swap ( record &  left, record &  right  )

inline

A free-standing swap function overload for record.

References boost::bimaps::support::left, and boost::icl::right().

void boost::swap ( any &  lhs, any &  rhs  )

inline

Referenced by boost::any::swap().

template<typename K , typename H , typename P , typename CA , typename A >

void boost::swap ( ptr_unordered_set< K, H, P, CA, A > &  l, ptr_unordered_set< K, H, P, CA, A > &  r  )

inline

template<typename T , size_t size, typename CA >

void boost::swap ( ptr_array< T, size, CA > &  l, ptr_array< T, size, CA > &  r  )

inline

template<class K , class T , class H , class P , class CA , class A >

void boost::swap ( ptr_unordered_map< K, T, H, P, CA, A > &  l, ptr_unordered_map< K, T, H, P, CA, A > &  r  )

inline

template<typename K , typename H , typename P , typename CA , typename A >

void boost::swap ( ptr_unordered_multiset< K, H, P, CA, A > &  l, ptr_unordered_multiset< K, H, P, CA, A > &  r  )

inline

template<typename CharT >

void boost::swap ( basic_formatter< CharT > &  left, basic_formatter< CharT > &  right  )

inline

References boost::bimaps::support::left, and boost::icl::right().

template<class K , class T , class H , class P , class CA , class A >

void boost::swap ( ptr_unordered_multimap< K, T, H, P, CA, A > &  l, ptr_unordered_multimap< K, T, H, P, CA, A > &  r  )

inline

template<class T >

void boost::swap	(	weak_ptr< T > &	a,
		weak_ptr< T > &	b
	)

References boost::asio::b.

Referenced by boost::weak_ptr< shared_state_base >::swap().

void boost::swap ( record_view &  left, record_view &  right  )

inline

A free-standing swap function overload for record_view.

References boost::bimaps::support::left, and boost::icl::right().

template<class T >

BOOST_GPU_ENABLED void boost::swap	(	value_initialized< T > &	lhs,
		value_initialized< T > &	rhs
	)

References boost::value_initialized< T >::swap().

Referenced by boost::initialized< T >::swap().

template<class T >

void boost::swap	(	intrusive_ptr< T > &	lhs,
		intrusive_ptr< T > &	rhs
	)

References boost::intrusive_ptr< T >::swap().

template<class T >

void boost::swap	(	shared_array< T > &	a,
		shared_array< T > &	b
	)

References boost::asio::b.

Referenced by boost::shared_array< unsigned char >::swap().

template<class Destroyer >

void boost::swap	(	scoped_thread< Destroyer > &	lhs,
		scoped_thread< Destroyer > &	rhs
	)

Effects: swaps the contents of two scoped threads.

template<typename T , typename MutexType >

void boost::swap	(	externally_locked< T, MutexType > &	lhs,
		externally_locked< T, MutexType > &	rhs
	)

References boost::externally_locked< T, MutexType >::swap().

void boost::swap ( attribute_value &  left, attribute_value &  right  )

inline

The function swaps two attribute values.

References boost::bimaps::support::left, and boost::icl::right().

template<class T , std::size_t N>

void boost::swap ( array< T, N > &  x, array< T, N > &  y  )

inline

References boost::array< T, N >::swap().

void boost::swap ( attribute_set &  left, attribute_set &  right  )

inline

Free swap overload.

References boost::icl::right().

void boost::swap ( attribute_value_set &  left, attribute_value_set &  right  )

inline

Free swap overload.

References boost::bimaps::support::left, and boost::icl::right().

template<typename T , typename TagT >

void boost::swap ( value_ref< T, TagT > &  left, value_ref< T, TagT > &  right  )

inline

Free swap function.

template<typename Mutex >

void boost::swap	(	unique_lock< Mutex > &	lhs,
		unique_lock< Mutex > &	rhs
	)

template<typename T , typename CA , typename A >

void boost::swap ( ptr_circular_buffer< T, CA, A > &  l, ptr_circular_buffer< T, CA, A > &  r  )

inline

template<typename CharT >

void boost::swap ( basic_settings_section< CharT > &  left, basic_settings_section< CharT > &  right  )

inline

References boost::basic_settings_section< CharT >::swap().

template<typename Block , typename Allocator >

void boost::swap	(	dynamic_bitset< Block, Allocator > &	b1,
		dynamic_bitset< Block, Allocator > &	b2
	)

References boost::dynamic_bitset< Block, Allocator >::swap().

Referenced by boost::dynamic_bitset< Block, Allocator >::swap().

template<typename CharT , typename TraitsT >

void boost::swap ( basic_string_literal< CharT, TraitsT > &  left, basic_string_literal< CharT, TraitsT > &  right  )

inline

External swap.

References boost::bimaps::support::left, and boost::icl::right().

template<class BidiIterator , class Allocator >

void boost::swap	(	match_results< BidiIterator, Allocator > &	a,
		match_results< BidiIterator, Allocator > &	b
	)

References boost::match_results< BidiIterator, Allocator >::swap().

Referenced by boost::match_results< BidirectionalIterator >::swap(), and boost::xpressive::match_results< BidiIter >::swap().

template<class charT , class traits >

void boost::swap	(	basic_regex< charT, traits > &	e1,
		basic_regex< charT, traits > &	e2
	)

References boost::basic_regex< charT, traits >::swap().

template<class T >

void boost::swap ( shared_ptr< T > &  a, shared_ptr< T > &  b  )

inline

References boost::asio::b.

Referenced by boost::shared_ptr< core >::swap().

template<typename T , typename L >

void boost::swap ( synchronized_value< T, L > &  lhs, synchronized_value< T, L > &  rhs  )

inline

References boost::synchronized_value< T, Lockable >::swap().

template<typename T , typename L >

void boost::swap ( synchronized_value< T, L > &  lhs, T &  rhs  )

inline

References boost::synchronized_value< T, Lockable >::swap().

template<typename T , typename L >

void boost::swap ( T &  lhs, synchronized_value< T, L > &  rhs  )

inline

References boost::synchronized_value< T, Lockable >::swap().

template<typename Mutex >

void boost::swap	(	upgrade_lock< Mutex > &	lhs,
		upgrade_lock< Mutex > &	rhs
	)

Referenced by BOOST_THREAD_DCL_MOVABLE_BEG(), boost::unique_lock< Lockable >::swap(), boost::upgrade_lock< Mutex >::swap(), and boost::upgrade_to_unique_lock< Mutex >::swap().

template<class T , class Alloc >

void boost::swap ( circular_buffer_space_optimized< T, Alloc > &  lhs, circular_buffer_space_optimized< T, Alloc > &  rhs  )

inline

Swap the contents of two space optimized circular buffers.

Referenced by boost::circular_buffer_space_optimized< T, Alloc >::swap().

template<BOOST_VARIANT_ENUM_PARAMS(typename T) >

void boost::swap ( variant< BOOST_VARIANT_ENUM_PARAMS(T) > &  lhs, variant< BOOST_VARIANT_ENUM_PARAMS(T) > &  rhs  )

inline

Referenced by boost::gil::swap().

template<class T , class Alloc >

void boost::swap ( circular_buffer< T, Alloc > &  lhs, circular_buffer< T, Alloc > &  rhs  )

inline

Swap the contents of two circular_buffers.

Postcondition

lhs contains elements of rhs and vice versa.

Parameters

lhs	The circular_buffer whose content will be swapped with rhs.
rhs	The circular_buffer whose content will be swapped with lhs.

Exceptions

Nothing.

Complexity

Constant (in the size of the circular_buffers).

Iterator Invalidation

Invalidates all iterators of both circular_buffers. (On the other hand the iterators still point to the same elements but within another container. If you want to rely on this feature you have to turn the Debug Support off otherwise an assertion will report an error if such invalidated iterator is used.)

See also

swap(circular_buffer<T, Alloc>&)

Referenced by boost::circular_buffer< Sample >::swap().

template<class Iterator >

void boost::swappable_iterator_test	(	Iterator	i,
		Iterator	j
	)

References BOOST_TEST, and boost::multiprecision::backends::i.

Referenced by forward_swappable_iterator_test().

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

void boost::synchronize

(

const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &

g

)

References synchronize().

template<typename... SV>

std::tuple<typename synchronized_value_strict_lock_ptr<SV>::type ...> boost::synchronize

(

SV &...

sv

)

References adopt_lock, lock(), and boost::detail::type.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

void boost::synchronize

(

const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &

g

)

Referenced by boost::graph::parallel::detail::do_brandes_sssp(), boost::graph::distributed::detail::crauser_et_al_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap, MinOutWeightMap, MinInWeightMap >::do_synchronize(), boost::detail::open_once_event(), boost::graph::property_on_adjacents(), boost::graph::property_on_inedges(), boost::graph::property_on_outedges(), boost::graph::property_on_predecessors(), boost::graph::property_on_successors(), boost::graph::parallel::detail::betweenness_centrality_delta_stepping_impl< Graph, DistanceMap, IncomingMap, EdgeWeightMap, PathCountMap >::run(), synchronize(), write_graphviz(), and boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::~adjacency_list().

template<typename V , typename D , typename P , typename B >

V boost::target	(	const typename incidence_graph_archetype< V, D, P, B >::edge_descriptor &	,
		const incidence_graph_archetype< V, D, P, B > &
	)

template<class G , class EI , class T , class D >

edge_list_impl<G,EI,T,D>::vertex_descriptor boost::target	(	typename edge_list_impl< G, EI, T, D >::edge_descriptor	e,
		const edge_list_impl< G, EI, T, D > &
	)

References boost::edge_list_impl< G, EdgeIter, T, D >::edge_descriptor::_ptr.

template<class G , class EI , class T , class D >

edge_list_impl_ra<G,EI,T,D>::vertex_descriptor boost::target	(	typename edge_list_impl_ra< G, EI, T, D >::edge_descriptor	e,
		const edge_list_impl_ra< G, EI, T, D > &	g_
	)

template<class Edge , class BidirectionalGraph , class GRef >

graph_traits<BidirectionalGraph>::vertex_descriptor boost::target ( const detail::reverse_graph_edge_descriptor< Edge > &  e, const reverse_graph< BidirectionalGraph, GRef > &  g  )

inline

References boost::reverse_graph< BidirectionalGraph, GraphRef >::m_g, source(), and boost::detail::reverse_graph_edge_descriptor< EdgeDesc >::underlying_descx.

template<typename G >

filtered_graph_base<G>::vertex_descriptor boost::target	(	typename filtered_graph_base< G >::edge_descriptor	e,
		const filtered_graph_base< G > &	g
	)

References boost::filtered_graph_base< G >::m_g, and target().

template<typename VP , typename EP , typename GP >

undirected_graph<VP,EP,GP>::vertex_descriptor boost::target ( typename undirected_graph< VP, EP, GP >::edge_descriptor  e, undirected_graph< VP, EP, GP > const &  g  )

inline

References target().

template<class vtype , class etype >

graph_traits< leda::GRAPH<vtype,etype> >::vertex_descriptor boost::target	(	typename graph_traits< leda::GRAPH< vtype, etype > >::edge_descriptor	e,
		const leda::GRAPH< vtype, etype > &	g
	)

References target().

template<typename VP , typename EP , typename GP >

directed_graph<VP,EP,GP>::vertex_descriptor boost::target ( typename directed_graph< VP, EP, GP >::edge_descriptor  e, directed_graph< VP, EP, GP > const &  g  )

inline

References target().

template<class Directed , class Vertex , class OutEdgeListS , class VertexListS , class DirectedS , class VertexProperty , class EdgeProperty , class GraphProperty , class EdgeListS >

Vertex boost::target ( const detail::edge_base< Directed, Vertex > &  e, const adjacency_list< OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &    )

inline

Referenced by boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::lazy_add_edge::add_local_edge(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::add_remote_edge(), add_vertex(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::adopt(), boost::geometry::detail::transform::transform_box_or_segment::apply(), boost::detail::copy_graph_impl< 0 >::apply(), boost::detail::copy_graph_impl< 1 >::apply(), boost::detail::copy_graph_impl< 2 >::apply(), astar_search_no_init_tree(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::augment(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::augment_direct_paths(), boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::augment_matching(), boost::detail::bridges_visitor< TreeMap, PredMap, DistMap, LowMap, Buffer >::back_edge(), boost::planar_dfs_visitor< LowPointMap, DFSParentMap, DFSNumberMap, LeastAncestorMap, DFSParentEdgeMap, SizeType >::back_edge(), boost::detail::biconnected_components_visitor< ComponentMap, DiscoverTimeMap, LowPointMap, PredecessorMap, OutputIterator, Stack, ArticulationVector, IndexMap, DFSVisitor >::back_edge(), bandwidth(), bellman_ford_shortest_paths(), boost::detail::astar_bfs_visitor< AStarHeuristic, UniformCostVisitor, UpdatableQueue, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, BinaryFunction, BinaryPredicate >::black_target(), boost::concepts::BOOST_concept(), boost::BOOST_SIGNALS_NAMESPACE::detail::BOOST_JOIN(), BOOST_PHOENIX_DEFINE_EXPRESSION(), BOOST_PHOENIX_DEFINE_EXPRESSION_VARARG(), breadth_first_visit(), boost::detail::can_extend_graph(), boost::detail::can_extend_path(), boost::detail::can_wrap_path(), check_r_c_path(), chrobak_payne_straight_line_drawing(), boost::spirit::lex::string_token_def< String, IdType, CharEncoding >::collect(), boost::spirit::lex::char_token_def< CharEncoding, IdType >::collect(), boost::spirit::lex::token_def< Attribute, Char, Idtype >::collect(), color_edge(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::lazy_add_edge::commit(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::lazy_add_edge_with_property::commit(), boost::detail::compute_in_degree_map(), boost::DistributedEdgeListGraphConcept< G >::const_constraints(), boost::DistributedEdgeListGraphConcept< G >::constraints(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::convert_preflow_to_flow(), boost::detail::core_numbers_impl(), dag_shortest_paths(), boost::detail::depth_first_visit_impl(), boost::adjacency_iterator< Graph, Vertex, OutEdgeIter, Difference >::dereference(), dijkstra_shortest_paths_no_color_map_no_init(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::discharge(), edge(), edge_connectivity(), boost::detail::graph::brandes_dijkstra_visitor< Graph, WeightMap, IncomingMap, DistanceMap, PathCountMap >::edge_not_relaxed(), boost::detail::graph::brandes_dijkstra_visitor< Graph, WeightMap, IncomingMap, DistanceMap, PathCountMap >::edge_relaxed(), edgesum(), boost::detail::mas_min_cut_visitor< ParityMap, WeightMap, IndexMap >::examine_edge(), boost::detail::extend_path(), boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::extract_kuratowski_subgraph(), boost::detail::state< Graph1, Graph2, IndexMap1, IndexMap2, EdgeEquivalencePredicate, VertexEquivalencePredicate, SubGraphIsoMapCallback, problem_selection >::feasible(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::find_bottleneck(), boost::greedy_matching< Graph, MateMap >::find_matching(), boost::extra_greedy_matching< Graph, MateMap >::find_matching(), boost::detail::bfs_king_visitor< OutputIterator, Buffer, Compare, PseudoDegreeMap, VecMap, VertexIndexMap >::finish_vertex(), boost::detail::tarjan_scc_visitor< ComponentMap, RootMap, DiscoverTime, Stack >::finish_vertex(), boost::detail::biconnected_components_visitor< ComponentMap, DiscoverTimeMap, LowPointMap, PredecessorMap, OutputIterator, Stack, ArticulationVector, IndexMap, DFSVisitor >::finish_vertex(), floyd_warshall_all_pairs_shortest_paths(), fruchterman_reingold_force_directed_layout(), generate_random_graph(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::global_distance_update(), boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::gray_target(), boost::detail::astar_bfs_visitor< AStarHeuristic, UniformCostVisitor, UpdatableQueue, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, BinaryFunction, BinaryPredicate >::gray_target(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::grow(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::has_sink_connect(), boost::grid_graph< Dimensions, VertexIndex, EdgeIndex >::in_edge_at(), in_edge_set(), incident(), incremental_components(), boost::grid_graph< Dimensions, VertexIndex, EdgeIndex >::index_of(), boost::detail::invert_cd_path(), boost::range::iota(), is_kuratowski_subgraph(), is_self_loop(), is_straight_line_drawing(), ith_bandwidth(), ith_wavefront(), johnson_all_pairs_shortest_paths(), boost::detail::kruskal_mst_impl(), boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::kuratowski_walkup(), lookup_edge(), loop_erased_random_walk(), make_biconnected_planar(), boost::sinks::file::aux::make_collector(), boost::detail::maximal_fan(), boost::detail::maximum_adjacency_search(), boost::detail::neighbor_bfs_impl(), boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type< Graph, IncomingMap, DistanceMap, PathCountMap >::non_tree_edge(), boost::detail::graph_copy_visitor< NewGraph, Copy2OrigIndexMap, CopyVertex, CopyEdge >::non_tree_edge(), boost::is_local_edge< DistributedGraph >::operator()(), boost::graph_test< Graph >::ignore_edges::operator()(), boost::detail::parallel::target_migrated_t< VertexProcessorMap, Graph >::operator()(), boost::detail::bipartition_colorize< PartitionMap >::operator()(), boost::detail::out_edge_predicate< EdgePredicate, VertexPredicate, Graph >::operator()(), boost::incident_to_predicate< Vertex, Graph >::operator()(), boost::detail::edge_predicate< EdgePredicate, VertexPredicate, Graph >::operator()(), boost::detail::bipartition_check< PartitionMap >::operator()(), boost::detail::parallel::source_or_target_migrated_t< VertexProcessorMap, Graph >::operator()(), boost::incident_on_predicate< Vertex, Graph >::operator()(), boost::GraphParser< Graph_t, VertexProperty, EdgeProperty, VertexPropertySubset, EdgePropertySubset >::operator()(), boost::connects_predicate< Vertex, Graph >::operator()(), boost::predecessor_recorder< PredecessorMap, Tag >::operator()(), boost::edge_predecessor_recorder< PredEdgeMap, on_edge_relaxed >::operator()(), boost::distance_recorder< DistanceMap, Tag >::operator()(), boost::detail::predicateRemoveEdge1< Graph, MarkerP, NumberD, Stack, VertexIndexMap >::operator()(), boost::detail::predicate_remove_tagged_edges< Graph, MarkerP >::operator()(), boost::detail::grid_graph_adjacent_vertex_at< Graph >::operator()(), boost::EdgePrinter< Graph, E >::operator()(), boost::detail::equivalent_edge_exists< Graph, Enable >::operator()(), boost::parallel::detail::remove_out_edge_predicate< Graph, Predicate >::operator()(), boost::parallel::detail::remove_in_edge_predicate< Graph, Predicate >::operator()(), boost::parallel::detail::remove_undirected_edge_predicate< Graph, Predicate >::operator()(), boost::detail::MapReducedWeight< Graph, Weight, Distance, Reversed >::operator[](), opposite(), planar_canonical_ordering(), planar_face_traversal(), boost::detail::base_state< Graph1, Graph2, IndexMap1, IndexMap2 >::pop(), print_edges(), print_edges2(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::print_flow_values(), print_graph_dispatch(), boost::detail::base_state< Graph1, Graph2, IndexMap1, IndexMap2 >::push(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::push_flow(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::push_relabel(), boost::detail::r_c_shortest_paths_dispatch(), boost::python::range(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::relabel_distance(), relax(), boost::directed_graph< VertexProp, EdgeProp, GraphProp >::remove_edge(), boost::undirected_graph< VertexProp, EdgeProp, GraphProp >::remove_edge(), remove_edge(), boost::detail::parallel::remove_in_edge(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::remove_local_edge(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::remove_local_edge_from_list(), boost::serialization::save(), boost::detail::parallel::save_edges(), boost::detail::parallel::save_in_edges(), sloan_ordering(), source(), target(), boost::bad_lexical_cast::target_type(), boost::graph_test< Graph >::test_add_edge(), boost::graph_test< Graph >::test_adjacency_matrix(), boost::graph_test< Graph >::test_bidirectional_graph(), boost::graph_test< Graph >::test_edge_list_graph(), boost::graph_test< Graph >::test_incidence_graph(), boost::graph_test< Graph >::test_remove_edge(), boost::planar_dfs_visitor< LowPointMap, DFSParentMap, DFSNumberMap, LeastAncestorMap, DFSParentEdgeMap, SizeType >::tree_edge(), boost::detail::bridges_visitor< TreeMap, PredMap, DistMap, LowMap, Buffer >::tree_edge(), boost::detail::biconnected_components_visitor< ComponentMap, DiscoverTimeMap, LowPointMap, PredecessorMap, OutputIterator, Stack, ArticulationVector, IndexMap, DFSVisitor >::tree_edge(), boost::detail::astar_bfs_visitor< AStarHeuristic, UniformCostVisitor, UpdatableQueue, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, BinaryFunction, BinaryPredicate >::tree_edge(), boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type< Graph, IncomingMap, DistanceMap, PathCountMap >::tree_edge(), boost::detail::graph_copy_visitor< NewGraph, Copy2OrigIndexMap, CopyVertex, CopyEdge >::tree_edge(), boost::detail::undir_dfv_impl(), verify_isomorphism(), verify_vf2_subgraph_iso(), write_dimacs_max_flow(), write_graphml(), write_graphviz(), boost::detail::write_graphviz_subgraph(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::lazy_add_edge::~lazy_add_edge(), and boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::lazy_add_edge_with_property::~lazy_add_edge_with_property().

template<typename G >

graph_traits<G>::vertex_descriptor boost::target	(	typename graph_traits< G >::edge_descriptor	e,
		const subgraph< G > &	g
	)

References boost::subgraph< Graph >::m_graph, and target().

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::vertex_descriptor boost::target ( typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::edge_descriptor  e, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g  )

inline

References target().

graph_traits<leda::graph>::vertex_descriptor boost::target	(	graph_traits< leda::graph >::edge_descriptor	e,
		const leda::graph &	g
	)

References target().

template<typename G , typename L , typename S >

labeled_graph<G,L,S>::vertex_descriptor boost::target ( typename labeled_graph< G, L, S >::edge_descriptor  e, labeled_graph< G, L, S > const &  g  )

inline

References target().

template<typename D , typename VP , typename EP , typename GP , typename A , typename Dir , typename Vertex >

adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor boost::target	(	const detail::matrix_edge_desc_impl< Dir, Vertex > &	e,
		const adjacency_matrix< D, VP, EP, GP, A > &
	)

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

Vertex boost::target ( typename compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex >::edge_descriptor  e, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g  )

inline

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS , typename Edge >

adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::vertex_descriptor boost::target	(	const detail::parallel::edge_descriptor< Edge > &	e,
		const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &	g
	)

Returns the target of edge.

Parameters

e	in
g.

References boost::detail::parallel::edge_descriptor< Edge >::local, target(), boost::detail::parallel::edge_descriptor< Edge >::target_processor, and Vertex.

template<class E >

BOOST_NORETURN void boost::throw_exception ( E const &  e )

inline

References enable_current_exception(), enable_error_info(), and throw_exception_assert_compatibility().

Referenced by boost::alignment::aligned_allocator< T, Alignment >::allocate(), boost::pool_allocator< T, UserAllocator, Mutex, NextSize, MaxSize >::allocate(), boost::wave::util::mallocator< T >::allocate(), boost::fast_pool_allocator< T, UserAllocator, Mutex, NextSize, MaxSize >::allocate(), boost::detail::allocate_raw_heap_memory(), any_cast(), boost::mpi::communicator::array_recv_impl(), boost::multi_index::detail::random_access_index< SuperMeta, TagList >::at(), boost::detail::parallel::available_process_files(), boost::io::detail::bind_arg_body(), BOOST_THREAD_DCL_MOVABLE_BEG(), boost::spirit::multi_pass_policies::buf_id_check::check_if_valid(), boost::date_time::time_input_facet< time_type, CharT, InItrT >::check_special_value(), boost::basic_format< Ch, Tr, Alloc >::clear_bind(), boost::iostreams::basic_gzip_decompressor< Alloc >::close(), boost::iostreams::detail::chain_base< chain< Mode, Ch, Tr, Alloc >, Ch, Tr, Alloc, Mode >::component_type(), boost::condition_variable::condition_variable(), boost::condition_variable_any::condition_variable_any(), boost::detail::win32::create_anonymous_event(), boost::detail::win32::create_anonymous_semaphore(), boost::mpi::detail::serialized_array_irecv_data< T >::deserialize(), dijkstra_shortest_paths_no_color_map_no_init(), boost::graph::dimacs_basic_reader::dimacs_basic_reader(), boost::io::detail::distribute(), boost::detail::graph::mutate_graph_impl< MutableGraph >::do_add_edge(), boost::condition_variable::do_wait_until(), boost::detail::win32::duplicate_handle(), boost::xpressive::detail::ensure_(), boost::wave::grammars::expression_grammar_gen< TokenT >::evaluate(), boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::examine_edge(), boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::examine_edge(), boost::array< T, 0 >::failed_rangecheck(), boost::iostreams::detail::read_write_if_impl< output >::get(), get(), boost::spirit::any_ptr::get(), boost::date_time::date_input_facet< time_type::date_type, CharT, InItrT >::get(), boost::unique_future< R >::get(), boost::shared_future< R >::get(), boost::date_time::partial_date< date_type >::get_date(), boost::promise< R >::get_future(), boost::promise< R & >::get_future(), boost::promise< void >::get_future(), boost::packaged_task< R >::get_future(), boost::date_time::date_generator_parser< time_type::date_type, CharT >::get_nth_kday_type(), boost::unique_future< R >::get_or(), boost::shared_future< R >::get_or(), boost::date_time::c_time::gmtime(), boost::graph::dimacs_basic_reader::incr(), boost::graph::distributed::detail::initialize_min_out_weights(), boost::detail::invalid_utf32_code_point(), boost::multi_index::multi_index_container< adjacency_list_traits< listS, listS, bidirectionalS, listS >::vertex_descriptor, multi_index::indexed_by< multi_index::hashed_unique< multi_index::tag< vertex_name_t >, extract_name_from_vertex > > >::load(), boost::date_time::tz_db_base< time_zone_type, rule_type >::load_from_file(), boost::local_time::local_date_time_base< utc_time_, tz_type >::local_date_time_base(), boost::date_time::static_local_time_adjustor< time_type, dst_rules, utc_offset_rules >::local_to_utc_offset(), boost::date_time::c_time::localtime(), boost::signals2::slot_base::lock(), boost::mutex::lock(), boost::unique_lock< Lockable >::lock(), boost::upgrade_lock< Mutex >::lock(), boost::shared_mutex::lock_upgrade(), boost::packaged_task< R >::make_ready_at_thread_exit(), boost::io::detail::maybe_throw_exception(), boost::io::detail::modify_item_body(), boost::mutex::mutex(), boost::iostreams::newline_filter::newline_filter(), boost::CV::simple_exception_policy< rep_type, min_value, max_value, exception_type >::on_error(), boost::iostreams::detail::code_converter_impl< Device, Codecvt, Alloc >::open(), boost::iostreams::mapped_file_source::open(), boost::iostreams::mapped_file_sink::open(), boost::wave::cpplexer::impl::token_data< StringTypeT, PositionT >::operator new(), boost::signals2::last_value< T >::operator()(), boost::spirit::qi::debug_handler< Iterator, Context, Skipper, F >::operator()(), boost::visitor_ptr_t< T, R >::operator()(), boost::spirit::qi::error_handler< Iterator, Context, Skipper, F, action >::operator()(), boost::graph::cannot_add_vertex< VertexProperty >::operator()(), boost::packaged_task< R >::operator()(), boost::coroutines::pull_coroutine< R >::iterator::operator*(), boost::coroutines::pull_coroutine< R & >::iterator::operator*(), boost::coroutines::pull_coroutine< R >::iterator::operator->(), boost::coroutines::pull_coroutine< R & >::iterator::operator->(), operator<<(), boost::spirit::x3::expect_directive< Subject >::parse(), boost::basic_format< Ch, Tr, Alloc >::parse(), polymorphic_get(), boost::typeindex::stl_type_index::pretty_name(), boost::iostreams::detail::read_write_if_impl< input >::put(), boost::math::policies::detail::raise_error(), boost::array< T, i >::rangecheck(), boost::iostreams::detail::read_write_if_impl< output >::read(), boost::iostreams::code_converter< Device, Codecvt, Alloc >::read(), boost::iostreams::basic_gzip_decompressor< Alloc >::read(), boost::recursive_mutex::recursive_mutex(), boost::recursive_timed_mutex::recursive_timed_mutex(), boost::wave::util::SimpleStringStorage< E, A >::reserve(), boost::accumulators::impl::tail_quantile_impl< Sample, LeftRight >::result(), boost::accumulators::impl::weighted_tail_quantile_impl< Sample, Weight, LeftRight >::result(), boost::accumulators::impl::extended_p_square_quantile_impl< Sample, Impl1, Impl2 >::result(), boost::accumulators::impl::tail_variate_means_impl< Sample, Impl, LeftRight, VariateTag >::result(), boost::accumulators::impl::non_coherent_weighted_tail_mean_impl< Sample, Weight, LeftRight >::result(), boost::accumulators::impl::weighted_tail_variate_means_impl< Sample, Weight, Impl, LeftRight, VariateType >::result(), boost::accumulators::impl::non_coherent_tail_mean_impl< Sample, LeftRight >::result(), boost::accumulators::impl::weighted_peaks_over_threshold_prob_impl< Sample, Weight, LeftRight >::result(), boost::accumulators::impl::peaks_over_threshold_prob_impl< Sample, LeftRight >::result(), boost::iostreams::detail::seek_if_impl< any_tag >::seek(), boost::promise< R >::set_exception(), boost::promise< R & >::set_exception(), boost::promise< void >::set_exception(), boost::detail::shared_state_base::set_exception_at_thread_exit(), boost::promise< R >::set_exception_at_thread_exit(), boost::promise< R & >::set_exception_at_thread_exit(), boost::promise< void >::set_exception_at_thread_exit(), boost::promise< R >::set_value(), boost::promise< R & >::set_value(), boost::promise< void >::set_value(), boost::detail::shared_state< Rp >::set_value_at_thread_exit(), boost::detail::shared_state< T & >::set_value_at_thread_exit(), boost::detail::shared_state< void >::set_value_at_thread_exit(), boost::promise< R >::set_value_at_thread_exit(), boost::promise< R & >::set_value_at_thread_exit(), boost::promise< void >::set_value_at_thread_exit(), boost::shared_mutex::shared_mutex(), boost::iostreams::detail::skip(), boost::basic_format< Ch, Tr, Alloc >::str(), boost::basic_regex< Ch, Tr >::subexpression(), boost::wave::util::throw_(), boost::spirit::throw_(), boost::conversion::detail::throw_bad_cast(), boost::wave::context_policies::default_preprocessing_hooks::throw_exception(), boost::exception_detail::throw_exception_(), boost::timed_mutex::timed_mutex(), boost::gregorian::to_tm(), boost::unique_lock< Lockable >::try_lock(), boost::upgrade_lock< Mutex >::try_lock(), boost::mutex::unlock(), boost::unique_lock< Lockable >::unlock(), boost::upgrade_lock< Mutex >::unlock(), boost::io::detail::upper_bound_from_fstring(), boost::date_time::c_local_adjustor< time_type >::utc_to_local(), boost::date_time::static_local_time_adjustor< time_type, dst_rules, utc_offset_rules >::utc_to_local_offset(), boost::optional< status >::value(), boost::condition_variable::wait(), boost::condition_variable_any::wait(), boost::detail::basic_future< R >::wait(), boost::mpi::wait_any(), boost::iostreams::detail::read_write_if_impl< input >::write(), boost::iostreams::code_converter< Device, Codecvt, Alloc >::write(), and boost::iostreams::basic_gzip_decompressor< Alloc >::write().

void boost::throw_exception_assert_compatibility ( std::exception const &  )

inline

Referenced by throw_exception().

system::error_code& boost::throws ( )

inline

References boost::detail::throws().

template<typename Graph , typename Visitor >

void boost::tiernan_all_cycles ( const Graph &  g, Visitor  vis, std::size_t  minlen, std::size_t  maxlen  )

inline

References boost::detail::all_cycles_from_vertex(), BOOST_CONCEPT_ASSERT(), end, boost::multiprecision::backends::i, and vertices().

Referenced by tiernan_all_cycles(), and tiernan_girth_and_circumference().

template<typename Graph , typename Visitor >

void boost::tiernan_all_cycles ( const Graph &  g, Visitor  vis, std::size_t  maxlen  )

inline

References tiernan_all_cycles().

template<typename Graph , typename Visitor >

void boost::tiernan_all_cycles ( const Graph &  g, Visitor  vis  )

inline

References boost::accumulators::extract::max, and tiernan_all_cycles().

template<typename Graph >

std::size_t boost::tiernan_circumference ( const Graph &  g )

inline

References tiernan_girth_and_circumference().

template<typename Graph >

std::size_t boost::tiernan_girth ( const Graph &  g )

inline

References tiernan_girth_and_circumference().

template<typename Graph >

std::pair<std::size_t, std::size_t> boost::tiernan_girth_and_circumference ( const Graph &  g )

inline

References find_min_max_cycle(), boost::xpressive::make_pair, boost::accumulators::extract::max, and tiernan_all_cycles().

Referenced by tiernan_circumference(), and tiernan_girth().

template<typename Block , typename Allocator , typename BlockOutputIterator >

void boost::to_block_range ( const dynamic_bitset< Block, Allocator > &  b, BlockOutputIterator  result  )

inline

References boost::filesystem::detail::copy().

template<typename T >

to_log_manip< T > boost::to_log ( T const &  value )

inline

References boost::program_options::value().

Referenced by boost::to_log_fun< void >::operator()().

template<typename TagT , typename T >

to_log_manip< T, TagT > boost::to_log ( T const &  value )

inline

References boost::program_options::value().

template<class T , class U >

std::string boost::to_string ( std::pair< T, U > const &  x )

inline

References to_string().

std::string boost::to_string ( std::exception const &  x )

inline

std::string boost::to_string ( errinfo_errno const &  e )

inline

template<class Tag , class T >

std::string boost::to_string ( error_info< Tag, T > const &  x )

inline

References error_info_name(), and to_string_stub().

template<class T >

enable_if<is_output_streamable<T>,std::string>::type boost::to_string ( T const &  x )

inline

References out, and boost::flyweights::x.

Referenced by to_string().

std::string boost::to_string ( type_info_wrapper const &  ti )

inline

The function for exception serialization to string.

References boost::type_info_wrapper::pretty_name().

template<typename Block , typename Allocator , typename stringT >

void boost::to_string ( const dynamic_bitset< Block, Allocator > &  b, stringT &  s  )

inline

References to_string_helper().

Referenced by boost::serialization::save().

template<typename B , typename A , typename stringT >

void boost::to_string_helper	(	const dynamic_bitset< B, A > &	b,
		stringT &	s,
		bool	dump_all
	)

References assign(), BOOST_DYNAMIC_BITSET_CTYPE_FACET, BOOST_DYNAMIC_BITSET_WIDEN_CHAR, boost::multiprecision::backends::i, boost::python::len(), boost::dynamic_bitset< Block, Allocator >::num_blocks(), and boost::dynamic_bitset< Block, Allocator >::size().

Referenced by dump_to_string(), and to_string().

template<class T >

std::string boost::to_string_stub ( T const &  x )

inline

References boost::exception_detail::to_string_dispatch::dispatch().

Referenced by to_string().

template<class T , class Stub >

std::string boost::to_string_stub ( T const &  x, Stub  s  )

inline

References boost::exception_detail::to_string_dispatch::dispatch().

template<class T , class U , class Stub >

std::string boost::to_string_stub ( std::pair< T, U > const &  x, Stub  s  )

inline

std::vector<size_type> boost::topo_number_storage

(

num_vertices(g)

)

boost::topological_sort	(	g	,
		std::	back_insertertopo_order
	)

template<typename VertexListGraph , typename OutputIterator , typename P , typename T , typename R >

void boost::topological_sort	(	VertexListGraph &	g,
		OutputIterator	result,
		const bgl_named_params< P, T, R > &	params
	)

References depth_first_search(), and boost::bgl_named_params< T, Tag, Base >::visitor().

Referenced by topological_sort(), and transitive_closure().

template<typename VertexListGraph , typename OutputIterator >

void boost::topological_sort	(	VertexListGraph &	g,
		OutputIterator	result
	)

References topological_sort().

template<typename Graph , typename GraphTC , typename G_to_TC_VertexMap , typename VertexIndexMap >

void boost::transitive_closure	(	const Graph &	g,
		GraphTC &	tc,
		G_to_TC_VertexMap	g_to_tc_map,
		VertexIndexMap	index_map
	)

References boost::numeric::odeint::detail::_1, boost::numeric::odeint::detail::_2, add_edge(), add_vertex(), adjacent_vertices(), boost::asio::begin, bind(), BOOST_CONCEPT_ASSERT(), build_component_lists(), boost::fusion::clear(), end, boost::fusion::find_if(), boost::multiprecision::backends::i, boost::xpressive::inf, boost::accumulators::extract::max, n, next(), not1(), num_vertices(), boost::multiprecision::backends::pr, boost::xpressive::push_back, boost::expressions::reverse, boost::asio::s, size(), strong_components(), boost::detail::subscript(), boost::flyweights::t, topo_order, topological_sort(), boost::detail::union_successor_sets(), boost::geometry::unique(), vertex(), vertex_index_map(), boost::detail::vertex_iterator, and vertices().

Referenced by transitive_closure(), and boost::detail::transitive_closure_dispatch().

template<typename Graph , typename GraphTC >

void boost::transitive_closure	(	const Graph &	g,
		GraphTC &	tc
	)

References num_vertices(), transitive_closure(), and vertex_index.

template<typename Graph , typename GraphTC , typename P , typename T , typename R >

void boost::transitive_closure	(	const Graph &	g,
		GraphTC &	tc,
		const bgl_named_params< P, T, R > &	params
	)

References choose_const_pmap(), get_param(), num_vertices(), boost::detail::transitive_closure_dispatch(), and vertex_index.

template<class VertexListGraph , class MutableGraph >

void boost::transpose_graph	(	const VertexListGraph &	G,
		MutableGraph &	G_T
	)

References copy_graph().

Referenced by kosaraju_strong_components().

template<class VertexListGraph , class MutableGraph , class P , class T , class R >

void boost::transpose_graph	(	const VertexListGraph &	G,
		MutableGraph &	G_T,
		const bgl_named_params< P, T, R > &	params
	)

References copy_graph().

template<class Tree , class TreeVisitor >

void boost::traverse_tree	(	typename tree_traits< Tree >::node_descriptor	v,
		Tree &	t,
		TreeVisitor	visitor
	)

References end, and boost::multiprecision::backends::i.

Referenced by metric_tsp_approx_from_vertex().

template<typename MutexType1 , typename MutexType2 >

detail::try_lock_impl_return<MutexType1>::type boost::try_lock	(	MutexType1 &	m1,
		MutexType2 &	m2
	)

References boost::detail::try_lock_impl().

Referenced by BOOST_THREAD_DCL_MOVABLE_BEG(), boost::detail::lock_impl(), and boost::detail::try_lock_impl().

template<typename MutexType1 , typename MutexType2 >

detail::try_lock_impl_return<MutexType1>::type boost::try_lock	(	const MutexType1 &	m1,
		MutexType2 &	m2
	)

References boost::detail::try_lock_impl().

template<typename MutexType1 , typename MutexType2 >

detail::try_lock_impl_return<MutexType1>::type boost::try_lock	(	MutexType1 &	m1,
		const MutexType2 &	m2
	)

References boost::detail::try_lock_impl().

template<typename MutexType1 , typename MutexType2 >

detail::try_lock_impl_return<MutexType1>::type boost::try_lock	(	const MutexType1 &	m1,
		const MutexType2 &	m2
	)

References boost::detail::try_lock_impl().

template<typename MutexType1 , typename MutexType2 , typename MutexType3 >

int boost::try_lock	(	MutexType1 &	m1,
		MutexType2 &	m2,
		MutexType3 &	m3
	)

References boost::detail::try_lock_internal().

template<typename MutexType1 , typename MutexType2 , typename MutexType3 , typename MutexType4 >

int boost::try_lock	(	MutexType1 &	m1,
		MutexType2 &	m2,
		MutexType3 &	m3,
		MutexType4 &	m4
	)

References boost::detail::try_lock_internal().

template<typename MutexType1 , typename MutexType2 , typename MutexType3 , typename MutexType4 , typename MutexType5 >

int boost::try_lock	(	MutexType1 &	m1,
		MutexType2 &	m2,
		MutexType3 &	m3,
		MutexType4 &	m4,
		MutexType5 &	m5
	)

References boost::detail::try_lock_internal().

boost::two_graphs_common_spanning_trees	(	iG	,
		iGO	,
		vG	,
		vGO	,
		func	,
		inL
	)

template<class BidiIterator , class Allocator >

bool boost::u32regex_match ( BidiIterator  first, BidiIterator  last, match_results< BidiIterator, Allocator > &  m, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_match().

bool boost::u32regex_match ( const UChar *  p, match_results< const UChar * > &  m, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_match().

bool boost::u32regex_match ( const wchar_t *  p, match_results< const wchar_t * > &  m, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_match().

bool boost::u32regex_match ( const char *  p, match_results< const char * > &  m, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_match().

bool boost::u32regex_match ( const unsigned char *  p, match_results< const unsigned char * > &  m, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_match().

bool boost::u32regex_match ( const std::string &  s, match_results< std::string::const_iterator > &  m, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_match().

bool boost::u32regex_match ( const std::wstring &  s, match_results< std::wstring::const_iterator > &  m, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_match().

bool boost::u32regex_match ( const U_NAMESPACE_QUALIFIER UnicodeString &  s, match_results< const UChar * > &  m, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_match().

template<class BidiIterator >

bool boost::u32regex_match ( BidiIterator  first, BidiIterator  last, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_match().

bool boost::u32regex_match ( const UChar *  p, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_match().

bool boost::u32regex_match ( const wchar_t *  p, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_match().

bool boost::u32regex_match ( const char *  p, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_match().

bool boost::u32regex_match ( const unsigned char *  p, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_match().

bool boost::u32regex_match ( const std::string &  s, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_match().

bool boost::u32regex_match ( const std::wstring &  s, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_match().

bool boost::u32regex_match ( const U_NAMESPACE_QUALIFIER UnicodeString &  s, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_match().

template<class OutputIterator , class BidirectionalIterator , class charT >

OutputIterator boost::u32regex_replace ( OutputIterator  out, BidirectionalIterator  first, BidirectionalIterator  last, const u32regex &  e, const charT *  fmt, match_flag_type  flags = match_default  )

inline

References boost::detail::const, boost::re_detail::do_regex_replace(), boost::re_detail::extract_output_base(), boost::re_detail::make_utf32_out(), and boost::re_detail::make_utf32_seq().

Referenced by u32regex_replace().

template<class OutputIterator , class Iterator , class charT >

OutputIterator boost::u32regex_replace ( OutputIterator  out, Iterator  first, Iterator  last, const u32regex &  e, const std::basic_string< charT > &  fmt, match_flag_type  flags = match_default  )

inline

References boost::detail::const, boost::re_detail::do_regex_replace(), boost::re_detail::extract_output_base(), boost::re_detail::make_utf32_out(), and boost::re_detail::make_utf32_seq().

template<class OutputIterator , class Iterator >

OutputIterator boost::u32regex_replace ( OutputIterator  out, Iterator  first, Iterator  last, const u32regex &  e, const U_NAMESPACE_QUALIFIER UnicodeString &  fmt, match_flag_type  flags = match_default  )

inline

References boost::detail::const, boost::re_detail::do_regex_replace(), boost::re_detail::extract_output_base(), boost::re_detail::make_utf32_out(), and boost::re_detail::make_utf32_seq().

template<class charT >

std::basic_string<charT> boost::u32regex_replace	(	const std::basic_string< charT > &	s,
		const u32regex &	e,
		const charT *	fmt,
		match_flag_type	flags = match_default
	)

References boost::multiprecision::backends::i, and u32regex_replace().

template<class charT >

std::basic_string<charT> boost::u32regex_replace	(	const std::basic_string< charT > &	s,
		const u32regex &	e,
		const std::basic_string< charT > &	fmt,
		match_flag_type	flags = match_default
	)

References boost::multiprecision::backends::i, and u32regex_replace().

U_NAMESPACE_QUALIFIER UnicodeString boost::u32regex_replace ( const U_NAMESPACE_QUALIFIER UnicodeString &  s, const u32regex &  e, const UChar *  fmt, match_flag_type  flags = match_default  )

inline

References boost::multiprecision::backends::i, and u32regex_replace().

U_NAMESPACE_QUALIFIER UnicodeString boost::u32regex_replace ( const U_NAMESPACE_QUALIFIER UnicodeString &  s, const u32regex &  e, const U_NAMESPACE_QUALIFIER UnicodeString &  fmt, match_flag_type  flags = match_default  )

inline

References boost::detail::const, boost::re_detail::do_regex_replace(), boost::multiprecision::backends::i, boost::re_detail::make_utf32_out(), and boost::re_detail::make_utf32_seq().

template<class BidiIterator , class Allocator >

bool boost::u32regex_search ( BidiIterator  first, BidiIterator  last, match_results< BidiIterator, Allocator > &  m, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_search().

Referenced by boost::u32regex_iterator_implementation< BidirectionalIterator >::init(), boost::u32regex_token_iterator_implementation< BidirectionalIterator >::init(), boost::u32regex_iterator_implementation< BidirectionalIterator >::next(), and boost::u32regex_token_iterator_implementation< BidirectionalIterator >::next().

template<class BidiIterator , class Allocator >

bool boost::u32regex_search ( BidiIterator  first, BidiIterator  last, match_results< BidiIterator, Allocator > &  m, const u32regex &  e, match_flag_type  flags, BidiIterator  base  )

inline

References boost::detail::const, and boost::re_detail::do_regex_search().

bool boost::u32regex_search ( const UChar *  p, match_results< const UChar * > &  m, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_search().

bool boost::u32regex_search ( const wchar_t *  p, match_results< const wchar_t * > &  m, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_search().

bool boost::u32regex_search ( const char *  p, match_results< const char * > &  m, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_search().

bool boost::u32regex_search ( const unsigned char *  p, match_results< const unsigned char * > &  m, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_search().

bool boost::u32regex_search ( const std::string &  s, match_results< std::string::const_iterator > &  m, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::basic_regex< charT, traits >::begin(), boost::detail::const, and boost::re_detail::do_regex_search().

bool boost::u32regex_search ( const std::wstring &  s, match_results< std::wstring::const_iterator > &  m, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::basic_regex< charT, traits >::begin(), boost::detail::const, and boost::re_detail::do_regex_search().

bool boost::u32regex_search ( const U_NAMESPACE_QUALIFIER UnicodeString &  s, match_results< const UChar * > &  m, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_search().

template<class BidiIterator >

bool boost::u32regex_search ( BidiIterator  first, BidiIterator  last, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_search().

bool boost::u32regex_search ( const UChar *  p, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_search().

bool boost::u32regex_search ( const wchar_t *  p, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_search().

bool boost::u32regex_search ( const char *  p, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_search().

bool boost::u32regex_search ( const unsigned char *  p, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_search().

bool boost::u32regex_search ( const std::string &  s, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::basic_regex< charT, traits >::begin(), boost::detail::const, and boost::re_detail::do_regex_search().

bool boost::u32regex_search ( const std::wstring &  s, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::basic_regex< charT, traits >::begin(), boost::detail::const, and boost::re_detail::do_regex_search().

bool boost::u32regex_search ( const U_NAMESPACE_QUALIFIER UnicodeString &  s, const u32regex &  e, match_flag_type  flags = match_default  )

inline

References boost::detail::const, and boost::re_detail::do_regex_search().

template<typename UnderlyingType , typename EnumType >

UnderlyingType boost::underlying_cast

(

EnumType

v

)

template<typename IncidenceGraph , typename DFSVisitor , typename VertexColorMap , typename EdgeColorMap >

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

References boost::detail::undir_dfv_impl().

template<typename Graph , typename DFSVisitor , typename VertexColorMap , typename EdgeColorMap , typename Vertex >

void boost::undirected_dfs	(	const Graph &	g,
		DFSVisitor	vis,
		VertexColorMap	vertex_color,
		EdgeColorMap	edge_color,
		Vertex	start_vertex
	)

References BOOST_CONCEPT_ASSERT(), edges(), boost::xpressive::first, put(), boost::detail::undir_dfv_impl(), vertex_color, vertices(), and white().

template<typename Graph , typename DFSVisitor , typename VertexColorMap , typename EdgeColorMap >

void boost::undirected_dfs	(	const Graph &	g,
		DFSVisitor	vis,
		VertexColorMap	vertex_color,
		EdgeColorMap	edge_color
	)

References boost::xpressive::first, undirected_dfs(), and vertices().

template<typename Graph , typename P , typename T , typename R >

void boost::undirected_dfs	(	const Graph &	g,
		const bgl_named_params< P, T, R > &	params
	)

References boost::detail::udfs_dispatch< VertexColorMap >::apply(), choose_param(), boost::xpressive::first, get_param(), graph_visitor, make_dfs_visitor(), and vertices().

boost::undirected_dfs	(	iG	,
		iG_vis	,
		associative_property_map< std::map< vertex_descriptor, default_color_type > >	vertex_color,
		associative_property_map< std::map< edge_descriptor, default_color_type > >	edge_color
	)

Referenced by boost::detail::udfs_dispatch< VertexColorMap >::apply(), boost::detail::udfs_dispatch< param_not_found >::apply(), if(), boost::detail::rec_two_graphs_common_spanning_trees(), and undirected_dfs().

boost::undirected_dfs	(	vG	,
		vG_vis	,
		associative_property_map< std::map< vertex_descriptor, default_color_type > >	vertex_color,
		associative_property_map< std::map< edge_descriptor, default_color_type > >	edge_color
	)

boost::undirected_dfs	(	make_filtered_graph(iG, detail::inL_edge_status< associative_property_map< std::map< edge_descriptor, bool > > >(aiG_inL))	,
		make_dfs_visitor(detail::cycle_finder< std::stack< edge_descriptor > >(&iG_buf))	,
		associative_property_map< std::map< vertex_descriptor, default_color_type > >	vertex_color,
		associative_property_map< std::map< edge_descriptor, default_color_type > >	edge_color
	)

boost::undirected_dfs	(	make_filtered_graph(vG, detail::inL_edge_status< associative_property_map< std::map< edge_descriptor, bool > > >(avG_inL))	,
		make_dfs_visitor(detail::cycle_finder< std::stack< edge_descriptor > >(&vG_buf))	,
		associative_property_map< std::map< vertex_descriptor, default_color_type > >	vertex_color,
		associative_property_map< std::map< edge_descriptor, default_color_type > >	edge_color
	)

template<typename I , typename F >

F boost::uninitialized_copy_or_move ( I  f, I  l, F  r  )

inline

Effects:

for (; first != last; ++result, ++first)
   new (static_cast<void*>(&*result))
      typename iterator_traits<ForwardIterator>::value_type(*first);

Returns: result

Note: This function is provided because std::uninitialized_copy from some STL implementations is not compatible with move_iterator

References boost::cb_details::uninitialized_copy().

template<typename I , typename F >

F boost::uninitialized_move	(	I	f,
		I	l,
		F	r
	)

defined(BOOST_MOVE_USE_STANDARD_LIBRARY_MOVE)

Effects:

for (; first != last; ++result, ++first)
   new (static_cast<void*>(&*result))
      typename iterator_traits<ForwardIterator>::value_type(boost::move(*first));

Returns: result

References addressof(), boost::xpressive::back, BOOST_CATCH, BOOST_CATCH_END, BOOST_RETHROW, BOOST_TRY, and move().

template<typename ValueType >

ValueType* boost::unsafe_any_cast ( any *  operand )

inline

Referenced by BOOST_JOIN(), and boost::BOOST_SIGNALS_NAMESPACE::detail::BOOST_JOIN().

template<typename ValueType >

const ValueType* boost::unsafe_any_cast ( const any *  operand )

inline

References boost::any::unsafe_any_cast.

template<typename T >

T& boost::unsafe_serialize ( T &  x )

inline

References boost::flyweights::x.

Referenced by boost::detail::parallel::maybe_save_local_descriptor(), boost::detail::parallel::maybe_save_property_ptr(), boost::detail::parallel::save_edges(), boost::detail::parallel::save_in_edges(), boost::detail::parallel::serializable_local_descriptor< Local >::serialize(), boost::unsafe_pair< T, U >::serialize(), boost::detail::serialize(), boost::detail::parallel::global_descriptor< LocalDescriptor >::serialize(), and boost::detail::parallel::msg_add_edge_data< Vertex, LocalVertex >::serialize().

ptr_serialize_type& boost::unsafe_serialize ( void *&  x )

inline

References boost::flyweights::x.

template<class T >

BOOST_FORCEINLINE unwrap_reference<T>::type& boost::unwrap_ref

(

T &

t

)

Returns

unwrap_reference<T>::type&(t)

Remarks

Does not throw.

References boost::flyweights::t.

Referenced by boost::graph::parallel::detail::brandes_betweenness_centrality_dispatch2(), boost::detail::graph::non_distributed_brandes_betweenness_centrality_dispatch2(), boost::phoenix::custom_terminal< boost::reference_wrapper< actor< Expr > const > >::operator()(), boost::graph::detail::breadth_first_search_impl< Graph, Source >::operator()(), boost::re_detail::format_functor3< Base, Match >::operator()(), boost::re_detail::format_functor2< Base, Match >::operator()(), and boost::re_detail::format_functor1< Base, Match >::operator()().

template<class TreeNode , class Compare , class ExternalData >

TreeNode boost::up_heap ( TreeNode  x, const Compare &  comp, ExternalData &  edata  )

inline

References boost::flyweights::x.

Referenced by boost::mutable_queue< IndexedType, RandomAccessContainer, Comp, ID >::push(), and update_heap().

template<class TreeNode , class Compare , class ExternalData >

void boost::update_heap ( TreeNode  x, const Compare &  comp, ExternalData &  edata  )

inline

References down_heap(), up_heap(), and boost::detail::void.

Referenced by boost::mutable_queue< IndexedType, RandomAccessContainer, Comp, ID >::update().

template<typename Graph1 , typename Graph2 , typename IsoMap >

bool boost::verify_isomorphism ( const Graph1 &  g1, const Graph2 &  g2, IsoMap  iso_map  )

inline

References BGL_FORALL_EDGES_T, num_edges(), num_vertices(), source(), and target().

Referenced by boost::graph_test< Graph >::test_add_edge(), boost::graph_test< Graph >::test_add_vertex(), boost::graph_test< Graph >::test_clear_vertex(), and boost::graph_test< Graph >::test_remove_edge().

template<typename Graph1 , typename Graph2 , typename CorresponenceMap1To2 , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate >

bool boost::verify_vf2_subgraph_iso ( const Graph1 &  graph1, const Graph2 &  graph2, const CorresponenceMap1To2  f, EdgeEquivalencePredicate  edge_comp, VertexEquivalencePredicate  vertex_comp  )

inline

References BGL_FORALL_EDGES_T, BOOST_CONCEPT_ASSERT(), boost::xpressive::s1, boost::xpressive::s2, source(), and target().

Referenced by verify_vf2_subgraph_iso().

template<typename Graph1 , typename Graph2 , typename CorresponenceMap1To2 >

bool boost::verify_vf2_subgraph_iso ( const Graph1 &  graph1, const Graph2 &  graph2, const CorresponenceMap1To2  f  )

inline

References verify_vf2_subgraph_iso().

template<typename Graph , typename EdgePredicate , typename VertexPredicate >

graph_traits<Graph>::vertex_descriptor boost::vertex	(	typename graph_traits< Graph >::vertices_size_type	i,
		filtered_graph< Graph, EdgePredicate, VertexPredicate > const &	g
	)

Forward vertex() to vertex() of the base graph.

References boost::filtered_graph_base< Graph >::m_g, and vertex().

Vertex* boost::vertex ( long  v, sgb_const_graph_ptr  g  )

inline

template<class BidirectionalGraph , class GRef >

graph_traits<BidirectionalGraph>::vertex_descriptor boost::vertex ( const typename graph_traits< BidirectionalGraph >::vertices_size_type  v, const reverse_graph< BidirectionalGraph, GRef > &  g  )

inline

References boost::reverse_graph< BidirectionalGraph, GraphRef >::m_g, and vertex().

template<typename VP , typename EP , typename GP >

undirected_graph<VP,EP,GP>::vertex_descriptor boost::vertex	(	typename undirected_graph< VP, EP, GP >::vertices_size_type	n,
		undirected_graph< VP, EP, GP > const &	g
	)

References vertex().

template<typename VP , typename EP , typename GP >

directed_graph<VP,EP,GP>::vertex_descriptor boost::vertex	(	typename directed_graph< VP, EP, GP >::vertices_size_type	n,
		directed_graph< VP, EP, GP > const &	g
	)

References vertex().

template<typename G >

subgraph<G>::vertex_descriptor boost::vertex	(	typename subgraph< G >::vertices_size_type	n,
		const subgraph< G > &	g
	)

References boost::subgraph< Graph >::m_graph, and vertex().

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

graph_traits< compressed_sparse_row_graph<Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex> >::vertex_descriptor boost::vertex ( typename graph_traits< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > >::vertex_descriptor  i, const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &    )

inline

References boost::multiprecision::backends::i.

template<typename D , typename VP , typename EP , typename GP , typename A >

adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor boost::vertex	(	typename adjacency_matrix< D, VP, EP, GP, A >::vertices_size_type	n,
		const adjacency_matrix< D, VP, EP, GP, A > &
	)

References n.

Referenced by boost::graph::add_vertex(), boost::geometry::strategy::buffer::join_miter::apply(), boost::geometry::strategy::buffer::join_round_by_divide::apply(), boost::geometry::strategy::buffer::join_round::apply(), are_property_maps_different(), boost::graph::parallel::detail::brandes_betweenness_centrality_impl(), boost::graph::distributed::build_reverse_graph(), boost::detail::core_numbers_dispatch(), boost::detail::core_numbers_impl(), create_condensation_graph(), boost::polygon::polygon_set_data< T >::downcast(), boost::mpi::get(), boost::polygon::polygon_90_set_data< T >::insert(), boost::polygon::insert_vertex_half_edge_45_pair_into_vector(), boost::geometry::strategy::buffer::join_round_by_divide::mid_points(), boost::graph::parallel::detail::non_distributed_brandes_betweenness_centrality_impl(), boost::detail::grid_graph_vertex_at< Graph >::operator()(), boost::index_to_vertex_func< Distribution, Graph >::operator()(), boost::labeled_graph< Graph *, Label, Selector >::operator[](), boost::detail::bfs_king_visitor< OutputIterator, Buffer, Compare, PseudoDegreeMap, VecMap, VertexIndexMap >::percolate_up(), boost::labeled_graph< Graph *, Label, Selector >::remove_vertex(), boost::mutate_graph_impl< MutableGraph >::set_vertex_property(), transitive_closure(), and vertex().

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::vertex_descriptor boost::vertex ( typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::vertices_size_type  i, const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g  )

inline

References boost::multiprecision::backends::i.

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::vertex_descriptor boost::vertex ( typename adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::vertices_size_type  n, const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &  g  )

inline

References n.

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( vertex_assignment_map , _t)> boost::vertex_assignment_map

(

const PType &

p

)

Referenced by boost::detail::stoer_wagner_min_cut().

template<typename G , typename L , typename S >

labeled_graph<G,L,S>::vertex_descriptor boost::vertex_by_label ( typename labeled_graph< G, L, S >::label_type const  l, labeled_graph< G, L, S > &  g  )

inline

template<typename PType >

bgl_named_params<PType, vertex_color_t> boost::vertex_color_map

(

const PType &

p

)

References color_map().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( vertex_copy , _t)> boost::vertex_copy

(

const PType &

p

)

Referenced by generate_random_graph1().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( vertex_index1 , _t)> boost::vertex_index1_map

(

const PType &

p

)

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( vertex_index2 , _t)> boost::vertex_index2_map

(

const PType &

p

)

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( vertex_index , _t)> boost::vertex_index_map

(

const PType &

p

)

Referenced by betweenness_centrality_clustering(), boost::detail::biconnected_components_impl(), boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::boyer_myrvold_impl(), boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(), find_odd_cycle(), boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), boost::graph::distributed::fleischer_hendrickson_pinar_strong_components_impl(), gursoy_atun_refine(), gursoy_atun_step(), hawick_circuits(), hawick_unique_circuits(), is_bipartite(), metric_tsp_approx_from_vertex(), boost::detail::graph::brandes_dijkstra_shortest_paths< WeightMap >::operator()(), boost::detail::r_c_shortest_paths_dispatch(), successive_shortest_path_nonnegative_weights(), transitive_closure(), and boost::maximum_cardinality_matching_verifier< Graph, MateMap, VertexIndexMap >::verify_matching().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( vertex_invariant , _t)> boost::vertex_invariant

(

const PType &

p

)

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( vertex_invariant1 , _t)> boost::vertex_invariant1

(

const PType &

p

)

Referenced by boost::graph::detail::isomorphism_impl< Graph1, Graph2 >::operator()().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( vertex_invariant2 , _t)> boost::vertex_invariant2

(

const PType &

p

)

Referenced by boost::graph::detail::isomorphism_impl< Graph1, Graph2 >::operator()().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( vertex_max_invariant , _t)> boost::vertex_max_invariant

(

const PType &

p

)

template<typename Graph >

std::vector<typename graph_traits<Graph>::vertex_descriptor> boost::vertex_order_by_mult

(

const Graph &

graph

)

References boost::filesystem::detail::copy(), boost::xpressive::first, boost::locale::period::marks::second, boost::detail::sort_vertices(), vertex_index, and vertices().

Referenced by vf2_graph_iso(), vf2_subgraph_iso(), and vf2_subgraph_mono().

template<class T >

T::ThereReallyIsNoMemberByThisNameInT boost::vertices

(

T const &

)

template<typename V , typename D , typename P , typename B >

std::pair<typename vertex_list_graph_archetype<V,D,P,B>::vertex_iterator, typename vertex_list_graph_archetype<V,D,P,B>::vertex_iterator> boost::vertices

(

const vertex_list_graph_archetype< V, D, P, B > &

)

References boost::xpressive::make_pair.

template<class EdgeList , class Alloc >

std::pair<boost::counting_iterator<typename EdgeList::value_type>, boost::counting_iterator<typename EdgeList::value_type> > boost::vertices

(

const std::vector< EdgeList, Alloc > &

v

)

References boost::xpressive::make_pair.

std::pair<sgb_vertex_iterator,sgb_vertex_iterator> boost::vertices ( sgb_const_graph_ptr  g )

inline

References boost::xpressive::make_pair.

template<class BidirectionalGraph , class GRef >

std::pair<typename reverse_graph<BidirectionalGraph>::vertex_iterator, typename reverse_graph<BidirectionalGraph>::vertex_iterator> boost::vertices

(

const reverse_graph< BidirectionalGraph, GRef > &

g

)

References boost::reverse_graph< BidirectionalGraph, GraphRef >::m_g, and vertices().

template<typename G , typename EP , typename VP >

std::pair<typename filtered_graph<G, EP, VP>::vertex_iterator, typename filtered_graph<G, EP, VP>::vertex_iterator> boost::vertices

(

const filtered_graph< G, EP, VP > &

g

)

References boost::filtered_graph_base< Graph >::m_g, boost::filtered_graph< Graph, EdgePredicate, VertexPredicate >::m_vertex_pred, boost::xpressive::make_pair, boost::detail::vertex_iterator, and vertices().

template<class vtype , class etype >

std::pair< typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_iterator, typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_iterator > boost::vertices ( const leda::GRAPH< vtype, etype > &  g )

inline

References boost::xpressive::make_pair.

template<typename VP , typename EP , typename GP >

std::pair< typename undirected_graph<VP,EP,GP>::vertex_iterator, typename undirected_graph<VP,EP,GP>::vertex_iterator> boost::vertices ( undirected_graph< VP, EP, GP > const &  g )

inline

References vertices().

template<typename VP , typename EP , typename GP >

std::pair< typename directed_graph<VP,EP,GP>::vertex_iterator, typename directed_graph<VP,EP,GP>::vertex_iterator> boost::vertices ( directed_graph< VP, EP, GP > const &  g )

inline

References vertices().

template<typename G >

std::pair<typename subgraph<G>::vertex_iterator, typename subgraph<G>::vertex_iterator> boost::vertices

(

const subgraph< G > &

g

)

References boost::subgraph< Graph >::m_graph, and vertices().

std::pair< graph_traits<leda::graph>::vertex_iterator, graph_traits<leda::graph>::vertex_iterator > boost::vertices ( const leda::graph &  g )

inline

References boost::xpressive::make_pair.

template<typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename ProcessGroup , typename InVertex , typename InDistribution , typename InEdgeIndex >

std::pair<typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::vertex_iterator, typename compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS<ProcessGroup, InVertex, InDistribution>, InEdgeIndex>::vertex_iterator> boost::vertices ( const compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex > &  g )

inline

References boost::xpressive::make_pair, num_vertices(), and boost::detail::vertex_iterator.

template<typename G , typename L , typename S >

std::pair< typename labeled_graph<G,L,S>::vertex_iterator, typename labeled_graph<G,L,S>::vertex_iterator> boost::vertices ( labeled_graph< G, L, S > const &  g )

inline

References vertices().

template<typename D , typename VP , typename EP , typename GP , typename A >

std::pair<typename adjacency_matrix<D,VP,EP,GP,A>::vertex_iterator, typename adjacency_matrix<D,VP,EP,GP,A>::vertex_iterator> boost::vertices

(

const adjacency_matrix< D, VP, EP, GP, A > &

g_

)

References boost::xpressive::make_pair.

Referenced by add_vertex(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::adjacency_list(), all_closeness_centralities(), all_clustering_coefficients(), all_degree_centralities(), all_eccentricities(), all_mean_geodesics(), boost::detail::copy_graph_impl< 0 >::apply(), boost::detail::copy_graph_impl< 1 >::apply(), boost::detail::copy_graph_impl< 2 >::apply(), boost::graph::detail::mas_dispatch< WeightMap >::apply(), boost::graph::detail::mas_dispatch< boost::param_not_found >::apply(), astar_search(), astar_search_tree(), boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::augment_matching(), aver_wavefront(), boost::detail::bellman_dispatch2(), boost::detail::bk_max_flow< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap >::bk_max_flow(), boost::concepts::BOOST_concept(), boost::TSPVertexVisitorConcept< Visitor, Graph >::BOOST_CONCEPT_USAGE(), boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::boyer_myrvold_impl(), boost::detail::graph::brandes_betweenness_centrality_impl(), breadth_first_search(), bron_kerbosch_all_cliques(), build_component_lists(), boost::hawick_circuits_detail::call_hawick_circuits(), central_point_dominance(), chrobak_payne_straight_line_drawing(), clear_vertex(), boost::detail::graph::compute_edge_length(), boost::detail::compute_in_degree_map(), boost::DistributedVertexListGraphConcept< G >::const_constraints(), boost::DistributedVertexListGraphConcept< G >::constraints(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::convert_preflow_to_flow(), boost::detail::core_numbers_dispatch(), boost::detail::core_numbers_impl(), cuthill_mckee_ordering(), dag_shortest_paths(), depth_first_search(), dijkstra_shortest_paths(), edge_connectivity(), boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::edmonds_augmenting_path_finder(), edmonds_karp_max_flow(), boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::extract_kuratowski_subgraph(), boost::greedy_matching< Graph, MateMap >::find_matching(), boost::extra_greedy_matching< Graph, MateMap >::find_matching(), boost::empty_matching< Graph, MateMap >::find_matching(), find_odd_cycle(), floyd_warshall_all_pairs_shortest_paths(), boost::detail::floyd_warshall_dispatch(), fruchterman_reingold_force_directed_layout(), boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::get_current_matching(), boost::detail::get_default_starting_vertex(), boost::detail::get_property_iter_range_kind(), boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::get_vertex_state_map(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::global_distance_update(), gursoy_atun_layout(), gursoy_atun_step(), in_vertex_set(), initialize_incremental_components(), is_a_matching(), is_connected(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::is_flow(), is_kuratowski_subgraph(), iterative_bit_vector_dominator_tree(), ith_wavefront(), johnson_all_pairs_shortest_paths(), king_ordering(), kosaraju_strong_components(), boost::detail::kruskal_mst_impl(), boost::labeled_graph< Graph, Label, Selector >::labeled_graph(), make_connected(), boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::make_edge_permutation(), boost::detail::make_K_3_3(), boost::detail::make_K_5(), boost::detail::match(), matching_size(), max_wavefront(), boost::detail::mcgregor_common_subgraphs_internal(), mean_clustering_coefficient(), metric_tsp_approx(), metric_tsp_approx_from_vertex(), metric_tsp_approx_tour(), boost::detail::min_degree_vertex(), boost::detail::mmd_impl< Graph, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, VertexIndexMap >::mmd_impl(), boost::detail::neighbor_bfs_helper(), boost::all_force_pairs::operator()(), boost::grid_force_pairs< Topology, PositionMap >::operator()(), planar_canonical_ordering(), planar_face_traversal(), prim_minimum_spanning_tree(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::print_flow_values(), print_graph_dispatch(), print_in_edges(), print_vertices(), profile(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::push_relabel(), radius_and_diameter(), random_vertex(), boost::detail::randomize_property(), relative_betweenness_centrality(), boost::undirected_graph< VertexProp, EdgeProp, GraphProp >::remove_vertex_and_renumber_indices(), boost::directed_graph< VertexProp, EdgeProp, GraphProp >::remove_vertex_and_renumber_indices(), boost::undirected_graph< VertexProp, EdgeProp, GraphProp >::renumber_vertex_indices(), boost::directed_graph< VertexProp, EdgeProp, GraphProp >::renumber_vertex_indices(), rms_wavefront(), boost::detail::graph::kamada_kawai_spring_layout_impl< Topology, Graph, PositionMap, WeightMap, EdgeOrSideLength, Done, VertexIndexMap, DistanceMatrix, SpringStrengthMatrix, PartialDerivativeMap >::run(), scale_graph(), sequential_vertex_coloring(), sloan_ordering(), sloan_start_end_vertices(), smallest_last_vertex_ordering(), boost::detail::stoer_wagner_min_cut(), boost::subgraph< Graph >::subgraph(), boost::graph_test< Graph >::test_readable_vertex_property_graph(), boost::graph_test< Graph >::test_vertex_list_graph(), boost::graph_test< Graph >::test_vertex_property_graph(), tiernan_all_cycles(), transitive_closure(), boost::triangulation_visitor< Graph, VertexIndexMap, AddEdgeVisitor >::triangulation_visitor(), undirected_dfs(), boost::maximum_cardinality_matching_verifier< Graph, MateMap, VertexIndexMap >::verify_matching(), boost::graph::vertex_list_adaptor< Graph, GlobalIndexMap >::vertex_list_adaptor(), vertex_order_by_mult(), vertices(), warren_transitive_closure(), warshall_transitive_closure(), write_graphml(), write_graphviz(), and boost::detail::write_graphviz_subgraph().

template<typename Directed , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename Vertex , typename EdgeIndex >

std::pair<counting_iterator<Vertex>, counting_iterator<Vertex> > boost::vertices ( const compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > &  g )

inline

References boost::xpressive::make_pair, and num_vertices().

template<typename OutEdgeListS , typename ProcessGroup , typename InVertexListS , typename InDistribution , typename DirectedS , typename VertexProperty , typename EdgeProperty , typename GraphProperty , typename EdgeListS >

std::pair<typename adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::vertex_iterator, typename adjacency_list<OutEdgeListS, distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::vertex_iterator> boost::vertices

(

const adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS > &

g

)

Returns the set of vertices local to this processor.

Note that although this routine matches a valid expression of a VertexListGraph, it does not meet the semantic requirements of VertexListGraph because it returns only local vertices (not all vertices).

References boost::xpressive::make_pair, boost::iterators::make_transform_iterator(), boost::locale::period::marks::second, Vertex, and vertices().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( vertices_equivalent , _t)> boost::vertices_equivalent

(

const PType &

p

)

Referenced by boost::detail::can_extend_graph(), and boost::detail::mcgregor_common_subgraphs_internal().

template<typename Graph1 , typename Graph2 , typename IndexMap1 , typename IndexMap2 , typename VertexOrder1 , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename GraphIsoMapCallback >

bool boost::vf2_graph_iso	(	const Graph1 &	graph1,
		const Graph2 &	graph2,
		GraphIsoMapCallback	user_callback,
		IndexMap1	index_map1,
		IndexMap2	index_map2,
		const VertexOrder1 &	vertex_order1,
		EdgeEquivalencePredicate	edge_comp,
		VertexEquivalencePredicate	vertex_comp
	)

References BOOST_ASSERT, BOOST_CONCEPT_ASSERT(), BOOST_STATIC_ASSERT(), is_undirected(), boost::detail::isomorphism, boost::detail::match(), num_edges(), num_vertices(), boost::asio::s, and boost::program_options::value().

Referenced by vf2_graph_iso().

template<typename Graph1 , typename Graph2 , typename GraphIsoMapCallback >

bool boost::vf2_graph_iso	(	const Graph1 &	graph1,
		const Graph2 &	graph2,
		GraphIsoMapCallback	user_callback
	)

References vertex_index, vertex_order_by_mult(), and vf2_graph_iso().

template<typename Graph1 , typename Graph2 , typename VertexOrder1 , typename GraphIsoMapCallback , typename Param , typename Tag , typename Rest >

bool boost::vf2_graph_iso	(	const Graph1 &	graph1,
		const Graph2 &	graph2,
		GraphIsoMapCallback	user_callback,
		const VertexOrder1 &	vertex_order1,
		const bgl_named_params< Param, Tag, Rest > &	params
	)

References choose_const_pmap(), choose_param(), get_param(), vertex_index, vertex_index1, vertex_index2, and vf2_graph_iso().

template<typename GraphSmall , typename GraphLarge , typename IndexMapSmall , typename IndexMapLarge , typename VertexOrderSmall , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename SubGraphIsoMapCallback >

bool boost::vf2_subgraph_iso	(	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
	)

Referenced by vf2_subgraph_iso().

template<typename GraphSmall , typename GraphLarge , typename SubGraphIsoMapCallback >

bool boost::vf2_subgraph_iso	(	const GraphSmall &	graph_small,
		const GraphLarge &	graph_large,
		SubGraphIsoMapCallback	user_callback
	)

References vertex_index, vertex_order_by_mult(), and vf2_subgraph_iso().

template<typename GraphSmall , typename GraphLarge , typename VertexOrderSmall , typename SubGraphIsoMapCallback , typename Param , typename Tag , typename Rest >

bool boost::vf2_subgraph_iso	(	const GraphSmall &	graph_small,
		const GraphLarge &	graph_large,
		SubGraphIsoMapCallback	user_callback,
		const VertexOrderSmall &	vertex_order_small,
		const bgl_named_params< Param, Tag, Rest > &	params
	)

References choose_const_pmap(), choose_param(), get_param(), vertex_index, vertex_index1, vertex_index2, and vf2_subgraph_iso().

template<typename GraphSmall , typename GraphLarge , typename IndexMapSmall , typename IndexMapLarge , typename VertexOrderSmall , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename SubGraphIsoMapCallback >

bool boost::vf2_subgraph_mono	(	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
	)

Referenced by vf2_subgraph_mono().

template<typename GraphSmall , typename GraphLarge , typename SubGraphIsoMapCallback >

bool boost::vf2_subgraph_mono	(	const GraphSmall &	graph_small,
		const GraphLarge &	graph_large,
		SubGraphIsoMapCallback	user_callback
	)

References vertex_index, vertex_order_by_mult(), and vf2_subgraph_mono().

template<typename GraphSmall , typename GraphLarge , typename VertexOrderSmall , typename SubGraphIsoMapCallback , typename Param , typename Tag , typename Rest >

bool boost::vf2_subgraph_mono	(	const GraphSmall &	graph_small,
		const GraphLarge &	graph_large,
		SubGraphIsoMapCallback	user_callback,
		const VertexOrderSmall &	vertex_order_small,
		const bgl_named_params< Param, Tag, Rest > &	params
	)

References choose_const_pmap(), choose_param(), get_param(), vertex_index, vertex_index1, vertex_index2, and vf2_subgraph_mono().

template<typename T , typename VisitorT >

visitation_result boost::visit ( attribute_name const &  name, attribute_value_set const &  attrs, VisitorT  visitor  )

inline

The function applies a visitor to an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be visited.

Parameters

name	The name of the attribute value to visit.
attrs	A set of attribute values in which to look for the specified attribute value.
visitor	A receiving function object to pass the attribute value to.

Returns

The result of visitation.

Referenced by boost::accumulators::accumulator_set< Sample, Features, Weight >::operator()(), and boost::graph::distributed::detail::parallel_dfs< DistributedGraph, ColorMap, ParentMap, ExploreMap, VertexIndexMap, DFSVisitor >::run().

template<typename T , typename VisitorT >

visitation_result boost::visit ( attribute_name const &  name, record const &  rec, VisitorT  visitor  )

inline

The function applies a visitor to an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be visited.

Parameters

name	The name of the attribute value to visit.
rec	A log record. The attribute value will be sought among those associated with the record.
visitor	A receiving function object to pass the attribute value to.

Returns

The result of visitation.

template<typename T , typename VisitorT >

visitation_result boost::visit ( attribute_name const &  name, record_view const &  rec, VisitorT  visitor  )

inline

The function applies a visitor to an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be visited.

Parameters

name	The name of the attribute value to visit.
rec	A log record view. The attribute value will be sought among those associated with the record.
visitor	A receiving function object to pass the attribute value to.

Returns

The result of visitation.

template<typename T , typename VisitorT >

visitation_result boost::visit ( attribute_value const &  value, VisitorT  visitor  )

inline

The function applies a visitor to an attribute value.

The user has to explicitly specify the type or set of possible types of the attribute value to be visited.

Parameters

value	The attribute value to visit.
visitor	A receiving function object to pass the attribute value to.

Returns

The result of visitation.

template<typename DescriptorT , template< typename > class ActorT, typename VisitorT >

visitation_result boost::visit ( expressions::attribute_keyword< DescriptorT, ActorT > const &  keyword, attribute_value_set const &  attrs, VisitorT  visitor  )

inline

The function applies a visitor to an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be visited.

Parameters

keyword	The keyword of the attribute value to visit.
attrs	A set of attribute values in which to look for the specified attribute value.
visitor	A receiving function object to pass the attribute value to.

Returns

The result of visitation.

References boost::expressions::attribute_keyword< DescriptorT, ActorT >::get_name(), and visitor().

template<typename DescriptorT , template< typename > class ActorT, typename VisitorT >

visitation_result boost::visit ( expressions::attribute_keyword< DescriptorT, ActorT > const &  keyword, record const &  rec, VisitorT  visitor  )

inline

The function applies a visitor to an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be visited.

Parameters

keyword	The keyword of the attribute value to visit.
rec	A log record. The attribute value will be sought among those associated with the record.
visitor	A receiving function object to pass the attribute value to.

Returns

The result of visitation.

References boost::expressions::attribute_keyword< DescriptorT, ActorT >::get_name(), and visitor().

template<typename DescriptorT , template< typename > class ActorT, typename VisitorT >

visitation_result boost::visit ( expressions::attribute_keyword< DescriptorT, ActorT > const &  keyword, record_view const &  rec, VisitorT  visitor  )

inline

The function applies a visitor to an attribute value from the view.

The user has to explicitly specify the type or set of possible types of the attribute value to be visited.

Parameters

keyword	The keyword of the attribute value to visit.
rec	A log record view. The attribute value will be sought among those associated with the record.
visitor	A receiving function object to pass the attribute value to.

Returns

The result of visitation.

References boost::expressions::attribute_keyword< DescriptorT, ActorT >::get_name(), and visitor().

template<typename Visitor , typename T >

void boost::visit_each ( Visitor &  visitor, const T &  t, long    )

inline

References visitor().

Referenced by accept(), boost::phoenix::detail::visit_each_impl< Visitor >::operator()(), boost::slot< SlotFunction >::slot(), visit_each(), and boost::_bi::visit_each().

template<typename Visitor , typename T >

void boost::visit_each ( Visitor &  visitor, const T &  t  )

inline

References visit_each().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( graph_visitor , _t)> boost::visitor

(

const PType &

p

)

Referenced by boost::geometry::resolve_variant::crosses< variant< BOOST_VARIANT_ENUM_PARAMS(T)>, Geometry2 >::apply(), boost::geometry::resolve_variant::num_interior_rings< boost::variant< BOOST_VARIANT_ENUM_PARAMS(T)> >::apply(), boost::geometry::resolve_variant::num_geometries< boost::variant< BOOST_VARIANT_ENUM_PARAMS(T)> >::apply(), boost::geometry::resolve_variant::crosses< Geometry1, variant< BOOST_VARIANT_ENUM_PARAMS(T)> >::apply(), boost::geometry::resolve_variant::reverse< boost::variant< BOOST_VARIANT_ENUM_PARAMS(T)> >::apply(), boost::geometry::resolve_variant::clear< variant< BOOST_VARIANT_ENUM_PARAMS(T)> >::apply(), boost::geometry::resolve_variant::crosses< variant< BOOST_VARIANT_ENUM_PARAMS(A)>, variant< BOOST_VARIANT_ENUM_PARAMS(B)> >::apply(), boost::geometry::resolve_variant::remove_spikes< boost::variant< BOOST_VARIANT_ENUM_PARAMS(T)> >::apply(), boost::geometry::resolve_variant::assign< variant< BOOST_VARIANT_ENUM_PARAMS(T)>, Geometry2 >::apply(), boost::geometry::resolve_variant::correct< boost::variant< BOOST_VARIANT_ENUM_PARAMS(T)> >::apply(), boost::geometry::resolve_variant::assign< Geometry1, variant< BOOST_VARIANT_ENUM_PARAMS(T)> >::apply(), boost::geometry::resolve_variant::assign< variant< BOOST_VARIANT_ENUM_PARAMS(A)>, variant< BOOST_VARIANT_ENUM_PARAMS(B)> >::apply(), boost::geometry::resolve_variant::equals< boost::variant< BOOST_VARIANT_ENUM_PARAMS(T)>, Geometry2 >::apply(), boost::geometry::resolve_variant::equals< Geometry1, boost::variant< BOOST_VARIANT_ENUM_PARAMS(T)> >::apply(), boost::geometry::resolve_variant::touches< boost::variant< BOOST_VARIANT_ENUM_PARAMS(T)>, Geometry2 >::apply(), boost::geometry::resolve_variant::variant< BOOST_VARIANT_ENUM_PARAMS(T2)>>::apply(), boost::geometry::resolve_variant::touches< Geometry1, boost::variant< BOOST_VARIANT_ENUM_PARAMS(T)> >::apply(), boost::geometry::resolve_variant::touches< boost::variant< BOOST_VARIANT_ENUM_PARAMS(T1)>, boost::variant< BOOST_VARIANT_ENUM_PARAMS(T2)> >::apply(), boost::geometry::resolve_variant::convert< boost::variant< BOOST_VARIANT_ENUM_PARAMS(T)>, Geometry2 >::apply(), boost::geometry::resolve_variant::self_touches< boost::variant< BOOST_VARIANT_ENUM_PARAMS(T)> >::apply(), boost::aux::singular_ref< T, TagT >::apply_visitor(), boost::aux::singular_ref< T, TagT >::apply_visitor_optional(), boost::aux::singular_ref< T, TagT >::apply_visitor_or_default(), boost::detail::biconnected_components_impl(), boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::boyer_myrvold_impl(), boost::hawick_circuits_detail::call_hawick_circuits(), connected_components(), cycle_canceling(), find_odd_cycle(), boost::graph_as_tree< Graph, ParentMap, Node, ChIt >::graph_as_tree(), is_bipartite(), lengauer_tarjan_dominator_tree_without_dfs(), make_maximal_planar(), boost::detail::variant::make_two_variables_holder(), boost::detail::graph::brandes_dijkstra_shortest_paths< WeightMap >::operator()(), boost::value_visitor_invoker< channel_value_type, channel_fallback_policy >::operator()(), boost::detail::graph::brandes_unweighted_shortest_paths::operator()(), boost::sinks::basic_custom_mapping< event_category, AttributeValueT >::operator()(), boost::variant< BOOST_PP_ENUM_PARAMS(BOOST_MPL_LIMIT_LIST_SIZE, T)>::operator<(), boost::variant< BOOST_PP_ENUM_PARAMS(BOOST_MPL_LIMIT_LIST_SIZE, T)>::operator==(), boost::detail::gursoy_shortest< EdgeWeightMap >::run(), boost::detail::gursoy_shortest< dummy_property_map >::run(), boost::serialization::save(), sloan_ordering(), sloan_start_end_vertices(), boost::detail::stoer_wagner_min_cut(), successive_shortest_path_nonnegative_weights(), boost::variant< BOOST_PP_ENUM_PARAMS(BOOST_MPL_LIMIT_LIST_SIZE, T)>::swap(), boost::type_dispatcher::callback_base::trampoline(), boost::variant< BOOST_PP_ENUM_PARAMS(BOOST_MPL_LIMIT_LIST_SIZE, T)>::type(), boost::variant< BOOST_PP_ENUM_PARAMS(BOOST_MPL_LIMIT_LIST_SIZE, T)>::variant(), boost::maximum_cardinality_matching_verifier< Graph, MateMap, VertexIndexMap >::verify_matching(), visit(), boost::attribute_value::visit(), visit_each(), and visitor_ptr().

template<typename R , typename T >

visitor_ptr_t<T,R> boost::visitor_ptr ( R(*)(T)  visitor )

inline

References visitor().

template<typename Iterator >

boost::disable_if<is_future_type<Iterator>,void>::type boost::wait_for_all	(	Iterator	begin,
		Iterator	end
	)

References current, and end.

template<typename F1 , typename... Fs>

void boost::wait_for_all	(	F1 &	f1,
		Fs &...	fs
	)

References boost::detail::void.

template<typename Iterator >

boost::disable_if<is_future_type<Iterator>,Iterator>::type boost::wait_for_any	(	Iterator	begin,
		Iterator	end
	)

References boost::detail::future_waiter::add(), current, end, next(), and boost::detail::future_waiter::wait().

template<typename F1 , typename... Fs>

boost::enable_if<is_future_type<F1>, unsigned>::type boost::wait_for_any	(	F1 &	f1,
		Fs &...	fs
	)

References boost::detail::future_waiter::add(), and boost::detail::future_waiter::wait().

template<typename G >

void boost::warren_transitive_closure

(

G &

g

)

References add_edge(), BOOST_CONCEPT_ASSERT(), edge(), num_vertices(), boost::locale::period::marks::second, boost::detail::vertex_iterator, and vertices().

template<typename G >

void boost::warshall_transitive_closure

(

G &

g

)

References add_edge(), BOOST_CONCEPT_ASSERT(), edge(), boost::locale::period::marks::second, boost::detail::vertex_iterator, and vertices().

template<typename T >

boost::weak_ptr< T > boost::weak_from_raw

(

T *

p

)

References boost::weak_ptr< T >::_internal_aliasing_assign(), and BOOST_ASSERT.

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( edge_weight , _t)> boost::weight_map

(

const PType &

p

)

Referenced by astar_search(), astar_search_no_init(), astar_search_no_init_tree(), astar_search_tree(), brandes_betweenness_centrality(), boost::graph::parallel::detail::brandes_betweenness_centrality_dispatch2(), cycle_canceling(), boost::detail::dijkstra_no_color_map_dispatch1(), metric_tsp_approx_from_vertex(), boost::detail::graph::brandes_dijkstra_shortest_paths< WeightMap >::operator()(), prim_minimum_spanning_tree(), boost::detail::gursoy_shortest< EdgeWeightMap >::run(), boost::detail::stoer_wagner_min_cut(), and successive_shortest_path_nonnegative_weights().

template<typename PType >

bgl_named_params<PType, BOOST_PP_CAT( edge_weight2 , _t)> boost::weight_map2

(

const PType &

p

)

template<typename Graph , typename CoreMap >

property_traits<CoreMap>::value_type boost::weighted_core_numbers	(	Graph &	g,
		CoreMap	c
	)

References make_core_numbers_visitor().

template<typename Graph , typename CoreMap , typename CoreNumVisitor >

property_traits<CoreMap>::value_type boost::weighted_core_numbers	(	Graph &	g,
		CoreMap	c,
		CoreNumVisitor	vis
	)

References core_numbers(), edge_weight, and vertex_index.

template<typename Graph , typename WeightMap , typename RandomNumGen >

graph_traits<Graph>::edge_descriptor boost::weighted_random_out_edge	(	Graph &	g,
		typename graph_traits< Graph >::vertex_descriptor	src,
		WeightMap	weight,
		RandomNumGen &	gen
	)

References BGL_FORALL_OUTEDGES_T, BOOST_ASSERT, and boost::polygon::ur().

Referenced by boost::weighted_random_out_edge_gen< Graph, WeightMap, Gen >::operator()().

boost::while

(

!iG_buf.

empty()

)

Referenced by boost::relaxed_heap< vertex_descriptor, queue_compare_type, VertexIndexMap >::relaxed_heap().

boost::while

(

!vG_buf.

empty()

)

default_color_type boost::white ( default_color_type  )

inline

References white_color.

Referenced by boost::detail::copy_graph_impl< 2 >::apply(), astar_search(), breadth_first_search(), breadth_first_visit(), cuthill_mckee_ordering(), depth_first_search(), boost::detail::depth_first_visit_impl(), dijkstra_shortest_paths(), edge_connectivity(), edmonds_karp_max_flow(), is_connected(), king_ordering(), kosaraju_strong_components(), loop_erased_random_walk(), boost::detail::neighbor_bfs_helper(), boost::detail::neighbor_bfs_impl(), boost::detail::darken_and_push< ColorMap >::operator()(), boost::property_reduce< vertex_color_t >::apply< Color >::operator()(), boost::detail::random_spanning_tree_internal(), sloan_ordering(), boost::graph::st_connected(), boost::graph::distributed::st_connected(), boost::detail::isomorphism_algo< Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2 >::test_isomorphism(), boost::detail::undir_dfv_impl(), and undirected_dfs().

template<class Lockable , class Function , class... Args>

boost::result_of<Function(Args...)>::type boost::with_lock_guard	(	Lockable &	m,
		BOOST_FWD_REF(Function)	func,
		BOOST_FWD_REF(Args)...	args
	)

Utility to run functions in scope protected by mutex.

Examples:

int func(int, int&);
boost::mutex m;
int a;
int result = boost::with_lock_guard(m, func, 1, boost::ref(a));

// using boost::bind
int result = boost::with_lock_guard(
    m, boost::bind(func, 2, boost::ref(a))
);

// using lambda
int a;
int result = boost::with_lock_guard(
    m,
    [&a](int x) {
      a = 3;
      return x + 4;
    },
    5
);

References func, and lock().

template<class Iterator , class T >

void boost::writable_iterator_test	(	Iterator	i,
		T	v,
		T	v2
	)

References boost::foreach_detail_::and_(), and writable_iterator_traversal_test().

template<class Iterator , class T >

void boost::writable_iterator_traversal_test	(	Iterator	i1,
		T	v,
		mpl::true_
	)

References boost::detail::void, and boost::flyweights::x.

Referenced by writable_iterator_test().

template<class Iterator , class T >

void boost::writable_iterator_traversal_test	(	const Iterator	i1,
		T	v,
		mpl::false_
	)

template<class EL , class VL , class D , class VP , class EP , class GP , class VPS , class EPS >

GraphPrinter<adjacency_list<EL,VL,D,VP,EP,GP>,VPS,EPS> boost::write	(	const adjacency_list< EL, VL, D, VP, EP, GP > &	g,
		VPS	,
		EPS
	)

write the graph with given property subsets

template<class EL , class VL , class D , class VP , class EP , class GP >

GraphPrinter<adjacency_list<EL,VL,D,VP,EP,GP>,VP,EP> boost::write

(

const adjacency_list< EL, VL, D, VP, EP, GP > &

g

)

write the graph with all internal vertex and edge properties

template<typename Attributes >

void boost::write_all_attributes ( Attributes  attributes, const std::string &  name, std::ostream &  out  )

inline

References end, boost::multiprecision::backends::i, and write_attributes().

Referenced by boost::graph_attributes_writer< GraphGraphAttributes, GraphNodeAttributes, GraphEdgeAttributes >::operator()().

void boost::write_all_attributes ( detail::error_property_not_found  , const std::string &  , std::ostream &    )

inline

template<class Attribute >

void boost::write_attributes ( const Attribute &  attr, std::ostream &  out  )

inline

References escape_dot_string(), and boost::multiprecision::backends::i.

Referenced by write_all_attributes().

template<class Graph , class CapacityMap , class IndexMap >

void boost::write_dimacs_max_flow	(	const Graph &	g,
		CapacityMap	capacity,
		IndexMap	idx,
		typename graph_traits< Graph >::vertex_descriptor	src,
		typename graph_traits< Graph >::vertex_descriptor	sink,
		std::ostream &	out
	)

References edges(), num_edges(), num_vertices(), source(), and target().

template<typename Graph , typename VertexIndexMap >

void boost::write_graphml	(	std::ostream &	out,
		const Graph &	g,
		VertexIndexMap	vertex_index,
		const dynamic_properties &	dp,
		bool	ordered_vertices = false
	)

References boost::dynamic_properties::begin(), BOOST_STATIC_CONSTANT(), edges(), boost::dynamic_properties::end(), boost::multiprecision::backends::i, lexical_cast(), source(), target(), boost::program_options::value(), vertex_index, boost::detail::vertex_iterator, and vertices().

Referenced by write_graphml().

template<typename Graph >

void boost::write_graphml	(	std::ostream &	out,
		const Graph &	g,
		const dynamic_properties &	dp,
		bool	ordered_vertices = false
	)

References vertex_index, and write_graphml().

template<typename Graph , typename VertexPropertiesWriter , typename EdgePropertiesWriter , typename GraphPropertiesWriter >

void boost::write_graphviz	(	std::ostream &	out,
		const Graph &	g,
		VertexPropertiesWriter	vpw,
		EdgePropertiesWriter	epw,
		GraphPropertiesWriter gpw	BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, distributed_graph_tag
	)

References boost::proto::envns_::data, edges(), boost::multiprecision::backends::i, is_undirected(), boost::python::len(), boost::graph::distributed::num_processes(), num_vertices(), boost::graph::parallel::process_group(), process_group(), process_id, boost::graph::distributed::receive(), boost::graph::distributed::send(), source(), synchronize(), target(), boost::program_options::value(), vertex_global, vertex_index, and vertices().

Referenced by write_graphviz(), and write_graphviz_dp().

template<typename Graph , typename VertexPropertiesWriter , typename EdgePropertiesWriter >

void boost::write_graphviz ( std::ostream &  out, const Graph &  g, VertexPropertiesWriter  vpw, EdgePropertiesWriter epw   BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, distributed_graph_tag  )

inline

References write_graphviz().

template<typename Graph , typename VertexPropertiesWriter >

void boost::write_graphviz ( std::ostream &  out, const Graph &  g, VertexPropertiesWriter vpw   BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, distributed_graph_tag  )

inline

References write_graphviz().

template<typename Graph >

void boost::write_graphviz ( std::ostream &  out, const Graph &g   BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, distributed_graph_tag  )

inline

References write_graphviz().

template<typename Graph , typename VertexPropertiesWriter , typename EdgePropertiesWriter , typename GraphPropertiesWriter >

void boost::write_graphviz	(	const std::string &	filename,
		const Graph &	g,
		VertexPropertiesWriter	vpw,
		EdgePropertiesWriter	epw,
		GraphPropertiesWriter gpw	BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, distributed_graph_tag
	)

References out, process_id, and write_graphviz().

template<typename Graph , typename VertexPropertiesWriter , typename EdgePropertiesWriter >

void boost::write_graphviz	(	const std::string &	filename,
		const Graph &	g,
		VertexPropertiesWriter	vpw,
		EdgePropertiesWriter epw	BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, distributed_graph_tag
	)

References out, process_id, and write_graphviz().

template<typename Graph , typename VertexPropertiesWriter , typename EdgePropertiesWriter , typename GraphPropertiesWriter , typename VertexID >

void boost::write_graphviz ( std::ostream &  out, const Graph &  g, VertexPropertiesWriter  vpw, EdgePropertiesWriter  epw, GraphPropertiesWriter  gpw, VertexID vertex_id   BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, vertex_list_graph_tag  )

inline

References BOOST_CONCEPT_ASSERT(), edges(), end, escape_dot_string(), boost::multiprecision::backends::i, boost::iostreams::gzip::flags::name, source(), target(), and vertices().

template<typename Graph , typename VertexPropertiesWriter >

void boost::write_graphviz	(	const std::string &	filename,
		const Graph &	g,
		VertexPropertiesWriter vpw	BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, distributed_graph_tag
	)

References out, process_id, and write_graphviz().

template<typename Graph >

void boost::write_graphviz	(	const std::string &	filename,
		const Graph &g	BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, distributed_graph_tag
	)

References out, process_id, and write_graphviz().

template<typename Graph >

void boost::write_graphviz	(	std::ostream &	out,
		const Graph &	g,
		const dynamic_properties &	dp,
		const std::string &	node_id = "node_id" BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph,distributed_graph_tag)
	)

References write_graphviz().

template<typename Graph , typename VertexPropertiesWriter , typename EdgePropertiesWriter , typename GraphPropertiesWriter >

void boost::write_graphviz ( std::ostream &  out, const Graph &  g, VertexPropertiesWriter  vpw, EdgePropertiesWriter  epw, GraphPropertiesWriter gpw   BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, vertex_list_graph_tag  )

inline

References vertex_index, and write_graphviz().

template<typename Graph >

void boost::write_graphviz ( std::ostream &  out, const Graph &g   BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, vertex_list_graph_tag  )

inline

References write_graphviz().

template<typename Graph , typename VertexWriter >

void boost::write_graphviz ( std::ostream &  out, const Graph &  g, VertexWriter vw   BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, vertex_list_graph_tag  )

inline

References write_graphviz().

template<typename Graph , typename VertexWriter , typename EdgeWriter >

void boost::write_graphviz ( std::ostream &  out, const Graph &  g, VertexWriter  vw, EdgeWriter ew   BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, vertex_list_graph_tag  )

inline

References write_graphviz().

template<typename Graph >

void boost::write_graphviz	(	std::ostream &	out,
		const subgraph< Graph > &	g
	)

References num_edges(), num_vertices(), vertex_index, and boost::detail::write_graphviz_subgraph().

template<typename Graph >

void boost::write_graphviz	(	const std::string &	filename,
		const subgraph< Graph > &	g
	)

References num_edges(), num_vertices(), out, vertex_index, and boost::detail::write_graphviz_subgraph().

template<typename Graph , typename VertexID >

void boost::write_graphviz	(	std::ostream &	out,
		const subgraph< Graph > &	g,
		VertexID	vertex_id
	)

References num_edges(), num_vertices(), and boost::detail::write_graphviz_subgraph().

template<typename Graph , typename VertexID >

void boost::write_graphviz	(	const std::string &	filename,
		const subgraph< Graph > &	g,
		VertexID	vertex_id
	)

References num_edges(), num_vertices(), out, and boost::detail::write_graphviz_subgraph().

template<typename Graph >

void boost::write_graphviz_dp ( std::ostream &  out, const Graph &  g, const dynamic_properties &  dp, const std::string &  node_id = "node_id" BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph,vertex_list_graph_tag)  )

inline

References Vertex.

template<typename Graph , typename VertexID >

void boost::write_graphviz_dp	(	std::ostream &	out,
		const Graph &	g,
		const dynamic_properties &	dp,
		const std::string &	node_id,
		VertexID id	BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, vertex_list_graph_tag
	)

References write_graphviz().

template<class PA , class OutputIterator , class Tag >

property_writer<PA, OutputIterator, Tag> boost::write_property	(	PA	pa,
		OutputIterator	out,
		Tag
	)

References out, and boost::multiprecision::backends::pa.

Variable Documentation

Allocator Allocator boost::a

Referenced by boost::math::acos(), boost::multiprecision::add(), boost::graph::distributed::cc_ps_detail::collision_map< component_value_type >::add(), boost::alignment::aligned_allocator_adaptor< Allocator, Alignment >::allocate(), boost::math::non_central_beta_distribution< T, Policy >::alpha(), boost::detail::dominator_visitor< Graph, IndexMap, TimeMap, PredMap, DomTreePredMap >::ancestor_with_lowest_semi_(), boost::geometry::detail::robust_policy< FpPoint, IntPoint, CalculationType >::apply(), boost::geometry::strategy::buffer::point_circle::apply(), boost::geometry::strategy::intersection::relate_cartesian_segments< Policy, CalculationType >::apply(), boost::geometry::strategy::area::huiller< PointOfSegment, CalculationType >::apply(), boost::geometry::strategy::distance::haversine< identity< T > >::apply(), boost::numeric::ublas::array_adaptor< T >::array_adaptor(), boost::xpressive::as(), boost::math::asin(), boost::geometry::fraction_type< SegmentRatio >::assign(), boost::basic_regex< Ch, Tr >::assign(), boost::numeric::ublas::bounded_array< T, M *N >::assign_temporary(), boost::numeric::ublas::array_adaptor< T >::assign_temporary(), boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::augment_matching(), boost::foreach_detail_::auto_any_cast(), boost::basic_regex< Ch, Tr >::basic_regex(), boost::re_detail::basic_regex_creator< charT, traits >::basic_regex_creator(), boost::math::detail::beta_imp(), BOOST_concept(), boost::BOOST_SIGNALS_NAMESPACE::detail::BOOST_JOIN(), boost::detail::function::BOOST_JOIN(), boost::math::detail::BOOST_NO_MACRO_EXPAND(), BOOST_PHOENIX_DEFINE_EXPRESSION(), boost::ball_topology< 3, RandomNumberGenerator >::bound(), boost::math::tools::detail::bracket(), boost::math::tools::bracket_and_solve_root(), boost::math::detail::bracket_and_solve_root_01(), boost::lambda::case_statement(), boost::lambda::catch_all(), boost::lambda::catch_exception(), boost::math::cdf(), boost::spirit::x3::changesign(), boost::math::detail::changesign_impl(), boost::python::map_indexing_suite< Container, NoProxy, final_map_derived_policies< Container, NoProxy > >::compare_index(), boost::spirit::type_of::action_concatenator< nop_functor, Action >::concatenate(), boost::spirit::type_of::action_concatenator< Action, nop_functor >::concatenate(), boost::xpressive::const_cast_(), boost::math::tools::continued_fraction_a(), boost::math::tools::continued_fraction_b(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::convert_preflow_to_flow(), boost::math::tools::detail::cubic_interpolate(), boost::date_time::gregorian_calendar_base< ymd_type_, date_int_type_ >::day_number(), boost::date_time::gregorian_calendar_base< ymd_type_, date_int_type_ >::day_of_week(), boost::alignment::aligned_allocator_adaptor< Allocator, Alignment >::deallocate(), boost::lambda::default_statement(), denominator(), boost::container::deque< T, Allocator >::deque(), boost::container::allocator_traits< Allocator >::destroy(), boost::random::linear_congruential_engine< IntType, a, c, m >::discard(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::discharge(), boost::xpressive::dynamic_cast_(), boost::multiprecision::empty(), phoenix::composite< OperationT, A, nil_t, nil_t, nil_t >::eval(), phoenix::composite< OperationT, A, B, nil_t, nil_t >::eval(), phoenix::composite< OperationT, A, B, C, nil_t >::eval(), boost::math::tools::evaluate_even_polynomial(), boost::math::tools::evaluate_odd_polynomial(), boost::math::tools::evaluate_polynomial(), boost::math::tools::evaluate_rational(), boost::math::detail::expm1_imp(), boost::math::extreme_value_distribution< RealType, Policy >::extreme_value_distribution(), boost::re_detail::find_sort_syntax(), boost::math::detail::finite_gamma_q(), boost::math::detail::finite_half_gamma_q(), boost::math::detail::float_distance_imp(), boost::date_time::gregorian_calendar_base< ymd_type_, date_int_type_ >::from_day_number(), boost::date_time::gregorian_calendar_base< ymd_type_, date_int_type_ >::from_julian_day_number(), boost::math::detail::gamma_incomplete_imp(), boost::math::detail::gamma_p_derivative_imp(), boost::math::detail::gcd_euclidean(), generate_random_graph(), generate_random_graph1(), boost::fusion::get(), boost::geometry::traits::access< boost::array< CoordinateType, DimensionCount >, Dimension >::get(), boost::container::container_detail::outermost_allocator_imp< Alloc >::get(), boost::container::container_detail::outermost_allocator_imp< MaybeScopedAlloc, true >::get(), boost::spirit::type_of::placeholdee< Placeholder, StartAction, NewChainOrChains >::get(), boost::spirit::type_of::placeholdee< Placeholder, StartAction, action_chains< Head, Tail > >::get(), get(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::global_distance_update(), boost::re_detail::global_value(), boost::multiprecision::hull(), boost::math::detail::ibeta_a_step(), boost::math::detail::ibeta_derivative_imp(), boost::math::detail::ibeta_imp(), boost::math::detail::ibeta_power_terms(), boost::math::detail::ibeta_series(), boost::multiprecision::in(), boost::graph::distributed::hohberg_detail::infimum(), boost::detail::int_to_string(), boost::multiprecision::intersect(), boost::io::ios_iword_saver::ios_iword_saver(), boost::io::ios_pword_saver::ios_pword_saver(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::is_flow(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::is_residual_edge(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::is_saturated(), boost::math::detail::isfinite_impl(), boost::math::detail::isinf_impl(), boost::math::detail::isnan_impl(), boost::math::detail::isnormal_impl(), johnson_all_pairs_shortest_paths(), boost::math::kurtosis_excess(), boost::fusion::less_equal(), boost::math::detail::log1p_imp(), boost::math::log1pmx(), boost::cb_details::make_assign_range(), boost::container::allocator_traits< Allocator >::max_size(), boost::math::mean(), boost::multiprecision::minmax(), boost::math::mode(), boost::multiprecision::multiply(), boost::math::detail::nc_beta_pdf(), boost::math::detail::nc_beta_quantile(), boost::math::non_central_beta_distribution< T, Policy >::non_central_beta_distribution(), boost::math::detail::non_central_chi_square_p(), boost::math::detail::non_central_t_cdf(), boost::math::detail::non_central_t_pdf(), numerator(), boost::polygon::axis_transformation::operator!=(), boost::alignment::operator!=(), operator!=(), boost::container::operator!=(), boost::iostreams::operator&(), operator()(), boost::spirit::utree_is_equal::operator()(), boost::random::beta_distribution< RealType >::operator()(), boost::spirit::utree_is_less_than::operator()(), boost::random::inversive_congruential_engine< IntType, a, b, p >::operator()(), boost::random::linear_congruential_engine< IntType, a, c, m >::operator()(), boost::detail::override_const_property_t< ArgType, Prop, Graph, Exists >::operator()(), boost::gil::channel_multiplier< ChannelValue >::operator()(), boost::detail::override_property_t< ArgType, Prop, Graph, Exists >::operator()(), boost::polygon::less_rectangle_concept< rectangle_type_1, rectangle_type_2 >::operator()(), boost::lambda::ll::min::operator()(), boost::lambda::ll::max::operator()(), phoenix::member_function_ptr_action< RT, ClassT, A, nil_t, nil_t, nil_t >::operator()(), phoenix::member_function_ptr_action< RT, ClassT, A, B, nil_t, nil_t >::operator()(), phoenix::bound_member_action< RT, ClassT, A, nil_t, nil_t, nil_t >::operator()(), phoenix::bound_member_action< RT, ClassT, A, B, nil_t, nil_t >::operator()(), boost::math::tools::operator*(), boost::units::operator*(), boost::polygon::axis_transformation::operator+(), boost::math::tools::operator+(), boost::spirit::type_of::operator,(), boost::multiprecision::operator-(), boost::spirit::operator<=(), boost::alignment::operator==(), operator==(), boost::container::operator==(), boost::spirit::operator>(), operator>(), boost::gregorian::operator>>(), boost::iostreams::operator^(), boost::iostreams::operator|(), boost::iostreams::operator~(), boost::multiprecision::overlap(), boost::math::detail::owens_t_T1(), boost::math::detail::owens_t_T1_accelerated(), boost::math::detail::owens_t_T2(), boost::math::detail::owens_t_T2_accelerated(), boost::math::detail::owens_t_T3_imp(), boost::math::detail::owens_t_T4(), boost::math::detail::owens_t_T5_imp(), boost::math::pdf(), boost::polygon::predicated_swap(), boost::multiprecision::proper_subset(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::push_relabel(), boost::math::tools::detail::quadratic_interpolate(), boost::math::quantile(), boost::range_detail::range_begin(), boost::range_detail::range_end(), boost::geometry::policies::relate::segments_de9im< S1, S2 >::rays_intersect(), boost::re_detail::re_is_set_member(), boost::_bi::ref_compare(), boost::math::detail::regularised_gamma_prefix(), boost::detail::push_relabel< Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue >::relabel_distance(), boost::relaxed_heap< vertex_descriptor, queue_compare_type, VertexIndexMap >::remove(), boost::interprocess::shared_ptr< T, VoidAllocator, Deleter >::reset(), boost::multiprecision::cpp_bf_io_detail::restricted_pow(), boost::accumulators::impl::extended_p_square_quantile_impl< Sample, Impl1, Impl2 >::result(), boost::math::tools::detail::secant_interpolate(), boost::geometry::policies::relate::segments_intersection_points< ReturnType >::segments_collinear(), boost::math::detail::signbit_impl(), boost::multiprecision::singleton(), boost::math::skewness(), boost::unit_test::for_each::static_any_cast(), boost::xpressive::static_cast_(), boost::multiprecision::subset(), boost::multiprecision::subtract(), swap(), boost::spirit::traits::swap_impl(), boost::math::detail::T4_mp(), boost::math::detail::tgamma_small_upper_part(), boost::math::tools::toms748_solve(), boost::graph::distributed::cc_ps_detail::collision_map< component_value_type >::update(), boost::relaxed_heap< vertex_descriptor, queue_compare_type, VertexIndexMap >::update(), boost::math::variance(), boost::container::vector< Value, container_detail::static_storage_allocator< Value, Capacity > >::vector(), boost::multiprecision::zero_in(), boost::math::constants::detail::detail::zeta_series_2(), and boost::math::constants::detail::detail::zeta_series_derivative_2().

BOOST_CONSTEXPR_OR_CONST adopt_lock_t boost::adopt_lock = {}

Referenced by boost::synchronized_value< T, Lockable >::adopt_synchronize(), boost::BasicLock< Lk >::BOOST_CONCEPT_USAGE(), make_unique_lock(), make_unique_locks(), synchronize(), and boost::reverse_lock< Lock >::~reverse_lock().

associative_property_map< std::map<edge_descriptor, bool> > boost::aiG_inL(iG_inL)

Referenced by for(), if(), and boost::detail::rec_two_graphs_common_spanning_trees().

BOOST_LOG_OPEN_NAMESPACE typedef error_info< struct attribute_name_info_tag, attribute_name > boost::attribute_name_info

Attribute name exception information.

associative_property_map< std::map<edge_descriptor, bool> > boost::avG_inL(vG_inL)

Referenced by for(), and if().

BOOST_SIGNALS_TEMPLATE_ARGS SlotFunction::result_type BOOST_SIGNALS_TEMPLATE_ARGS boost::Combiner

Referenced by boost::icl::map< DomainT, CodomainT, Traits, Compare, Combine, Section, Alloc >::_add(), boost::icl::map< DomainT, CodomainT, Traits, Compare, Combine, Section, Alloc >::_subtract(), boost::icl::interval_base_map< interval_map< DomainT, CodomainT, Traits, Compare, Combine, Section, Interval, Alloc >, DomainT, CodomainT, Traits, Compare, Combine, Section, Interval, Alloc >::add_at(), BOOST_JOIN(), and boost::icl::conversion< icl::inplace_minus< Type > >::inversion().

edge_iterator boost::curr

Referenced by boost::date_time::day_clock< date_type >::local_day_ymd(), boost::date_time::second_clock< time_type >::local_time(), metric_tsp_approx_from_vertex(), boost::date_time::day_clock< date_type >::universal_day_ymd(), and boost::date_time::second_clock< time_type >::universal_time().

edge_iterator boost::current

Referenced by boost::detail::basic_timed_mutex::clear_waiting_and_try_lock(), component_count(), compress_components(), boost::graph::distributed::connected_components_ps(), boost::python::detail::def_maybe_overloads(), find_odd_cycle(), boost::spirit::get_column(), boost::spirit::get_line_start(), if(), boost::detail::win32::interlocked_bit_test_and_reset(), boost::detail::win32::interlocked_bit_test_and_set(), boost::detail::basic_timed_mutex::mark_waiting_and_try_lock(), normalize_components(), boost::graph::distributed::cc_ps_detail::update_reducer< ComponentMap, work_queue >::operator()(), boost::spirit::x3::seek_directive< Subject >::parse(), boost::bucket_sorter< BucketType, ValueType, Bucket, ValueIndexMap >::stack::pop(), boost::bucket_sorter< BucketType, ValueType, Bucket, ValueIndexMap >::stack::push(), boost::detail::rotate_fan(), sequential_vertex_coloring(), boost::mpi::test_any(), boost::mpi::test_some(), boost::detail::mmd_impl< Graph, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, VertexIndexMap >::update(), boost::mpi::wait_all(), boost::mpi::wait_any(), wait_for_all(), wait_for_any(), and boost::mpi::wait_some().

BOOST_CONSTEXPR_OR_CONST defer_lock_t boost::defer_lock = {}

Referenced by boost::BasicLock< Lk >::BOOST_CONCEPT_USAGE(), boost::synchronized_value< T, Lockable >::defer_synchronize(), boost::detail::lock_impl(), make_unique_lock(), boost::synchronized_value< T, Lockable >::operator<(), boost::synchronized_value< T, Lockable >::operator<=(), boost::synchronized_value< T, Lockable >::operator=(), boost::synchronized_value< T, Lockable >::operator==(), boost::synchronized_value< T, Lockable >::operator>(), boost::synchronized_value< T, Lockable >::operator>=(), and boost::synchronized_value< T, Lockable >::swap().

std::map<vertex_descriptor, int> boost::dist_map

Referenced by boost::detail::rec_two_graphs_common_spanning_trees().

boost::E

Referenced by boost::wave::util::VectorStringStorage< E, A >::append(), boost::geometry::strategy::area::huiller< PointOfSegment, CalculationType >::apply(), boost::concepts::BOOST_concept(), boost::wave::util::SimpleStringStorage< E, A >::c_str(), boost::wave::util::AllocatorStringStorage< E, A >::c_str(), boost::DistributedEdgeListGraphConcept< G >::const_constraints(), const_pointer_cast(), current_exception_cast(), boost::wave::util::SimpleStringStorage< E, A >::Data::Data(), dynamic_pointer_cast(), generate_random_graph(), generate_random_graph1(), boost::property_tree::stream_translator< Ch, Traits, Alloc, E >::get_value(), boost::math::detail::lgamma_imp(), boost::serialization::load(), boost::wave::util::SimpleStringStorage< E, A >::max_size(), boost::numeric::ublas::operator>>(), boost::math::policies::detail::raise_error(), reinterpret_pointer_cast(), boost::wave::util::SimpleStringStorage< E, A >::reserve(), boost::wave::util::SimpleStringStorage< E, A >::resize(), boost::wave::util::VectorStringStorage< E, A >::resize(), boost::detail::graph::kamada_kawai_spring_layout_impl< Topology, Graph, PositionMap, WeightMap, EdgeOrSideLength, Done, VertexIndexMap, DistanceMatrix, SpringStrengthMatrix, PartialDerivativeMap >::run(), boost::serialization::save(), static_pointer_cast(), boost::wave::util::VectorStringStorage< E, A >::VectorStringStorage(), and boost::wave::util::AllocatorStringStorage< E, A >::~AllocatorStringStorage().

typedef null_deleter boost::empty_deleter

A deprecated name for null_deleter.

std::vector<Vertex>::iterator boost::end = topo_order.end()

Referenced by boost::icl::map< DomainT, CodomainT, Traits, Compare, Combine, Section, Alloc >::_subtract(), accumulate(), add_edge(), boost::icl::add_intersection(), boost::re_detail::basic_char_set< charT, traits >::add_range(), adjacent_difference(), boost::range::adjacent_find(), adjacent_vertices(), boost::iterator_range_detail::iterator_range_impl< IteratorT >::adl_end(), all_closeness_centralities(), all_clustering_coefficients(), all_degree_centralities(), all_eccentricities(), all_mean_geodesics(), boost::algorithm::all_of(), boost::algorithm::all_of_equal(), boost::wave::util::AllocatorStringStorage< E, A >::AllocatorStringStorage(), boost::algorithm::any_of(), boost::algorithm::any_of_equal(), boost::wave::util::SimpleStringStorage< E, A >::append(), boost::wave::util::AllocatorStringStorage< E, A >::append(), boost::wave::util::VectorStringStorage< E, A >::append(), boost::wave::util::flex_string< E, T, A, Storage >::append(), boost::io::detail::append_string(), boost::geometry::detail::svg::svg_multi< MultiPolygon, detail::svg::svg_poly< boost::range_value< MultiPolygon >::type > >::apply(), boost::geometry::detail::unique::range_unique::apply(), boost::geometry::detail::overlay::stateless_predicate_based_interrupt_policy< IsAcceptableTurnPredicate, AllowEmptyTurnRange >::apply(), boost::geometry::detail::reverse::range_reverse::apply(), boost::geometry::detail::simplify::simplify_range_insert::apply(), boost::geometry::detail::reverse::polygon_reverse::apply(), boost::geometry::detail::unique::polygon_unique::apply(), boost::geometry::detail::remove_spikes::range_remove_spikes< Ring >::apply(), boost::geometry::detail::simplify::simplify_copy::apply(), boost::geometry::dispatch::points_begin< Polygon, polygon_tag >::apply(), boost::geometry::strategy::convex_hull::detail::get_extremes< InputRange, RangeIterator, StrategyLess, StrategyGreater >::apply(), boost::geometry::detail::append::append_range< Geometry, Range >::apply(), boost::geometry::detail::overlay::predicate_based_interrupt_policy< IsAcceptableTurnPredicate, AllowEmptyTurnRange >::apply(), boost::geometry::detail::for_each::fe_range_per_point::apply(), boost::geometry::detail::unique::multi_unique< detail::unique::range_unique >::apply(), boost::geometry::detail::area::ring_area< order_as_direction< geometry::point_order< Ring >::value >::value, geometry::closure< Ring >::value >::apply(), boost::geometry::dispatch::segments_begin< Polygon, polygon_tag >::apply(), boost::geometry::detail::svg::svg_range< Linestring, detail::svg::prefix_linestring >::apply(), boost::geometry::detail::length::range_length< Geometry, closed >::apply(), boost::geometry::detail::for_each::fe_range_per_segment_with_closure< Closure >::apply(), boost::geometry::detail::wkt::parsing_assigner< Point, Dimension, DimensionCount >::apply(), boost::geometry::dispatch::points_begin< MultiLinestring, multi_linestring_tag >::apply(), boost::geometry::dispatch::segments_begin< MultiLinestring, multi_linestring_tag >::apply(), boost::geometry::detail::svg::svg_poly< Polygon >::apply(), boost::geometry::detail::wkt::wkt_range< Range, opening_parenthesis, closing_parenthesis >::apply(), boost::geometry::dispatch::points_begin< MultiPolygon, multi_polygon_tag >::apply(), boost::geometry::dispatch::segments_begin< MultiPolygon, multi_polygon_tag >::apply(), boost::geometry::detail::correct::correct_ring< Ring, std::less< default_area_result< Ring >::type > >::apply(), boost::geometry::detail::remove_spikes::polygon_remove_spikes< Polygon >::apply(), boost::geometry::detail::touches::areal_interrupt_policy::apply(), boost::geometry::strategy::convex_hull::detail::assign_range< InputRange, RangeIterator, Container, SideStrategy >::apply(), boost::geometry::detail::conversion::range_to_range< LineString1, LineString2 >::apply(), boost::geometry::dispatch::points_end< Linestring, linestring_tag >::apply(), boost::geometry::detail::transform::transform_polygon::apply(), boost::geometry::detail::for_each::fe_polygon_per_point::apply(), boost::geometry::detail::dsv::dsv_range< Linestring >::apply(), boost::geometry::detail::remove_spikes::multi_remove_spikes< MultiPolygon, detail::remove_spikes::polygon_remove_spikes< boost::range_value< MultiPolygon >::type > >::apply(), boost::geometry::dispatch::points_end< Ring, ring_tag >::apply(), boost::geometry::dispatch::svg_map< multi_tag, Multi >::apply(), boost::geometry::detail::correct::correct_polygon< Polygon >::apply(), boost::geometry::detail::for_each::fe_polygon_per_segment::apply(), boost::geometry::dispatch::points_end< Polygon, polygon_tag >::apply(), boost::geometry::detail::simplify::simplify_multi< detail::simplify::simplify_polygon >::apply(), boost::geometry::detail::wkt::wkt_poly< Polygon, detail::wkt::prefix_polygon >::apply(), boost::geometry::strategy::simplify::detail::douglas_peucker< Point, PointDistanceStrategy, LessCompare >::apply(), boost::geometry::dispatch::segments_end< Polygon, polygon_tag >::apply(), boost::geometry::detail::conversion::polygon_to_polygon< Polygon1, Polygon2 >::apply(), boost::geometry::detail::for_each::for_each_multi< for_each_point< add_const_if_c< is_const< MultiGeometry >::value, boost::range_value< MultiGeometry >::type >::type > >::apply(), boost::geometry::dispatch::points_end< MultiPoint, multi_point_tag >::apply(), boost::geometry::detail::dsv::dsv_poly< Polygon >::apply(), boost::geometry::detail::centroid::centroid_range_state< Closure >::apply(), boost::geometry::detail::wkt::wkt_multi< Multi, detail::wkt::wkt_sequence< boost::range_value< Multi >::type >, detail::wkt::prefix_multilinestring >::apply(), boost::geometry::dispatch::points_end< MultiLinestring, multi_linestring_tag >::apply(), boost::geometry::dispatch::segments_end< MultiLinestring, multi_linestring_tag >::apply(), boost::geometry::dispatch::points_end< MultiPolygon, multi_polygon_tag >::apply(), boost::geometry::dispatch::segments_end< MultiPolygon, multi_polygon_tag >::apply(), boost::geometry::detail::transform::transform_multi< dispatch::transform< boost::range_value< Multi1 >::type, boost::range_value< Multi2 >::type > >::apply(), boost::geometry::detail::conversion::multi_to_multi< Multi1, Multi2, convert< boost::range_value< Multi1 >::type, boost::range_value< Multi2 >::type, single_tag_of< tag< Multi1 >::type >::type, single_tag_of< tag< Multi2 >::type >::type, DimensionCount > >::apply(), boost::geometry::detail::centroid::centroid_polygon_state::apply(), boost::geometry::detail::centroid::centroid_multi< detail::centroid::centroid_polygon_state >::apply(), boost::geometry::detail::dsv::dsv_multi< Geometry >::apply(), boost::geometry::detail::wkt::multi_parser< MultiGeometry, detail::wkt::polygon_parser, detail::wkt::prefix_multipolygon >::apply(), boost::geometry::detail::wkt::multi_point_parser< MultiGeometry, detail::wkt::prefix_multipoint >::apply(), boost::geometry::detail::wkt::box_parser< Box >::apply(), boost::geometry::detail::wkt::segment_parser< Segment >::apply(), boost::wave::util::impl::as_string(), boost::wave::util::impl::as_stringlit(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::assign(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::assign(), boost::wave::util::flex_string< E, T, A, Storage >::assign(), boost::container::map< const sync_id *, umap_type::iterator, address_less >::at(), boost::detail::parallel::available_process_files(), aver_wavefront(), boost::geometry::range::back(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::back(), bandwidth(), bellman_ford_shortest_paths(), boost::icl::between(), boost::range::binary_search(), boost::SinglePassRangeConcept< T >::BOOST_CONCEPT_USAGE(), boost::lockfree::stack< T, A0, A1, A2 >::bounded_push(), boost::algorithm::boyer_moore_horspool_search(), boost::algorithm::boyer_moore_search(), boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::boyer_myrvold_impl(), bron_kerbosch_all_cliques(), bucket_sort(), boost::graph::distributed::build_reverse_graph(), boost::geometry::detail::point_on_surface::calculate_average(), boost::detail::can_wrap_path(), boost::property_tree::ini_parser::detail::check_dupes(), boost::algorithm::clamp_range(), boost::icl::clear(), boost::iostreams::symmetric_filter< detail::bzip2_decompressor_impl< Alloc >, Alloc >::close(), boost::iostreams::detail::bzip2_compressor_impl< Alloc >::close(), boost::iostreams::detail::bzip2_decompressor_impl< Alloc >::close(), boost::xpressive::regex_compiler< BidiIter, RegexTraits, CompilerTraits >::compile(), boost::detail::graph::compute_edge_length(), boost::graph::distributed::connected_components_ps(), boost::hawick_circuits_detail::contains(), boost::detail::contract_edge(), boost::range::copy(), boost::numeric::odeint::copy_impl< Container1, boost::compute::vector< T, A > >::copy(), boost::numeric::odeint::copy_impl< boost::compute::vector< T, A >, Container2 >::copy(), boost::numeric::odeint::copy_impl< boost::compute::vector< T, A >, boost::compute::vector< T, A > >::copy(), boost::numeric::odeint::copy_impl< Container1, thrust::device_vector< Value > >::copy(), boost::numeric::odeint::copy_impl< thrust::device_vector< Value >, Container2 >::copy(), boost::numeric::odeint::copy_impl< thrust::device_vector< Value >, thrust::device_vector< Value > >::copy(), boost::range::copy_backward(), boost::algorithm::copy_if(), copy_range(), boost::algorithm::copy_until(), boost::algorithm::copy_while(), boost::range::count(), boost::attribute_set::count(), boost::range::count_if(), counting_range(), boost::random::piecewise_linear_distribution< RealType >::param_type::densities(), boost::random::piecewise_linear_distribution< RealType >::densities(), boost::random::discrete_distribution< std::size_t, WeightType >::discrete_distribution(), distance(), boost::icl::distance(), boost::icl::domain(), edge(), edgesum(), boost::icl::elements_end(), empty(), boost::geometry::identity_view< Range >::end(), boost::foreach_detail_::end(), boost::coroutines::end(), boost::algorithm::ends_with(), boost::geometry::detail::envelope::envelope_range_additional(), boost::range::equal(), boost::range::equal_range(), boost::range::erase(), boost::ptr_container_detail::ptr_set_adapter_base< Key, std::set< void *, void_ptr_indirect_fun< Compare, Key >, Allocator >, CloneAllocator, Ordered >::erase(), boost::geometry::range::erase(), boost::icl::erase(), boost::wave::util::flex_string< E, T, A, Storage >::erase(), boost::icl::erase_if(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::erase_if(), boost::re_detail::raw_storage::extend(), boost::detail::extend_path(), boost::range::fill(), boost::range::fill_n(), boost::detail::filter_unconnected_vertices(), boost::range::find(), boost::algorithm::find(), boost::icl::find(), boost::unit_test::basic_cstring< CharT >::find(), boost::intrusive::bstree_algorithms< NodeTraits >::find(), boost::range::find_end(), boost::wave::util::flex_string< E, T, A, Storage >::find_first_not_of(), boost::range::find_first_of(), boost::wave::util::flex_string< E, T, A, Storage >::find_first_of(), boost::algorithm::find_format(), boost::algorithm::find_format_all(), boost::algorithm::find_format_all_copy(), boost::algorithm::find_format_copy(), boost::range::find_if(), boost::algorithm::find_if_not(), boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), boost::graph::distributed::fleischer_hendrickson_pinar_strong_components_impl(), boost::range::for_each(), boost::numeric::odeint::range_algebra::for_each1(), boost::numeric::odeint::thrust_algebra::for_each1(), boost::numeric::odeint::range_algebra::for_each10(), boost::numeric::odeint::range_algebra::for_each11(), boost::numeric::odeint::range_algebra::for_each12(), boost::numeric::odeint::range_algebra::for_each13(), boost::numeric::odeint::range_algebra::for_each14(), boost::numeric::odeint::range_algebra::for_each15(), boost::numeric::odeint::range_algebra::for_each2(), boost::numeric::odeint::thrust_algebra::for_each2(), boost::numeric::odeint::range_algebra::for_each3(), boost::numeric::odeint::thrust_algebra::for_each3(), boost::numeric::odeint::range_algebra::for_each4(), boost::numeric::odeint::thrust_algebra::for_each4(), boost::numeric::odeint::range_algebra::for_each5(), boost::numeric::odeint::thrust_algebra::for_each5(), boost::numeric::odeint::range_algebra::for_each6(), boost::numeric::odeint::thrust_algebra::for_each6(), boost::numeric::odeint::range_algebra::for_each7(), boost::numeric::odeint::thrust_algebra::for_each7(), boost::numeric::odeint::range_algebra::for_each8(), boost::numeric::odeint::thrust_algebra::for_each8(), boost::numeric::odeint::range_algebra::for_each9(), boost::adaptors::format(), boost::gregorian::from_stream(), boost::algorithm::gather(), boost::range::generate(), boost::spirit::karma::base_kleene< Subject, mpl::false_, kleene< Subject > >::generate(), boost::spirit::karma::base_list< Left, Right, mpl::true_, strict_list< Left, Right > >::generate(), boost::spirit::karma::base_plus< Subject, mpl::false_, plus< Subject > >::generate(), boost::random::random_device::generate(), boost::spirit::karma::base_repeat_generator< Subject, LoopIter, mpl::false_, repeat_generator< Subject, LoopIter > >::generate(), boost::spirit::karma::base_sequence< Elements, mpl::true_, strict_sequence< Elements > >::generate_impl(), boost::chrono::time_point_get< CharT, InputIterator >::get(), boost::chrono::duration_get< CharT, InputIterator >::get(), boost::unit_test::token_iterator_base< range_token_iterator< Iter, CharCompare, ValueType, Reference >, iterator_value< Iter >::type, CharCompare, ValueType, Reference >::get(), boost::wave::util::impl::get_full_name(), boost::python::slice::get_indices(), boost::spirit::lex::lexertl::functor< Token, FunctorData, Iterator, SupportsActors, SupportsState >::get_next(), boost::BOOST_RT_PARAM_NAMESPACE::file::get_param_subns(), boost::algorithm::hex(), boost::range::includes(), incremental_components(), boost::bimaps::views::map_view< Tag, BimapType >::info_at(), boost::bimaps::views::unordered_map_view< Tag, BimapType >::info_at(), boost::random::detail::integer_alias_table< IntType, WeightType >::init_average(), inner_product(), boost::range::inplace_merge(), boost::range::insert(), boost::icl::map< DomainT, CodomainT, Traits, Compare, Combine, Section, Alloc >::insert(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::insert(), boost::attribute_set::insert(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::insert(), boost::ptr_set_adapter< Key, std::set< void *, void_ptr_indirect_fun< Compare, Key >, Allocator >, CloneAllocator, true >::insert(), boost::ptr_map_adapter< T, boost::unordered_map< Key, void *, Hash, Pred, Allocator >, CloneAllocator, false >::insert(), boost::ptr_multiset_adapter< Key, boost::unordered_multiset< void *, void_ptr_indirect_fun< Hash, Key >, void_ptr_indirect_fun< Pred, Key >, Allocator >, CloneAllocator, false >::insert(), boost::ptr_multimap_adapter< T, boost::unordered_multimap< Key, void *, Hash, Pred, Allocator >, CloneAllocator, false >::insert(), boost::intrusive::treap_impl< ValueTraits, VoidOrKeyComp, VoidOrPrioComp, SizeType, ConstantTimeSize, HeaderHolder >::insert_equal(), boost::intrusive::sgtree_impl< ValueTraits, Compare, SizeType, FloatingPoint, HeaderHolder >::insert_equal(), boost::intrusive::bstree_impl< ValueTraits, Compare, SizeType, ConstantTimeSize, RbTreeAlgorithms, HeaderHolder >::insert_equal(), boost::intrusive::treap_impl< ValueTraits, VoidOrKeyComp, VoidOrPrioComp, SizeType, ConstantTimeSize, HeaderHolder >::insert_unique(), boost::intrusive::sgtree_impl< ValueTraits, Compare, SizeType, FloatingPoint, HeaderHolder >::insert_unique(), boost::intrusive::bstree_impl< ValueTraits, Compare, SizeType, ConstantTimeSize, RbTreeAlgorithms, HeaderHolder >::insert_unique(), boost::polygon::polygon_45_set_data< Unit >::insert_with_resize_dispatch(), boost::numeric::odeint::integrate_times(), boost::wave::impl::pp_iterator_functor< ContextT >::interpret_pragma(), boost::date_time::period< point_rep, duration_rep >::intersection(), boost::algorithm::iota(), boost::date_time::period< point_rep, duration_rep >::is_adjacent(), boost::algorithm::is_decreasing(), boost::algorithm::is_increasing(), is_kuratowski_subgraph(), boost::date_time::period< point_rep, duration_rep >::is_null(), boost::algorithm::is_partitioned(), boost::algorithm::is_permutation(), boost::range::is_sorted(), boost::algorithm::is_sorted(), boost::algorithm::is_sorted_until(), boost::algorithm::is_strictly_decreasing(), boost::algorithm::is_strictly_increasing(), boost::wave::util::impl::is_whitespace_only(), iterative_bit_vector_dominator_tree(), ith_bandwidth(), boost::algorithm::join(), boost::icl::join(), boost::algorithm::join_if(), boost::algorithm::knuth_morris_pratt_search(), boost::date_time::period< point_rep, duration_rep >::length(), boost::icl::length(), boost::iterator_range_detail::less_than(), boost::range::lexicographical_compare(), boost::algorithm::lexicographical_compare(), boost::date_time::us_dst_trait< date_type >::local_dst_end_day(), boost::date_time::eu_dst_trait< date_type >::local_dst_end_day(), boost::date_time::acst_dst_trait< date_type >::local_dst_end_day(), boost::spirit::lex::lexertl::detail::data< Iterator, mpl::true_, HasState, TokenValue >::lookahead(), boost::spirit::lex::lexertl::detail::static_data< Iterator, mpl::true_, HasState, TokenValue >::lookahead(), boost::spirit::lex::lexertl::detail::data< Iterator, mpl::true_, HasState, boost::optional< TokenValue > >::lookahead(), boost::spirit::lex::lexertl::detail::static_data< Iterator, mpl::true_, HasState, boost::optional< TokenValue > >::lookahead(), boost::interprocess::lookup_error(), boost::range::lower_bound(), boost::range_detail::make_begin_strided_iterator(), boost::algorithm::make_boyer_moore(), boost::algorithm::make_boyer_moore_horspool(), boost::range_detail::make_end_strided_iterator(), boost::iterators::make_filter_iterator(), boost::range::make_heap(), boost::algorithm::make_knuth_morris_pratt(), boost::iterator_range_detail::make_range_impl(), boost::unit_test::make_range_token_iterator(), boost::detail::shared_state_base::mark_finished_internal(), boost::aux::match_traits< ExpressionT, boost_spirit_qi_expression_tag >::matches(), boost::aux::match_traits< spirit::qi::rule< IteratorT, T1, T2, T3, T4 >, boost_spirit_qi_expression_tag >::matches(), boost::range::max_element(), max_wavefront(), mean_clustering_coefficient(), boost::range::merge(), boost::date_time::period< point_rep, duration_rep >::merge(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::merge(), boost::range::min_element(), boost::range::mismatch(), boost::range::next_permutation(), boost::wave::impl::impl::next_token_is_pp_directive(), boost::algorithm::none_of(), boost::algorithm::none_of_equal(), boost::numeric::odeint::range_algebra::norm_inf(), boost::numeric::odeint::thrust_algebra::norm_inf(), boost::random::detail::real_alias_table< IntType, WeightType >::normalize(), boost::locale::normalize(), boost::detail::basic_condition_variable::notify_all(), boost::detail::basic_condition_variable::notify_one(), boost::range::nth_element(), num_paths_through_vertex(), num_triangles_on_vertex(), boost::wave::impl::pp_iterator_functor< ContextT >::on_define(), boost::algorithm::one_of(), boost::algorithm::one_of_equal(), boost::proto::functional::end::operator()(), boost::interprocess::unordered_map_index_aux< MapConfig >::hasher::operator()(), boost::all_force_pairs::operator()(), boost::algorithm::knuth_morris_pratt< patIter >::operator()(), boost::interprocess::iunordered_set_index_aux< MapConfig >::hash_function::operator()(), boost::algorithm::boyer_moore_horspool< patIter, traits >::operator()(), boost::algorithm::boyer_moore< patIter, traits >::operator()(), boost::detail::dominator_visitor< Graph, IndexMap, TimeMap, PredMap, DomTreePredMap >::operator()(), boost::escaped_list_separator< Char, Traits >::operator()(), boost::expressions::pattern_replacer< CharT >::operator()(), boost::expressions::c_ascii_pattern_replacer< CharT >::operator()(), boost::icl::map< DomainT, CodomainT, Traits, Compare, Combine, Section, Alloc >::operator()(), boost::icl::interval_base_map< interval_map< DomainT, CodomainT, Traits, Compare, Combine, Section, Interval, Alloc >, DomainT, CodomainT, Traits, Compare, Combine, Section, Interval, Alloc >::operator()(), boost::random::discrete_distribution< std::size_t, WeightType >::operator()(), boost::re_detail::format_functor_c_string< charT, Match, Traits >::operator()(), boost::attributes::operator<<(), boost::posix_time::operator>>(), boost::attribute_set::operator[](), boost::adaptors::operator|(), boost::range_detail::operator|(), out_edges(), boost::range::overwrite(), boost::graph::distributed::cc_detail::parallel_connected_components(), boost::random::piecewise_linear_distribution< RealType >::param_type::param_type(), boost::re_detail::basic_regex_parser< charT, traits >::parse_QE(), boost::range::partial_sort(), boost::range::partial_sort_copy(), partial_sum(), boost::range::partition(), boost::algorithm::partition_copy(), boost::algorithm::partition_point(), boost::expressions::pattern_replacer< CharT >::pattern_replacer(), boost::wave::util::impl::next_token< IteratorT >::peek(), boost::random::piecewise_linear_distribution< RealType >::piecewise_linear_distribution(), boost::relaxed_heap< vertex_descriptor, queue_compare_type, VertexIndexMap >::pop(), boost::range::pop_heap(), boost::local_time::posix_time_zone_base< CharT >::posix_time_zone_base(), boost::wave::impl::impl::pp_is_last_on_line(), boost::typeindex::stl_type_index::pretty_name(), boost::range::prev_permutation(), boost::date_time::string_parse_tree< CharT >::printme(), boost::random::discrete_distribution< std::size_t, WeightType >::probabilities(), boost::uuids::detail::sha1::process_block(), profile(), boost::lockfree::stack< T, A0, A1, A2 >::push(), boost::range::push_back(), boost::range::push_front(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::push_front(), boost::range::push_heap(), boost::date_time::period_formatter< CharT >::put_period_end_delimeter(), boost::date_time::special_values_formatter< CharT >::put_special(), boost::date_time::date_names_put< Config, charT, OutputIterator >::put_string(), radius_and_diameter(), boost::range::random_shuffle(), boost::assign::list_inserter< Function, Argument >::range(), boost::assign_detail::generic_list< T >::range(), boost::assign_detail::static_generic_list< T, N >::range(), boost::range_detail::range_calculate_size(), boost::geometry::adapt::bp::range_end(), rbegin(), boost::wave::util::flex_string< E, T, A, Storage >::rbegin(), boost::property_tree::ini_parser::read_ini(), boost::xpressive::regex_match(), boost::xpressive::regex_replace(), boost::xpressive::regex_search(), boost::range::remove(), boost::range::remove_copy(), remove_copy_if(), remove_edge(), boost::undirected_graph< VertexProp, EdgeProp, GraphProp >::remove_edge_and_renumber_indices(), boost::directed_graph< VertexProp, EdgeProp, GraphProp >::remove_edge_and_renumber_indices(), remove_edge_if(), boost::range::remove_erase(), boost::range::remove_erase_if(), boost::range::remove_if(), boost::wave::util::impl::remove_placeholders(), boost::undirected_graph< VertexProp, EdgeProp, GraphProp >::remove_vertex_and_renumber_indices(), boost::directed_graph< VertexProp, EdgeProp, GraphProp >::remove_vertex_and_renumber_indices(), boost::undirected_graph< VertexProp, EdgeProp, GraphProp >::renumber_edge_indices(), boost::directed_graph< VertexProp, EdgeProp, GraphProp >::renumber_edge_indices(), boost::directed_graph< VertexProp, EdgeProp, GraphProp >::renumber_vertex_indices(), boost::range::replace(), boost::ptr_container_detail::ptr_map_adapter_base< T, VoidPtrMultiMap, CloneAllocator, Ordered >::replace(), boost::range::replace_copy(), boost::range::replace_copy_if(), boost::geometry::detail::point_on_surface::replace_extremes_for_self_tangencies(), boost::range::replace_if(), boost::wave::util::macro_definition< TokenT, ContainerT >::replace_parameters(), boost::graph::distributed::cc_detail::request_parent_map_entries(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::rerase(), boost::wave::util::AllocatorStringStorage< E, A >::reserve(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::resize(), boost::wave::util::SimpleStringStorage< E, A >::resize(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::resize(), boost::wave::util::AllocatorStringStorage< E, A >::resize(), boost::wave::util::SmallStringOpt< Storage, threshold, Align >::resize(), boost::accumulators::impl::extended_p_square_quantile_impl< Sample, Impl1, Impl2 >::result(), boost::wave::util::retrieve_macrodefinition(), boost::range::reverse(), boost::range::reverse_copy(), boost::unit_test::basic_cstring< CharT >::rfind(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::rinsert(), rms_wavefront(), boost::range::rotate(), boost::range::rotate_copy(), boost::detail::rotate_fan(), boost::geometry::index::rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator >::rtree(), boost::detail::graph::kamada_kawai_spring_layout_impl< Topology, Graph, PositionMap, WeightMap, EdgeOrSideLength, Done, VertexIndexMap, DistanceMatrix, SpringStrengthMatrix, PartialDerivativeMap >::run(), boost::range::search(), boost::range::search_n(), boost::uuids::detail::seed(), boost::simple_segregated_storage< SizeType >::segregate(), boost::graph::distributed::cc_ps_detail::collision_map< component_value_type >::serialize(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::set_capacity(), boost::range::set_difference(), boost::range::set_intersection(), boost::range::set_symmetric_difference(), boost::range::set_union(), boost::wave::util::SimpleStringStorage< E, A >::SimpleStringStorage(), boost::wave::util::AllocatorStringStorage< E, A >::size(), boost::intrusive::bstree_algorithms< NodeTraits >::size(), boost::wave::impl::impl::skip_to_eol(), boost::range::sort(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::sort(), boost::range::sort_heap(), boost::date_time::period< point_rep, duration_rep >::span(), boost::numeric::odeint::split_impl< SourceContainer, openmp_state< typename SourceContainer::value_type > >::split(), boost::range::stable_partition(), boost::intrusive::circular_list_algorithms< NodeTraits >::stable_partition(), boost::range::stable_sort(), boost::iostreams::detail::chain_base< Self, Ch, Tr, Alloc, Mode >::strict_sync(), boost::range::swap_ranges(), boost::spirit::x3::symbols< Char, T, Lookup, Filter >::symbols(), boost::spirit::qi::symbols< Char, T, Lookup, Filter >::symbols(), boost::spirit::karma::symbols< Attribute, T, Lookup, CharEncoding, Tag >::symbols(), boost::spirit::karma::symbols< Attribute, unused_type, Lookup, CharEncoding, Tag >::symbols(), boost::graph_test< Graph >::test_adjacency_matrix(), boost::graph_test< Graph >::test_edge_list_graph(), tiernan_all_cycles(), boost::posix_time::to_simple_string_type(), boost::locale::conv::to_utf(), boost::spirit::lex::tokenize(), boost::spirit::lex::tokenize_and_phrase_parse(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::transfer(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::transfer(), boost::ptr_set_adapter< Key, std::set< void *, void_ptr_indirect_fun< Compare, Key >, Allocator >, CloneAllocator, true >::transfer(), boost::ptr_map_adapter< T, boost::unordered_map< Key, void *, Hash, Pred, Allocator >, CloneAllocator, false >::transfer(), boost::ptr_multiset_adapter< Key, boost::unordered_multiset< void *, void_ptr_indirect_fun< Hash, Key >, void_ptr_indirect_fun< Pred, Key >, Allocator >, CloneAllocator, false >::transfer(), boost::ptr_multimap_adapter< T, boost::unordered_multimap< Key, void *, Hash, Pred, Allocator >, CloneAllocator, false >::transfer(), boost::range::transform(), boost::geometry::detail::transform::transform_range_out(), transitive_closure(), traverse_tree(), boost::algorithm::trim_copy_if(), boost::unit_test::basic_cstring< CharT >::trim_left(), boost::algorithm::trim_left_copy_if(), boost::algorithm::trim_left_if(), boost::wave::util::impl::trim_replacement_list(), boost::unit_test::basic_cstring< CharT >::trim_right(), boost::algorithm::trim_right_copy_if(), boost::algorithm::trim_right_if(), boost::random::detail::integer_alias_table< IntType, WeightType >::try_get_sum(), boost::detail::try_lock_impl(), boost::adaptors::type_erase(), boost::u16_to_u32_iterator< BaseIterator, U32Type >::u16_to_u32_iterator(), boost::u8_to_u32_iterator< BaseIterator, U32Type >::u8_to_u32_iterator(), boost::algorithm::unhex(), boost::graph::distributed::cc_ps_detail::collision_map< component_value_type >::uniqify(), boost::range::unique(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::unique(), boost::range::unique_copy(), boost::graph::distributed::detail::unmarshal_set(), boost::lockfree::stack< T, A0, A1, A2 >::unsynchronized_push(), boost::range::upper_bound(), boost::locale::conv::utf_to_utf(), boost::xpressive::c_regex_traits< Char >::value(), wait_for_all(), wait_for_any(), write_all_attributes(), write_graphviz(), boost::detail::write_graphviz_subgraph(), boost::property_tree::ini_parser::write_ini(), and boost::wave::util::SimpleStringStorage< E, A >::~SimpleStringStorage().

class BOOST_SYMBOL_VISIBLE boost::exception

Referenced by boost::geometry::detail::wkt::parsing_assigner< Point, Dimension, DimensionCount >::apply(), current_exception_diagnostic_information(), boost::exception_detail::diagnostic_information_impl(), boost::msm::back::state_machine< A0, A1, A2, A3, A4 >::do_process_helper(), boost::multiprecision::backends::eval_pow(), boost::multiprecision::concepts::number_backend_float_architype::operator=(), boost::user_scheduler::try_executing_one(), boost::executors::loop_executor::try_executing_one(), boost::executors::basic_thread_pool::try_executing_one(), boost::executors::serial_executor::try_executing_one(), boost::multiprecision::backends::debug_adaptor< Backend >::update_view(), and boost::mpi::wait_any().

const int boost::exit_exception_failure = 200

Referenced by boost::detail::translate_exception< Exception, ExceptionTranslator >::operator()().

const int boost::exit_failure = EXIT_FAILURE

const int boost::exit_success = EXIT_SUCCESS

Referenced by main().

const int boost::exit_test_failure = 201

Referenced by main().

const Graph Func boost::func

Referenced by phoenix::bind(), BOOST_THREAD_DCL_MOVABLE_BEG(), boost::detail::depth_first_visit_impl(), boost::match_results< BidirectionalIterator >::format(), if(), boost::container::list< T, Allocator >::insert(), boost::container::slist< T, Allocator >::insert_after(), boost::math::tools::kahan_sum_series(), boost::detail::rec_two_graphs_common_spanning_trees(), boost::math::tools::sum_series(), and with_lock_guard().

GraphTR G_to_TR_VertexMap boost::g_to_tr_map

BOOST_SIGNALS_TEMPLATE_ARGS SlotFunction::result_type BOOST_SIGNALS_TEMPLATE_ARGS boost::Group

BOOST_SIGNALS_TEMPLATE_ARGS SlotFunction::result_type BOOST_SIGNALS_TEMPLATE_ARGS boost::GroupCompare

Referenced by BOOST_JOIN().

template<typename T >

std::size_t boost::hash_value

inline

Referenced by boost::intrusive::hashtable_impl< ValueTraits, Hash, Equal, SizeType, BucketTraits, BoolFlags >::find(), hash_value(), boost::intrusive::hashtable_impl< ValueTraits, Hash, Equal, SizeType, BucketTraits, BoolFlags >::insert_equal(), boost::hash< T >::operator()(), boost::hash< T * >::operator()(), boost::hash< detail::parallel::global_descriptor< LocalDescriptor > >::operator()(), boost::hash< detail::parallel::edge_descriptor< Edge > >::operator()(), and boost::intrusive::hashtable_impl< ValueTraits, Hash, Equal, SizeType, BucketTraits, BoolFlags >::rehash().

bimap_type boost::iG_bimap

Referenced by if(), and boost::detail::rec_two_graphs_common_spanning_trees().

std::stack<edge_descriptor> boost::iG_buf

Referenced by boost::detail::rec_two_graphs_common_spanning_trees().

std::map<edge_descriptor, bool> boost::iG_inL

boost::iG_map[i]

detail::bridges_visitor< associative_property_map< std::map<vertex_descriptor, edge_descriptor> >, associative_property_map< std::map<vertex_descriptor, vertex_descriptor> >, associative_property_map< std::map<vertex_descriptor, int> >, associative_property_map< std::map<vertex_descriptor, int> >, std::stack<edge_descriptor> > boost::iG_vis(associative_property_map< std::map< vertex_descriptor, edge_descriptor > >(tree_map), associative_property_map< std::map< vertex_descriptor, vertex_descriptor > >(pred_map), associative_property_map< std::map< vertex_descriptor, int > >(dist_map), associative_property_map< std::map< vertex_descriptor, int > >(low_map), iG_buf)

Referenced by boost::detail::rec_two_graphs_common_spanning_trees().

std::vector<edge_descriptor> boost::iGO

initialized_value_t const boost::initialized_value = {}

const Graph Func Seq boost::inL

Initial value:

{
  typedef graph_traits<Graph> GraphTraits

Referenced by if(), and boost::detail::rec_two_graphs_common_spanning_trees().

BOOST_LOG_OPEN_NAMESPACE typedef mpl::vector< bool, char, wchar_t, signed char, unsigned char, short, unsigned short, int, unsigned int, long, unsigned long > boost::integral_types

An MPL-sequence of integral types of attributes, supported by default.

std::vector<Vertex>::iterator boost::it = topo_order.begin()

Referenced by boost::icl::map< DomainT, CodomainT, Traits, Compare, Combine, Section, Alloc >::_add(), boost::polygon::voronoi_diagram< T, TRAITS >::_build(), boost::wave::util::macromap< ContextT >::add_macro(), boost::geometry::detail::svg::svg_multi< MultiPolygon, detail::svg::svg_poly< boost::range_value< MultiPolygon >::type > >::apply(), boost::geometry::detail::unique::range_unique::apply(), boost::geometry::detail::reverse::polygon_reverse::apply(), boost::geometry::detail::unique::polygon_unique::apply(), boost::geometry::detail::remove_spikes::range_remove_spikes< Ring >::apply(), boost::geometry::strategy::convex_hull::detail::get_extremes< InputRange, RangeIterator, StrategyLess, StrategyGreater >::apply(), boost::geometry::detail::append::append_range< Geometry, Range >::apply(), boost::geometry::detail::for_each::fe_range_per_point::apply(), boost::geometry::detail::unique::multi_unique< detail::unique::range_unique >::apply(), boost::geometry::detail::area::ring_area< order_as_direction< geometry::point_order< Ring >::value >::value, geometry::closure< Ring >::value >::apply(), boost::geometry::detail::envelope::envelope_multi_linestring::apply(), boost::geometry::detail::svg::svg_range< Linestring, detail::svg::prefix_linestring >::apply(), boost::geometry::detail::length::range_length< Geometry, closed >::apply(), boost::geometry::detail::for_each::fe_range_per_segment_with_closure< Closure >::apply(), boost::geometry::detail::wkt::parsing_assigner< Point, Dimension, DimensionCount >::apply(), boost::geometry::detail::envelope::envelope_multi_polygon::apply(), boost::geometry::detail::svg::svg_poly< Polygon >::apply(), boost::geometry::detail::wkt::wkt_range< Range, opening_parenthesis, closing_parenthesis >::apply(), boost::geometry::detail::conversion::segment_to_range< Segment, LineString >::apply(), boost::geometry::detail::remove_spikes::polygon_remove_spikes< Polygon >::apply(), boost::geometry::detail::touches::areal_interrupt_policy::apply(), boost::geometry::strategy::convex_hull::detail::assign_range< InputRange, RangeIterator, Container, SideStrategy >::apply(), boost::geometry::detail::conversion::range_to_range< LineString1, LineString2 >::apply(), boost::geometry::detail::for_each::fe_polygon_per_point::apply(), boost::geometry::detail::dsv::dsv_range< Linestring >::apply(), boost::geometry::detail::remove_spikes::multi_remove_spikes< MultiPolygon, detail::remove_spikes::polygon_remove_spikes< boost::range_value< MultiPolygon >::type > >::apply(), boost::geometry::dispatch::svg_map< multi_tag, Multi >::apply(), boost::geometry::detail::correct::correct_polygon< Polygon >::apply(), boost::geometry::detail::for_each::fe_polygon_per_segment::apply(), boost::geometry::detail::wkt::wkt_poly< Polygon, detail::wkt::prefix_polygon >::apply(), boost::geometry::strategy::simplify::detail::douglas_peucker< Point, PointDistanceStrategy, LessCompare >::apply(), boost::geometry::detail::wkt::container_inserter< Point >::apply(), boost::geometry::detail::for_each::for_each_multi< for_each_point< add_const_if_c< is_const< MultiGeometry >::value, boost::range_value< MultiGeometry >::type >::type > >::apply(), boost::geometry::detail::dsv::dsv_poly< Polygon >::apply(), boost::geometry::detail::centroid::centroid_range_state< Closure >::apply(), boost::geometry::detail::wkt::wkt_multi< Multi, detail::wkt::wkt_sequence< boost::range_value< Multi >::type >, detail::wkt::prefix_multilinestring >::apply(), boost::geometry::detail::wkt::container_appender< Geometry >::apply(), boost::geometry::detail::centroid::centroid_polygon_state::apply(), boost::geometry::detail::wkt::polygon_parser< Polygon >::apply(), boost::geometry::detail::centroid::centroid_multi< detail::centroid::centroid_polygon_state >::apply(), boost::numeric::ublas::vector_sum< V >::apply(), boost::geometry::detail::dsv::dsv_multi< Geometry >::apply(), boost::numeric::ublas::vector_norm_1< V >::apply(), boost::geometry::detail::wkt::geometry_parser< Ring, detail::wkt::ring_parser, detail::wkt::prefix_polygon >::apply(), boost::numeric::ublas::vector_norm_2< V >::apply(), boost::geometry::detail::wkt::multi_parser< MultiGeometry, detail::wkt::polygon_parser, detail::wkt::prefix_multipolygon >::apply(), boost::geometry::detail::wkt::multi_point_parser< MultiGeometry, detail::wkt::prefix_multipoint >::apply(), boost::numeric::ublas::vector_norm_inf< V >::apply(), boost::geometry::detail::wkt::box_parser< Box >::apply(), boost::numeric::ublas::vector_index_norm_inf< V >::apply(), boost::geometry::detail::wkt::segment_parser< Segment >::apply(), boost::wave::util::impl::as_string(), boost::wave::util::impl::as_stringlit(), boost::spirit::karma::symbols< Attribute, unused_type, Lookup, CharEncoding, Tag >::at(), boost::numeric::ublas::axpy_prod(), boost::unit_test::fixed_mapping< Key, Value, Compare >::BOOST_PP_REPEAT(), boost::geometry::detail::point_on_surface::calculate_average(), boost::fusion::detail::pair_from< It, is_assoc >::call(), boost::spirit::x3::traits::deref_iterator< Iterator, Enable >::call(), boost::spirit::x3::traits::next_iterator< Iterator, Enable >::call(), boost::spirit::traits::deref_iterator< Iterator >::call(), boost::spirit::traits::next_iterator< Iterator, Enable >::call(), boost::icl::cardinality(), boost::property_tree::ini_parser::detail::check_dupes(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::clear_and_dispose(), boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::clear_and_dispose(), boost::wave::util::macromap< ContextT >::concat_tokensequence(), boost::gil::RandomAccessNDImageViewConcept< View >::constraints(), boost::multi_index::detail::ordered_index< KeyFromValue, Compare, SuperMeta, TagList, Category >::copy_(), boost::spirit::common_tree_match_policy< ast_match_policy< IteratorT, NodeFactoryT, T >, IteratorT, NodeFactoryT, ast_tree_policy< ast_match_policy< IteratorT, NodeFactoryT, T >, NodeFactoryT, T >, T >::create_match(), boost::numeric::ublas::basic_column_major< Z, D >::decrement_i(), boost::numeric::ublas::basic_row_major< Z, D >::decrement_j(), boost::interprocess::ipcdetail::sync_handles::destroy_handle(), dijkstra_shortest_paths(), boost::math::nonfinite_num_get< CharType, InputIterator >::do_get(), boost::msm::back::state_machine< A0, A1, A2, A3, A4 >::handle_defer_helper< StateType, typename enable_if< typename::boost::msm::back::has_fsm_deferred_events< StateType >::type, int >::type >::do_post_handle_deferred(), boost::math::nonfinite_num_put< CharType, OutputIterator >::do_put(), boost::chrono::detail::duration_units_default_initializer_t< CharT >::duration_units_default_initializer_t(), boost::wave::impl::pp_iterator_functor< ContextT >::ensure_is_last_on_line(), boost::geometry::detail::envelope::envelope_range_additional(), boost::polygon::envelope_segments(), boost::algorithm::equals(), boost::multi_index::detail::hashed_index< KeyFromValue, Hash, Pred, SuperMeta, TagList, Category >::equals(), boost::geometry::range::erase(), boost::circular_buffer_space_optimized< T, Alloc >::erase(), boost::container::stable_vector< T, Allocator >::erase(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_after_and_dispose(), boost::intrusive::hashtable_impl< ValueTraits, Hash, Equal, SizeType, BucketTraits, BoolFlags >::erase_and_dispose(), boost::numeric::ublas::mapped_matrix< T, L, A >::erase_element(), boost::numeric::ublas::mapped_vector< T, A >::erase_element(), boost::numeric::ublas::compressed_vector< T, IB, IA, TA >::erase_element(), boost::numeric::ublas::mapped_vector_of_mapped_vector< T, L, A >::erase_element(), boost::numeric::ublas::coordinate_vector< T, IB, IA, TA >::erase_element(), boost::numeric::ublas::compressed_matrix< T, L, IB, IA, TA >::erase_element(), boost::numeric::ublas::coordinate_matrix< T, L, IB, IA, TA >::erase_element(), boost::spirit::lex::less_type< Actor >::eval(), boost::wave::util::macromap< ContextT >::expand_tokensequence_worker(), boost::signals2::slot_base::expired(), boost::wave::impl::pp_iterator_functor< ContextT >::extract_identifier(), boost::chrono::duration_units_default< CharT >::fill_units(), boost::unit_test::basic_cstring< CharT >::find(), boost::numeric::ublas::vector_range< V >::find(), boost::numeric::ublas::vector_unary< E, F >::find(), boost::spirit::karma::symbols< Attribute, T, Lookup, CharEncoding, Tag >::find(), boost::numeric::ublas::map_array< I, T, ALLOC >::find(), boost::spirit::karma::symbols< Attribute, unused_type, Lookup, CharEncoding, Tag >::find(), boost::numeric::ublas::vector_binary_scalar1< E1, E2, F >::find(), boost::numeric::ublas::vector_binary_scalar2< E1, E2, F >::find(), boost::numeric::ublas::generalized_vector_of_vector< T, L, A >::find1(), boost::numeric::ublas::mapped_matrix< T, L, A >::find1(), boost::numeric::ublas::mapped_vector_of_mapped_vector< T, L, A >::find1(), boost::numeric::ublas::compressed_matrix< T, L, IB, IA, TA >::find1(), boost::numeric::ublas::coordinate_matrix< T, L, IB, IA, TA >::find1(), boost::numeric::ublas::generalized_vector_of_vector< T, L, A >::find2(), boost::numeric::ublas::mapped_matrix< T, L, A >::find2(), boost::numeric::ublas::mapped_vector_of_mapped_vector< T, L, A >::find2(), boost::numeric::ublas::compressed_matrix< T, L, IB, IA, TA >::find2(), boost::numeric::ublas::coordinate_matrix< T, L, IB, IA, TA >::find2(), boost::numeric::ublas::mapped_matrix< T, L, A >::find_element(), boost::numeric::ublas::mapped_vector< T, A >::find_element(), boost::numeric::ublas::compressed_vector< T, IB, IA, TA >::find_element(), boost::numeric::ublas::mapped_vector_of_mapped_vector< T, L, A >::find_element(), boost::numeric::ublas::coordinate_vector< T, IB, IA, TA >::find_element(), boost::numeric::ublas::compressed_matrix< T, L, IB, IA, TA >::find_element(), boost::numeric::ublas::coordinate_matrix< T, L, IB, IA, TA >::find_element(), boost::wave::util::include_paths::find_include_file(), boost::BOOST_RT_PARAM_NAMESPACE::environment::rt_env_detail::find_var_record(), for(), boost::spirit::karma::base_kleene< Subject, mpl::false_, kleene< Subject > >::generate(), boost::spirit::karma::base_list< Left, Right, mpl::true_, strict_list< Left, Right > >::generate(), boost::spirit::karma::base_plus< Subject, mpl::false_, plus< Subject > >::generate(), boost::spirit::karma::base_repeat_generator< Subject, LoopIter, mpl::false_, repeat_generator< Subject, LoopIter > >::generate(), boost::spirit::karma::symbols< Attribute, T, Lookup, CharEncoding, Tag >::generate(), boost::spirit::karma::symbols< Attribute, unused_type, Lookup, CharEncoding, Tag >::generate(), boost::wave::util::macromap< ContextT >::get_macro(), boost::spirit::lex::lexertl::functor< Token, FunctorData, Iterator, SupportsActors, SupportsState >::get_next(), boost::BOOST_RT_PARAM_NAMESPACE::file::get_param_subns(), boost::container::get_ptr(), boost::spirit::common_tree_match_policy< ast_match_policy< IteratorT, NodeFactoryT, T >, IteratorT, NodeFactoryT, ast_tree_policy< ast_match_policy< IteratorT, NodeFactoryT, T >, NodeFactoryT, T >, T >::group_match(), boost::geometry::detail::wkt::handle_close_parenthesis(), boost::geometry::detail::wkt::handle_empty_z_m(), boost::geometry::detail::wkt::handle_open_parenthesis(), boost::wave::impl::pp_iterator_functor< ContextT >::handle_pp_directive(), boost::filesystem::hash_value(), in_edges(), boost::range_detail::skip_iterator< Iter, Pred, default_pass >::increment(), boost::numeric::ublas::increment(), boost::numeric::ublas::basic_column_major< Z, D >::increment_i(), boost::numeric::ublas::basic_row_major< Z, D >::increment_j(), boost::polygon::insert(), boost::icl::map< DomainT, CodomainT, Traits, Compare, Combine, Section, Alloc >::insert(), boost::container::deque< T, Allocator >::insert(), boost::container::vector< Value, container_detail::static_storage_allocator< Value, Capacity > >::insert(), boost::interprocess::iunordered_set_index< MapConfig >::insert_commit(), boost::numeric::ublas::compressed_vector< T, IB, IA, TA >::insert_element(), boost::numeric::ublas::compressed_matrix< T, L, IB, IA, TA >::insert_element(), boost::wave::impl::pp_iterator_functor< ContextT >::interpret_pragma(), boost::wave::util::macromap< ContextT >::is_defined(), boost::heap::detail::skew_heap_node< value_type, store_parent_pointer >::is_heap(), boost::wave::util::macromap< ContextT >::is_valid_concat(), boost::wave::util::impl::is_whitespace_only(), boost::spirit::lex::lexertl::detail::data< Iterator, mpl::false_, mpl::false_, TokenValue >::less(), boost::spirit::lex::lexertl::detail::static_data< Iterator, mpl::false_, mpl::false_, TokenValue >::less(), boost::spirit::lex::lexertl::detail::data< Iterator, mpl::true_, HasState, TokenValue >::less(), boost::spirit::lex::lexertl::detail::static_data< Iterator, mpl::true_, HasState, TokenValue >::less(), boost::spirit::lex::lexertl::detail::data< Iterator, mpl::true_, HasState, boost::optional< TokenValue > >::less(), boost::spirit::lex::lexertl::detail::static_data< Iterator, mpl::true_, HasState, boost::optional< TokenValue > >::less(), boost::serialization::load(), boost::signals2::slot_base::lock(), lookup_edge(), loop_erased_random_walk(), boost::wave::util::symbol_table< StringT, MacroDefT >::make_iterator(), make_move_iterator(), boost::gil::detail::make_step_iterator_impl(), boost::iterators::make_transform_iterator(), boost::detail::shared_state_base::mark_finished_internal(), boost::aux::match_traits< ExpressionT, boost_spirit_qi_expression_tag >::matches(), boost::aux::match_traits< spirit::qi::rule< IteratorT, T1, T2, T3, T4 >, boost_spirit_qi_expression_tag >::matches(), boost::geometry::detail::point_on_surface::max_value(), move_inserter(), boost::geometry::ever_circling_iterator< Iterator >::moveto(), boost::multi_index::multi_index_container< adjacency_list_traits< listS, listS, bidirectionalS, listS >::vertex_descriptor, multi_index::indexed_by< multi_index::hashed_unique< multi_index::tag< vertex_name_t >, extract_name_from_vertex > > >::multi_index_container(), boost::wave::impl::impl::next_token_is_pp_directive(), boost::signals2::detail::connection_body< GroupKey, SlotType, Mutex >::nolock_grab_tracked_objects(), boost::detail::basic_condition_variable::notify_all(), boost::detail::basic_condition_variable::notify_one(), boost::interprocess::ipcdetail::sync_handles::obtain_mutex(), boost::interprocess::ipcdetail::sync_handles::obtain_semaphore(), boost::wave::impl::pp_iterator_functor< ContextT >::on_ifdef(), boost::wave::impl::pp_iterator_functor< ContextT >::on_ifndef(), boost::aux::attribute_set_reference_proxy::operator mapped_type(), boost::contains_fun::operator()(), boost::accumulators::impl::weighted_p_square_quantile_impl< Sample, Weight, Impl >::operator()(), boost::accumulators::impl::weighted_p_square_cumulative_distribution_impl< Sample, Weight >::operator()(), boost::iterators::detail::increment_iterator::operator()(), boost::accumulators::impl::weighted_density_impl< Sample, Weight >::operator()(), boost::uuids::basic_random_generator< UniformRandomNumberGenerator >::operator()(), boost::iterators::detail::decrement_iterator::operator()(), boost::accumulators::impl::p_square_cumulative_distribution_impl< Sample >::operator()(), boost::accumulators::impl::p_square_quantile_impl< Sample, Impl >::operator()(), boost::accumulators::impl::density_impl< Sample >::operator()(), boost::accumulators::impl::weighted_extended_p_square_impl< Sample, Weight >::operator()(), boost::iterators::detail::dereference_iterator::operator()(), boost::accumulators::impl::extended_p_square_impl< Sample >::operator()(), boost::random::uniform_on_sphere< RealType, Cont >::operator()(), boost::expressions::pattern_replacer< CharT >::operator()(), boost::value_visitor_invoker< channel_value_type, channel_fallback_policy >::operator()(), boost::expressions::c_ascii_pattern_replacer< CharT >::operator()(), boost::value_extractor< T, FallbackPolicyT, TagT >::operator()(), boost::icl::map< DomainT, CodomainT, Traits, Compare, Combine, Section, Alloc >::operator()(), boost::wave::impl::pp_iterator_functor< ContextT >::operator()(), boost::numeric::ublas::mapped_matrix< T, L, A >::operator()(), boost::numeric::ublas::mapped_vector< T, A >::operator()(), boost::numeric::ublas::compressed_vector< T, IB, IA, TA >::operator()(), boost::spirit::discard_first_node_op::operator()(), boost::spirit::discard_last_node_op::operator()(), boost::spirit::inner_node_op::operator()(), boost::numeric::ublas::mapped_vector_of_mapped_vector< T, L, A >::operator()(), boost::numeric::ublas::coordinate_vector< T, IB, IA, TA >::operator()(), boost::cb_details::iterator< Buff, Traits >::operator<(), boost::attributes::operator<<(), boost::icl::operator<<(), boost::cb_details::iterator< Buff, Traits >::operator<=(), boost::cb_details::iterator< Buff, Traits >::operator>=(), boost::gil::bit_aligned_pixel_iterator< NonAlignedPixelReference >::operator[](), boost::attribute_value_set::operator[](), boost::attribute_set::operator[](), out_edges(), boost::spirit::qi::eol_parser::parse(), boost::basic_format< Ch, Tr, Alloc >::parse(), boost::spirit::qi::any_binary_parser< T, endian, bits >::parse(), boost::spirit::qi::binary_lit_parser< V, T, endian, bits >::parse(), boost::expressions::pattern_replacer< CharT >::pattern_replacer(), boost::wave::util::impl::next_token< IteratorT >::peek(), boost::local_time::posix_time_zone_base< CharT >::posix_time_zone_base(), boost::wave::impl::pp_iterator_functor< ContextT >::pp_directive(), boost::wave::impl::impl::pp_is_last_on_line(), boost::spirit::traits::transform_attribute< iterator_range< Iterator > const, utree, karma::domain >::pre(), boost::numeric::ublas::map_array< I, T, ALLOC >::push_back(), boost::interprocess::ipcdetail::mq_hdr_t< VoidPointer >::queue_free_msg(), random_out_edge(), boost::numeric::ublas::compressed_vector< T, IB, IA, TA >::ref(), boost::numeric::ublas::coordinate_vector< T, IB, IA, TA >::ref(), boost::wave::impl::impl::remove_leading_whitespace(), boost::wave::util::macromap< ContextT >::remove_macro(), boost::wave::util::impl::remove_placeholders(), remove_vertex(), boost::wave::util::macro_definition< TokenT, ContainerT >::replace_parameters(), boost::circular_buffer_space_optimized< T, Alloc >::rerase(), boost::wave::util::macromap< ContextT >::rescan_replacement_list(), boost::wave::util::macromap< ContextT >::resolve_operator_pragma(), boost::accumulators::impl::with_density_median_impl< Sample >::result(), boost::accumulators::impl::with_density_weighted_median_impl< Sample >::result(), boost::accumulators::impl::with_p_square_cumulative_distribution_median_impl< Sample >::result(), boost::accumulators::impl::with_p_square_cumulative_distribution_weighted_median_impl< Sample, Weight >::result(), boost::unit_test::basic_cstring< CharT >::rfind(), boost::serialization::save(), boost::multi_index::multi_index_container< adjacency_list_traits< listS, listS, bidirectionalS, listS >::vertex_descriptor, multi_index::indexed_by< multi_index::hashed_unique< multi_index::tag< vertex_name_t >, extract_name_from_vertex > > >::save(), boost::serialization::stl::save_collection(), boost::serialization::stl::save_hash_collection(), boost::serialization::stl::save_unordered_collection(), boost::spirit::lex::lexertl::detail::data< Iterator, mpl::true_, HasState, TokenValue >::set_end(), boost::spirit::lex::lexertl::detail::static_data< Iterator, mpl::true_, HasState, TokenValue >::set_end(), boost::spirit::lex::lexertl::detail::data< Iterator, mpl::true_, HasState, boost::optional< TokenValue > >::set_end(), boost::spirit::lex::lexertl::detail::static_data< Iterator, mpl::true_, HasState, boost::optional< TokenValue > >::set_end(), boost::wave::impl::impl::skip_to_eol(), boost::wave::impl::pp_iterator_functor< ContextT >::skip_to_eol_with_check(), boost::algorithm::starts_with(), boost::chrono::duration_units_default< CharT >::static_fill_units(), boost::chrono::duration_units_default< CharT >::static_init_valid_units(), boost::io::detail::str2int(), boost::geometry::svg_mapper< Point, SameScale >::text(), boost::wave::cpplexer::token_cache< string_type >::token_cache(), boost::geometry::detail::transform::transform_range_out(), boost::unit_test::basic_cstring< CharT >::trim_left(), boost::wave::util::impl::trim_replacement_list(), boost::unit_test::basic_cstring< CharT >::trim_right(), boost::container::vector_iterator_get_ptr(), boost::range_detail::formatted_range< Iter, Sep, Prefix, Postfix >::write(), and boost::property_tree::ini_parser::write_ini().

edge_iterator boost::last

Referenced by boost::gil::detail::_copy_n(), boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator >::adjacency_matrix(), adjacent_vertices(), boost::algorithm::all_of(), boost::algorithm::all_of_equal(), boost::algorithm::any_of(), boost::algorithm::any_of_equal(), boost::re_detail::basic_regex_creator< charT, traits >::append_set(), boost::tokenizer< TokenizerFunc, Iterator, Type >::assign(), boost::iterator_range_detail::iterator_range_base< IteratorT, incrementable_traversal_tag >::assign(), boost::container::list< T, Allocator >::assign(), boost::container::stable_vector< T, Allocator >::assign(), boost::container::vector< Value, container_detail::static_storage_allocator< Value, Capacity > >::assign(), boost::container::basic_string< CharT, Traits, Allocator >::assign(), boost::spirit::ast_parse(), boost::detail::basic_first_max_element(), boost::detail::basic_first_min_element(), boost::detail::basic_last_max_element(), boost::detail::basic_last_min_element(), boost::detail::basic_last_min_last_max_element(), boost::detail::basic_minmax_element(), BOOST_concept(), boost::spirit::x3::traits::append_container< Container, Enable >::call(), boost::spirit::traits::assign_to_attribute_from_iterators< utree, Iterator >::call(), boost::hawick_circuits_detail::call_hawick_circuits(), boost::spirit::chseq_p(), component_count(), compress_components(), boost::disjoint_sets< vertex_to_vsize_map_t, vertex_to_vertex_map_t >::compress_sets(), boost::disjoint_sets_with_storage< ID, InverseID, FindCompress >::compress_sets(), boost::algorithm::copy_if(), boost::disjoint_sets< vertex_to_vsize_map_t, vertex_to_vertex_map_t >::count_sets(), boost::disjoint_sets_with_storage< ID, InverseID, FindCompress >::count_sets(), boost::spirit::common_tree_match_policy< ast_match_policy< IteratorT, NodeFactoryT, T >, IteratorT, NodeFactoryT, ast_tree_policy< ast_match_policy< IteratorT, NodeFactoryT, T >, NodeFactoryT, T >, T >::create_match(), boost::subgraph< Graph >::create_subgraph(), boost::container::node_allocator< T, NodesPerBlock, Version >::deallocate_many(), boost::container::allocator< T, Version, AllocationDisableMask >::deallocate_many(), edges(), boost::polygon::envelope_segments(), boost::multi_index::detail::random_access_index< SuperMeta, TagList >::erase(), boost::container::basic_string< CharT, Traits, Allocator >::erase(), boost::intrusive::hashtable_impl< ValueTraits, Hash, Equal, SizeType, BucketTraits, BoolFlags >::erase_and_dispose(), boost::wave::grammars::expression_grammar_gen< TokenT >::evaluate(), boost::detail::exhaust_paths(), boost::python::vector_indexing_suite< Container, NoProxy, final_vector_derived_policies< Container, NoProxy > >::extend(), boost::spirit::f_chseq_p(), boost::spirit::f_range_p(), boost::spirit::f_str_p(), boost::unit_test::basic_cstring< CharT >::find(), boost::algorithm::find_if_not(), boost::container::basic_string< CharT, Traits, Allocator >::find_last_not_of(), boost::container::basic_string< CharT, Traits, Allocator >::find_last_of(), floyd_warshall_all_pairs_shortest_paths(), boost::mpl::for_each(), boost::random::rand48::generate(), boost::spirit::get_current_line(), boost::spirit::traits::get_end(), boost::polygon::get_error_rects_shell(), boost::spirit::x3::traits::get_string_end(), boost::spirit::common_tree_match_policy< ast_match_policy< IteratorT, NodeFactoryT, T >, IteratorT, NodeFactoryT, ast_tree_policy< ast_match_policy< IteratorT, NodeFactoryT, T >, NodeFactoryT, T >, T >::group_match(), hash_range(), boost::algorithm::hex(), if(), in_edges(), boost::xpressive::null_regex_traits< Elem >::in_range(), boost::xpressive::c_regex_traits< Char >::in_range(), boost::xpressive::cpp_regex_traits< Char >::in_range(), boost::xpressive::null_regex_traits< Elem >::in_range_nocase(), boost::intrusive::hashtable_impl< ValueTraits, Hash, Equal, SizeType, BucketTraits, BoolFlags >::incremental_rehash(), boost::graph::distributed::hohberg_detail::infimum(), boost::dynamic_bitset< Block, Allocator >::init_from_block_range(), boost::polygon::insert(), boost::multi_index::detail::hashed_index< KeyFromValue, Hash, Pred, SuperMeta, TagList, Category >::insert(), boost::bimaps::container_adaptor::sequence_container_adaptor< Base, Iterator, ConstIterator, ReverseIterator, ConstReverseIterator, IteratorToBaseConverter, IteratorFromBaseConverter, ReverseIteratorFromBaseConverter, ValueToBaseConverter, ValueFromBaseConverter, FunctorsFromDerivedClasses >::insert(), boost::multi_index::detail::ordered_index< KeyFromValue, Compare, SuperMeta, TagList, Category >::insert(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::insert(), boost::geometry::index::rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator >::insert(), boost::container::list< T, Allocator >::insert(), boost::container::deque< T, Allocator >::insert(), boost::container::stable_vector< T, Allocator >::insert(), boost::container::basic_string< CharT, Traits, Allocator >::insert(), boost::container::vector< Value, container_detail::static_storage_allocator< Value, Capacity > >::insert(), boost::container::slist< T, Allocator >::insert_after(), boost::polygon::intersect_segments(), boost::algorithm::iota(), irange(), boost::algorithm::is_partitioned(), boost::algorithm::is_sorted(), boost::algorithm::is_sorted_until(), boost::serialization::load(), boost::dynamic_bitset< Block, Allocator >::m_append(), boost::cb_details::make_assign_range(), make_edge_list(), boost::intrusive::circular_list_algorithms< NodeTraits >::move_forward(), boost::multi_index::multi_index_container< adjacency_list_traits< listS, listS, bidirectionalS, listS >::vertex_descriptor, multi_index::indexed_by< multi_index::hashed_unique< multi_index::tag< vertex_name_t >, extract_name_from_vertex > > >::multi_index_container(), boost::detail::neighbors(), boost::wave::cpplexer::new_lexer_gen< IteratorT, PositionT, TokenT >::new_lexer(), boost::algorithm::none_of(), boost::algorithm::none_of_equal(), normalize_components(), boost::disjoint_sets< vertex_to_vsize_map_t, vertex_to_vertex_map_t >::normalize_sets(), boost::disjoint_sets_with_storage< ID, InverseID, FindCompress >::normalize_sets(), boost::wave::impl::pp_iterator_functor< ContextT >::on_line(), boost::wave::impl::pp_iterator_functor< ContextT >::on_pragma(), boost::multi_index::multi_index_container< adjacency_list_traits< listS, listS, bidirectionalS, listS >::vertex_descriptor, multi_index::indexed_by< multi_index::hashed_unique< multi_index::tag< vertex_name_t >, extract_name_from_vertex > > >::operator=(), boost::dynamic_bitset< Block, Allocator >::operator>>=(), out_edges(), boost::spirit::x3::eoi_parser::parse(), boost::spirit::x3::seek_directive< Subject >::parse(), boost::spirit::qi::eoi_parser::parse(), boost::spirit::qi::stream_parser< Char, T >::parse(), boost::spirit::repository::qi::subrule< ID_, T1, T2 >::parse(), boost::wave::grammars::cpp_grammar_gen< LexIteratorT, TokenContainerT >::parse_cpp_grammar(), boost::wave::grammars::parsetree_parse(), boost::algorithm::partition_copy(), print_file(), boost::spirit::pt_parse(), boost::lockfree::detail::ringbuffer_base< T >::push(), boost::assign::list_inserter< Function, Argument >::range(), boost::assign_detail::generic_list< T >::range(), boost::assign_detail::static_generic_list< T, N >::range(), boost::spirit::range_p(), read_graphviz(), boost::spirit::regex_p(), regex_split(), boost::intrusive::hashtable_impl< ValueTraits, Hash, Equal, SizeType, BucketTraits, BoolFlags >::rehash(), boost::spirit::qi::tst< Char, T >::remove(), boost::spirit::x3::tst< Char, T >::remove(), boost::spirit::x3::tst_map< Char, T >::remove(), boost::spirit::qi::tst_map< Char, T >::remove(), boost::geometry::index::rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator >::remove(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::rerase(), boost::wave::util::macromap< ContextT >::resolve_defined(), boost::wave::impl::impl::retrieve_line_info(), boost::unit_test::basic_cstring< CharT >::rfind(), boost::container::basic_string< CharT, Traits, Allocator >::rfind(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::rinsert(), boost::range_detail::search_n_impl(), boost::range_detail::search_n_pred_impl(), boost::random::lagged_fibonacci_engine< UIntType, w, p, q >::seed(), boost::random::mersenne_twister_engine< UIntType, w, n, m, r, a, u, d, s, b, t, c, l, f >::seed(), boost::random::subtract_with_carry_engine< IntType, w, s, r >::seed(), boost::random::lagged_fibonacci_01_engine< RealType, w, p, q >::seed(), boost::random::subtract_with_carry_01_engine< RealType, w, s, r >::seed(), boost::python::vector_indexing_suite< Container, NoProxy, final_vector_derived_policies< Container, NoProxy > >::set_slice(), boost::multi_index::detail::sequenced_index< SuperMeta, TagList >::splice(), boost::multi_index::detail::random_access_index< SuperMeta, TagList >::splice(), boost::spirit::str_p(), boost::iostreams::detail::chain_base< Self, Ch, Tr, Alloc, Mode >::strict_sync(), boost::mpi::test_all(), boost::mpi::test_any(), boost::mpi::test_some(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::transfer(), boost::wave::impl::impl::trim_whitespace(), boost::cb_details::uninitialized_copy(), boost::cb_details::uninitialized_move_if_noexcept_impl(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::unique(), boost::mpi::wait_all(), boost::mpi::wait_any(), and boost::mpi::wait_some().

std::map<vertex_descriptor, int> boost::low_map

Referenced by boost::detail::rec_two_graphs_common_spanning_trees().

size_type boost::n = 0

Referenced by boost::detail::multi_array::multi_array_impl_base< T, NumDims >::access_element(), boost::locale::date_time_period_set::add(), boost::detail::multi_array::array_iterator< T, TPtr, NumDims, Reference, IteratorCategory >::advance(), boost::mpi::detail::comm_out_edge_iterator::advance(), boost::mpi::detail::comm_adj_iterator::advance(), boost::mpi::all_gather(), boost::mpi::detail::all_gather_impl(), boost::mpi::all_to_all(), boost::mpi::detail::all_to_all_impl(), boost::pool_allocator< T, UserAllocator, Mutex, NextSize, MaxSize >::allocate(), boost::wave::util::flex_string< E, T, A, Storage >::append(), boost::geometry::detail::num_segments::range_count::apply(), boost::geometry::detail::num_points::range_count< AddForOpen >::apply(), boost::geometry::detail::remove_spikes::range_remove_spikes< Ring >::apply(), boost::detail::strong_comp_dispatch2< param_not_found >::apply(), boost::detail::edmonds_karp_dispatch2< param_not_found >::apply(), boost::geometry::detail::conversion::range_to_range< LineString1, LineString2 >::apply(), boost::detail::strong_comp_dispatch1< param_not_found >::apply(), boost::detail::edmonds_karp_dispatch1< param_not_found >::apply(), boost::geometry::detail::wkt::polygon_parser< Polygon >::apply(), boost::geometry::detail::wkt::box_parser< Box >::apply(), boost::rational< IntType >::assign(), boost::multi_index::detail::sequenced_index< SuperMeta, TagList >::assign(), boost::multi_index::detail::random_access_index< SuperMeta, TagList >::assign(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::assign(), boost::circular_buffer_space_optimized< T, Alloc >::assign(), boost::container::vector< Value, container_detail::static_storage_allocator< Value, Capacity > >::assign(), boost::wave::util::flex_string< E, T, A, Storage >::assign(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::at(), boost::container::basic_string< CharT, Traits, Allocator >::at(), boost::container::deque< T, Allocator >::at(), boost::container::vector< Value, container_detail::static_storage_allocator< Value, Capacity > >::at(), boost::wave::util::flex_string< E, T, A, Storage >::at(), boost::bc_clustering_threshold< T >::bc_clustering_threshold(), boost::unordered::unordered_set< T, H, P, A >::begin(), boost::unordered::unordered_map< sync_id, void * >::begin(), boost::unordered::unordered_multiset< T, H, P, A >::begin(), boost::unordered::unordered_multimap< K, T, H, P, A >::begin(), boost::math::detail::bernoulli_number_imp(), boost::math::detail::beta_small_b_large_a_series(), boost::math::binomial_coefficient(), boost::math::binomial_coefficient< float, policies::policy<> >(), boost::parallel::twod_block_cyclic::block_size(), boost::parallel::twod_random::block_size(), boost::concepts::BOOST_concept(), BOOST_concept(), boost::geometry::concept::Segment< Geometry >::BOOST_CONCEPT_USAGE(), boost::geometry::concept::Box< Geometry >::BOOST_CONCEPT_USAGE(), boost::geometry::concept::ConstSegment< Geometry >::BOOST_CONCEPT_USAGE(), boost::geometry::concept::ConstBox< Geometry >::BOOST_CONCEPT_USAGE(), boost::movelib::BOOST_MOVE_DOC1ST(), boost::random::mersenne_twister_engine< UIntType, w, n, m, r, a, u, d, s, b, t, c, l, f >::BOOST_RANDOM_DETAIL_ARITHMETIC_SEED(), boost::random::mersenne_twister_engine< UIntType, w, n, m, r, a, u, d, s, b, t, c, l, f >::BOOST_RANDOM_DETAIL_SEED_SEQ_SEED(), boost::basic_format< Ch, Tr, Alloc >::bound_args(), boost::graph::parallel::detail::brandes_betweenness_centrality_impl(), boost::mpi::detail::broadcast_impl(), boost::intrusive::hashtable_impl< ValueTraits, Hash, Equal, SizeType, BucketTraits, BoolFlags >::bucket_size(), boost::asio::buffer_copy(), boost::graph::distributed::build_reverse_graph(), boost::numeric::odeint::rosenbrock4< Value, Coefficients, Resizer >::calc_state(), boost::detail::multi_array::multi_array_impl_base< T, NumDims >::calculate_descending_dimension_offset(), boost::detail::multi_array::multi_array_impl_base< T, NumDims >::calculate_indexing_offset(), boost::next_prior_detail::next_impl2< T, Distance, true >::call(), boost::next_prior_detail::next_impl1< T, Distance, true >::call(), boost::next_prior_detail::prior_impl2< T, Distance, true >::call(), boost::next_prior_detail::prior_impl1< T, Distance, true >::call(), boost::unordered::unordered_set< T, H, P, A >::cbegin(), boost::unordered::unordered_map< sync_id, void * >::cbegin(), boost::unordered::unordered_multiset< T, H, P, A >::cbegin(), boost::unordered::unordered_multimap< K, T, H, P, A >::cbegin(), boost::intrusive::hashtable_impl< ValueTraits, Hash, Equal, SizeType, BucketTraits, BoolFlags >::cbegin(), boost::math::cdf(), boost::intrusive::hashtable_impl< ValueTraits, Hash, Equal, SizeType, BucketTraits, BoolFlags >::cend(), central_point_dominance(), circle_graph_layout(), boost::circular_buffer< Sample >::circular_buffer(), closeness_centrality(), boost::unit_test::ut_detail::case_ins< CharT >::compare(), boost::unit_test::ut_detail::bcs_char_traits_impl< CharT >::compare(), boost::basic_string_literal< CharT, TraitsT >::compare(), boost::iostreams::detail::chain_client< Chain >::component(), boost::detail::multi_array::multi_array_impl_base< T, NumDims >::compute_strides(), boost::RegexTraitsConcept< traits >::constraints(), boost::gil::detail::RandomAccessIteratorIsMutableConcept< TT >::constraints(), boost::date_time::convert_to_lower(), boost::basic_string_literal< CharT, TraitsT >::copy(), boost::wave::util::flex_string< E, T, A, Storage >::copy(), copy_component(), copy_graph(), boost::algorithm::copy_n(), boost::range::copy_n(), boost::wave::util::flex_string_details::copy_n(), boost::gil::detail::copy_with_2d_iterators(), boost::intrusive::splaytree_algorithms< NodeTraits >::count(), boost::multi_index::detail::ordered_index< KeyFromValue, Compare, SuperMeta, TagList, Category >::count(), boost::intrusive::bstree_algorithms< NodeTraits >::count(), boost::intrusive::bstree_impl< ValueTraits, Compare, SizeType, ConstantTimeSize, RbTreeAlgorithms, HeaderHolder >::count(), count_vertices(), boost::multiprecision::backends::cpp_dec_float< Digits10, ExponentType, Allocator >::cpp_dec_float(), boost::detail::dag_sp_dispatch1(), boost::heap::binomial_heap< T, A0, A1, A2, A3 >::decrease(), boost::numeric::ublas::basic_column_major< Z, D >::decrement_i(), boost::numeric::ublas::basic_row_major< Z, D >::decrement_j(), boost::mpi::detail::serialized_array_irecv_data< T >::deserialize(), boost::detail::dijkstra_dispatch1(), dijkstra_shortest_paths(), boost::random::discrete_distribution< std::size_t, WeightType >::discrete_distribution(), boost::disjoint_sets_with_storage< ID, InverseID, FindCompress >::disjoint_sets_with_storage(), boost::multiprecision::backends::cpp_dec_float< Digits10, ExponentType, Allocator >::div_unsigned_long_long(), boost::locale::dngettext(), boost::locale::dnpgettext(), boost::numeric::odeint::rosenbrock4< Value, Coefficients, Resizer >::do_step(), boost::locale::gnu_gettext::messages_info::domain::domain(), boost::math::double_factorial(), boost::detail::RecordEdgeMapAndCycleVertex< PredEdgeMap, Vertex >::edge_not_minimized(), boost::heap::binomial_heap< T, A0, A1, A2, A3 >::emplace(), boost::heap::fibonacci_heap< T, A0, A1, A2, A3, A4 >::emplace(), boost::heap::pairing_heap< T, A0, A1, A2, A3, A4 >::emplace(), boost::intrusive::hashtable_impl< ValueTraits, Hash, Equal, SizeType, BucketTraits, BoolFlags >::empty(), boost::multi_index::detail::random_access_index< SuperMeta, TagList >::erase(), boost::heap::pairing_heap< T, A0, A1, A2, A3, A4 >::erase(), boost::heap::binomial_heap< T, A0, A1, A2, A3 >::erase(), boost::intrusive::sgtree_impl< ValueTraits, Compare, SizeType, FloatingPoint, HeaderHolder >::erase(), boost::intrusive::treap_impl< ValueTraits, VoidOrKeyComp, VoidOrPrioComp, SizeType, ConstantTimeSize, HeaderHolder >::erase(), boost::intrusive::bstree_impl< ValueTraits, Compare, SizeType, ConstantTimeSize, RbTreeAlgorithms, HeaderHolder >::erase(), boost::container::deque< T, Allocator >::erase(), boost::intrusive::sgtree_impl< ValueTraits, Compare, SizeType, FloatingPoint, HeaderHolder >::erase_and_dispose(), boost::intrusive::treap_impl< ValueTraits, VoidOrKeyComp, VoidOrPrioComp, SizeType, ConstantTimeSize, HeaderHolder >::erase_and_dispose(), boost::intrusive::bstree_impl< ValueTraits, Compare, SizeType, ConstantTimeSize, RbTreeAlgorithms, HeaderHolder >::erase_and_dispose(), boost::intrusive::hashtable_impl< ValueTraits, Hash, Equal, SizeType, BucketTraits, BoolFlags >::erase_and_dispose(), boost::numeric::ublas::compressed_vector< T, IB, IA, TA >::erase_element(), boost::numeric::ublas::coordinate_vector< T, IB, IA, TA >::erase_element(), boost::numeric::ublas::compressed_matrix< T, L, IB, IA, TA >::erase_element(), boost::numeric::ublas::coordinate_matrix< T, L, IB, IA, TA >::erase_element(), boost::graph_detail::erase_if_dispatch(), boost::numeric::odeint::rosenbrock4_controller< Stepper >::error(), boost::multiprecision::backends::eval_exp(), boost::math::detail::expint_as_series(), boost::math::detail::expm1_imp(), boost::re_detail::raw_storage::extend(), boost::basic_format< Ch, Tr, Alloc >::fed_args(), boost::unit_test::ut_detail::bcs_char_traits_impl< CharT >::find(), boost::math::detail::finite_gamma_q(), boost::math::detail::finite_half_gamma_q(), boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), boost::numeric::fmod(), boost::math::ef::fmod(), for(), boost::mpi::gather(), boost::random::seed_seq::generate(), boost::detail::multi_array::multi_array_impl_base< T, NumDims >::generate_array_view(), boost::environment_iterator::get(), boost::intrusive::bstree_algorithms< NodeTraits >::get_header(), boost::chrono::detail::time_get< CharT, InputIterator >::get_up_to_n_digits(), boost::graph::metis_distribution::global(), boost::parallel::global_index_map< VertexIndexMap, VertexGlobalMap >::global_index_map(), boost::re_detail::global_length(), boost::math::detail::ibeta_imp(), in_degree(), boost::heap::binomial_heap< T, A0, A1, A2, A3 >::increase(), boost::heap::fibonacci_heap< T, A0, A1, A2, A3, A4 >::increase(), boost::numeric::ublas::basic_column_major< Z, D >::increment_i(), boost::numeric::ublas::basic_row_major< Z, D >::increment_j(), boost::intrusive::hashtable_impl< ValueTraits, Hash, Equal, SizeType, BucketTraits, BoolFlags >::incremental_rehash(), boost::random::detail::integer_alias_table< IntType, WeightType >::init_average(), boost::graph::detail::initialize_global_index_map(), boost::numeric::ublas::inplace_solve(), boost::multi_index::detail::sequenced_index< SuperMeta, TagList >::insert(), boost::numeric::ublas::map_array< I, T, ALLOC >::insert(), boost::container::deque< T, Allocator >::insert(), boost::wave::util::flex_string< E, T, A, Storage >::insert(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::insert_after(), boost::numeric::ublas::compressed_vector< T, IB, IA, TA >::insert_element(), boost::numeric::ublas::compressed_matrix< T, L, IB, IA, TA >::insert_element(), boost::intrusive::hashtable_impl< ValueTraits, Hash, Equal, SizeType, BucketTraits, BoolFlags >::insert_unique_commit(), integer_log2(), boost::detail::integer_log2_impl(), boost::math::binomial_detail::inverse_binomial_cornish_fisher(), boost::algorithm::iota_n(), kamada_kawai_spring_layout(), boost::math::constants::detail::khinchin_detail::khinchin(), kruskal_minimum_spanning_tree(), boost::math::kurtosis(), boost::math::kurtosis_excess(), boost::uuids::detail::left_rotate(), boost::math::detail::legendre_imp(), boost::math::detail::legendre_p_imp(), lengauer_tarjan_dominator_tree_without_dfs(), boost::sub_match< BidirectionalIterator >::length(), boost::math::detail::lgamma_imp(), boost::serialization::load(), boost::multi_index::multi_index_container< adjacency_list_traits< listS, listS, bidirectionalS, listS >::vertex_descriptor, multi_index::indexed_by< multi_index::hashed_unique< multi_index::tag< vertex_name_t >, extract_name_from_vertex > > >::load(), boost::graph::metis_distribution::local(), boost::gil::detail::__nth_channel_view_basic< View, true >::make(), make_label_writer(), make_one_bit_color_map(), make_shared_array_property_map(), make_two_bit_color_map(), maximum_adjacency_search(), boost::math::mean(), mean_geodesic(), boost::math::median(), boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::merge(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::merge(), boost::io::detail::mk_str(), boost::math::mode(), boost::intrusive::circular_slist_algorithms< NodeTraits >::move_backwards(), boost::intrusive::linear_slist_algorithms< NodeTraits >::move_first_n_backwards(), boost::multiprecision::backends::cpp_dec_float< Digits10, ExponentType, Allocator >::mul_unsigned_long_long(), boost::spirit::x3::extension::negate(), boost::intrusive::bstree_algorithms< NodeTraits >::next_node(), boost::locale::ngettext(), boost::math::detail::non_central_t_cdf(), boost::math::detail::non_central_t_quantile(), boost::graph::parallel::detail::non_distributed_brandes_betweenness_centrality_impl(), boost::convex_topology< 2 >::norm(), boost::numeric::odeint::vector_space_algebra::norm_inf(), boost::locale::normalize(), boost::locale::npgettext(), boost::graph::distributed::number_components(), boost::graph::distributed::number_components_from_parents(), boost::numeric::odeint::mkl_operations::scale_sum2< F1, F2 >::operator()(), boost::intrusive::rbtree_node_cloner< NodeTraits, F >::operator()(), boost::numeric::odeint::mkl_operations::scale_sum3< F1, F2, F3 >::operator()(), boost::detail::dominator_visitor< Graph, IndexMap, TimeMap, PredMap, DomTreePredMap >::operator()(), boost::numeric::odeint::mkl_operations::scale_sum4< F1, F2, F3, F4 >::operator()(), boost::GraphParser< Graph_t, VertexProperty, EdgeProperty, VertexPropertySubset, EdgePropertySubset >::operator()(), boost::random::independent_bits_engine< Engine, w, UIntType >::operator()(), boost::graph::metis_distribution::operator()(), boost::numeric::odeint::mkl_operations::scale_sum5< F1, F2, F3, F4, F5 >::operator()(), boost::graph::detail::isomorphism_impl< Graph1, Graph2 >::operator()(), boost::gil::detail::equal_n_fn< boost::gil::iterator_from_2d< Loc >, I2 >::operator()(), boost::gil::detail::equal_n_fn< I1, boost::gil::iterator_from_2d< Loc > >::operator()(), boost::gil::detail::equal_n_fn< boost::gil::iterator_from_2d< Loc1 >, boost::gil::iterator_from_2d< Loc2 > >::operator()(), boost::move_iterator< It >::operator+(), boost::container::container_detail::deque_iterator< val_alloc_ptr, false >::operator+(), boost::cb_details::iterator< Buff, Traits >::operator+(), boost::cb_details::operator+(), boost::move_iterator< It >::operator+=(), boost::container::container_detail::deque_iterator< val_alloc_ptr, false >::operator+=(), boost::numeric::ublas::matrix_row< M >::const_iterator::operator+=(), boost::numeric::ublas::vector_range< V >::const_iterator::operator+=(), boost::cb_details::iterator< Buff, Traits >::operator+=(), boost::numeric::ublas::symmetric_matrix< T, TRI, L, A >::const_iterator1::operator+=(), boost::numeric::ublas::matrix_row< M >::iterator::operator+=(), boost::numeric::ublas::vector_unary< E, F >::const_iterator::operator+=(), boost::numeric::ublas::triangular_matrix< T, TRI, L, A >::const_iterator1::operator+=(), boost::numeric::ublas::vector_range< V >::iterator::operator+=(), boost::numeric::ublas::vector_matrix_binary< E1, E2, F >::const_iterator1::operator+=(), boost::numeric::ublas::banded_matrix< T, L, A >::const_iterator1::operator+=(), boost::numeric::ublas::symmetric_matrix< T, TRI, L, A >::iterator1::operator+=(), boost::numeric::ublas::triangular_matrix< T, TRI, L, A >::iterator1::operator+=(), boost::numeric::ublas::vector< T, A >::const_iterator::operator+=(), boost::numeric::ublas::hermitian_matrix< T, TRI, L, A >::const_iterator1::operator+=(), boost::numeric::ublas::symmetric_matrix< T, TRI, L, A >::const_iterator2::operator+=(), boost::numeric::ublas::banded_matrix< T, L, A >::iterator1::operator+=(), boost::numeric::ublas::vector_matrix_binary< E1, E2, F >::const_iterator2::operator+=(), boost::numeric::ublas::vector< T, A >::iterator::operator+=(), boost::numeric::ublas::triangular_matrix< T, TRI, L, A >::const_iterator2::operator+=(), boost::numeric::ublas::matrix_column< M >::const_iterator::operator+=(), boost::numeric::ublas::hermitian_matrix< T, TRI, L, A >::iterator1::operator+=(), boost::numeric::ublas::banded_matrix< T, L, A >::const_iterator2::operator+=(), boost::numeric::ublas::symmetric_matrix< T, TRI, L, A >::iterator2::operator+=(), boost::numeric::ublas::matrix_column< M >::iterator::operator+=(), boost::numeric::ublas::vector_slice< V >::const_iterator::operator+=(), boost::numeric::ublas::triangular_matrix< T, TRI, L, A >::iterator2::operator+=(), boost::numeric::ublas::hermitian_matrix< T, TRI, L, A >::const_iterator2::operator+=(), boost::numeric::ublas::vector_slice< V >::iterator::operator+=(), boost::numeric::ublas::banded_matrix< T, L, A >::iterator2::operator+=(), boost::numeric::ublas::matrix_unary1< E, F >::const_iterator1::operator+=(), boost::numeric::ublas::basic_range< Z, D >::const_iterator::operator+=(), boost::numeric::ublas::hermitian_matrix< T, TRI, L, A >::iterator2::operator+=(), boost::numeric::ublas::vector_binary_scalar1< E1, E2, F >::const_iterator::operator+=(), boost::numeric::ublas::matrix_unary1< E, F >::const_iterator2::operator+=(), boost::numeric::ublas::matrix_vector_range< M >::const_iterator::operator+=(), boost::numeric::ublas::basic_slice< Z, D >::const_iterator::operator+=(), boost::numeric::ublas::matrix_vector_range< M >::iterator::operator+=(), boost::numeric::ublas::triangular_adaptor< M, TRI >::const_iterator1::operator+=(), boost::numeric::ublas::vector_binary_scalar2< E1, E2, F >::const_iterator::operator+=(), boost::numeric::ublas::vector_indirect< V, IA >::const_iterator::operator+=(), boost::numeric::ublas::triangular_adaptor< M, TRI >::iterator1::operator+=(), boost::numeric::ublas::vector_indirect< V, IA >::iterator::operator+=(), boost::numeric::ublas::indirect_array< A >::const_iterator::operator+=(), boost::numeric::ublas::matrix_unary2< E, F >::const_iterator1::operator+=(), boost::numeric::ublas::banded_adaptor< M >::const_iterator1::operator+=(), boost::numeric::ublas::symmetric_adaptor< M, TRI >::iterator1::operator+=(), boost::numeric::ublas::triangular_adaptor< M, TRI >::const_iterator2::operator+=(), boost::numeric::ublas::matrix_vector_slice< M >::const_iterator::operator+=(), boost::numeric::ublas::matrix_unary2< E, F >::const_iterator2::operator+=(), boost::numeric::ublas::banded_adaptor< M >::iterator1::operator+=(), boost::numeric::ublas::matrix_vector_slice< M >::iterator::operator+=(), boost::numeric::ublas::triangular_adaptor< M, TRI >::iterator2::operator+=(), boost::numeric::ublas::banded_adaptor< M >::const_iterator2::operator+=(), boost::numeric::ublas::hermitian_adaptor< M, TRI >::iterator1::operator+=(), boost::numeric::ublas::banded_adaptor< M >::iterator2::operator+=(), boost::numeric::ublas::symmetric_adaptor< M, TRI >::iterator2::operator+=(), boost::numeric::ublas::matrix_vector_indirect< M, IA >::const_iterator::operator+=(), boost::numeric::ublas::matrix_vector_indirect< M, IA >::iterator::operator+=(), boost::numeric::ublas::scalar_vector< T, ALLOC >::const_iterator::operator+=(), boost::numeric::ublas::hermitian_adaptor< M, TRI >::iterator2::operator+=(), boost::numeric::ublas::vector_of_vector< T, L, A >::const_iterator1::operator+=(), boost::numeric::ublas::matrix_range< M >::const_iterator1::operator+=(), boost::numeric::ublas::c_vector< T, N >::const_iterator::operator+=(), boost::numeric::ublas::c_vector< T, N >::iterator::operator+=(), boost::numeric::ublas::vector_of_vector< T, L, A >::iterator1::operator+=(), boost::numeric::ublas::matrix_range< M >::iterator1::operator+=(), boost::numeric::ublas::matrix_range< M >::const_iterator2::operator+=(), boost::numeric::ublas::vector_of_vector< T, L, A >::const_iterator2::operator+=(), boost::numeric::ublas::matrix_binary_scalar1< E1, E2, F >::const_iterator1::operator+=(), boost::numeric::ublas::matrix_range< M >::iterator2::operator+=(), boost::numeric::ublas::matrix_binary_scalar1< E1, E2, F >::const_iterator2::operator+=(), boost::numeric::ublas::vector_of_vector< T, L, A >::iterator2::operator+=(), boost::numeric::ublas::matrix_binary_scalar2< E1, E2, F >::const_iterator1::operator+=(), boost::numeric::ublas::matrix_slice< M >::const_iterator1::operator+=(), boost::numeric::ublas::matrix_binary_scalar2< E1, E2, F >::const_iterator2::operator+=(), boost::numeric::ublas::matrix_slice< M >::iterator1::operator+=(), boost::numeric::ublas::matrix_slice< M >::const_iterator2::operator+=(), boost::numeric::ublas::matrix_vector_binary1< E1, E2, F >::const_iterator::operator+=(), boost::numeric::ublas::matrix_slice< M >::iterator2::operator+=(), boost::numeric::ublas::scalar_matrix< T, ALLOC >::const_iterator1::operator+=(), boost::numeric::ublas::matrix_vector_binary2< E1, E2, F >::const_iterator::operator+=(), boost::numeric::ublas::matrix_indirect< M, IA >::const_iterator1::operator+=(), boost::numeric::ublas::scalar_matrix< T, ALLOC >::const_iterator2::operator+=(), boost::numeric::ublas::matrix_indirect< M, IA >::iterator1::operator+=(), boost::numeric::ublas::matrix_matrix_binary< E1, E2, F >::const_iterator1::operator+=(), boost::numeric::ublas::matrix_indirect< M, IA >::const_iterator2::operator+=(), boost::numeric::ublas::matrix_indirect< M, IA >::iterator2::operator+=(), boost::numeric::ublas::matrix_matrix_binary< E1, E2, F >::const_iterator2::operator+=(), boost::numeric::ublas::c_matrix< T, N, M >::const_iterator2::operator+=(), boost::numeric::ublas::c_matrix< T, N, M >::iterator2::operator+=(), boost::move_iterator< It >::operator-(), boost::container::container_detail::deque_iterator< val_alloc_ptr, false >::operator-(), boost::cb_details::iterator< Buff, Traits >::operator-(), boost::move_iterator< It >::operator-=(), boost::container::container_detail::deque_iterator< val_alloc_ptr, false >::operator-=(), boost::numeric::ublas::matrix_row< M >::const_iterator::operator-=(), boost::numeric::ublas::vector_range< V >::const_iterator::operator-=(), boost::numeric::ublas::symmetric_matrix< T, TRI, L, A >::const_iterator1::operator-=(), boost::cb_details::iterator< Buff, Traits >::operator-=(), boost::numeric::ublas::matrix_row< M >::iterator::operator-=(), boost::numeric::ublas::vector_unary< E, F >::const_iterator::operator-=(), boost::numeric::ublas::triangular_matrix< T, TRI, L, A >::const_iterator1::operator-=(), boost::numeric::ublas::vector_range< V >::iterator::operator-=(), boost::numeric::ublas::vector_matrix_binary< E1, E2, F >::const_iterator1::operator-=(), boost::numeric::ublas::banded_matrix< T, L, A >::const_iterator1::operator-=(), boost::numeric::ublas::symmetric_matrix< T, TRI, L, A >::iterator1::operator-=(), boost::numeric::ublas::triangular_matrix< T, TRI, L, A >::iterator1::operator-=(), boost::numeric::ublas::vector< T, A >::const_iterator::operator-=(), boost::numeric::ublas::hermitian_matrix< T, TRI, L, A >::const_iterator1::operator-=(), boost::numeric::ublas::symmetric_matrix< T, TRI, L, A >::const_iterator2::operator-=(), boost::numeric::ublas::banded_matrix< T, L, A >::iterator1::operator-=(), boost::numeric::ublas::vector_matrix_binary< E1, E2, F >::const_iterator2::operator-=(), boost::numeric::ublas::vector< T, A >::iterator::operator-=(), boost::numeric::ublas::triangular_matrix< T, TRI, L, A >::const_iterator2::operator-=(), boost::numeric::ublas::matrix_column< M >::const_iterator::operator-=(), boost::numeric::ublas::hermitian_matrix< T, TRI, L, A >::iterator1::operator-=(), boost::numeric::ublas::banded_matrix< T, L, A >::const_iterator2::operator-=(), boost::numeric::ublas::symmetric_matrix< T, TRI, L, A >::iterator2::operator-=(), boost::numeric::ublas::matrix_column< M >::iterator::operator-=(), boost::numeric::ublas::vector_slice< V >::const_iterator::operator-=(), boost::numeric::ublas::triangular_matrix< T, TRI, L, A >::iterator2::operator-=(), boost::numeric::ublas::hermitian_matrix< T, TRI, L, A >::const_iterator2::operator-=(), boost::numeric::ublas::vector_slice< V >::iterator::operator-=(), boost::numeric::ublas::banded_matrix< T, L, A >::iterator2::operator-=(), boost::numeric::ublas::matrix_unary1< E, F >::const_iterator1::operator-=(), boost::numeric::ublas::basic_range< Z, D >::const_iterator::operator-=(), boost::numeric::ublas::hermitian_matrix< T, TRI, L, A >::iterator2::operator-=(), boost::numeric::ublas::vector_binary_scalar1< E1, E2, F >::const_iterator::operator-=(), boost::numeric::ublas::matrix_unary1< E, F >::const_iterator2::operator-=(), boost::numeric::ublas::matrix_vector_range< M >::const_iterator::operator-=(), boost::numeric::ublas::basic_slice< Z, D >::const_iterator::operator-=(), boost::numeric::ublas::matrix_vector_range< M >::iterator::operator-=(), boost::numeric::ublas::triangular_adaptor< M, TRI >::const_iterator1::operator-=(), boost::numeric::ublas::vector_binary_scalar2< E1, E2, F >::const_iterator::operator-=(), boost::numeric::ublas::vector_indirect< V, IA >::const_iterator::operator-=(), boost::numeric::ublas::triangular_adaptor< M, TRI >::iterator1::operator-=(), boost::numeric::ublas::vector_indirect< V, IA >::iterator::operator-=(), boost::numeric::ublas::indirect_array< A >::const_iterator::operator-=(), boost::numeric::ublas::matrix_unary2< E, F >::const_iterator1::operator-=(), boost::numeric::ublas::banded_adaptor< M >::const_iterator1::operator-=(), boost::numeric::ublas::symmetric_adaptor< M, TRI >::iterator1::operator-=(), boost::numeric::ublas::triangular_adaptor< M, TRI >::const_iterator2::operator-=(), boost::numeric::ublas::matrix_vector_slice< M >::const_iterator::operator-=(), boost::numeric::ublas::matrix_unary2< E, F >::const_iterator2::operator-=(), boost::numeric::ublas::banded_adaptor< M >::iterator1::operator-=(), boost::numeric::ublas::matrix_vector_slice< M >::iterator::operator-=(), boost::numeric::ublas::triangular_adaptor< M, TRI >::iterator2::operator-=(), boost::numeric::ublas::banded_adaptor< M >::const_iterator2::operator-=(), boost::numeric::ublas::hermitian_adaptor< M, TRI >::iterator1::operator-=(), boost::numeric::ublas::banded_adaptor< M >::iterator2::operator-=(), boost::numeric::ublas::symmetric_adaptor< M, TRI >::iterator2::operator-=(), boost::numeric::ublas::matrix_vector_indirect< M, IA >::const_iterator::operator-=(), boost::numeric::ublas::matrix_vector_indirect< M, IA >::iterator::operator-=(), boost::numeric::ublas::scalar_vector< T, ALLOC >::const_iterator::operator-=(), boost::numeric::ublas::hermitian_adaptor< M, TRI >::iterator2::operator-=(), boost::numeric::ublas::vector_of_vector< T, L, A >::const_iterator1::operator-=(), boost::numeric::ublas::matrix_range< M >::const_iterator1::operator-=(), boost::numeric::ublas::c_vector< T, N >::const_iterator::operator-=(), boost::numeric::ublas::c_vector< T, N >::iterator::operator-=(), boost::numeric::ublas::matrix_range< M >::iterator1::operator-=(), boost::numeric::ublas::vector_of_vector< T, L, A >::iterator1::operator-=(), boost::numeric::ublas::matrix_range< M >::const_iterator2::operator-=(), boost::numeric::ublas::vector_of_vector< T, L, A >::const_iterator2::operator-=(), boost::numeric::ublas::matrix_binary_scalar1< E1, E2, F >::const_iterator1::operator-=(), boost::numeric::ublas::matrix_range< M >::iterator2::operator-=(), boost::numeric::ublas::matrix_binary_scalar1< E1, E2, F >::const_iterator2::operator-=(), boost::numeric::ublas::vector_of_vector< T, L, A >::iterator2::operator-=(), boost::numeric::ublas::matrix_binary_scalar2< E1, E2, F >::const_iterator1::operator-=(), boost::numeric::ublas::matrix_slice< M >::const_iterator1::operator-=(), boost::numeric::ublas::matrix_binary_scalar2< E1, E2, F >::const_iterator2::operator-=(), boost::numeric::ublas::matrix_slice< M >::iterator1::operator-=(), boost::numeric::ublas::matrix_slice< M >::const_iterator2::operator-=(), boost::numeric::ublas::matrix_vector_binary1< E1, E2, F >::const_iterator::operator-=(), boost::numeric::ublas::matrix_slice< M >::iterator2::operator-=(), boost::numeric::ublas::scalar_matrix< T, ALLOC >::const_iterator1::operator-=(), boost::numeric::ublas::matrix_vector_binary2< E1, E2, F >::const_iterator::operator-=(), boost::numeric::ublas::matrix_indirect< M, IA >::const_iterator1::operator-=(), boost::numeric::ublas::scalar_matrix< T, ALLOC >::const_iterator2::operator-=(), boost::numeric::ublas::matrix_indirect< M, IA >::iterator1::operator-=(), boost::numeric::ublas::matrix_matrix_binary< E1, E2, F >::const_iterator1::operator-=(), boost::numeric::ublas::matrix_indirect< M, IA >::const_iterator2::operator-=(), boost::numeric::ublas::matrix_indirect< M, IA >::iterator2::operator-=(), boost::numeric::ublas::matrix_matrix_binary< E1, E2, F >::const_iterator2::operator-=(), boost::numeric::ublas::c_matrix< T, N, M >::const_iterator2::operator-=(), boost::numeric::ublas::c_matrix< T, N, M >::iterator2::operator-=(), boost::rational< IntType >::operator<(), boost::dynamic_bitset< Block, Allocator >::operator<<(), boost::container::operator<<(), boost::multiprecision::backends::tommath_int::operator=(), boost::multiprecision::backends::cpp_bin_float< Digits, DigitBase, Allocator, Exponent, MinExponent, MaxExponent >::operator=(), boost::multiprecision::backends::gmp_int::operator=(), boost::container::operator==(), boost::dynamic_bitset< Block, Allocator >::operator>>(), operator>>(), boost::detail::vector_matrix< Value >::operator[](), boost::accumulators::detail::lvalue_index_iterator< Base >::operator[](), boost::bimaps::views::vector_set_view< CoreIndex >::operator[](), boost::bimaps::views::vector_map_view< Tag, BimapType >::operator[](), boost::move_iterator< It >::operator[](), boost::bimaps::container_adaptor::vector_adaptor< Base, Iterator, ConstIterator, ReverseIterator, ConstReverseIterator, IteratorToBaseConverter, IteratorFromBaseConverter, ReverseIteratorFromBaseConverter, ValueToBaseConverter, ValueFromBaseConverter, FunctorsFromDerivedClasses >::operator[](), boost::range_detail::sub_range_base< ForwardRange, random_access_traversal_tag >::operator[](), boost::container::container_detail::deque_iterator< val_alloc_ptr, false >::operator[](), boost::numeric::ublas::matrix_row< M >::const_iterator::operator[](), boost::indexable< T, D, R, B >::operator[](), boost::numeric::ublas::vector_range< V >::const_iterator::operator[](), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::operator[](), boost::numeric::ublas::symmetric_matrix< T, TRI, L, A >::const_iterator1::operator[](), boost::cb_details::iterator< Buff, Traits >::operator[](), boost::numeric::ublas::matrix_row< M >::iterator::operator[](), boost::numeric::ublas::vector_unary< E, F >::const_iterator::operator[](), boost::numeric::ublas::triangular_matrix< T, TRI, L, A >::const_iterator1::operator[](), boost::numeric::ublas::vector_range< V >::iterator::operator[](), boost::locale::date_time_period_set::operator[](), boost::numeric::ublas::vector_matrix_binary< E1, E2, F >::const_iterator1::operator[](), boost::numeric::ublas::matrix< T, L, A >::const_iterator1::operator[](), boost::numeric::ublas::banded_matrix< T, L, A >::const_iterator1::operator[](), boost::numeric::ublas::symmetric_matrix< T, TRI, L, A >::iterator1::operator[](), boost::numeric::ublas::triangular_matrix< T, TRI, L, A >::iterator1::operator[](), boost::numeric::ublas::vector< T, A >::const_iterator::operator[](), boost::numeric::ublas::hermitian_matrix< T, TRI, L, A >::const_iterator1::operator[](), boost::numeric::ublas::symmetric_matrix< T, TRI, L, A >::const_iterator2::operator[](), boost::numeric::ublas::matrix< T, L, A >::iterator1::operator[](), boost::numeric::ublas::banded_matrix< T, L, A >::iterator1::operator[](), boost::numeric::ublas::vector_matrix_binary< E1, E2, F >::const_iterator2::operator[](), boost::numeric::ublas::vector< T, A >::iterator::operator[](), boost::iterators::detail::iterator_facade_base< Derived, Value, CategoryOrTraversal, Reference, Difference, true, true >::operator[](), boost::numeric::ublas::triangular_matrix< T, TRI, L, A >::const_iterator2::operator[](), boost::numeric::ublas::matrix_column< M >::const_iterator::operator[](), boost::numeric::ublas::hermitian_matrix< T, TRI, L, A >::iterator1::operator[](), boost::leda_node_property_map< E, ERef, NodeMapPtr >::operator[](), boost::numeric::ublas::matrix< T, L, A >::const_iterator2::operator[](), boost::numeric::ublas::banded_matrix< T, L, A >::const_iterator2::operator[](), boost::numeric::ublas::symmetric_matrix< T, TRI, L, A >::iterator2::operator[](), boost::numeric::ublas::vector_binary< E1, E2, F >::const_iterator::operator[](), boost::numeric::ublas::matrix_column< M >::iterator::operator[](), boost::numeric::ublas::vector_slice< V >::const_iterator::operator[](), boost::numeric::ublas::triangular_matrix< T, TRI, L, A >::iterator2::operator[](), boost::leda_edge_property_map< E, ERef, EdgeMapPtr >::operator[](), boost::numeric::ublas::hermitian_matrix< T, TRI, L, A >::const_iterator2::operator[](), boost::numeric::ublas::vector_slice< V >::iterator::operator[](), boost::numeric::ublas::matrix< T, L, A >::iterator2::operator[](), boost::numeric::ublas::banded_matrix< T, L, A >::iterator2::operator[](), boost::numeric::ublas::matrix_unary1< E, F >::const_iterator1::operator[](), boost::numeric::ublas::basic_range< Z, D >::const_iterator::operator[](), boost::container::basic_string< CharT, Traits, Allocator >::operator[](), boost::numeric::ublas::hermitian_matrix< T, TRI, L, A >::iterator2::operator[](), boost::numeric::ublas::vector_binary_scalar1< E1, E2, F >::const_iterator::operator[](), boost::container::stable_vector< T, Allocator >::operator[](), boost::numeric::ublas::matrix_unary1< E, F >::const_iterator2::operator[](), boost::numeric::ublas::matrix_vector_range< M >::const_iterator::operator[](), boost::numeric::ublas::basic_slice< Z, D >::const_iterator::operator[](), boost::container::vector< Value, container_detail::static_storage_allocator< Value, Capacity > >::operator[](), boost::numeric::ublas::matrix_vector_range< M >::iterator::operator[](), boost::numeric::ublas::triangular_adaptor< M, TRI >::const_iterator1::operator[](), boost::numeric::ublas::vector_binary_scalar2< E1, E2, F >::const_iterator::operator[](), boost::numeric::ublas::vector_indirect< V, IA >::const_iterator::operator[](), boost::numeric::ublas::symmetric_adaptor< M, TRI >::const_iterator1::operator[](), boost::numeric::ublas::triangular_adaptor< M, TRI >::iterator1::operator[](), boost::numeric::ublas::vector_indirect< V, IA >::iterator::operator[](), boost::numeric::ublas::indirect_array< A >::const_iterator::operator[](), boost::numeric::ublas::matrix_unary2< E, F >::const_iterator1::operator[](), boost::numeric::ublas::banded_adaptor< M >::const_iterator1::operator[](), boost::numeric::ublas::symmetric_adaptor< M, TRI >::iterator1::operator[](), boost::numeric::ublas::triangular_adaptor< M, TRI >::const_iterator2::operator[](), boost::numeric::ublas::matrix_vector_slice< M >::const_iterator::operator[](), boost::numeric::ublas::hermitian_adaptor< M, TRI >::const_iterator1::operator[](), boost::numeric::ublas::matrix_unary2< E, F >::const_iterator2::operator[](), boost::numeric::ublas::banded_adaptor< M >::iterator1::operator[](), boost::numeric::ublas::matrix_vector_slice< M >::iterator::operator[](), boost::numeric::ublas::triangular_adaptor< M, TRI >::iterator2::operator[](), boost::numeric::ublas::symmetric_adaptor< M, TRI >::const_iterator2::operator[](), boost::numeric::ublas::banded_adaptor< M >::const_iterator2::operator[](), boost::numeric::ublas::hermitian_adaptor< M, TRI >::iterator1::operator[](), boost::numeric::ublas::symmetric_adaptor< M, TRI >::iterator2::operator[](), boost::numeric::ublas::banded_adaptor< M >::iterator2::operator[](), boost::numeric::ublas::matrix_vector_indirect< M, IA >::const_iterator::operator[](), boost::numeric::ublas::hermitian_adaptor< M, TRI >::const_iterator2::operator[](), boost::numeric::ublas::matrix_vector_indirect< M, IA >::iterator::operator[](), boost::numeric::ublas::scalar_vector< T, ALLOC >::const_iterator::operator[](), boost::numeric::ublas::matrix_binary< E1, E2, F >::const_iterator1::operator[](), boost::numeric::ublas::hermitian_adaptor< M, TRI >::iterator2::operator[](), boost::numeric::ublas::matrix_binary< E1, E2, F >::const_iterator2::operator[](), boost::numeric::ublas::vector_of_vector< T, L, A >::const_iterator1::operator[](), boost::numeric::ublas::matrix_range< M >::const_iterator1::operator[](), boost::numeric::ublas::c_vector< T, N >::const_iterator::operator[](), boost::numeric::ublas::c_vector< T, N >::iterator::operator[](), boost::numeric::ublas::matrix_range< M >::iterator1::operator[](), boost::numeric::ublas::vector_of_vector< T, L, A >::iterator1::operator[](), boost::numeric::ublas::matrix_range< M >::const_iterator2::operator[](), boost::numeric::ublas::vector_of_vector< T, L, A >::const_iterator2::operator[](), boost::numeric::ublas::matrix_binary_scalar1< E1, E2, F >::const_iterator1::operator[](), boost::numeric::ublas::matrix_range< M >::iterator2::operator[](), boost::numeric::ublas::matrix_binary_scalar1< E1, E2, F >::const_iterator2::operator[](), boost::numeric::ublas::vector_of_vector< T, L, A >::iterator2::operator[](), boost::numeric::ublas::matrix_binary_scalar2< E1, E2, F >::const_iterator1::operator[](), boost::numeric::ublas::matrix_slice< M >::const_iterator1::operator[](), boost::numeric::ublas::matrix_binary_scalar2< E1, E2, F >::const_iterator2::operator[](), boost::numeric::ublas::matrix_slice< M >::iterator1::operator[](), boost::numeric::ublas::matrix_slice< M >::const_iterator2::operator[](), boost::numeric::ublas::matrix_vector_binary1< E1, E2, F >::const_iterator::operator[](), boost::numeric::ublas::matrix_slice< M >::iterator2::operator[](), boost::numeric::ublas::scalar_matrix< T, ALLOC >::const_iterator1::operator[](), boost::numeric::ublas::matrix_vector_binary2< E1, E2, F >::const_iterator::operator[](), boost::numeric::ublas::matrix_indirect< M, IA >::const_iterator1::operator[](), boost::numeric::ublas::scalar_matrix< T, ALLOC >::const_iterator2::operator[](), boost::numeric::ublas::matrix_indirect< M, IA >::iterator1::operator[](), boost::numeric::ublas::matrix_matrix_binary< E1, E2, F >::const_iterator1::operator[](), boost::numeric::ublas::matrix_indirect< M, IA >::const_iterator2::operator[](), boost::numeric::ublas::matrix_indirect< M, IA >::iterator2::operator[](), boost::numeric::ublas::matrix_matrix_binary< E1, E2, F >::const_iterator2::operator[](), boost::numeric::ublas::c_matrix< T, N, M >::const_iterator1::operator[](), boost::numeric::ublas::c_matrix< T, N, M >::iterator1::operator[](), boost::numeric::ublas::c_matrix< T, N, M >::const_iterator2::operator[](), boost::numeric::ublas::c_matrix< T, N, M >::iterator2::operator[](), out_degree(), boost::math::detail::owens_t_T1_accelerated(), boost::math::detail::owens_t_T2_accelerated(), boost::random::piecewise_constant_distribution< RealType, WeightType >::param_type::param_type(), boost::random::piecewise_linear_distribution< RealType >::param_type::param_type(), boost::random::discrete_distribution< IntType, WeightType >::param_type::param_type(), boost::spirit::fixed_loop< ParserT, ExactT >::parse(), boost::spirit::x3::extract_real< T, RealPolicies >::parse(), boost::spirit::infinite_loop< ParserT, MinT >::parse(), boost::spirit::qi::binary_lit_parser< V, T, endian, bits >::parse(), boost::io::detail::parse_printf_directive(), boost::math::pdf(), boost::numeric::odeint::rosenbrock4< Value, Coefficients, Resizer >::prepare_dense_output(), boost::math::prime(), boost::spirit::karma::simple_trace::print_indent(), boost::spirit::x3::simple_trace< IndentSpaces, CharsToPrint >::print_indent(), boost::spirit::qi::simple_trace::print_indent(), boost::container::deque_base< Allocator >::priv_deallocate_map(), boost::container::deque_base< Allocator >::priv_destroy_nodes(), boost::heap::binomial_heap< T, A0, A1, A2, A3 >::push(), boost::heap::pairing_heap< T, A0, A1, A2, A3, A4 >::push(), boost::heap::fibonacci_heap< T, A0, A1, A2, A3, A4 >::push(), boost::parallel::random_distribution::random_distribution(), random_edge(), random_vertex(), boost::math::range(), boost::geometry::detail::centroid::range_ok(), boost::re_detail::raw_storage::raw_storage(), boost::iostreams::basic_line_filter< Ch, Alloc >::read(), boost::iostreams::symmetric_filter< detail::bzip2_decompressor_impl< Alloc >, Alloc >::read(), boost::iostreams::detail::read_filter_impl< any_tag >::read(), boost::iostreams::code_converter< Device, Codecvt, Alloc >::read(), boost::detail::read_dimacs_max_flow_internal(), boost::asio::ssl::stream< Stream >::read_some(), boost::multi_index::detail::hashed_index< KeyFromValue, Hash, Pred, SuperMeta, TagList, Category >::rehash(), boost::intrusive::hashtable_impl< ValueTraits, Hash, Equal, SizeType, BucketTraits, BoolFlags >::rehash(), relative_betweenness_centrality(), boost::basic_format< Ch, Tr, Alloc >::remaining_args(), boost::multi_index::detail::random_access_index< SuperMeta, TagList >::remove(), boost::multi_index::detail::random_access_index< SuperMeta, TagList >::remove_if(), boost::basic_string_ref< charT, traits >::remove_prefix(), boost::basic_string_ref< charT, traits >::remove_suffix(), boost::lockfree::stack< T, A0, A1, A2 >::reserve(), boost::lockfree::queue< T, A0, A1, A2 >::reserve(), boost::asio::basic_streambuf< Allocator >::reserve(), boost::lockfree::stack< T, A0, A1, A2 >::reserve_unsafe(), boost::lockfree::queue< T, A0, A1, A2 >::reserve_unsafe(), boost::wave::util::AllocatorStringStorage< E, A >::resize(), boost::accumulators::impl::tail_quantile_impl< Sample, LeftRight >::result(), boost::accumulators::impl::coherent_tail_mean_impl< Sample, LeftRight >::result(), boost::accumulators::impl::weighted_tail_quantile_impl< Sample, Weight, LeftRight >::result(), boost::accumulators::impl::tail_variate_means_impl< Sample, Impl, LeftRight, VariateTag >::result(), boost::accumulators::impl::non_coherent_weighted_tail_mean_impl< Sample, Weight, LeftRight >::result(), boost::accumulators::impl::weighted_tail_variate_means_impl< Sample, Weight, Impl, LeftRight, VariateType >::result(), boost::accumulators::impl::non_coherent_tail_mean_impl< Sample, LeftRight >::result(), boost::accumulators::impl::weighted_peaks_over_threshold_prob_impl< Sample, Weight, LeftRight >::result(), boost::accumulators::impl::peaks_over_threshold_prob_impl< Sample, LeftRight >::result(), boost::intrusive::circular_list_algorithms< NodeTraits >::reverse(), boost::container::basic_string< CharT, Traits, Allocator >::rfind(), boost::math::detail::rising_factorial_imp(), boost::circular_buffer< Sample >::rotate(), boost::graph::detail::parallel_dijkstra_impl< ::boost::param_not_found >::run(), boost::serialization::save(), boost::mpi::detail::scatter_impl(), boost::range_detail::search_n_impl(), boost::range_detail::search_n_pred_impl(), boost::random::mersenne_twister_engine< UIntType, w, n, m, r, a, u, d, s, b, t, c, l, f >::seed(), boost::interprocess::basic_bufferbuf< CharT, CharTraits >::seekoff(), boost::multiprecision::backends::rational_adaptor< IntBackend >::serialize(), boost::iostreams::detail::chain_base< chain< Mode, Ch, Tr, Alloc >, Ch, Tr, Alloc, Mode >::set_device_buffer_size(), boost::iostreams::detail::chain_base< chain< Mode, Ch, Tr, Alloc >, Ch, Tr, Alloc, Mode >::set_filter_buffer_size(), boost::match_results< BidirectionalIterator >::set_first(), boost::iostreams::detail::chain_base< chain< Mode, Ch, Tr, Alloc >, Ch, Tr, Alloc, Mode >::set_pback_size(), boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::shift_backwards(), boost::intrusive::list_impl< ValueTraits, SizeType, ConstantTimeSize, HeaderHolder >::shift_forward(), boost::intrusive::hashtable_impl< ValueTraits, Hash, Equal, SizeType, BucketTraits, BoolFlags >::size(), boost::math::skewness(), boost::math::spherical_harmonic(), boost::multi_index::detail::random_access_index< SuperMeta, TagList >::splice(), boost::container::list< T, Allocator >::splice(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice(), boost::container::slist< T, Allocator >::splice_after(), stoer_wagner_min_cut(), boost::container::container_detail::string_fill(), boost::basic_string_ref< charT, traits >::substr(), boost::intrusive::bstree_algorithms< NodeTraits >::subtree_size(), boost::mpi::test_all(), boost::detail::isomorphism_algo< Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2 >::test_isomorphism(), boost::graph_test< Graph >::test_vertex_list_graph(), boost::intrusive::trivial_value_traits< NodeTraits, LinkMode >::to_value_ptr(), boost::intrusive::circular_list_algorithms< NodeTraits >::transfer(), transitive_closure(), boost::detail::transitive_closure_dispatch(), boost::locale::translate(), boost::mpi::group::translate_ranks(), boost::mpi::detail::tree_reduce_impl(), boost::cb_details::uninitialized_fill_n_with_alloc(), boost::multi_index::detail::random_access_index< SuperMeta, TagList >::unique(), boost::heap::pairing_heap< T, A0, A1, A2, A3, A4 >::update(), boost::heap::fibonacci_heap< T, A0, A1, A2, A3, A4 >::update(), boost::heap::fibonacci_heap< T, A0, A1, A2, A3, A4 >::update_lazy(), boost::mpi::detail::upper_lower_scan(), boost::math::variance(), boost::container::vector< Value, container_detail::static_storage_allocator< Value, Capacity > >::vector(), boost::container::container_detail::vector_alloc_holder< Allocator, container_detail::integral_constant< unsigned, 0 > >::vector_alloc_holder(), vertex(), boost::graph::metis_reader::vertex_weight(), boost::convex_topology< 2 >::volume(), boost::mpi::wait_any(), boost::mpi::wait_some(), boost::graph::weight_degree_dist(), boost::iostreams::back_insert_device< Container >::write(), boost::iostreams::basic_null_device< Ch, input >::write(), boost::iostreams::aggregate_filter< Ch, Alloc >::write(), boost::iostreams::basic_line_filter< Ch, Alloc >::write(), boost::iostreams::non_blocking_sink::write(), boost::iostreams::detail::write_filter_impl< any_tag >::write(), boost::iostreams::tee_device< Device, Sink >::write(), boost::iostreams::code_converter< Device, Codecvt, Alloc >::write(), boost::asio::ssl::stream< Stream >::write_some(), boost::basic_nullbuf< CharType, CharTraits >::xsputn(), boost::math::constants::detail::detail::zeta_derivative_2(), boost::math::detail::zeta_polynomial_series(), boost::math::constants::detail::khinchin_detail::zeta_polynomial_series(), boost::math::constants::detail::detail::zeta_series_2(), and boost::math::constants::detail::detail::zeta_series_derivative_2().

BOOST_LOG_OPEN_NAMESPACE typedef mpl::vector< std::time_t, std::tm> boost::native_date_time_types

An MPL-sequence of natively supported date and time types of attributes.

BOOST_CONSTEXPR_OR_CONST no_block_tag boost::no_block = {}

none_t const boost::none = (static_cast<none_t>(0))

Referenced by BOOST_SCOPED_ENUM_DECLARE_BEGIN(), boost::filesystem::BOOST_SCOPED_ENUM_START(), boost::python::detail::return_none::apply< T >::type::get_pytype(), boost::iterators::impl::function_input_iterator< Function, Input >::increment(), boost::iterators::impl::function_pointer_input_iterator< Function *, Input >::increment(), boost::python::detail::install_holder< T >::operator()(), operator>>(), boost::optional_detail::swap_selector< true >::optional_swap(), boost::optional_detail::swap_selector< false >::optional_swap(), boost::relaxed_heap< vertex_descriptor, queue_compare_type, VertexIndexMap >::pop(), and boost::relaxed_heap< vertex_descriptor, queue_compare_type, VertexIndexMap >::top().

T& boost::out

Referenced by boost::geometry::detail::convex_hull::hull_insert< Order, Closure >::apply(), boost::geometry::strategy::simplify::detail::douglas_peucker< Point, PointDistanceStrategy, LessCompare >::apply(), boost::geometry::detail::wkt::container_inserter< Point >::apply(), boost::geometry::resolve_variant::simplify< boost::variant< BOOST_VARIANT_ENUM_PARAMS(T)> >::apply(), boost::io::basic_altstringbuf< Ch, Tr, Alloc >::begin(), boost::math::detail::bernoulli_number_imp(), boost::algorithm::clamp_range(), boost::io::basic_altstringbuf< Ch, Tr, Alloc >::clear_buffer(), boost::iostreams::close(), boost::iostreams::detail::combined_device< Source, Sink >::close(), boost::iostreams::aggregate_filter< Ch, Alloc >::close(), boost::iostreams::detail::composite_device< Filter, Device, Mode >::close(), boost::iostreams::detail::combined_filter< InputFilter, OutputFilter >::close(), boost::iostreams::basic_line_filter< Ch, Alloc >::close(), boost::iostreams::symmetric_filter< detail::bzip2_decompressor_impl< Alloc >, Alloc >::close(), boost::iostreams::detail::close_impl< any_tag >::close(), boost::iostreams::detail::code_converter_impl< Device, Codecvt, Alloc >::close(), boost::iostreams::detail::composite_filter< Filter1, Filter2, Mode >::close(), boost::iostreams::detail::close_impl< close_boost_stream >::close(), boost::iostreams::basic_gzip_compressor< Alloc >::close(), boost::iostreams::basic_gzip_decompressor< Alloc >::close(), boost::iostreams::detail::close_all(), boost::BoostRegexConcept< Regex >::constraints(), boost::range::copy_n(), boost::io::basic_altstringbuf< Ch, Tr, Alloc >::cur_size(), boost::geometry::detail::difference::difference_insert(), boost::graph::parallel::detail::do_brandes_sssp(), boost::re_detail::do_regex_replace(), boost::locale::utf::utf_traits< CharType, 1 >::encode(), boost::locale::utf::utf_traits< CharType, 2 >::encode(), boost::locale::utf::utf_traits< CharType, 4 >::encode(), boost::graph::detail::edge_list_storage< std_list, Edge >::get_list(), boost::detail::dynamic_property_map_adaptor< PropertyMap >::get_string(), boost::algorithm::hex(), boost::attribute_set::insert(), boost::attribute_value_set::insert(), boost::algorithm::iota_n(), main(), boost::graph::distributed::detail::marshal_set(), boost::iostreams::basic_file_source< Ch >::open(), boost::filesystem::basic_ofstream< charT, traits >::open(), boost::iostreams::basic_file_sink< Ch >::open(), boost::filesystem::basic_fstream< charT, traits >::open(), boost::iostreams::mapped_file_source::open(), boost::iostreams::mapped_file_sink::open(), boost::spirit::x3::operator<<(), boost::spirit::operator<<(), boost::range_detail::operator<<(), boost::test_tools::operator<<(), boost::logic::operator<<(), operator<<(), boost::locale::boundary::operator<<(), boost::locale::operator<<(), boost::io::basic_altstringbuf< Ch, Tr, Alloc >::overflow(), boost::interprocess::basic_bufferbuf< CharT, CharTraits >::overflow(), boost::range::overwrite(), boost::random::seed_seq::param(), boost::io::basic_altstringbuf< Ch, Tr, Alloc >::pbackfail(), boost::interprocess::basic_bufferbuf< CharT, CharTraits >::pbackfail(), boost::graph::accounting::print_time(), regex_replace(), boost::xpressive::regex_replace(), boost::xpressive::detail::regex_replace_impl(), regex_split(), boost::interprocess::basic_vectorbuf< CharVector, CharTraits >::reserve(), boost::graph::parallel::detail::betweenness_centrality_delta_stepping_impl< Graph, DistanceMap, IncomingMap, EdgeWeightMap, PathCountMap >::run(), boost::re_detail::parser_buf< charT, traits >::seekoff(), boost::io::basic_altstringbuf< Ch, Tr, Alloc >::seekoff(), boost::interprocess::basic_bufferbuf< CharT, CharTraits >::seekoff(), boost::interprocess::basic_vectorbuf< CharVector, CharTraits >::seekoff(), boost::re_detail::parser_buf< charT, traits >::seekpos(), boost::io::basic_altstringbuf< Ch, Tr, Alloc >::seekpos(), boost::graph::distributed::send_oob(), boost::io::basic_altstringbuf< Ch, Tr, Alloc >::size(), boost::io::basic_altstringbuf< Ch, Tr, Alloc >::str(), boost::interprocess::basic_vectorbuf< CharVector, CharTraits >::swap_vector(), boost::geometry::detail::sym_difference::sym_difference_insert(), boost::mpi::test_all(), boost::iostreams::test_input_filter(), boost::iostreams::test_output_filter(), to_string(), boost::range_detail::transform_impl(), boost::mpi::group::translate_ranks(), boost::algorithm::unhex(), boost::graph::distributed::detail::unmarshal_set(), boost::numeric::odeint::unsplit_impl< mpi_state< InnerState >, Target, typename boost::enable_if< boost::has_range_iterator< Target > >::type >::unsplit(), boost::numeric::odeint::unsplit_impl< openmp_state< typename TargetContainer::value_type >, TargetContainer >::unsplit(), boost::interprocess::basic_vectorbuf< CharVector, CharTraits >::vector(), boost::mpi::wait_all(), boost::mpi::wait_some(), boost::iostreams::code_converter< Device, Codecvt, Alloc >::write(), boost::iostreams::basic_gzip_decompressor< Alloc >::write(), write_graphviz(), boost::detail::write_graphviz_subgraph(), write_property(), and boost::lockfree::detail::runtime_sized_ringbuffer< T, Alloc >::~runtime_sized_ringbuffer().

std::map<vertex_descriptor, vertex_descriptor> boost::pred_map

Referenced by boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), kruskal_minimum_spanning_tree(), and boost::detail::rec_two_graphs_common_spanning_trees().

BOOST_LOG_OPEN_NAMESPACE typedef boost::log::aux::process::id boost::process_id

Process identifier type used by the library.

Referenced by add_common_attributes(), boost::compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::add_vertex(), boost::compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::add_vertices(), boost::compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::compressed_sparse_row_graph(), boost::graph::parallel::detail::do_brandes_sssp(), edge(), get(), boost::compressed_sparse_row_graph< directedS, VertexProperty, EdgeProperty, GraphProperty, distributedS< ProcessGroup, InVertex, InDistribution >, InEdgeIndex >::local_to_global_vertex(), boost::graph::parallel::detail::non_distributed_brandes_betweenness_centrality_impl(), boost::graph_id_writer< Graph >::operator()(), boost::is_local_vertex< DistributedGraph >::operator()(), boost::local_property_map< ProcessGroup, GlobalMap, StorageMap >::operator[](), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::processor(), put(), boost::detail::parallel::remove_in_edge(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::remove_local_edge(), boost::graph::parallel::detail::betweenness_centrality_delta_stepping_impl< Graph, DistanceMap, IncomingMap, EdgeWeightMap, PathCountMap >::run(), boost::scalable_rmat_iterator< ProcessGroup, Distribution, RandomGenerator, Graph >::scalable_rmat_iterator(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::send_remove_edge_request(), and write_graphviz().

class BOOST_REGEX_DECL boost::scoped_static_mutex_lock

BOOST_FUNCTION_NUM_ARGS boost::self_type

Referenced by boost::unit_test::basic_cstring< CharT >::assign(), boost::unit_test::basic_cstring< CharT >::operator=(), and boost::unit_test::basic_cstring< CharT >::substr().

void boost::swap ( rhs  )

inline

Referenced by boost::wave::util::macromap< ContextT >::add_macro(), boost::fibonacci_heap< T, Compare, ID >::add_tree_to_new_roots(), boost::multiprecision::backends::add_unsigned(), boost::spirit::lex::lexertl::detail::data< Iterator, mpl::true_, HasState, TokenValue >::adjust_start(), boost::spirit::lex::lexertl::detail::static_data< Iterator, mpl::true_, HasState, TokenValue >::adjust_start(), boost::spirit::lex::lexertl::detail::data< Iterator, mpl::true_, HasState, boost::optional< TokenValue > >::adjust_start(), boost::spirit::lex::lexertl::detail::static_data< Iterator, mpl::true_, HasState, boost::optional< TokenValue > >::adjust_start(), boost::geometry::detail::transform::transform_box::apply(), boost::numeric::ublas::scalar_swap< T1, T2 >::apply(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::assign(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::assign(), boost::edmonds_augmenting_path_finder< Graph, MateMap, VertexIndexMap >::augment_matching(), boost::numeric::ublas::axpy_lu_factorize(), boost::math::detail::beta_imp(), BOOST_THREAD_DCL_MOVABLE_BEG(), boost::re_detail::bubble_down_one(), boost::spirit::ast_tree_policy< MatchPolicyT, NodeFactoryT, T >::concat(), boost::gil::Swappable< T >::constraints(), boost::BaseRegexConcept< Regex >::constraints(), boost::gil::detail::ChannelIsMutableConcept< T >::constraints(), boost::polygon::construct(), boost::spirit::impl::cp_swap(), boost::multiprecision::backends::cpp_int_base< MinBits, MaxBits, signed_magnitude, Checked, Allocator, false >::do_swap(), boost::math::detail::ellint_rj_imp(), boost::boyer_myrvold_impl< Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::extract_kuratowski_subgraph(), boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), boost::graph::detail::face_handle< Graph, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::flip(), boost::expressions::aux::date_time_formatter_generator_traits_impl< TimeT, CharT >::formatter::formatter(), boost::expressions::aux::date_time_formatter_generator_traits< local_time::local_date_time_base< TimeT, TimeZoneT >, CharT, VoidT >::formatter::formatter(), boost::expressions::aux::date_formatter_generator_traits_impl< DateT, CharT >::formatter::formatter(), boost::expressions::aux::time_duration_formatter_generator_traits_impl< TimeDurationT, CharT >::formatter::formatter(), boost::expressions::aux::date_duration_formatter_generator_traits_impl< DateDurationT, CharT >::formatter::formatter(), generate_permutation_vector(), boost::polygon::get_corner(), boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator >::get_edge(), boost::spirit::pt_tree_policy< MatchPolicyT, NodeFactoryT, T >::group_match(), boost::spirit::ast_tree_policy< MatchPolicyT, NodeFactoryT, T >::group_match(), boost::polygon::handleResizingEdge45(), boost::polygon::handleResizingEdge45_SQRT1OVER2(), boost::math::detail::hermite_imp(), boost::math::detail::hypot_imp(), boost::math::detail::ibeta_imp(), boost::graph::distributed::hohberg_detail::infimum(), boost::numeric::ublas::coordinate_vector< T, IB, IA, TA >::inplace_merge(), boost::numeric::ublas::coordinate_matrix< T, L, IB, IA, TA >::inplace_merge(), boost::polygon::polygon_90_set_data< T >::insert(), boost::polygon::polygon_set_data< T >::insert_clean(), boost::multiprecision::backends::integer_gcd_reduce(), intersects(), is_straight_line_drawing(), iterative_bit_vector_dominator_tree(), boost::math::detail::laguerre_imp(), boost::math::detail::legendre_imp(), boost::math::detail::legendre_p_imp(), boost::phoenix::impl::swap::operator()(), boost::accumulators::impl::weighted_p_square_quantile_impl< Sample, Weight, Impl >::operator()(), boost::accumulators::impl::weighted_p_square_cumulative_distribution_impl< Sample, Weight >::operator()(), boost::accumulators::impl::weighted_extended_p_square_impl< Sample, Weight >::operator()(), boost::lambda::ll::swap::operator()(), boost::spirit::infix_node_op::operator()(), boost::spirit::discard_first_node_op::operator()(), boost::spirit::discard_last_node_op::operator()(), boost::spirit::inner_node_op::operator()(), boost::ptr_circular_buffer< T, CloneAllocator, Allocator >::operator=(), boost::ptr_array< T, N, CloneAllocator >::operator=(), boost::attribute::operator=(), boost::expressions::aux::date_time_formatter_generator_traits_impl< TimeT, CharT >::formatter::operator=(), boost::ptr_container_detail::ptr_set_adapter_base< Key, std::set< void *, void_ptr_indirect_fun< Compare, Key >, Allocator >, CloneAllocator, Ordered >::operator=(), boost::expressions::aux::date_time_formatter_generator_traits< local_time::local_date_time_base< TimeT, TimeZoneT >, CharT, VoidT >::formatter::operator=(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::operator=(), boost::attribute_set::operator=(), boost::expressions::aux::date_formatter_generator_traits_impl< DateT, CharT >::formatter::operator=(), boost::expressions::aux::time_duration_formatter_generator_traits_impl< TimeDurationT, CharT >::formatter::operator=(), boost::geometry::index::rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator >::operator=(), boost::ptr_map_adapter< T, boost::unordered_map< Key, void *, Hash, Pred, Allocator >, CloneAllocator, false >::operator=(), boost::expressions::aux::date_duration_formatter_generator_traits_impl< DateDurationT, CharT >::formatter::operator=(), boost::ptr_multimap_adapter< T, boost::unordered_multimap< Key, void *, Hash, Pred, Allocator >, CloneAllocator, false >::operator=(), boost::packaged_task< R >::operator=(), boost::optional_detail::swap_selector< true >::optional_swap(), boost::optional_detail::swap_selector< false >::optional_swap(), boost::spirit::exclusive_or< A, B >::parse(), boost::spirit::difference< A, B >::parse(), boost::spirit::longest_alternative< A, B >::parse(), boost::spirit::shortest_alternative< A, B >::parse(), boost::detail::bfs_king_visitor< OutputIterator, Buffer, Compare, PseudoDegreeMap, VecMap, VertexIndexMap >::percolate_down(), boost::detail::bfs_king_visitor< OutputIterator, Buffer, Compare, PseudoDegreeMap, VecMap, VertexIndexMap >::percolate_up(), boost::iostreams::detail::chain_base< Self, Ch, Tr, Alloc, Mode >::pop(), boost::heap::detail::d_ary_heap< T, BoundArgs, IndexUpdater >::pop(), boost::polygon::rectangle_data< coordinate_type >::rectangle_data(), boost::ptr_array< T, N, CloneAllocator >::release(), boost::detail::parallel::remove_in_edge(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::remove_local_edge(), boost::multi_array< T, NumDims, Allocator >::resize(), boost::geometry::side_info::reverse(), boost::spirit::lex::lexertl::detail::data< Iterator, mpl::true_, HasState, TokenValue >::revert_adjust_start(), boost::spirit::lex::lexertl::detail::static_data< Iterator, mpl::true_, HasState, TokenValue >::revert_adjust_start(), boost::spirit::lex::lexertl::detail::data< Iterator, mpl::true_, HasState, boost::optional< TokenValue > >::revert_adjust_start(), boost::spirit::lex::lexertl::detail::static_data< Iterator, mpl::true_, HasState, boost::optional< TokenValue > >::revert_adjust_start(), boost::geometry::index::rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator >::rtree(), boost::scalable_rmat_iterator< ProcessGroup, Distribution, RandomGenerator, Graph >::scalable_rmat_iterator(), boost::geometry::policies::relate::segments_intersection_points< ReturnType >::segments_collinear(), boost::intrusive::sgtree_impl< ValueTraits, Compare, SizeType, FloatingPoint, HeaderHolder >::sgtree_impl(), boost::sorted_unique_rmat_iterator< RandomGenerator, Graph, EdgePredicate >::sorted_unique_rmat_iterator(), boost::multiprecision::backends::subtract_unsigned(), boost::basic_format< Ch, Tr, Alloc >::swap(), boost::interprocess::file_mapping::swap(), boost::multiprecision::concepts::number_backend_float_architype::swap(), boost::multiprecision::backends::debug_adaptor< Backend >::swap(), boost::interprocess::xsi_named_mutex::swap(), boost::spirit::multi_pass< T, iterator_policies::default_policy< iterator_policies::first_owner, iterator_policies::no_check, iterator_policies::input_iterator, iterator_policies::fixed_size_queue< N > > >::swap(), boost::multiprecision::backends::logged_adaptor< Backend >::swap(), boost::interprocess::shared_memory_object::swap(), boost::interprocess::windows_shared_memory::swap(), boost::interprocess::basic_managed_external_buffer< CharType, AllocationAlgorithm, IndexType >::swap(), boost::interprocess::xsi_shared_memory::swap(), boost::interprocess::basic_managed_heap_memory< CharType, AllocationAlgorithm, IndexType >::swap(), boost::multiprecision::backends::rational_adaptor< IntBackend >::swap(), boost::array< T, i >::swap(), boost::interprocess::basic_managed_xsi_shared_memory< CharType, AllocationAlgorithm, IndexType >::swap(), boost::interprocess::basic_managed_windows_shared_memory< CharType, AllocationAlgorithm, IndexType >::swap(), boost::interprocess::basic_managed_mapped_file< CharType, AllocationAlgorithm, IndexType >::swap(), boost::re_detail::raw_storage::swap(), boost::multiprecision::backends::float128_backend::swap(), boost::interprocess::basic_managed_shared_memory< CharType, AllocationAlgorithm, IndexType >::swap(), boost::numeric::ublas::unbounded_array< T, ALLOC >::swap(), boost::icl::map< DomainT, CodomainT, Traits, Compare, Combine, Section, Alloc >::swap(), boost::heap::detail::d_ary_heap< T, BoundArgs, IndexUpdater >::swap(), boost::externally_locked< T &, MutexType >::swap(), boost::numeric::ublas::symmetric_matrix< T, TRI, L, A >::swap(), boost::flyweights::flyweight< T, Arg1, Arg2, Arg3, Arg4, Arg5 >::swap(), boost::numeric::ublas::generalized_vector_of_vector< T, L, A >::swap(), boost::numeric::ublas::triangular_matrix< T, TRI, L, A >::swap(), boost::heap::priority_queue< T, A0, A1, A2, A3 >::swap(), boost::interprocess::sharable_lock< SharableMutex >::swap(), boost::interprocess::upgradable_lock< UpgradableMutex >::swap(), boost::undirected_graph< VertexProp, EdgeProp, GraphProp >::swap(), boost::multiprecision::backends::cpp_bin_float< Digits, DigitBase, Allocator, Exponent, MinExponent, MaxExponent >::swap(), boost::directed_graph< VertexProp, EdgeProp, GraphProp >::swap(), boost::heap::binomial_heap< T, A0, A1, A2, A3 >::swap(), boost::heap::pairing_heap< T, A0, A1, A2, A3, A4 >::swap(), boost::intrusive::treap_impl< ValueTraits, VoidOrKeyComp, VoidOrPrioComp, SizeType, ConstantTimeSize, HeaderHolder >::swap(), boost::locale::basic_message< char_type >::swap(), boost::heap::fibonacci_heap< T, A0, A1, A2, A3, A4 >::swap(), boost::interprocess::scoped_lock< Mutex >::swap(), boost::numeric::ublas::map_array< I, T, ALLOC >::swap(), boost::numeric::ublas::matrix< T, L, bounded_array< T, M *N > >::swap(), boost::numeric::ublas::banded_matrix< T, L, A >::swap(), boost::intrusive::sgtree_impl< ValueTraits, Compare, SizeType, FloatingPoint, HeaderHolder >::swap(), boost::numeric::ublas::bounded_array< T, M *N >::swap(), boost::numeric::ublas::hermitian_matrix< T, TRI, L, A >::swap(), boost::multiprecision::backends::cpp_dec_float< Digits10, ExponentType, Allocator >::swap(), boost::heap::skew_heap< T, A0, A1, A2, A3, A4, A5, A6 >::swap(), boost::detail::win32::handle_manager::swap(), boost::numeric::ublas::mapped_matrix< T, L, A >::swap(), boost::geometry::index::rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator >::swap(), boost::numeric::ublas::mapped_vector< T, A >::swap(), boost::synchronized_value< T, Lockable >::swap(), boost::numeric::ublas::array_adaptor< T >::swap(), boost::heap::d_ary_heap< T, A0, A1, A2, A3, A4, A5 >::swap(), boost::optional< status >::swap(), boost::numeric::ublas::compressed_vector< T, IB, IA, TA >::swap(), boost::intrusive::hashtable_impl< ValueTraits, Hash, Equal, SizeType, BucketTraits, BoolFlags >::swap(), boost::unique_future< R >::swap(), boost::adjacency_list< OutEdgeListS, distributedS< ProcessGroup, InVertexListS, InDistribution >, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS >::swap(), boost::numeric::ublas::mapped_vector_of_mapped_vector< T, L, A >::swap(), boost::numeric::ublas::zero_vector< T, ALLOC >::swap(), boost::numeric::ublas::coordinate_vector< T, IB, IA, TA >::swap(), boost::numeric::ublas::unit_vector< T, ALLOC >::swap(), boost::promise< R >::swap(), boost::promise< R & >::swap(), boost::numeric::ublas::scalar_vector< T, ALLOC >::swap(), boost::promise< void >::swap(), boost::numeric::ublas::vector_of_vector< T, L, A >::swap(), boost::numeric::ublas::c_vector< T, N >::swap(), boost::numeric::ublas::compressed_matrix< T, L, IB, IA, TA >::swap(), boost::packaged_task< R >::swap(), boost::numeric::ublas::zero_matrix< T, ALLOC >::swap(), boost::numeric::ublas::identity_matrix< T, ALLOC >::swap(), boost::numeric::ublas::scalar_matrix< T, ALLOC >::swap(), boost::numeric::ublas::coordinate_matrix< T, L, IB, IA, TA >::swap(), boost::numeric::ublas::c_matrix< T, N, M >::swap(), boost::container::deque_base< Allocator >::swap_members(), boost::numeric::ublas::swap_rows(), boost::spirit::tree_parse_info< IteratorT, NodeFactoryT, T >::tree_parse_info(), boost::unique_rmat_iterator< RandomGenerator, Graph, EdgePredicate >::unique_rmat_iterator(), and boost::math::detail::zeta_imp().

BOOST_LOG_OPEN_NAMESPACE typedef boost::log::aux::thread::id boost::thread_id

Thread identifier type.

Referenced by add_common_attributes().

iterator_property_map<size_type*, VertexIndexMap, size_type, size_type&> topo_number &[0] boost::topo_number_storage

std::vector<Vertex> boost::topo_order

Referenced by transitive_closure().

GraphTR& boost::tr

Referenced by boost::polygon::transformation< coordinate_type >::operator!=(), boost::polygon::transformation< coordinate_type >::operator+(), and boost::polygon::transform().

std::map<vertex_descriptor, edge_descriptor> boost::tree_map

Referenced by boost::detail::rec_two_graphs_common_spanning_trees().

BOOST_CONSTEXPR_OR_CONST try_to_lock_t boost::try_to_lock = {}

Referenced by boost::Lock< Lk >::BOOST_CONCEPT_USAGE(), make_unique_lock(), boost::sync_bounded_queue< ValueType >::nonblocking_pull_front(), boost::sync_queue< ValueType >::nonblocking_pull_front(), boost::sync_bounded_queue< ValueType >::nonblocking_push_back(), boost::sync_queue< ValueType >::nonblocking_push_back(), boost::interprocess::segment_manager< CharType, MemoryAlgorithm, IndexType >::try_atomic_func(), boost::sinks::bounded_fifo_queue< MaxQueueSizeV, OverflowStrategyT >::try_enqueue(), boost::sinks::unbounded_ordering_queue< OrderT >::try_enqueue(), boost::sinks::bounded_ordering_queue< OrderT, MaxQueueSizeV, OverflowStrategyT >::try_enqueue(), boost::sinks::basic_sink_frontend::try_feed_record(), boost::sinks::basic_formatting_sink_frontend< CharT >::try_feed_record(), boost::interprocess::interprocess_upgradable_mutex::try_lock(), boost::interprocess::interprocess_sharable_mutex::try_lock(), boost::detail::try_lock_impl(), boost::detail::try_lock_internal(), boost::interprocess::interprocess_upgradable_mutex::try_lock_sharable(), boost::interprocess::interprocess_sharable_mutex::try_lock_sharable(), boost::interprocess::interprocess_upgradable_mutex::try_lock_upgradable(), boost::sync_bounded_queue< ValueType >::try_pull(), boost::sync_queue< ValueType >::try_pull(), boost::sync_queue< ValueType >::try_push(), boost::sync_bounded_queue< ValueType >::try_push(), boost::synchronized_value< T, Lockable >::try_to_synchronize(), boost::interprocess::interprocess_upgradable_mutex::try_unlock_sharable_and_lock(), boost::interprocess::interprocess_upgradable_mutex::try_unlock_sharable_and_lock_upgradable(), and boost::interprocess::interprocess_upgradable_mutex::try_unlock_upgradable_and_lock().

GraphTR G_to_TR_VertexMap VertexIndexMap g_index_map typedef graph_traits<Graph>::vertex_descriptor boost::Vertex

Referenced by boost::detail::add_edge_recur_down(), all_closeness_centralities(), all_clustering_coefficients(), boost::detail::all_cycles_from_vertex(), all_degree_centralities(), all_eccentricities(), all_mean_geodesics(), boost::detail::strong_comp_dispatch1< param_not_found >::apply(), astar_search_no_init(), astar_search_no_init_tree(), bellman_ford_shortest_paths(), boost::detail::bfs_helper(), boost::graph::distributed::boman_et_al_graph_coloring(), boost::concepts::BOOST_concept(), breadth_first_visit(), bron_kerbosch_all_cliques(), boost::hawick_circuits_detail::call_hawick_circuits(), boost::detail::can_extend_path(), boost::detail::can_wrap_path(), closeness_centrality(), connected_components(), boost::detail::contract_edge(), cuthill_mckee_ordering(), dag_shortest_paths(), depth_first_search(), boost::detail::depth_first_visit_impl(), dijkstra_shortest_paths_no_color_map_no_init(), dijkstra_shortest_paths_no_init(), eccentricity(), edge_range(), edges(), boost::detail::exhaust_paths(), boost::detail::extend_clique(), boost::detail::extend_path(), boost::graph::distributed::find_vertex(), boost::detail::bfs_king_visitor< OutputIterator, Buffer, Compare, PseudoDegreeMap, VecMap, VertexIndexMap >::finish_vertex(), boost::detail::bridges_visitor< TreeMap, PredMap, DistMap, LowMap, Buffer >::finish_vertex(), boost::planar_dfs_visitor< LowPointMap, DFSParentMap, DFSNumberMap, LeastAncestorMap, DFSParentEdgeMap, SizeType >::finish_vertex(), boost::detail::biconnected_components_visitor< ComponentMap, DiscoverTimeMap, LowPointMap, PredecessorMap, OutputIterator, Stack, ArticulationVector, IndexMap, DFSVisitor >::finish_vertex(), get(), boost::graph_detail::insert_labeled_vertex(), iterative_bit_vector_dominator_tree(), king_ordering(), kosaraju_strong_components(), boost::detail::kruskal_mst_impl(), lengauer_tarjan_dominator_tree(), lengauer_tarjan_dominator_tree_without_dfs(), boost::serialization::load(), mean_clustering_coefficient(), metric_tsp_approx_from_vertex(), boost::detail::neighbor_bfs_helper(), boost::detail::neighbor_bfs_impl(), boost::hawick_circuits_detail::get_unique_adjacent_vertices::operator()(), boost::GraphParser< Graph_t, VertexProperty, EdgeProperty, VertexPropertySubset, EdgePropertySubset >::operator()(), boost::detail::optimum_cycle_ratio(), boost::detail::parallel_bfs_helper(), radius_and_diameter(), relax(), boost::detail::remove_edge_recur_down(), boost::serialization::save(), sequential_vertex_coloring(), sloan_ordering(), sloan_start_end_vertices(), smallest_last_vertex_ordering(), source(), boost::graph::st_connected(), boost::graph::distributed::st_connected(), boost::detail::strong_components_impl(), target(), boost::detail::undir_dfv_impl(), vertices(), write_graphviz_dp(), and boost::detail::write_graphviz_subgraph().

const Graph & boost::vG

Referenced by if(), and boost::detail::rec_two_graphs_common_spanning_trees().

bimap_type boost::vG_bimap

Referenced by if(), and boost::detail::rec_two_graphs_common_spanning_trees().

std::stack<edge_descriptor> boost::vG_buf

Referenced by boost::detail::rec_two_graphs_common_spanning_trees().

std::map<edge_descriptor, bool> boost::vG_inL

boost::vG_map[i]

detail::bridges_visitor< associative_property_map< std::map<vertex_descriptor, edge_descriptor> >, associative_property_map< std::map<vertex_descriptor, vertex_descriptor> >, associative_property_map< std::map<vertex_descriptor, int> >, associative_property_map< std::map<vertex_descriptor, int> >, std::stack<edge_descriptor> > boost::vG_vis(associative_property_map< std::map< vertex_descriptor, edge_descriptor > >(tree_map), associative_property_map< std::map< vertex_descriptor, vertex_descriptor > >(pred_map), associative_property_map< std::map< vertex_descriptor, int > >(dist_map), associative_property_map< std::map< vertex_descriptor, int > >(low_map), vG_buf)

Referenced by boost::detail::rec_two_graphs_common_spanning_trees().

std::vector<edge_descriptor> boost::vGO