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

bfs(set< id_t > &nodes, map< id_t, map< id_t, int >> &edge_weight, id_t s, id_t t, map< id_t, id_t > &parent)	vg::FlowSort
DEFAULT_PATH_WEIGHT	vg::FlowSort	static
dfs(set< id_t > &nodes, id_t s, set< id_t > &visited, map< id_t, map< id_t, int >> &edge_weight)	vg::FlowSort
erase_in_out_edges(EdgeMapping &edges_in, EdgeMapping &edges_out, Edge *e)	vg::FlowSort
fast_linear_sort(const string &ref_name, bool isGrooming=true)	vg::FlowSort
find_in_out_web(list< NodeTraversal > &sorted_nodes, Growth &in_out_growth, WeightedGraph &weighted_graph, set< id_t > &unsorted_nodes, id_t start_node, bool in_out, int count)	vg::FlowSort
find_max_node(std::vector< std::set< id_t >> nodes_degree)	vg::FlowSort
flow_sort_nodes(list< NodeTraversal > &sorted_nodes, const string &ref_name, bool isGrooming)	vg::FlowSort
FlowSort(VG &vg)	vg::FlowSort
from_simple_reverse(Edge *&e)	vg::FlowSort
from_simple_reverse_orientation(Edge *&e)	vg::FlowSort
get_cc_in_wg(EdgeMapping &edges_in, EdgeMapping &edges_out, const set< id_t > &all_nodes, id_t start_ref_node)	vg::FlowSort
get_next_node_recalc_degrees(WeightedGraph &wg, std::vector< std::set< id_t >> &degrees, std::set< id_t > &sources, id_t node)	vg::FlowSort
get_node_degree(WeightedGraph &wg, id_t node_id)	vg::FlowSort
groom_components(EdgeMapping &edges_in, EdgeMapping &edges_out, set< id_t > &isolated_nodes, set< id_t > &main_nodes, map< id_t, set< Edge * >> &minus_start, map< id_t, set< Edge * >> &minus_end)	vg::FlowSort
mark_dfs(EdgeMapping &graph_matrix, id_t s, set< id_t > &new_nodes, set< id_t > &visited, bool reverse, set< id_t > &nodes, set< id_t > &backbone)	vg::FlowSort
max_flow_sort(const string &ref_name, bool isGrooming=true)	vg::FlowSort
min_cut(map< id_t, map< id_t, int >> &graph_weight, set< id_t > &nodes, id_t s, id_t t, EdgeMapping &edges_out_nodes, set< Edge * > &in_joins)	vg::FlowSort
process_in_out_growth(EdgeMapping &edges_out_nodes, id_t current_id, Growth &in_out_growth, WeightedGraph &weighted_graph, set< id_t > &visited, list< NodeTraversal > &sorted_nodes, bool reverse, set< id_t > &unsorted_nodes, bool in_out, int count)	vg::FlowSort
remove_edge(EdgeMapping &nodes_to_edges, id_t node, id_t to, bool reverse)	vg::FlowSort
reverse_edge(Edge *&e)	vg::FlowSort
reverse_from_start_to_end_edge(Edge *&e)	vg::FlowSort
to_simple_reverse(Edge *&e)	vg::FlowSort
to_simple_reverse_orientation(Edge *&e)	vg::FlowSort
update_in_out_edges(EdgeMapping &edges_in, EdgeMapping &edges_out, Edge *e)	vg::FlowSort
vg	vg::FlowSort	private