chop.cpp File Reference

#include "handlegraph/algorithms/chop.hpp"
#include "handlegraph/util.hpp"
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <set>
#include <sstream>
#include <utility>
#include <cassert>
#include <algorithm>

Namespaces
	handlegraph
	handlegraph::algorithms

Functions
handle_t	handlegraph::algorithms::concat_nodes (MutablePathDeletableHandleGraph &graph, const std::vector< handle_t > &nodes)
handle_t	handlegraph::algorithms::combine_handles (MutablePathDeletableHandleGraph &graph, const std::vector< handle_t > &handles)
bool	handlegraph::algorithms::nodes_are_perfect_path_neighbors (const PathHandleGraph &graph, handle_t left_handle, handle_t right_handle)
vector< deque< handle_t > >	handlegraph::algorithms::simple_components (const PathHandleGraph &graph, int min_size=1)
void	handlegraph::algorithms::unchop (MutablePathDeletableHandleGraph &graph)
void	handlegraph::algorithms::chop (MutablePathDeletableHandleGraph &graph, size_t max_node_length, const std::function< void(nid_t, size_t, size_t, handle_t)> &record_change)
void	handlegraph::algorithms::chop (MutablePathDeletableHandleGraph &graph, size_t max_node_length)