#include <cmath>
#include <memory>
#include <iterator>
#include <iostream>
#include <vector>
#include <list>
#include <algorithm>
#include <set>
#include <unordered_map>
#include <fstream>
#include <string>
#include <thread>
#include <mutex>
Go to the source code of this file.
|
struct | canonic_wraper |
| Wraper for comunicating through threads More...
|
|
struct | graph |
| Main class to store all the information about graph, edges, vertices, ... More...
|
|
struct | Vertex |
| Class to store vertex, containing information about edge to_ going into it More...
|
|
struct | Face |
| Structure to store a face containing about one edge incident to it More...
|
|
struct | Edge |
| Structure to store the edge containing information about next_ , prev_ , opposite_ edges and vertices and face incident to it. More...
|
|
struct | fingerprints |
| Structure for generating all fingerprints iteratively. More...
|
|
struct | smart_permutations |
| Structure to go through only needed fingerprints. First try all rellabilings of rotation producing "12345" and then all producing "15432". Then move the another vertex. More...
|
|
|
using | array_4D = vector< vector< vector< vector< bool > > > > |
|
◆ M_PI
#define M_PI 3.14159265358979323846 |
◆ SIZE_OF_ARRAY
◆ array_4D
using array_4D = vector<vector<vector<vector<bool> > > > |
◆ factorial()
long long factorial |
( |
int |
n | ) |
|
|
inline |
◆ find_lexical_min_rotation()
string find_lexical_min_rotation |
( |
string |
str | ) |
|
|
inline |
◆ is_correct_K4()
bool is_correct_K4 |
( |
vector< int > |
orders[4] | ) |
|
|
inline |
Check if given rotations of K4 form a realizable K4.
- Parameters
-
- Returns
◆ precount_factorials()
void precount_factorials |
( |
| ) |
|
|
inline |
◆ print_graph()
void print_graph |
( |
graph * |
g | ) |
|
|
inline |
◆ fact