|
| bool | vg::start_backward (const Chain &chain) |
| |
| bool | vg::end_backward (const Chain &chain) |
| |
| Visit | vg::get_start_of (const Chain &chain) |
| |
| Visit | vg::get_end_of (const Chain &chain) |
| |
| ChainIterator | vg::chain_begin (const Chain &chain) |
| |
| ChainIterator | vg::chain_end (const Chain &chain) |
| |
| ChainIterator | vg::chain_rbegin (const Chain &chain) |
| |
| ChainIterator | vg::chain_rend (const Chain &chain) |
| |
| ChainIterator | vg::chain_rcbegin (const Chain &chain) |
| |
| ChainIterator | vg::chain_rcend (const Chain &chain) |
| |
| ChainIterator | vg::chain_begin_from (const Chain &chain, const Snarl *start_snarl, bool snarl_orientation) |
| |
| ChainIterator | vg::chain_end_from (const Chain &chain, const Snarl *start_snarl, bool snarl_orientation) |
| |
| edge_t | vg::to_edge (const handlegraph::HandleGraph &graph, const Visit &v1, const Visit &v2) |
| | Make an edge_t from a pair of visits. More...
|
| |
| bool | vg::operator== (const Visit &a, const Visit &b) |
| |
| bool | vg::operator!= (const Visit &a, const Visit &b) |
| |
| bool | vg::operator< (const Visit &a, const Visit &b) |
| |
| ostream & | vg::operator<< (ostream &out, const Visit &visit) |
| |
| bool | vg::operator== (const SnarlTraversal &a, const SnarlTraversal &b) |
| |
| bool | vg::operator!= (const SnarlTraversal &a, const SnarlTraversal &b) |
| |
| bool | vg::operator< (const SnarlTraversal &a, const SnarlTraversal &b) |
| |
| bool | vg::operator== (const Snarl &a, const Snarl &b) |
| |
| bool | vg::operator!= (const Snarl &a, const Snarl &b) |
| |
| bool | vg::operator< (const Snarl &a, const Snarl &b) |
| |
| ostream & | vg::operator<< (ostream &out, const Snarl &snarl) |
| |
