Class and Concept List

Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.

[detail level 12]

▼NCGAL
CEigen_diagonalize_traits	The class Eigen_diagonalize_traits provides an interface to the diagonalization of covariance matrices of Eigen
CEigen_matrix	The class Eigen_matrix is a wrapper around Eigen matrix type Eigen::Matrix
CEigen_solver_traits	The class Eigen_solver_traits provides an interface to the sparse solvers of Eigen
CEigen_solver_traits< Eigen::BiCGSTAB< Eigen_sparse_matrix< double >::EigenType > >
CEigen_sparse_matrix	The class Eigen_sparse_matrix is a wrapper around Eigen matrix type Eigen::SparseMatrix that represents general matrices, be they symmetric or not
CEigen_sparse_symmetric_matrix	The class Eigen_sparse_symmetric_matrix is a wrapper around Eigen matrix type Eigen::SparseMatrix
CEigen_svd	The class Eigen_svd provides an algorithm to solve in the least square sense a linear system with a singular value decomposition using Eigen
CEigen_vector	The class Eigen_vector is a wrapper around Eigen vector type, which is a simple array of numbers
CGLPK_mixed_integer_program_traits	This class provides an interface for formulating and solving constrained or unconstrained mixed integer programs using GLPK, which must be available on the system
CLinear_constraint	The linear constraint of a mixed integer program
CLinear_objective	The linear objective of a mixed integer program
CMixed_integer_program_traits	The class CGAL::Mixed_integer_program_traits provides an interface for formulating and solving (constrained or unconstrained) mixed integer programs
COSQP_quadratic_program_traits	Wraps the external OSQP solver
CSCIP_mixed_integer_program_traits	This class provides an interface for formulating and solving constrained or unconstrained mixed integer programs using SCIP (which must be available on the system)
CVariable	The variable of a mixed integer program
CDiagonalizeTraits	Concept providing functions to extract eigenvectors and eigenvalues from covariance matrices represented by an array a, using symmetric diagonalization
CLinearProgramTraits	A concept that describes the set of methods used to define and solve a linear programming (lp) problem of the general form:
CMixedIntegerProgramLinearConstraint	MixedIntegerProgramLinearConstraint is a concept of a linear constraint in a Mixed Integer Programming (MIP) problem
CMixedIntegerProgramLinearObjective	MixedIntegerProgramLinearObjective is a concept of the linear objective function in a Mixed Integer Programming (MIP) problem
CMixedIntegerProgramTraits	Concept describing the set of requirements for (constrained or unconstrained) Mixed Integer Programming (MIP) problems. A model of this concept stores the integer variables, linear objective, and linear constraints (if any) and provides a method to solve the problem
CMixedIntegerProgramVariable	MixedIntegerProgramVariable is a concept of a variable in a Mixed Integer Programming (MIP) problem
CNormalEquationSparseLinearAlgebraTraits_d	Concept describing the set of requirements for solving the normal equation \( A^t A X = A^t B \), \( A \) being a matrix, \( At \) its transpose matrix, \( B \) and \( X \) being two vectors
CQuadraticProgramTraits	A concept that describes the set of methods used to define and solve a quadratic programming (qp) problem of the general form:
▼CSparseLinearAlgebraTraits_d	The concept SparseLinearAlgebraTraits_d is used to solve sparse linear systems A \( \times \) X = B
CMatrix	SparseLinearAlgebraTraits_d::Matrix is a concept of a sparse matrix class
CVector	SparseLinearAlgebraTraits_d::Vector is a concept of a vector that can be multiplied by a sparse matrix
CSparseLinearAlgebraWithFactorTraits_d	Concept describing the set of requirements for a direct sparse linear system solver with factorization. A model of this concept stores the left-hand matrix (denoted \( A \)) and provides an additional factorization method to solve the system for different right-hand vectors
▼CSvdTraits	The concept SvdTraits describes the linear algebra types and algorithms needed to solve in the least square sense a linear system with a singular value decomposition
CMatrix	Concept of matrix type used by the concept SvdTraits
CVector	Concept of vector type used by the concept SvdTraits