1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
|
use std::io::{self, BufRead};
use std::time::Instant;
mod graph;
use crate::graph::Graph;
mod theorems;
use crate::theorems::basic::{
bondy_chvatal_hamiltonian_cycle, dirac_theorem, ore_theorem, posa_theorem,
};
use crate::theorems::forbidden;
use crate::theorems::toughness::{theorem15, theorem25};
struct Counters {
graphs: i32,
tough_1: i32,
tough_2: i32,
bch_hamiltonian: i32,
t15_hamiltonian: i32,
t25_hamiltonian: i32,
dirac_hamiltonian: i32,
ore_hamiltonian: i32,
posa_hamiltonian: i32,
}
impl Counters {
fn new() -> Counters {
return Counters {
graphs: 0,
tough_1: 0,
tough_2: 0,
bch_hamiltonian: 0,
t15_hamiltonian: 0,
t25_hamiltonian: 0,
dirac_hamiltonian: 0,
ore_hamiltonian: 0,
posa_hamiltonian: 0,
};
}
}
fn main() {
let stdin = io::stdin();
let mut time = 0;
let mut counters = Counters::new();
for line in stdin.lock().lines() {
let line = line.unwrap();
let g = Graph::from_g6(&line);
counters.graphs += 1;
let start = Instant::now();
let closure = g.get_closure();
let is_complete = closure.is_complete();
let toughness = if g.is_complete() {
f64::MAX
} else {
g.get_toughness()
};
if toughness >= 1.0 {
counters.tough_1 += 1;
}
if toughness >= 2.0 {
counters.tough_2 += 1;
}
let min_degree = g.min_degree() as f64;
// TODO: add counter
if forbidden::theorem3_1(&g) {
println!("g6:t3_1:{}", line);
}
if theorem15(&g, toughness, min_degree) {
counters.t15_hamiltonian += 1;
println!("g6:bigalke-jung:{}", line);
}
if theorem25(&g, toughness, min_degree) {
counters.t25_hamiltonian += 1;
println!("g6:bauer:{}", line);
}
if dirac_theorem(&g) {
counters.dirac_hamiltonian += 1;
println!("g6:dirac:{}", line);
}
if ore_theorem(&g) {
counters.ore_hamiltonian += 1;
println!("g6:ore:{}", line);
}
if posa_theorem(&g) {
counters.posa_hamiltonian += 1;
println!("g6:posa:{}", line);
}
if is_complete {
counters.bch_hamiltonian += 1;
println!("g6:bondy-chvatal:{}", line);
}
if is_complete && false {
println!("Graph: {line}\n{g}");
let components_count = g.count_components();
println!("Components count: {components_count}");
let min_degree = g.min_degree();
println!("Minimal degree: {min_degree}");
let cutset = g.max_independent_cutset();
println!("Maximal independent cutset:\n{}", cutset.graph);
println!("Included vertices: {:?}", cutset.vertices);
println!("Cutset cardinality: {}", cutset.cardinality);
let cycle = bondy_chvatal_hamiltonian_cycle(&g);
print!("Hamiltonian cycle: ");
let start = 0;
let mut current = start;
loop {
print!("{}", current + 1);
print!(" -> ");
current = cycle[current];
if current == start {
println!("{}", current + 1);
break;
}
}
}
let elapsed = start.elapsed();
time += elapsed.as_nanos();
}
println!("Total count of graphs: {}", counters.graphs);
println!("Count of 1-tough graphs: {}", counters.tough_1);
println!("Count of 2-tough graphs: {}", counters.tough_2);
println!(
"Count of Dirac's Hamiltonian graphs: {}",
counters.dirac_hamiltonian
);
println!(
"Count of Ore's Hamiltonian graphs: {}",
counters.ore_hamiltonian
);
println!(
"Count of Posa's Hamiltonian graphs: {}",
counters.posa_hamiltonian
);
println!(
"Count of Bondy-Chvatal Hamiltonian graphs: {}",
counters.bch_hamiltonian
);
println!(
"Count of Theorem 15 Hamiltonian graphs: {}",
counters.t15_hamiltonian
);
println!(
"Count of Theorem 25 Hamiltonian graphs: {}",
counters.t25_hamiltonian
);
println!("Time elapsed: {}s", time as f64 / 1e9);
}
|
