diff options
Diffstat (limited to 'src/main.rs')
| -rw-r--r-- | src/main.rs | 40 |
1 files changed, 0 insertions, 40 deletions
diff --git a/src/main.rs b/src/main.rs index 3888b2a..fb6faef 100644 --- a/src/main.rs +++ b/src/main.rs @@ -30,18 +30,6 @@ fn main() -> std::io::Result<()> { let cliques = c.get::<Vec<Vec<u32>>>("B"); write!(buffer, "p cnf {} {}\n", ((order * (order - 1)) / 2), 2*cliques.len())?; for clique in cliques { - /*let fedge: [u32; 2] = [clique[0], clique[1]]; - let fresult = edges.iter().position(|&val| val==fedge); - let feindex = match fresult { - Some(val) => val+1, - None => { - edges.push(fedge); - println!("{} = {:?}", edges.len(), fedge); - edges.len() - } - };*/ - //write!(buffer, "x")?; - for a in 0..sclique { for b in a+1..sclique { //i += 1; @@ -64,31 +52,3 @@ fn main() -> std::io::Result<()> { } Ok(()) } - -//fn search_space() { - // I just have to find a single counterexample. A single example of it being possible to color - // the graph such that none of the cliques have all edges colored the same color. - // Finding an example of it being possible to color the graph such that a clique has all edges - // colored the same tells me nothing. - // - // //identify lines that are the most idependent of each other? - // take the first line - // assume 9 of the edges are colored. - // assume the same for the next line - // continue until you've selected a coloring for every edge - // test the coloring - // do the same with different edges (there are 10 choose 1 = 10 ways to do this per line, but - // the lines are obviously not independent) - // test the colorings - // now assume 8 of the edges are colored on the first line (there are 10 choose 2 = 45 ways to - // do this per line) - // count down in reverse order in octary in terms of how many edges are colored per line - // don't bother checking whenever a line is forced to have 0 or 10 edges colored. - // if the fpga ever returns a 1, I have found a counterexample. - // The first lines should be edited first because they have the most control over the next - // lines. - // - // Work in reverse? - // Find what other colorings all the edges of a specific clique being colored the same forces, - // and try to -//} |