cycles_in_cactus() const | vg::IntegratedSnarlFinder::MergedAdjacencyGraph | |
extra_node_weight | vg::IntegratedSnarlFinder::MergedAdjacencyGraph | protected |
find(handle_t into) const | vg::IntegratedSnarlFinder::MergedAdjacencyGraph | |
find_cycle_path_in_cactus(const unordered_map< handle_t, handle_t > &next_along_cycle, handle_t start_cactus_head, handle_t end_cactus_head) const | vg::IntegratedSnarlFinder::MergedAdjacencyGraph | |
for_each_head(const function< void(handle_t)> &iteratee) const | vg::IntegratedSnarlFinder::MergedAdjacencyGraph | |
for_each_member(handle_t head, const function< void(handle_t)> &iteratee) const | vg::IntegratedSnarlFinder::MergedAdjacencyGraph | |
for_each_membership(const function< void(handle_t, handle_t)> &iteratee) const | vg::IntegratedSnarlFinder::MergedAdjacencyGraph | |
for_each_other_member(handle_t head, const function< void(handle_t)> &iteratee) const | vg::IntegratedSnarlFinder::MergedAdjacencyGraph | |
get_weighted_length(const handle_t &handle) const | vg::IntegratedSnarlFinder::MergedAdjacencyGraph | protected |
graph | vg::IntegratedSnarlFinder::MergedAdjacencyGraph | protected |
longest_paths_in_forest(const vector< pair< size_t, handle_t >> &longest_simple_cycles) const | vg::IntegratedSnarlFinder::MergedAdjacencyGraph | |
merge(handle_t into_a, handle_t into_b) | vg::IntegratedSnarlFinder::MergedAdjacencyGraph | |
MergedAdjacencyGraph(const RankedHandleGraph *graph, const std::unordered_map< nid_t, size_t > &extra_node_weight) | vg::IntegratedSnarlFinder::MergedAdjacencyGraph | |
MergedAdjacencyGraph(const MergedAdjacencyGraph &other) | vg::IntegratedSnarlFinder::MergedAdjacencyGraph | |
to_dot(ostream &out) const | vg::IntegratedSnarlFinder::MergedAdjacencyGraph | |
uf_handle(size_t rank) const | vg::IntegratedSnarlFinder::MergedAdjacencyGraph | protected |
uf_rank(handle_t into) const | vg::IntegratedSnarlFinder::MergedAdjacencyGraph | protected |
union_find | vg::IntegratedSnarlFinder::MergedAdjacencyGraph | mutableprotected |