#include <dozeu_interface.hpp>
Represents a HandleGraph with a defined (topological) order calculated for it.
◆ OrderedGraph()
| DozeuInterface::OrderedGraph::OrderedGraph |
( |
const HandleGraph & | graph, |
|
|
const vector< handle_t > & | order ) |
◆ for_each_neighbor()
| void DozeuInterface::OrderedGraph::for_each_neighbor |
( |
const size_t | i, |
|
|
bool | go_left, |
|
|
const function< void(size_t)> & | lambda ) const |
◆ size()
| size_t DozeuInterface::OrderedGraph::size |
( |
| ) |
const |
◆ graph
| const HandleGraph& vg::DozeuInterface::OrderedGraph::graph |
◆ index_of
| unordered_map<handle_t, size_t> vg::DozeuInterface::OrderedGraph::index_of |
◆ order
| const vector<handle_t>& vg::DozeuInterface::OrderedGraph::order |
The documentation for this struct was generated from the following files: