![]() |
Structural Bioinformatics Library
Template C++ / Python API for developping structural bioinformatics applications.
|
A dynamic programming algorithm which solves the D family matching problem for trees. More...
#include <Algorithms.hpp>
Public Types | |
typedef T_Tree_solver< Graph > | Self |
typedef T_Sub_graph< Graph > | Sub_graph |
typedef T_Tree< Graph > | Tree |
typedef boost::graph_traits< Graph >::vertex_descriptor | Graph_vertex |
typedef boost::graph_traits< Graph >::edge_descriptor | Edge |
typedef boost::property_map< Graph, boost::edge_weight_t >::type | Edge_weight_map |
typedef std::pair< int, Sub_graph > | Result_map_element |
typedef std::vector< Result_map_element > | Result_map |
Constructors | |
T_Tree_solver (Graph *g) | |
Initialize the pointer to the graph. More... | |
Functor | |
Sub_graph | operator() (Tree &t, unsigned D) |
Command line options | |
boost::program_options::options_description | add_options (void) const |
Just to add options on the command line. More... | |
A dynamic programming algorithm which solves the D family matching problem for trees.
The graph must be weighted.
Graph | Representation of a graph. |
typedef boost::graph_traits<Graph>::edge_descriptor Edge |
typedef boost::property_map<Graph, boost::edge_weight_t>::type Edge_weight_map |
typedef boost::graph_traits<Graph>::vertex_descriptor Graph_vertex |
typedef std::vector<Result_map_element> Result_map |
typedef std::pair<int, Sub_graph> Result_map_element |
typedef T_Tree_solver<Graph> Self |
typedef T_Sub_graph<Graph> Sub_graph |
|
inline |
Initialize the pointer to the graph.
|
inline |
Just to add options on the command line.
|
inline |
A functor that computes a solution to the D family matching problem for a given Tree t (that is a spanning tree on m_graph) and a parameter D. Returns a Sub_graph (which is the optimal constructed solution over the Tree)