|
vg
tools for working with variation graphs
|
Public Member Functions | |
| MinimizerConfig (int argc, char **argv, int max_threads, const Logger &logger) | |
Public Attributes | |
| std::string | output_name |
| std::string | distance_name |
| std::string | zipcode_name |
| std::string | graph_name |
| MinimizerIndexParameters | params |
| bool | require_distance_index = true |
| bool | require_path_payloads = false |
| bool | progress = false |
| int | threads = get_default_threads() |
| MinimizerConfig::MinimizerConfig | ( | int | argc, |
| char ** | argv, | ||
| int | max_threads, | ||
| const Logger & | logger ) |
| std::string MinimizerConfig::distance_name |
| std::string MinimizerConfig::graph_name |
| std::string MinimizerConfig::output_name |
| MinimizerIndexParameters MinimizerConfig::params |
| bool MinimizerConfig::progress = false |
| bool MinimizerConfig::require_distance_index = true |
| bool MinimizerConfig::require_path_payloads = false |
Should we enforce that the resulting minimizer index has path payloads, for recombination-aware mapping?
| int MinimizerConfig::threads = get_default_threads() |
| std::string MinimizerConfig::zipcode_name |
1.17.0