vg
tools for working with variation graphs
vg::SnarlDistanceIndexClusterer Member List

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

add_seed_to_chain_problem(ClusteringProblem &clustering_problem, SnarlTreeNodeProblem *chain_problem, SnarlTreeNodeProblem::SnarlTreeChild &last_child, size_t &last_prefix_sum, size_t &last_length, size_t &last_chain_component_end, vector< ClusterHead > &cluster_heads_to_add_again, bool &found_first_node, pair< bool, bool > &found_first_node_by_read, const SnarlTreeNodeProblem::SnarlTreeChild &current_child, bool is_first_child, bool is_last_child, bool skip_distances_to_ends) constvg::SnarlDistanceIndexClustererprivate
add_snarl_to_chain_problem(ClusteringProblem &clustering_problem, SnarlTreeNodeProblem *chain_problem, SnarlTreeNodeProblem::SnarlTreeChild &last_child, size_t &last_prefix_sum, size_t &last_length, size_t &last_chain_component_end, vector< ClusterHead > &cluster_heads_to_add_again, bool &found_first_node, pair< bool, bool > &found_first_node_by_read, const SnarlTreeNodeProblem::SnarlTreeChild &current_child, bool is_first_child, bool is_last_child, bool skip_distances_to_ends) constvg::SnarlDistanceIndexClustererprivate
cluster_chain_level(ClusteringProblem &clustering_problem, size_t depth) constvg::SnarlDistanceIndexClustererprivate
cluster_one_chain(ClusteringProblem &clustering_problem, SnarlTreeNodeProblem *chain_problem, bool is_top_level_chain) constvg::SnarlDistanceIndexClustererprivate
cluster_one_node(ClusteringProblem &clustering_problem, SnarlTreeNodeProblem *node_problem) constvg::SnarlDistanceIndexClustererprivate
cluster_one_snarl(ClusteringProblem &clustering_problem, SnarlTreeNodeProblem *snarl_problem) constvg::SnarlDistanceIndexClustererprivate
cluster_root(ClusteringProblem &clustering_problem) constvg::SnarlDistanceIndexClustererprivate
cluster_seeds(const vector< Seed > &seeds, size_t read_distance_limit) constvg::SnarlDistanceIndexClusterer
cluster_seeds(const vector< vector< Seed >> &all_seeds, size_t read_distance_limit, size_t fragment_distance_limit=0) constvg::SnarlDistanceIndexClusterer
cluster_seeds_internal(vector< vector< SeedCache > * > &all_seeds, size_t read_distance_limit, size_t fragment_distance_limit=0) constvg::SnarlDistanceIndexClustererprivate
cluster_seeds_on_linear_structure(ClusteringProblem &clustering_problem, SnarlTreeNodeProblem *problem, size_t structure_length, bool include_prefix_sum, bool skip_distances_to_ends) constvg::SnarlDistanceIndexClustererprivate
cluster_snarl_level(ClusteringProblem &clustering_problem) constvg::SnarlDistanceIndexClustererprivate
compare_and_combine_cluster_on_child_structures(ClusteringProblem &clustering_problem, SnarlTreeNodeProblem *child_problem1, SnarlTreeNodeProblem *child_problem2, SnarlTreeNodeProblem *parent_problem, const vector< pair< size_t, size_t >> &child_distances, bool is_root, bool first_child) constvg::SnarlDistanceIndexClustererprivate
compare_and_combine_cluster_on_one_child(ClusteringProblem &clustering_problem, SnarlTreeNodeProblem *child_problem) constvg::SnarlDistanceIndexClustererprivate
distance_between_seeds(const Seed &seed1, const Seed &seed2, bool stop_at_lowest_common_ancestor) constvg::SnarlDistanceIndexClusterer
distance_indexvg::SnarlDistanceIndexClustererprivate
get_nodes(ClusteringProblem &clustering_problem, vector< vector< net_handle_t >> &chains_by_level) constvg::SnarlDistanceIndexClustererprivate
graphvg::SnarlDistanceIndexClustererprivate
SnarlDistanceIndexClusterer(const SnarlDistanceIndex &distance_index, const HandleGraph *graph)vg::SnarlDistanceIndexClusterer
SnarlDistanceIndexClusterer(const SnarlDistanceIndex *distance_index, const HandleGraph *graph)vg::SnarlDistanceIndexClusterer
SnarlDistanceIndexClusterer(const SnarlDistanceIndex &distance_index)vg::SnarlDistanceIndexClusterer
SnarlDistanceIndexClusterer(const SnarlDistanceIndex *distance_index)vg::SnarlDistanceIndexClusterer