|
vg
tools for working with variation graphs
|
This is the complete list of members for vg::DagifiedGraph, including all inherited members.
| DagifiedGraph(const HandleGraph *graph, size_t min_preserved_path_length, size_t max_num_duplications=std::numeric_limits< size_t >::max()) | vg::DagifiedGraph | |
| DagifiedGraph()=default | vg::DagifiedGraph | |
| edge_handle(const handle_t &left, const handle_t &right) const | handlegraph::HandleGraph | |
| flip(const handle_t &handle) const | vg::DagifiedGraph | virtual |
| follow_edges(const handle_t &handle, bool go_left, const Iteratee &iteratee) const | handlegraph::HandleGraph | |
| follow_edges_impl(const handle_t &handle, bool go_left, const function< bool(const handle_t &)> &iteratee) const | vg::DagifiedGraph | |
| handlegraph::ExpandingOverlayGraph::follow_edges_impl(const handle_t &handle, bool go_left, const std::function< bool(const handle_t &)> &iteratee) const =0 | handlegraph::HandleGraph | protectedpure virtual |
| for_each_edge(const Iteratee &iteratee, bool parallel=false) const | handlegraph::HandleGraph | |
| for_each_handle(const Iteratee &iteratee, bool parallel=false) const | handlegraph::HandleGraph | |
| for_each_handle_impl(const function< bool(const handle_t &)> &iteratee, bool parallel=false) const | vg::DagifiedGraph | |
| handlegraph::ExpandingOverlayGraph::for_each_handle_impl(const std::function< bool(const handle_t &)> &iteratee, bool parallel=false) const =0 | handlegraph::HandleGraph | protectedpure virtual |
| forward(const handle_t &handle) const | handlegraph::HandleGraph | |
| get_base(const handle_t &handle, size_t index) const | handlegraph::HandleGraph | virtual |
| get_degree(const handle_t &handle, bool go_left) const | handlegraph::HandleGraph | virtual |
| get_edge_count() const | handlegraph::HandleGraph | virtual |
| get_handle(const id_t &node_id, bool is_reverse=false) const | vg::DagifiedGraph | virtual |
| get_id(const handle_t &handle) const | vg::DagifiedGraph | virtual |
| get_is_reverse(const handle_t &handle) const | vg::DagifiedGraph | virtual |
| get_length(const handle_t &handle) const | vg::DagifiedGraph | virtual |
| get_node_count() const | vg::DagifiedGraph | virtual |
| get_sequence(const handle_t &handle) const | vg::DagifiedGraph | virtual |
| get_subsequence(const handle_t &handle, size_t index, size_t size) const | handlegraph::HandleGraph | virtual |
| get_total_length() const | handlegraph::HandleGraph | virtual |
| get_underlying_handle(const handle_t &handle) const | vg::DagifiedGraph | virtual |
| get_underlying_id(const id_t &node_id) const | vg::DagifiedGraph | protected |
| graph | vg::DagifiedGraph | protected |
| handle_val_range | vg::DagifiedGraph | protected |
| has_edge(const handle_t &left, const handle_t &right) const | handlegraph::HandleGraph | virtual |
| has_edge(const edge_t &edge) const | handlegraph::HandleGraph | inline |
| has_node(id_t node_id) const | vg::DagifiedGraph | virtual |
| layout_order | vg::DagifiedGraph | protected |
| layout_order_of_handle(const handle_t &handle) const | vg::DagifiedGraph | protected |
| max_id | vg::DagifiedGraph | protected |
| max_node_id() const | vg::DagifiedGraph | virtual |
| min_handle | vg::DagifiedGraph | protected |
| min_node_id() const | vg::DagifiedGraph | virtual |
| node_count | vg::DagifiedGraph | protected |
| nth_copy_of_handle(const handle_t &handle, const uint64_t &n) const | vg::DagifiedGraph | protected |
| scc_copy_count | vg::DagifiedGraph | protected |
| scc_copy_of_handle(const handle_t &handle) const | vg::DagifiedGraph | protected |
| scc_copy_of_node_id(const id_t &node_id) const | vg::DagifiedGraph | protected |
| scc_of_handle | vg::DagifiedGraph | protected |
| traverse_edge_handle(const edge_t &edge, const handle_t &left) const | handlegraph::HandleGraph | |
| ~DagifiedGraph()=default | vg::DagifiedGraph | |
| ~ExpandingOverlayGraph()=default | handlegraph::ExpandingOverlayGraph | virtual |
| ~HandleGraph()=default | handlegraph::HandleGraph | virtual |
1.8.17