src/common/tree_decomp.h

/*

This tree decomposition based library was written by 
Kyle Ellrott (kellrott@csbl.bmb.uga.edu)
and is distributed under the GPL v2.0 license

*/

#ifndef __td_decomp_h__
#define __td_decomp_h__


typedef struct td_graph {
        long vertex_count, edge_count;
        long *state_count;
        double **vertex_score, ***edge_score;
        char **matrix;
} td_graph;

typedef struct td_decomp {
        td_graph *graph;
        long bag_count;
        long *bag_size;
        long **bag;
        char **bag_matrix;
        long root;
} td_decomp;


char **td_matrix_init( long vertex_count );
td_graph * td_graph_init( long vertex_count, long *state_count, char **matrix );

void td_matrix_free( char ** graph);
void td_graph_free( td_graph *graph);


td_decomp * td_graph_decomp_tri( td_graph *graph );

long *td_graph_decomp_solve( td_decomp *decomp  );


inline double td_edge_get( td_graph *graph, long vertex_1, long vertex_2, long state_1, long state_2 ) {
        if (vertex_2 > vertex_1) {
                return graph->edge_score[ vertex_1 * graph->vertex_count + vertex_2 ][ state_1 ][ state_2 ];            
        }
        return graph->edge_score[ vertex_2 * graph->vertex_count + vertex_1 ][ state_2 ][ state_1 ];            
}

inline void td_edge_set( td_graph *graph, long vertex_1, long vertex_2, long state_1, long state_2, double val ) {
        if (vertex_2 > vertex_1) {
                graph->edge_score[ vertex_1 * graph->vertex_count + vertex_2 ][ state_1 ][ state_2 ] = val;             
        } else {
                graph->edge_score[ vertex_2 * graph->vertex_count + vertex_1 ][ state_2 ][ state_1 ] = val;             
        }
}

inline long td_edge_offset( td_graph *graph, long vertex_1, long vertex_2) {
        return vertex_1 * graph->vertex_count + vertex_2;
}




#endif

---