vg
tools for working with variation graphs
Toggle main menu visibility
Loading...
Searching...
No Matches
Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
N
haplo
N
haploMath
C
RRMemo
C
int_itvl_t
C
gbwt_thread_t
C
hDP_gbwt_graph_accessor
C
haplo_DP_rectangle
C
haplo_DP_column
C
haplo_DP
C
ScoreProvider
C
GBWTScoreProvider
Score haplotypes using a GBWT haplotype database (normal or dynamic)
N
std
Hash functor to hash
NodeSide
s using std::hash
C
hash< const vg::Snarl >
Hash function for Snarls
C
hash< pair< A, B > >
C
hash< std::tuple< TT... > >
C
hash< vg::NodeSide >
C
hash< vg::NodeTraversal >
Hash function for NodeTraversals
C
hash< vg::ZipCodeTree::oriented_seed_t >
Hash functor to hash oriented_seed_t with std::hash
C
hash< vg::ZipCodeTree::seed_result_t >
Hash functor to hash seed_result_t with std::hash
C
iterator_traits< vg::PhasedGenome::iterator >
C
iterator_traits< vg::ZipCodeTree::distance_iterator >
C
iterator_traits< vg::ZipCodeTree::seed_iterator >
N
vg
N
algorithms
C
Anchor
C
ChainScoringScheme
C
ChainsResult
C
ChainWithRec
C
Edge
C
GFADuplicatePathError
C
GFAFormatError
This exception will be thrown if the GFA data is not acceptable
C
GFAIDMapInfo
C
GFAParser
C
GFATextParser
C
GFAzParser
C
PendingRGFAVisit
C
Graph
C
kmer_t
Stores a kmer in the context of a graph
C
Node
C
TracedScore
C
transition_info
Represents a possible transition between anchors
C
walk_t
Record a <=k-length walk in the context of a graph
N
io
C
ConvertedHashGraph
C
JSONStreamHelper
N
subcommand
C
ArgSpec
C
BaseArgSpec
C
BaseOptionGroup
C
BaseValuation
C
FlagArgSpec
C
GroupedOptionGroup
C
NegationFlagArgSpec
C
OptionGroup
C
Preset
C
RangeArgSpec
C
Subcommand
C
TickChainLink
C
Valuation
C
ValueArgSpec
N
temp_file
C
Handler
C
AbstractReadSampler
C
AliasGraph
C
Aligner
C
AlignerClient
C
AlignmentChainModel
C
AlignmentChainModelVertex
C
AlignmentEmbeddingError
C
AlignmentEmitter
C
AlignmentScorer
C
AlignmentValidity
C
Annotation
C
AugmentedGraph
C
BackTranslatingAlignmentEmitter
C
BandedGlobalAligner
C
BAMatrix
C
AltTracebackStack
C
Deflection
C
BABuilder
C
BandMatricesTooBigException
C
BaseAligner
C
BaseMapper
C
BaseOption
C
BBEdgeHash
C
BenchmarkResult
C
BitString
C
BitStringTree
C
TreeNode
C
CachedPackedTraversalSupportFinder
C
CactusSide
C
CactusSnarlFinder
C
cerrWrapper
C
ChainAlignmentFailedError
C
ChainIterator
C
Colors
C
CompletedTranscriptPath
C
ComponentMinDistanceClusterer
C
Configurable
C
ConfigurableParser
C
connection_t
C
ConsistencyCalculator
C
ConstructedChunk
C
Constructor
C
ContractingGraph
C
count_back_inserter
C
Counts
C
DagifiedGraph
C
Deconstructor
C
ChildContext
C
DeletionAligner
C
DiagramExplainer
C
DinucleotideMachine
C
discrete_distribution
We provide a partial
discrete_distribution
implementation that is just the parts we need
C
DistanceHeuristic
C
DotDumpExplainer
C
DozeuInterface
C
graph_pos_s
C
OrderedGraph
C
DozeuPinningOverlay
C
edit_t
C
EditAlignmentScorer
C
EditedTranscriptPath
C
ExhaustiveTraversalFinder
C
Exon
C
ExpandingOverlayGraph
C
Explainer
C
FeatureSet
C
Feature
C
FixedGenotypePriorCalculator
C
FlatFileBackTranslation
C
FlowCaller
C
FlowSort
C
WeightedGraph
C
Growth
C
FlowTraversalFinder
C
FragmentedHaplotypeVisit
C
FragmentLengthDistribution
C
FragmentLengthStatistics
C
Funnel
C
FilterPerformance
C
PaintableSpace
C
Item
Represents an
Item
whose provenance we track
C
Stage
Represents a
Stage
which is a series of Items, which track their own provenance
C
GAFOutputCaller
C
GAFSorterFile
C
GAFSorterParameters
C
GAFSorterRecord
C
GaplessExtender
C
GaplessExtension
C
GBWTHandler
C
GBWTTraversalFinder
C
GBZGraph
C
GenotypeLikelihoodCalculator
C
GenotypePriorCalculator
C
Genotyper
C
Affinity
C
GFAHandleGraph
Use to load in GFAs and remember where they came from
C
GFFReader
C
GFFRecord
C
Graph
C
GraphCaller
C
GraphSynchronizer
C
Lock
C
GreedyMinDistanceClusterer
C
GrefCover
C
TopLevelSnarlStats
C
GSSWAligner
C
HandleGraphNodeSet
C
HandleGraphSnarlFinder
C
HaplotypeIndexer
C
HaplotypePartitioner
C
Subchain
C
Parameters
Parameters
for
partition_haplotypes()
C
Haplotypes
C
Header
Header
of the serialized file
C
Subchain
Representation of a subchain
C
TopLevelChain
Representation of a top-level chain
C
hash_map
C
hash_map< K *, V >
C
hash_set
C
hash_set< K * >
C
HTSAlignmentEmitter
C
HTSWriter
C
IdentityOverlay
C
IDScanner
C
IncrementalSubgraph
C
FCmp
C
IterFCmp
C
IncrementIter
C
IndexFile
C
IndexingParameters
C
IndexingPlan
C
IndexRecipe
C
IndexRegistry
C
IndirectVectorView
C
InsufficientInputException
C
IntegratedSnarlFinder
C
MergedAdjacencyGraph
C
IntervalUnion
C
is_instantiation_of
C
is_instantiation_of< Predicate< PredicateArgs... >, Predicate >
C
JobSchedule
C
JoinedSpliceGraph
C
kff_recoding_t
A mapping of character values from KFF encoding to minimizer index encoding
C
kmer_t
C
KmerPosition
C
LazyRNG
C
LegacyCaller
C
LoggedGapAlignmentScorer
C
Logger
C
Mapper
C
mapping_t
C
MappingHash
C
MappingQualityCalculator
C
Masker
C
MatchPos
C
PathList
C
MatrixAlignmentScorer
C
MaximalExactMatch
C
MCMCCaller
C
MCMCGenotyper
C
MEMAccelerator
C
MEMChainModel
C
MEMChainModelVertex
C
MEMClusterer
C
HitEdge
C
HitNode
C
HitGraph
C
DPScoreComparator
C
MemoizingGraph
C
MinDistanceClusterer
C
MinimizerIndexParameters
Minimizer index construction parameters
C
MinimizerMapper
C
Minimizer
C
aligner_stats_t
Struct to represent per-DP-method stats
C
stat_collection_t
Collection of values you can +=
C
stat_set_t
Struct to represent counts of bases or seconds or invocations used by different aligners
C
read_alignment_index_t
Type to point to an alignment of a known read
C
alignment_index_t
C
MIPayload
C
MSAConverter
C
multipath_alignment_t
C
MultipathAlignmentEmitter
C
MultipathAlignmentGraph
C
MultipathMapper
C
MultipathProblem
C
NameMapper
C
NestedCachedPackedTraversalSupportFinder
C
snarl_less
C
NestedFlowCaller
C
CallRecord
Stuff we remember for each snarl call, to be used when genotyping its parent
C
NetGraph
C
NGSSimulator
C
MarkovDistribution
C
NoAlignmentInBandException
C
NodeSide
C
NodeTraversal
C
normal_distribution
C
NullClusterer
C
NullMaskingGraph
C
Option
C
Option< vector< Item >, Parser >
C
OptionInterface
C
OptionValueParser
C
OptionValueParser< vector< Item > >
C
OrientedDistanceClusterer
C
OrientedDistanceMeasurer
C
PackedTraversalSupportFinder
C
Packer
C
Packers
C
pair_hash_map
C
pair_hash_set
C
PairedEndMapper
C
ParallelKFFReader
C
ParentGenotypeInfo
C
path_mapping_t
C
path_t
C
PathBasedTraversalFinder
C
PathBranch
C
PathChunker
C
PathComponentIndex
C
PathIndex
C
PathNode
C
PathOrientedDistanceMeasurer
C
PathPiece
A maximal piece of a path whose nodes and edges all exist in a GBWT index
C
PathRestrictedTraversalFinder
C
Paths
C
PathSubgraph
C
PathSubgraphOverlay
C
PathTraversalFinder
C
PhasedGenome
C
HaplotypeNode
C
Haplotype
C
iterator
C
PhaseUnfolder
C
Pictographs
C
PoissonSupportSnarlCaller
C
PoissonCallInfo
C
position_t
C
PositionIDScanner
C
Primer
C
PrimerFinder
C
PrimerPair
C
ProblemDumpExplainer
C
Progressive
C
QualAdjAligner
C
QualAdjAlignmentScorer
C
QualAdjXdropAligner
C
Range
C
RareVariantSimplifier
C
RatioSupportSnarlCaller
C
ReadFilter
C
ReadMasker
C
ReadRestrictedTraversalFinder
C
RebuildJob
C
RebuildParameters
Parameters for
rebuild_gbwt
C
Recombinator
C
Statistics
Statistics
on the generated haplotypes
C
Parameters
Parameters
for
generate_haplotypes()
C
LocalHaplotype
A local haplotype sequence within a single subchain
C
RecombinatorFragment
C
RecombinatorHaplotype
C
Region
C
RegionExpander
C
RepresentativeTraversalFinder
C
ReverseGraph
C
RewindPlanException
C
Sampler
C
SeqComplexity
C
SequenceDictionaryEntry
C
ShuffledPairs
C
iterator
C
SimpleConsistencyCalculator
C
SimpleTraversalSupportCalculator
C
SizeLimitExceededException
C
SmallBitset
C
SmallSnarlSimplifier
C
SnarlCaller
C
CallInfo
C
SnarlDistanceIndexClusterer
C
Seed
Seed
information used in Giraffe
C
SeedCache
Seed
information used for clustering
C
Cluster
Cluster
information used in Giraffe
C
SnarlTreeNodeProblem
C
SnarlTreeChild
C
ClusterHead
C
ClusteringProblem
C
SnarlFinder
C
SnarlGraph
C
SnarlManager
C
SnarlRecord
C
SnarlMinDistance
C
SnarlOrientedDistanceMeasurer
C
SourceSinkOverlay
C
SparseUnionFind
C
SplicedHTSAlignmentEmitter
C
SpliceRegion
C
SpliceStats
C
SSWAligner
C
state_hash
C
StrandSplitGraph
C
StreamIndex
C
StreamIndexBase
C
StreamSorter
C
string_hash_map
C
string_hash_set
C
SubgraphExplainer
C
SubgraphOverlay
C
SubHandleGraph
C
subpath_t
C
SubpathOverlay
C
SummaryStatistics
C
SupportAugmentedGraph
Augmented
Graph
that holds some Support annotation data specific to vg call
C
SupportBasedSnarlCaller
C
SupportRestrictedTraversalFinder
C
SurjectingAlignmentEmitter
C
Surjector
C
TargetValueSearch
C
TipAnchoredMaxDistance
C
Transcript
C
Transcriptome
C
TranscriptPath
C
Translator
C
TraversalFinder
C
TraversalSupportCalculator
C
TraversalSupportFinder
C
Tree
C
TreeNode
C
TreeSubgraph
C
TrivialTraversalFinder
C
truncated_normal_distribution
C
TSVExplainer
C
TVSClusterer
C
uniform_int_distribution
C
uniform_real_distribution
C
VariantAdder
C
varint_vector_t
C
VcfBuffer
C
VCFGenotyper
C
VCFOutputCaller
C
SuppressedRef
C
VcfRecordConverter
C
VcfRecordFilter
C
VCFTraversalFinder
C
VectorView
C
const_iterator
Random access iterator
C
VectorViewInverse
C
Version
Class for holding vg version and build environment information
C
VG
C
Plan
Structure for managing parallel construction of a graph
C
VGIndexes
C
VGset
C
Viz
C
wang_hash
C
wang_hash< handle_t >
C
wang_hash< handlegraph::net_handle_t >
Define
wang_hash
for net_handle_t's so that we can use a
hash_map
C
wang_hash< net_identifier_t >
C
wang_hash< NodeSide >
C
wang_hash< NodeTraversal >
Hash function for NodeTraversals
C
wang_hash< path_handle_t >
C
wang_hash< std::pair< A, B > >
C
wang_hash< T * >
C
wang_hash< T, typename std::enable_if< std::is_integral< T >::value >::type >
C
Watchdog
C
thread_state_t
C
WFAAlignment
C
WFAExtender
C
ErrorModel
C
Event
C
WFANode
C
WFAPoint
C
WFATree
C
ScoreProperties
C
WideningPRNG
C
WindowedVcfBuffer
C
WrappingPositionScanner
C
XdropAligner
C
ZipCode
C
decoder_t
C
node_code_t
C
chain_code_t
C
snarl_code_t
C
ZipCodeCollection
C
ZipCodeForest
C
forest_growing_state_t
This stores information about the state of the forest as we fill it in
C
seed_info_t
C
child_info_t
C
interval_state_t
C
sort_value_t
C
ZipCodeTree
C
tree_item_t
One item in the zip code tree, representing a node or edge of the tree
C
oriented_seed_t
C
seed_result_t
C
seed_iterator
C
distance_iterator
C
iteration_position
C
zstd_compress_buf
Zstandard compression buffer that writes to another stream buffer
C
zstd_decompress_buf
Zstandard decompression buffer that reads from another stream buffer
C
zstd_ifstream
C
zstd_ofstream
C
ChainsConfig
C
GBWTConfig
C
GiraffeMainOptions
Options struct for options for the Giraffe driver (i.e. this file)
C
GraphHandler
C
HaplotypesConfig
C
job_type
C
MappingRun
C
MinimizerConfig
C
PruningParameters
C
ReferenceInterval
C
ScoringOptions
Options struct for scoring-related parameters. Defaults are in
aligner.hpp
C
Vectorizer
Generated by
1.17.0