OKlibrary  0.2.1.6
VertexBranching.hpp File Reference

Computing (basically) all transversals of size up to B, by branching on vertices. More...

#include <list>
#include <vector>
#include <iterator>
#include <cassert>
#include <algorithm>
#include <functional>
#include <ostream>
#include <iomanip>
#include <set>
#include <OKlib/Structures/Sets/SetAlgorithms/BasicSetOperations.hpp>

Go to the source code of this file.

Classes

class  OKlib::Combinatorics::Hypergraphs::Transversals::Bounded::Bounded_transversals_bv< SetSystem >
 Functor, which for a given set system G and a bound B computes (essentially) all transversals of G of size at most B. More...
class  OKlib::Combinatorics::Hypergraphs::Transversals::Bounded::TransversalPredicate< SetSystem >
 Unary predicate for checking whether a set of vertices is a transversal of a given hypergraph. More...
class  OKlib::Combinatorics::Hypergraphs::Transversals::Bounded::Minimum_transversals_mongen< SetSystem, Generator, Output >
 Computing all minimum transversals for hypergraphs gen(N0+1), ..., gen(Nmax). More...
class  OKlib::Combinatorics::Hypergraphs::Transversals::Bounded::TrivialOutput< SetSystem >
 Functor for just outputting the number of minimum transversals (together with the number of vertices and the minimum size of a transversal) More...
class  OKlib::Combinatorics::Hypergraphs::Transversals::Bounded::DirectStratification< SetSystem, UInt >
 Transforms a set-system into a standardised stratified set-system according to the order on the vertices. More...

Namespaces

namespace  OKlib
 

All components of the OKlibrary.


namespace  OKlib::Combinatorics
 

The part of the OKlibrary for general combinatorics.


namespace  OKlib::Combinatorics::Hypergraphs
 

Supermodule for dedicated hypergraph algorithms.


namespace  OKlib::Combinatorics::Hypergraphs::Transversals
 

Components for handling hypergraph transversals.


namespace  OKlib::Combinatorics::Hypergraphs::Transversals::Bounded
 

Components for handling hypergraph transversals of bounded size.



Detailed Description

Computing (basically) all transversals of size up to B, by branching on vertices.

The role model is transversals_bv (and transversals_bvs) in ComputerAlgebra/Hypergraphs/Lisp/Transversals/Bounded/MaintainingBound.mac

Definition in file VertexBranching.hpp.