Structural Bioinformatics Library
Template C++ / Python API for developping structural bioinformatics applications.
T_Maximum_spanning_tree_generator< Graph > Class Template Reference

Generates a Maximum spanning tree over a given graph (using boost::graph). More...

#include <Spanning_tree_generators.hpp>

Classes

struct  Negative_graph_vertex_property
 To compute the Maximum spanning tree, we use a negative version of the original graph. More...
 

Public Types

typedef boost::property< boost::edge_weight_t, int > Negative_edge_weight_property
 In this sub graph, the weights will be negative. More...
 
typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::undirectedS, Negative_graph_vertex_property, Negative_edge_weight_propertyNegative_sub_graph_type
 The basic sub-graph type is defined using boost::graph. More...
 

Constructors

 T_Maximum_spanning_tree_generator (Graph g)
 
 T_Maximum_spanning_tree_generator (Graph *g)
 

Functor

template<class Tree >
void operator() (std::vector< Graph_vertex > connected_component, Tree &t)
 A functor to compute the spanning tree over a given connected component (it will be stored in the template Tree class object passed as parameter). More...
 

Command line options

boost::program_options::options_description add_options (void)
 

Detailed Description

template<class Graph>
class SBL::CADS::T_Maximum_spanning_tree_generator< Graph >

Generates a Maximum spanning tree over a given graph (using boost::graph).

Template Parameters
GraphRepresentation of the intersection graph.

Class Documentation

◆ SBL::CADS::T_Maximum_spanning_tree_generator::Negative_graph_vertex_property

struct SBL::CADS::T_Maximum_spanning_tree_generator::Negative_graph_vertex_property

template<class Graph>
struct SBL::CADS::T_Maximum_spanning_tree_generator< Graph >::Negative_graph_vertex_property

To compute the Maximum spanning tree, we use a negative version of the original graph.

Member Typedef Documentation

◆ Negative_edge_weight_property

typedef boost::property<boost::edge_weight_t, int> Negative_edge_weight_property

In this sub graph, the weights will be negative.

◆ Negative_sub_graph_type

typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, Negative_graph_vertex_property, Negative_edge_weight_property> Negative_sub_graph_type

The basic sub-graph type is defined using boost::graph.

Member Function Documentation

◆ operator()()

void operator() ( std::vector< Graph_vertex >  connected_component,
Tree &  t 
)
inline

A functor to compute the spanning tree over a given connected component (it will be stored in the template Tree class object passed as parameter).