vg
tools for working with variation graphs
Namespaces | Functions
weakly_connected_components.hpp File Reference
#include "../handle.hpp"
#include <unordered_set>
#include <vector>

Namespaces

 vg
 
 vg::algorithms
 

Functions

vector< unordered_set< id_t > > vg::algorithms::weakly_connected_components (const HandleGraph *graph)
 
vector< pair< unordered_set< id_t >, vector< handle_t > > > vg::algorithms::weakly_connected_components_with_tips (const HandleGraph *graph)
 
bool vg::algorithms::is_weakly_connected (const HandleGraph *graph)
 

Detailed Description

Defines an algorithm for finding weakly connected components in a graph.