class QuickBB

Overview

#include <QuickBB.h>

class QuickBB
{
public:
    // classes

    class Graph;

    // methods

    static std::pair<size_t, adj_arr_t> compute(Graph& graph, size_t alloted_time);

    static std::pair<size_t, adj_arr_t> compute(
        const std::vector<std::pair<size_t, size_t>>& vertice_vect,
        size_t alloted_time
        );

    static void make_clique(
        Graph& graph,
        const adj_arr_t& vertices
        );

    static bool is_clique(
        const Graph& graph,
        const adj_arr_t& vertices
        );

    static bool simplicial(
        const Graph& graph,
        vertex_index_t vertex
        );

    static bool almost_simplicial(
        const Graph& graph,
        vertex_index_t vertex
        );

    static void eliminate(
        Graph& graph,
        vertex_index_t vertex
        );

    static size_t count_fillin(
        const Graph& graph,
        adj_arr_t vertices
        );

    static std::pair<adj_arr_t, size_t> upper_bound(const Graph& graph);
    static size_t lower_bound(const Graph& graph);
};

Detailed Documentation

Methods

static std::pair<size_t, adj_arr_t> compute(Graph& graph, size_t alloted_time)

compute the optimal order

Parameters:

Graph	QuickBB graph
size_t	alloted compute time

Returns:

std::pair<size_t, adj_arr_t> first : tree width , second : order

static std::pair<size_t, adj_arr_t> compute(
    const std::vector<std::pair<size_t, size_t>>& vertice_vect,
    size_t alloted_time
    )

compute the optimal order

Parameters:

std::vector<std::pair<size_t
size_t>>	QuickBB graph
size_t	alloted compute time

Returns:

std::pair<size_t, adj_arr_t> first : tree width , second : order