Record a <=k-length walk in the context of a graph. More...

#include <walk.hpp>

Public Member Functions
	walk_t (uint16_t l, const pos_t &b, const pos_t &e, const handle_t &c, uint16_t f)

	walk_t (const std::string &s, const pos_t &b, const pos_t &e, const handle_t &c)

Public Attributes
pos_t	begin
	our start position More...

pos_t	end
	Used in construction. More...

handle_t	curr
	one past the (current) end of the kmer More...

uint16_t	forks
	the next handle we extend into More...

uint16_t	length
	how many branching edge crossings we took to get here More...

std::vector< handle_t >	path
	the walk More...

std::string	seq
	the sequence More...

Detailed Description

Record a <=k-length walk in the context of a graph.

Stores a walk in the context of a graph.

Constructor & Destructor Documentation

◆ walk_t() [1/2]

vg::algorithms::walk_t::walk_t	(	uint16_t	l,
		const pos_t &	b,
		const pos_t &	e,
		const handle_t &	c,
		uint16_t	f
	)

inline

◆ walk_t() [2/2]

vg::algorithms::walk_t::walk_t	(	const std::string &	s,
		const pos_t &	b,
		const pos_t &	e,
		const handle_t &	c
	)

inline

Member Data Documentation

◆ begin

pos_t vg::algorithms::walk_t::begin

our start position

◆ curr

handle_t vg::algorithms::walk_t::curr

one past the (current) end of the kmer

one past the (current) end of the walk

◆ end

pos_t vg::algorithms::walk_t::end

Used in construction.

◆ forks

uint16_t vg::algorithms::walk_t::forks

the next handle we extend into

◆ length

uint16_t vg::algorithms::walk_t::length

how many branching edge crossings we took to get here

◆ path

std::vector<handle_t> vg::algorithms::walk_t::path

the walk

◆ seq

std::string vg::algorithms::walk_t::seq

the sequence

The documentation for this struct was generated from the following files:

src/algorithms/prune.cpp
src/algorithms/walk.hpp

Public Member Functions

Public Attributes