prune.cpp File Reference

#include "algorithms/prune.hpp"
#include "hash_map.hpp"
#include "position.hpp"
#include "source_sink_overlay.hpp"
#include <stack>

Classes
struct	vg::algorithms::walk_t
	Record a <=k-length walk in the context of a graph. More...

Namespaces
	vg
	vg::algorithms

Functions
pair_hash_set< edge_t >	vg::algorithms::find_edges_to_prune (const HandleGraph &graph, size_t k, size_t edge_max)
size_t	vg::algorithms::prune_complex (DeletableHandleGraph &graph, int path_length, int edge_max)
size_t	vg::algorithms::prune_complex_with_head_tail (DeletableHandleGraph &graph, int path_length, int edge_max)
size_t	vg::algorithms::prune_short_subgraphs (DeletableHandleGraph &graph, int min_size)
size_t	vg::algorithms::remove_high_degree_nodes (DeletableHandleGraph &g, int max_degree)

Variables
constexpr size_t	vg::algorithms::PRUNE_THREAD_BUFFER_SIZE = 1024 * 1024