vg
tools for working with variation graphs
Namespaces | Functions
dagify.hpp File Reference
#include "../handle.hpp"
#include "../subgraph.hpp"
#include "shortest_cycle.hpp"
#include "eades_algorithm.hpp"
#include "strongly_connected_components.hpp"
#include "is_single_stranded.hpp"
#include <unordered_map>

Namespaces

 vg
 
 vg::algorithms
 

Functions

unordered_map< id_t, id_t > vg::algorithms::dagify (const HandleGraph *graph, MutableHandleGraph *into, size_t min_preserved_path_length)