vg
tools for working with variation graphs
|
#include <path_handle_graph.hpp>
Classes | |
class | iterator |
Public Member Functions | |
iterator | begin () const |
iterator | end () const |
~PathForEachSocket ()=default | |
Private Member Functions | |
PathForEachSocket ()=delete | |
PathForEachSocket (const PathHandleGraph *graph, const path_handle_t &path) | |
Private Attributes | |
const PathHandleGraph * | graph |
The graph that contains the path. More... | |
const path_handle_t | path |
The path we're iterating over. More... | |
Friends | |
class | PathHandleGraph |
An auxilliary class that enables for each loops over paths. Not intended to constructed directly. Instead, use the PathHandleGraph's scan_path method.
|
default |
|
privatedelete |
|
private |
PathForEachSocket::iterator handlegraph::PathForEachSocket::begin | ( | ) | const |
PathForEachSocket::iterator handlegraph::PathForEachSocket::end | ( | ) | const |
|
friend |
|
private |
The graph that contains the path.
|
private |
The path we're iterating over.