traversal_clusters.hpp File Reference

#include "handle.hpp"
#include "traversal_finder.hpp"

Classes
class	vg::count_back_inserter< T >
struct	vg::ParentGenotypeInfo

Namespaces
	vg

Functions
template<typename T , typename U >
double	vg::jaccard_coefficient (const T &target, const U &query)
double	vg::weighted_jaccard_coefficient (const PathHandleGraph *graph, const multiset< handle_t > &target, const multiset< handle_t > &query)
vector< int >	vg::get_traversal_order (const PathHandleGraph *graph, const vector< Traversal > &traversals, const vector< string > &trav_path_names, const vector< int > &ref_travs, int64_t ref_trav_idx, const vector< bool > &use_traversal)
vector< vector< int > >	vg::cluster_traversals (const PathHandleGraph *graph, const vector< Traversal > &traversals, const vector< int > &traversal_order, const vector< pair< handle_t, handle_t >> &child_snarls, double min_jaccard, vector< pair< double, int64_t >> &out_info, vector< int > &out_child_snarl_to_trav)
vector< vector< int > >	vg::assign_child_snarls_to_traversals (const PathHandleGraph *graph, const vector< Traversal > &traversals, const vector< pair< handle_t, handle_t >> &child_snarls)
void	vg::merge_equivalent_traversals_in_graph (MutablePathHandleGraph *graph, const unordered_set< path_handle_t > &selected_paths)

Detailed Description

Utilities for finding and clustering similar snarl traversals