vg
tools for working with variation graphs
Namespaces | Functions
strongly_connected_components.cpp File Reference
#include "handlegraph/algorithms/strongly_connected_components.hpp"
#include <unordered_map>
#include <deque>

Namespaces

 handlegraph
 
 handlegraph::algorithms
 

Functions

void handlegraph::algorithms::dfs (const HandleGraph &graph, const function< void(const handle_t &)> &handle_begin_fn, const function< void(const handle_t &)> &handle_end_fn, const function< bool(void)> &break_fn, const function< void(const edge_t &)> &edge_fn, const function< void(const edge_t &)> &tree_fn, const function< void(const edge_t &)> &edge_curr_fn, const function< void(const edge_t &)> &edge_cross_fn, const vector< handle_t > &sources, const unordered_set< handle_t > &sinks)
 
void handlegraph::algorithms::dfs (const HandleGraph &graph, const function< void(const handle_t &)> &handle_begin_fn, const function< void(const handle_t &)> &handle_end_fn, const vector< handle_t > &sources, const unordered_set< handle_t > &sinks)
 
void handlegraph::algorithms::dfs (const HandleGraph &graph, const function< void(const handle_t &)> &handle_begin_fn, const function< void(const handle_t &)> &handle_end_fn, const function< bool(void)> &break_fn)
 
vector< unordered_set< nid_t > > handlegraph::algorithms::strongly_connected_components (const HandleGraph *handle_graph)