dagify.cpp File Reference

#include <vector>
#include <unordered_set>
#include <atomic>
#include "handlegraph/expanding_overlay_graph.hpp"
#include "handlegraph/algorithms/dagify.hpp"
#include "handlegraph/algorithms/is_single_stranded.hpp"
#include "handlegraph/algorithms/strongly_connected_components.hpp"
#include "handlegraph/algorithms/eades_algorithm.hpp"
#include "handlegraph/algorithms/internal/dfs.hpp"

Classes
class	handlegraph::algorithms::SubHandleGraph

Namespaces
	handlegraph
	handlegraph::algorithms

Functions
unordered_map< nid_t, nid_t >	handlegraph::algorithms::dagify (const HandleGraph *graph, MutableHandleGraph *into, size_t min_preserved_path_length)
std::pair< std::unordered_map< nid_t, nid_t >, std::vector< handle_t > >	handlegraph::algorithms::dagify_from (const HandleGraph *graph, std::vector< handle_t > start_handles, DeletableHandleGraph *into, size_t min_preserved_path_length)

Detailed Description

Implements an algorithm to convert a single-stranded graph into a DAG