Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <cstddef>
#include <cstdint>
#include <functional>
#include <limits>
#include <numeric>
#include <string>
#include <vector>
#include "absl/strings/str_cat.h"
#include "ortools/base/int_type.h"
#include "ortools/base/logging.h"
#include "ortools/base/strong_vector.h"
#include "ortools/util/time_limit.h"
Go to the source code of this file.
Classes | |
class | operations_research::BronKerboschAlgorithm< NodeIndex > |
Namespaces | |
namespace | operations_research |
In SWIG mode, we don't want anything besides these top-level includes. | |
Enumerations | |
enum class | operations_research::CliqueResponse { operations_research::CONTINUE , operations_research::STOP } |
enum class | operations_research::BronKerboschAlgorithmStatus { operations_research::COMPLETED , operations_research::INTERRUPTED } |
Functions | |
void | operations_research::FindCliques (std::function< bool(int, int)> graph, int node_count, std::function< bool(const std::vector< int > &)> callback) |
void | operations_research::CoverArcsByCliques (std::function< bool(int, int)> graph, int node_count, std::function< bool(const std::vector< int > &)> callback) |