|
vg
tools for working with variation graphs
|
#include "../handle.hpp"#include "../utility.hpp"#include <unordered_set>#include <unordered_map>Namespaces | |
| vg | |
| vg::algorithms | |
Functions | |
| unordered_map< id_t, pair< id_t, bool > > | vg::algorithms::split_strands (const HandleGraph *source, MutableHandleGraph *into) |
Defines algorithm for converting any graph into a single stranded graph.
1.8.20