Class List

Here are the classes, structs, unions and interfaces with brief descriptions:

SCIL::ABA_Constraint
SCIL::ABA_Variable	Class forms the virtual base class for all possible variables given in pool format
SCIL::ATOUR< Graph >	The symbolic constraint for directed Hamiltonian cycles
bfElement
SCIL::CUT< Graph >::bfs_dist_visitor< Graph >	Visitor for algorithm boost::breadth_first_search
bfStack
SCIL::bool_inst
SCIL::bool_score_split
SCIL::bool_simple_split
SCIL::bool_split_strategy
SCIL::boolfunction	Boolean functions
SCIL::Branching_Rule
SCIL::column	A column for the LP-Matrix
SCIL::column_entry
SCIL::cons	Handle class for basic constraints
SCIL::cons_map< A >	Basic Constraint Maps
SCIL::cons_obj
coord
SCIL::CP_KNAPSACK
SCIL::CUT< Graph >	The symbolic constraint for cuts
SCIL::TOUR< Graph >::cutset_inequality< Graph >
dcmst_heuristic
SCIL::TOUR< Graph >::degree_equality< Graph >
dfs_back_visitor	DFS-vistor to get the back edges
SCIL::SteinerArborescence< Graph >::dfs_visitor< Graph >	Visitor for algorith boost::depth_first_search
SCIL::ATOUR< Graph >::dir_cutset_inequality< Graph >
SCIL::ATOUR< Graph >::dir_cutset_inequality
SCIL::ATOUR< Graph >::dir_degree_equality< Graph >
SCIL::ATOUR< Graph >::dir_degree_equality
Edge
edge_cost_t
edge_properties
edgeCostsPair
SCIL::FLOW< Graph >	The symbolic constraint for flows
SCIL::FLOW< Graph >::flow_balance
FLOW::flow_balance< Graph >
Graph
SCIL::ILP_Problem
SCIL::implicator
SCIL::KCONNECTED< Graph >	The symbolic constraint for k-edge connected subgraphs
SCIL::LCI
SCIL::MATCHING< Graph >	The symbolic constraint for matchings
SCIL::MAX	The symbolic constraint for weighted maxima
SCIL::MC< Graph >
mc_heuristic
SCIL::MIN_CUT< Graph >	Class implements mincut algorithm of M.Stoer and F.Wagner
SCIL::mon_score_split
SCIL::mon_simple_split
SCIL::mon_split_strategy
SCIL::monomial	Monomials
SCIL::monomial_inst
mysub
Node
SCIL::nonlinear_inst
paircomp
Partition< GraphTyp >	Represents a partition of a graph
SCIL::PATH< Graph >	The symbolic constraint for supersets of path
SCIL::PATH< Graph >::path_cutset_inequality< Graph >
point
SCIL::pol_constraint	Polynomial constraints
SCIL::polynomial	Polynomials
SCIL::primal_heuristic
PrimerPricer
PrimerVariable
SCIL::qboolfunction< Graph >
SCIL::qelement< Graph >
SCIL::qmonomial< Graph >	: used to store the quadratic decomposition of a polynomial 0/1 optimization problem
qmst_heuristic
SCIL::QuadRef	The symbolic constraint for Quadratic Reformulation
reformulation_constraint
SCIL::row	Rows
SCIL::row_constraint
SCIL::row_entry	Row entries
SCIL::row_map< A >
SCIL::row_map2< A, B >
SCIL::scil_map< A >
SCIL::solution	The class that stores assignments from variables to values
SCIL::SpanTree< Graph >	The symbolic constraint for spanning trees
SCIL::SpanTree< Graph >::st_cutset_inequality< Graph >
SCIL::STABLESET< Graph >	The symbolic constraint for stable sets
stableset_heuristic
SCIL::SteinerArborescence< Graph >	The symbolic constraint for Steiner arborescences
SCIL::StronglyConnected< Graph >	The symbolic constraint for strongly connected graphs
SCIL::submodular
SCIL::subproblem
SCIL::sym_constraint	Symbolic Constraints
SCIL::TJOIN< Graph >	The symbolic constraint for T-Joins
SCIL::TOUR< Graph >	The symbolic constraint for undirected Hamiltonian cycles
SCIL::var	Handle class for variables
SCIL::var_map< A >
SCIL::var_map2< A, B >
SCIL::var_obj	Variable Objects : The base class to derive variable-schema
vertex_properties
SCIL::vertex_reached_t
vertex_reached_t