|
vg
tools for working with variation graphs
|
#include <sparsepp/spp.h>#include <vg/vg.pb.h>#include "../position.hpp"#include "../hash_map.hpp"#include "../handle.hpp"#include "apply_bulk_modifications.hpp"#include "is_single_stranded.hpp"Namespaces | |
| vg | |
| vg::algorithms | |
Functions | |
| vector< handle_t > | vg::algorithms::topological_order (const HandleGraph *g) |
| vector< handle_t > | vg::algorithms::lazy_topological_order (const HandleGraph *g) |
| vector< handle_t > | vg::algorithms::lazier_topological_order (const HandleGraph *g) |
| unordered_set< id_t > | vg::algorithms::orient_nodes_forward (MutableHandleGraph *g) |
Defines a topological sort algorithm for handle graphs.
1.8.20