#include <disjoint_sets.hpp>
|
| disjoint_sets (RankPA r, ParentPA p) |
|
| disjoint_sets (const self &c) |
|
template<class Element > |
void | make_set (Element x) |
|
template<class Element > |
void | link (Element x, Element y) |
|
template<class Element > |
void | union_set (Element x, Element y) |
|
template<class Element > |
Element | find_set (Element x) |
|
template<class ElementIterator > |
std::size_t | count_sets (ElementIterator first, ElementIterator last) |
|
template<class ElementIterator > |
void | normalize_sets (ElementIterator first, ElementIterator last) |
|
template<class ElementIterator > |
void | compress_sets (ElementIterator first, ElementIterator last) |
|
template<class RankPA, class ParentPA, class FindCompress = find_with_full_path_compression>
template<class RankPA, class ParentPA, class FindCompress = find_with_full_path_compression>
template<class RankPA, class ParentPA, class FindCompress = find_with_full_path_compression>
template<class ElementIterator >
void boost::disjoint_sets< RankPA, ParentPA, FindCompress >::compress_sets |
( |
ElementIterator |
first, |
|
|
ElementIterator |
last |
|
) |
| |
|
inline |
template<class RankPA, class ParentPA, class FindCompress = find_with_full_path_compression>
template<class ElementIterator >
std::size_t boost::disjoint_sets< RankPA, ParentPA, FindCompress >::count_sets |
( |
ElementIterator |
first, |
|
|
ElementIterator |
last |
|
) |
| |
|
inline |
template<class RankPA, class ParentPA, class FindCompress = find_with_full_path_compression>
template<class Element >
template<class RankPA, class ParentPA, class FindCompress = find_with_full_path_compression>
template<class Element >
template<class RankPA, class ParentPA, class FindCompress = find_with_full_path_compression>
template<class Element >
template<class RankPA, class ParentPA, class FindCompress = find_with_full_path_compression>
template<class ElementIterator >
void boost::disjoint_sets< RankPA, ParentPA, FindCompress >::normalize_sets |
( |
ElementIterator |
first, |
|
|
ElementIterator |
last |
|
) |
| |
|
inline |
template<class RankPA, class ParentPA, class FindCompress = find_with_full_path_compression>
template<class Element >
template<class RankPA, class ParentPA, class FindCompress = find_with_full_path_compression>
Referenced by boost::disjoint_sets< vertex_to_vsize_map_t, vertex_to_vertex_map_t >::compress_sets(), boost::disjoint_sets< vertex_to_vsize_map_t, vertex_to_vertex_map_t >::count_sets(), boost::disjoint_sets< vertex_to_vsize_map_t, vertex_to_vertex_map_t >::find_set(), boost::disjoint_sets< vertex_to_vsize_map_t, vertex_to_vertex_map_t >::link(), boost::disjoint_sets< vertex_to_vsize_map_t, vertex_to_vertex_map_t >::make_set(), and boost::disjoint_sets< vertex_to_vsize_map_t, vertex_to_vertex_map_t >::normalize_sets().
template<class RankPA, class ParentPA, class FindCompress = find_with_full_path_compression>
template<class RankPA, class ParentPA, class FindCompress = find_with_full_path_compression>
The documentation for this class was generated from the following file: