SearchEngine.cpp File Reference

Enumeration (Section "Enumeration" of the paper): the candidate-space index, the edge-orbit index filter, backtracking with optional conflict-directed backjumping, symmetry-broken counting, and counting the last level without visiting it. More...

#include "SearchEngine.h"
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <unordered_map>

Include dependency graph for SearchEngine.cpp:

Namespaces
namespace	anonymous_namespace{SearchEngine.cpp}

Functions
size_t	anonymous_namespace{SearchEngine.cpp}::intersectSorted (const int *a, size_t na, const int *b, size_t nb, int *out)
static std::vector< int64_t >	edgeTriangles (const Escape::CGraph *g)
static int64_t	commonNeighbours (const Escape::CGraph *g, int64_t x, int64_t y)
static double	intersectionCost (int64_t da, int64_t db)

Detailed Description

Enumeration (Section "Enumeration" of the paper): the candidate-space index, the edge-orbit index filter, backtracking with optional conflict-directed backjumping, symmetry-broken counting, and counting the last level without visiting it.

See SearchEngine.h.

Function Documentation

commonNeighbours()

static int64_t commonNeighbours ( const Escape::CGraph *  g, int64_t  x, int64_t  y  )

static

edgeTriangles()

static std::vector< int64_t > edgeTriangles ( const Escape::CGraph *  g )

static

intersectionCost()

static double intersectionCost ( int64_t  da, int64_t  db  )

static