vg
tools for working with variation graphs
vg::NetGraph Member List

This is the complete list of members for vg::NetGraph, including all inherited members.

add_chain_child(const Chain &chain)vg::NetGraphprotected
add_unary_child(const Snarl *unary)vg::NetGraphprotected
chain_end_rewritesvg::NetGraphprotected
chain_ends_by_startvg::NetGraphprotected
connectivityvg::NetGraphprotected
edge_handle(const handle_t &left, const handle_t &right) consthandlegraph::HandleGraph
endvg::NetGraphprotected
flip(const handle_t &handle) constvg::NetGraphvirtual
follow_edges(const handle_t &handle, bool go_left, const Iteratee &iteratee) consthandlegraph::HandleGraph
follow_edges_impl(const handle_t &handle, bool go_left, const function< bool(const handle_t &)> &iteratee) constvg::NetGraphvirtual
handlegraph::HandleGraph::follow_edges_impl(const handle_t &handle, bool go_left, const std::function< bool(const handle_t &)> &iteratee) const =0handlegraph::HandleGraphprotectedpure virtual
for_each_edge(const Iteratee &iteratee, bool parallel=false) consthandlegraph::HandleGraph
for_each_handle(const Iteratee &iteratee, bool parallel=false) consthandlegraph::HandleGraph
for_each_handle_impl(const function< bool(const handle_t &)> &iteratee, bool parallel=false) constvg::NetGraphvirtual
handlegraph::HandleGraph::for_each_handle_impl(const std::function< bool(const handle_t &)> &iteratee, bool parallel=false) const =0handlegraph::HandleGraphprotectedpure virtual
forward(const handle_t &handle) consthandlegraph::HandleGraph
get_base(const handle_t &handle, size_t index) consthandlegraph::HandleGraphvirtual
get_degree(const handle_t &handle, bool go_left) consthandlegraph::HandleGraphvirtual
get_edge_count() consthandlegraph::HandleGraphvirtual
get_end() constvg::NetGraph
get_handle(const id_t &node_id, bool is_reverse=false) constvg::NetGraphvirtual
get_handle_from_inward_backing_handle(const handle_t &backing_handle) constvg::NetGraph
get_id(const handle_t &handle) constvg::NetGraphvirtual
get_inward_backing_handle(const handle_t &child_handle) constvg::NetGraph
get_is_reverse(const handle_t &handle) constvg::NetGraphvirtual
get_length(const handle_t &handle) constvg::NetGraphvirtual
get_node_count() constvg::NetGraphvirtual
get_sequence(const handle_t &handle) constvg::NetGraphvirtual
get_start() constvg::NetGraph
get_subsequence(const handle_t &handle, size_t index, size_t size) consthandlegraph::HandleGraphvirtual
get_total_length() consthandlegraph::HandleGraphvirtual
graphvg::NetGraphprotected
has_edge(const handle_t &left, const handle_t &right) consthandlegraph::HandleGraphvirtual
has_edge(const edge_t &edge) consthandlegraph::HandleGraphinline
has_node(id_t node_id) constvg::NetGraphvirtual
is_child(const handle_t &handle) constvg::NetGraph
max_node_id() constvg::NetGraphvirtual
min_node_id() constvg::NetGraphvirtual
NetGraph(const Visit &start, const Visit &end, const ChainContainer &child_chains_mixed, const HandleGraph *graph, bool use_internal_connectivity=false)vg::NetGraphinline
NetGraph(const Visit &start, const Visit &end, const ChainContainer &child_chains, const SnarlContainer &child_unary_snarls, const HandleGraph *graph, bool use_internal_connectivity=false)vg::NetGraphinline
NetGraph(const Visit &start, const Visit &end, const vector< vector< pair< Snarl, bool >>> &child_chains, const vector< Snarl > &child_unary_snarls, const HandleGraph *graph, bool use_internal_connectivity=false)vg::NetGraph
NetGraph(const Visit &start, const Visit &end, const HandleGraph *graph, bool use_internal_connectivity=false)vg::NetGraphprotected
startvg::NetGraphprotected
traverse_edge_handle(const edge_t &edge, const handle_t &left) consthandlegraph::HandleGraph
unary_boundariesvg::NetGraphprotected
use_internal_connectivityvg::NetGraphprotected
~HandleGraph()=defaulthandlegraph::HandleGraphvirtual