|
vg
tools for working with variation graphs
|
#include <queue>#include <thread>#include <atomic>#include <mutex>#include <structures/union_find.hpp>#include "../cluster.hpp"#include "component.hpp"#include "utility.hpp"#include "sdsl/bit_vectors.hpp"#include "sdsl/int_vector.hpp"Namespaces | |
| vg | |
| vg::algorithms | |
Functions | |
| void | vg::algorithms::traverse_components (const HandleGraph &graph, function< void(void)> &on_new_comp, function< void(handle_t)> &on_node) |
| size_t | vg::algorithms::num_components (const HandleGraph &graph) |
| vector< size_t > | vg::algorithms::component_sizes (const HandleGraph &graph) |
| vector< unordered_set< path_handle_t > > | vg::algorithms::component_paths (const PathHandleGraph &graph) |
| template<typename Int1 , typename Int2 > | |
| void | vg::algorithms::reallocate_atomic_int_vector (vector< atomic< Int1 >> *&vec1, vector< atomic< Int2 >> *&vec2) |
| vector< unordered_set< path_handle_t > > | vg::algorithms::component_paths_parallel (const PathHandleGraph &graph) |
Implements per-component algorithms
1.8.17