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

//!An implementation of
//![flag algebras](http://people.cs.uchicago.edu/~razborov/files/flag.pdf).
//!
//!
//!
//!# Example
//!
//!```rust,no_run
//!extern crate flag_algebra;
//!
//!use flag_algebra::*;
//!use crate::sdp::Problem;
//!use crate::flags::Graph;
//!use crate::operator::Basis;
//!
//!pub fn main() {
//!    // Work on the graphs of size 3.
//!    let basis = Basis::new(3);
//!
//!    // Define useful flags.
//!    let k3 = flag(&Graph::new(3, &[(0,1),(1,2),(2,0)])); // Triangle
//!    let e3 = flag(&Graph::new(3, &[])); // Independent set of size 3
//!
//!    // Definition of the optimization problem.
//!    let pb = Problem::<i64, _> {
//!        // Constraints
//!        ineqs: vec!(total_sum_is_one(basis),
//!                    flags_are_nonnegative(basis)),
//!        // Use all relevant Cauchy-Schwarz inequalities.
//!        cs: basis.all_cs(),
//!        // Minimize density of triangle plus density of independent of size 3.
//!        obj: k3 + e3,
//!    };
//!
//!    // Write the correspondind SDP program in "goodman.sdpa".
//!    // This program can then be solved by CSDP.
//!    pb.write_sdpa("goodman").unwrap();
//!}
//!```
//!

#![warn(
    //missing_docs,
    missing_debug_implementations,
    missing_copy_implementations,
    trivial_casts,
    trivial_numeric_casts,
    unsafe_code,
    unstable_features,
    unused_import_braces,
    unused_qualifications,
    unused_labels,
    unused_results,
)]

mod algebra;
pub use crate::algebra::*;

pub mod combinatorics;
pub mod common;
pub mod density;
pub mod flags;
pub mod iterators;
pub mod operator;
pub use crate::operator::Basis;

pub mod prettyprint;
pub mod sdp;

mod flag;
pub use crate::flag::*;

#[macro_use]
extern crate serde_derive;