![]() |
Structural Bioinformatics Library
Template C++ / Python API for developping structural bioinformatics applications.
|
A heuristic algorithm to solve the D-Family-matching problem by using spanning trees. More...
#include <Spanning_tree_solver.hpp>
Classes | |
class | Meta_clusters_iterator |
Public Types | |
typedef IntersectionGraph | Intersection_graph |
typedef SpanningTreeGenerator | ST_computer |
typedef StopCondition | SC_computer |
typedef T_Spanning_tree_solver< Intersection_graph, SC_computer, ST_computer, Algorithm > | Self |
typedef boost::graph_traits< Intersection_graph >::vertex_descriptor | Intersection_graph_vertex |
typedef boost::graph_traits< Intersection_graph >::edge_descriptor | Intersection_graph_edge |
typedef boost::property_map< Intersection_graph, boost::edge_weight_t >::type | Intersection_graph_edge_weight_map |
typedef Algorithm::Sub_graph | Sub_graph |
typedef Algorithm::Tree | Tree |
typedef SC_computer::Solution_space | Solution_type |
typedef std::vector< Sub_graph > | Results |
typedef std::map< unsigned, std::vector< Intersection_graph_vertex > > | Meta_cluster_map |
typedef Meta_cluster_map::iterator | Map_iterator |
typedef std::vector< Intersection_graph_vertex >::iterator | Clusters_iterator |
Constructors | |
T_Spanning_tree_solver () | |
The best score is always initialized at 0. More... | |
T_Spanning_tree_solver (Intersection_graph *g) | |
T_Spanning_tree_solver (const Self &other) | |
Functor | |
unsigned | operator() (unsigned D, Solution_type &solutions) |
A functor to solve the D-Family-matching problem using the heuristic algorithm on the given intersection graph m_graph. Updates the graph if required. More... | |
Iterators | |
Meta_clusters_iterator | meta_clusters_begin () |
Iterate over meta clusters. More... | |
Meta_clusters_iterator | meta_clusters_end () |
Clusters_iterator | clusters_in_meta_cluster_begin (unsigned meta_index) |
Iterate over clusters contained in a meta cluster. More... | |
Clusters_iterator | clusters_in_meta_cluster_end (unsigned meta_index) |
Command line options | |
boost::program_options::options_description | add_options (void) const |
Just to add options on the command line. More... | |
A heuristic algorithm to solve the D-Family-matching problem by using spanning trees.
The graph must be weighted.
Graph | Representation of the intersection graph. |
StopCondition | A functor to compute if the stop condition is met. Also provides the definitions of the Solution space (which is inherent to a particular stop condition). |
SpanningTreeGenerator | A method to generate a spanning tree over a connected component of the intersection graph |
Algorithm | The algorithm to solve the D-Family-matching problem over a tree. |
typedef std::vector<Intersection_graph_vertex>::iterator Clusters_iterator |
typedef IntersectionGraph Intersection_graph |
typedef boost::graph_traits<Intersection_graph>::edge_descriptor Intersection_graph_edge |
typedef boost::property_map<Intersection_graph, boost::edge_weight_t>::type Intersection_graph_edge_weight_map |
typedef boost::graph_traits<Intersection_graph>::vertex_descriptor Intersection_graph_vertex |
typedef Meta_cluster_map::iterator Map_iterator |
typedef std::map<unsigned, std::vector<Intersection_graph_vertex> > Meta_cluster_map |
typedef StopCondition SC_computer |
typedef T_Spanning_tree_solver<Intersection_graph, SC_computer, ST_computer, Algorithm> Self |
typedef SC_computer::Solution_space Solution_type |
typedef SpanningTreeGenerator ST_computer |
typedef Algorithm::Sub_graph Sub_graph |
typedef Algorithm::Tree Tree |
|
inline |
The best score is always initialized at 0.
|
inline |
|
inline |
|
inline |
Just to add options on the command line.
|
inline |
Iterate over clusters contained in a meta cluster.
|
inline |
|
inline |
Iterate over meta clusters.
|
inline |
|
inline |
A functor to solve the D-Family-matching problem using the heuristic algorithm on the given intersection graph m_graph. Updates the graph if required.