compress_sets(ElementIterator first, ElementIterator last) | boost::disjoint_sets_with_storage< ID, InverseID, FindCompress > | inline |
count_sets(ElementIterator first, ElementIterator last) | boost::disjoint_sets_with_storage< ID, InverseID, FindCompress > | inline |
disjoint_sets_with_storage(size_type n=0, ID id_=ID(), InverseID inv=InverseID()) | boost::disjoint_sets_with_storage< ID, InverseID, FindCompress > | inline |
extend_sets(Element x, Element y) | boost::disjoint_sets_with_storage< ID, InverseID, FindCompress > | inlineprotected |
find_set(Element x) | boost::disjoint_sets_with_storage< ID, InverseID, FindCompress > | inline |
id | boost::disjoint_sets_with_storage< ID, InverseID, FindCompress > | protected |
id_to_vertex | boost::disjoint_sets_with_storage< ID, InverseID, FindCompress > | protected |
link(Element x, Element y) | boost::disjoint_sets_with_storage< ID, InverseID, FindCompress > | inline |
make_set(Element x) | boost::disjoint_sets_with_storage< ID, InverseID, FindCompress > | inline |
normalize_sets(ElementIterator first, ElementIterator last) | boost::disjoint_sets_with_storage< ID, InverseID, FindCompress > | inline |
parent | boost::disjoint_sets_with_storage< ID, InverseID, FindCompress > | protected |
parents() | boost::disjoint_sets_with_storage< ID, InverseID, FindCompress > | inline |
rank | boost::disjoint_sets_with_storage< ID, InverseID, FindCompress > | protected |
rep | boost::disjoint_sets_with_storage< ID, InverseID, FindCompress > | protected |
size_type typedef | boost::disjoint_sets_with_storage< ID, InverseID, FindCompress > | |
union_set(Element x, Element y) | boost::disjoint_sets_with_storage< ID, InverseID, FindCompress > | inline |