vg
tools for working with variation graphs
Public Member Functions | Private Attributes | List of all members
vg::HandleGraphNodeSet Class Reference

Public Member Functions

 HandleGraphNodeSet (const HandleGraph *graph)
 
size_t size () const
 
void insert (const handle_t &here)
 
bool count (const handle_t &here) const
 

Private Attributes

unordered_set< handle_tvisited
 
const HandleGraphgraph
 

Detailed Description

A set over the nodes in a handle graph. All queries automatically ignore orientation.

Constructor & Destructor Documentation

◆ HandleGraphNodeSet()

vg::HandleGraphNodeSet::HandleGraphNodeSet ( const HandleGraph graph)
inline

Make a new set over the nodes of the given graph.

Member Function Documentation

◆ count()

bool vg::HandleGraphNodeSet::count ( const handle_t here) const
inline

Return whether a node is in the set, given a handle to either orientation.

◆ insert()

void vg::HandleGraphNodeSet::insert ( const handle_t here)
inline

Add a node to the set, given a handle to either orientation.

◆ size()

size_t vg::HandleGraphNodeSet::size ( ) const
inline

Get the number of nodes in the set.

Member Data Documentation

◆ graph

const HandleGraph* vg::HandleGraphNodeSet::graph
private

◆ visited

unordered_set<handle_t> vg::HandleGraphNodeSet::visited
private

The documentation for this class was generated from the following file: