OKlibrary  0.2.1.6
EliminationSequences.hpp File Reference

Methods for handling elimination sequences for graphs (related to the notion of treewidth) More...

#include <cassert>
#include <utility>
#include <functional>
#include <vector>
#include <algorithm>
#include <boost/range/value_type.hpp>
#include <boost/range/const_iterator.hpp>
#include <boost/range/empty.hpp>
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>
#include <boost/utility.hpp>
#include <boost/static_assert.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/graph_concepts.hpp>
#include <boost/iterator/counting_iterator.hpp>
#include <boost/iterator/transform_iterator.hpp>
#include <boost/range/iterator_range.hpp>

Go to the source code of this file.

Classes

class  OKlib::GraphDecomposition::Width_elimination_sequence< EliminationSequence, Graph >
 Functor computing the width induced by an elimination sequence. More...
struct  OKlib::GraphDecomposition::Treewidth_by_enumerating_elimination_sequences< Graph >
class  OKlib::GraphDecomposition::Treewidth_by_enumerating_elimination_sequences< Graph >::DeIndex< Container, Index >

Namespaces

namespace  OKlib
 

All components of the OKlibrary.


namespace  OKlib::GraphDecomposition
 

Module for SAT decision by means of graph decomposition.



Detailed Description

Methods for handling elimination sequences for graphs (related to the notion of treewidth)

Definition in file EliminationSequences.hpp.