refactor: update all imports, tests, examples, and docs for new categories

Updates imports across unit tests, integration tests, examples, benchmarks,
CLI, solver, and source doc comments from old categories (optimization,
satisfiability, specialized) to new ones (algebraic, formula, graph, misc).

Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>

Author: GiggleLiu

benches/solver_benchmarks.rs

@@ -1,11 +1,10 @@
 //! Benchmarks for the BruteForce solver on various problem types.
 
 use criterion::{criterion_group, criterion_main, BenchmarkId, Criterion};
+use problemreductions::models::formula::*;
 use problemreductions::models::graph::*;
-use problemreductions::models::optimization::*;
-use problemreductions::models::satisfiability::*;
+use problemreductions::models::misc::*;
 use problemreductions::models::set::*;
-use problemreductions::models::specialized::*;
 use problemreductions::prelude::*;
 use problemreductions::topology::SimpleGraph;
 use problemreductions::variant::K3;

examples/reduction_circuitsat_to_ilp.rs

@@ -23,8 +23,8 @@
 // ```
 
 use problemreductions::export::*;
-use problemreductions::models::optimization::ILP;
-use problemreductions::models::specialized::{Assignment, BooleanExpr, Circuit};
+use problemreductions::models::algebraic::ILP;
+use problemreductions::models::formula::{Assignment, BooleanExpr, Circuit};
 use problemreductions::prelude::*;
 
 pub fn run() {

examples/reduction_circuitsat_to_spinglass.rs

@@ -17,7 +17,7 @@
 // Exports `docs/paper/examples/circuitsat_to_spinglass.json` and `circuitsat_to_spinglass.result.json`.
 
 use problemreductions::export::*;
-use problemreductions::models::specialized::{Assignment, BooleanExpr, Circuit};
+use problemreductions::models::formula::{Assignment, BooleanExpr, Circuit};
 use problemreductions::prelude::*;
 use problemreductions::topology::{Graph, SimpleGraph};
 

examples/reduction_factoring_to_circuitsat.rs

@@ -19,7 +19,7 @@
 // Exports `docs/paper/examples/factoring_to_circuitsat.json` and `factoring_to_circuitsat.result.json`.
 
 use problemreductions::export::*;
-use problemreductions::models::specialized::Circuit;
+use problemreductions::models::formula::Circuit;
 use problemreductions::prelude::*;
 use std::collections::HashMap;
 

examples/reduction_factoring_to_ilp.rs

@@ -18,7 +18,7 @@
 // Exports `docs/paper/examples/factoring_to_ilp.json` for use in paper code blocks.
 
 use problemreductions::export::*;
-use problemreductions::models::optimization::ILP;
+use problemreductions::models::algebraic::ILP;
 use problemreductions::prelude::*;
 use problemreductions::solvers::ILPSolver;
 

examples/reduction_ilp_to_qubo.rs

@@ -36,7 +36,7 @@
 // ```
 
 use problemreductions::export::*;
-use problemreductions::models::optimization::{LinearConstraint, ObjectiveSense, ILP};
+use problemreductions::models::algebraic::{LinearConstraint, ObjectiveSense, ILP};
 use problemreductions::prelude::*;
 
 pub fn run() {

examples/reduction_kcoloring_to_ilp.rs

@@ -16,7 +16,7 @@
 // Exports `docs/paper/examples/kcoloring_to_ilp.json` and `kcoloring_to_ilp.result.json`.
 
 use problemreductions::export::*;
-use problemreductions::models::optimization::ILP;
+use problemreductions::models::algebraic::ILP;
 use problemreductions::prelude::*;
 use problemreductions::solvers::ILPSolver;
 use problemreductions::topology::small_graphs::petersen;

examples/reduction_maximumclique_to_ilp.rs

@@ -15,7 +15,7 @@
 // Exports `docs/paper/examples/maximumclique_to_ilp.json` and `maximumclique_to_ilp.result.json`.
 
 use problemreductions::export::*;
-use problemreductions::models::optimization::ILP;
+use problemreductions::models::algebraic::ILP;
 use problemreductions::prelude::*;
 use problemreductions::topology::small_graphs::octahedral;
 use problemreductions::topology::{Graph, SimpleGraph};

examples/reduction_maximumindependentset_to_ilp.rs

@@ -14,7 +14,7 @@
 // Exports `docs/paper/examples/maximumindependentset_to_ilp.json` and `maximumindependentset_to_ilp.result.json`.
 
 use problemreductions::export::*;
-use problemreductions::models::optimization::ILP;
+use problemreductions::models::algebraic::ILP;
 use problemreductions::prelude::*;
 use problemreductions::topology::small_graphs::petersen;
 use problemreductions::topology::{Graph, SimpleGraph};

examples/reduction_maximummatching_to_ilp.rs

@@ -14,7 +14,7 @@
 // Exports `docs/paper/examples/maximummatching_to_ilp.json` and `maximummatching_to_ilp.result.json`.
 
 use problemreductions::export::*;
-use problemreductions::models::optimization::ILP;
+use problemreductions::models::algebraic::ILP;
 use problemreductions::prelude::*;
 use problemreductions::topology::small_graphs::petersen;
 use problemreductions::topology::{Graph, SimpleGraph};