vg
tools for working with variation graphs
|
#include <iostream>
#include <algorithm>
#include <functional>
#include <cmath>
#include <regex>
#include <limits>
#include <unordered_set>
#include <unordered_map>
#include <list>
#include <structures/immutable_list.hpp>
#include <vg/vg.pb.h>
#include "vg.hpp"
#include "translator.hpp"
#include "hash_map.hpp"
#include "utility.hpp"
#include "types.hpp"
#include "snarls.hpp"
#include "path_index.hpp"
#include "genotypekit.hpp"
#include "gbwt_helper.hpp"
Classes | |
class | vg::TraversalFinder |
class | vg::ExhaustiveTraversalFinder |
class | vg::SupportRestrictedTraversalFinder |
class | vg::ReadRestrictedTraversalFinder |
class | vg::PathRestrictedTraversalFinder |
class | vg::PathBasedTraversalFinder |
class | vg::PathTraversalFinder |
class | vg::TrivialTraversalFinder |
class | vg::RepresentativeTraversalFinder |
class | vg::VCFTraversalFinder |
class | vg::FlowTraversalFinder |
class | vg::GBWTTraversalFinder |
Namespaces | |
vg | |
Typedefs | |
using | vg::Traversal = vector< handle_t > |
using | vg::PathInterval = pair< step_handle_t, step_handle_t > |
Functions | |
string | vg::traversal_to_string (const PathHandleGraph *graph, const Traversal &traversal, int64_t max_steps) |
string | vg::graph_interval_to_string (const HandleGraph *graph, const handle_t &start_handle, const handle_t &end_handle) |