Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
find_graph_symmetries.h File Reference
#include <cstdint>
#include <memory>
#include <string>
#include <vector>
#include "absl/numeric/int128.h"
#include "absl/status/status.h"
#include "absl/time/time.h"
#include "absl/types/span.h"
#include "ortools/algorithms/dynamic_partition.h"
#include "ortools/algorithms/dynamic_permutation.h"
#include "ortools/graph/graph.h"
#include "ortools/graph/iterators.h"
#include "ortools/util/stats.h"
#include "ortools/util/time_limit.h"

Go to the source code of this file.

Classes

class  operations_research::GraphSymmetryFinder
 

Namespaces

namespace  operations_research
 In SWIG mode, we don't want anything besides these top-level includes.
 

Functions

std::vector< int > operations_research::CountTriangles (const ::util::StaticGraph< int, int > &graph, int max_degree)
 HELPER FUNCTIONS: PUBLIC FOR UNIT TESTING ONLY.
 
void operations_research::LocalBfs (const ::util::StaticGraph< int, int > &graph, int source, int stop_after_num_nodes, std::vector< int > *visited, std::vector< int > *num_within_radius, std::vector< bool > *tmp_mask)