|
vg
tools for working with variation graphs
|
#include <unordered_set>#include "cactus.hpp"#include "vg.hpp"#include "handle.hpp"#include "algorithms/dfs.hpp"Namespaces | |
| vg | |
Typedefs | |
| typedef unordered_set< handle_t > | vg::HandleSet |
| typedef unordered_map< handle_t, int > | vg::Handle2Component |
Functions | |
| void * | vg::mergeNodeObjects (void *a, void *b) |
| void | vg::getReachableBridges2 (stCactusEdgeEnd *edgeEnd1, stHash *bridgeEndsToBridgeNodes, stList *bridgeEnds) |
| void | vg::getReachableBridges (stCactusEdgeEnd *edgeEnd1, stList *bridgeEnds) |
| void | vg::addArbitraryTelomerePair (vector< stCactusEdgeEnd * > ends, stList *telomeres) |
| pair< stCactusGraph *, stList * > | vg::handle_graph_to_cactus (const PathHandleGraph &graph, const unordered_set< string > &hint_paths, bool single_component) |
| VG | vg::cactus_to_vg (stCactusGraph *cactus_graph) |
| VG | vg::cactusify (VG &graph) |
1.8.17