|
vg
tools for working with variation graphs
|
#include <dozeu_interface.hpp>
Public Member Functions | |
| OrderedGraph (const HandleGraph &graph, const vector< handle_t > &order) | |
| void | for_each_neighbor (const size_t i, bool go_left, const function< void(size_t)> &lambda) const |
| size_t | size () const |
Public Attributes | |
| const HandleGraph & | graph |
| const vector< handle_t > & | order |
| unordered_map< handle_t, size_t > | index_of |
Represents a HandleGraph with a defined (topological) order calculated for it.
| DozeuInterface::OrderedGraph::OrderedGraph | ( | const HandleGraph & | graph, |
| const vector< handle_t > & | order | ||
| ) |
| void DozeuInterface::OrderedGraph::for_each_neighbor | ( | const size_t | i, |
| bool | go_left, | ||
| const function< void(size_t)> & | lambda | ||
| ) | const |
| size_t DozeuInterface::OrderedGraph::size | ( | ) | const |
| const HandleGraph& vg::DozeuInterface::OrderedGraph::graph |
| unordered_map<handle_t, size_t> vg::DozeuInterface::OrderedGraph::index_of |
| const vector<handle_t>& vg::DozeuInterface::OrderedGraph::order |
1.8.17