vg
tools for working with variation graphs
vg::IntegratedSnarlFinder::MergedAdjacencyGraph Member List

This is the complete list of members for vg::IntegratedSnarlFinder::MergedAdjacencyGraph, including all inherited members.

cycles_in_cactus() constvg::IntegratedSnarlFinder::MergedAdjacencyGraph
find(handle_t into) constvg::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) constvg::IntegratedSnarlFinder::MergedAdjacencyGraph
for_each_head(const function< void(handle_t)> &iteratee) constvg::IntegratedSnarlFinder::MergedAdjacencyGraph
for_each_member(handle_t head, const function< void(handle_t)> &iteratee) constvg::IntegratedSnarlFinder::MergedAdjacencyGraph
for_each_membership(const function< void(handle_t, handle_t)> &iteratee) constvg::IntegratedSnarlFinder::MergedAdjacencyGraph
for_each_other_member(handle_t head, const function< void(handle_t)> &iteratee) constvg::IntegratedSnarlFinder::MergedAdjacencyGraph
graphvg::IntegratedSnarlFinder::MergedAdjacencyGraphprotected
longest_paths_in_forest(const vector< pair< size_t, handle_t >> &longest_simple_cycles) constvg::IntegratedSnarlFinder::MergedAdjacencyGraph
merge(handle_t into_a, handle_t into_b)vg::IntegratedSnarlFinder::MergedAdjacencyGraph
MergedAdjacencyGraph(const RankedHandleGraph *graph)vg::IntegratedSnarlFinder::MergedAdjacencyGraph
MergedAdjacencyGraph(const MergedAdjacencyGraph &other)vg::IntegratedSnarlFinder::MergedAdjacencyGraph
to_dot(ostream &out) constvg::IntegratedSnarlFinder::MergedAdjacencyGraph
uf_handle(size_t rank) constvg::IntegratedSnarlFinder::MergedAdjacencyGraphprotected
uf_rank(handle_t into) constvg::IntegratedSnarlFinder::MergedAdjacencyGraphprotected
union_findvg::IntegratedSnarlFinder::MergedAdjacencyGraphmutableprotected
Generated by   doxygen 1.8.17