Generated on Sat Feb 7 2015 02:05:30 for Gecode by doxygen 1.8.9.1
Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 12345]
 NGecodeGecode toplevel namespace
 NTestGeneral test support
 CAllIntervalExample: All-interval series
 CAlphaExample: Alpha puzzle
 CArchimedeanSpiralExample: Archimedean spiral
 CBACPExample: The balanced academic curriculum problem
 CBIBDExample: Balanced incomplete block design (BIBD)
 CBIBDOptionsOptions for BIBD problems
 CBinPackingExample: Bin packing
 CBlackHoleExample: Black hole patience
 CCarSequencingExample: Car sequencing
 CCartesianHeartExample: Cartesian Heart
 CCDBFCustom brancher implementing CDBF
 CColoredMatrixExample: Colored matrix example
 CColoredMatrixOptionsColoredMatrixOptions
 CCourseA course
 CCrewExample: Airline crew allocation
 CCrosswordExample: Crossword puzzle
 CCrowdedChessExample: Crowded chessboard
 CCurriculumA curriculum
 CDescartesFoliumExample: Folium of Descartes
 CDictionaryA simple dictionary class
 CDominatingQueensExample: Dominating Queens
 CDominoExample: Solitaire domino
 CDonaldExample: DONALD+GERALD=ROBERT puzzle
 CEFPAExample: Equidistant Frequency Permutation Arrays
 CEFPAOptionsOptions for EFPA problems
 CEq20Example: Solving 20 linear equations
 CFileSizeOptionsParse an additional file option
 CGoldenSpiralExample: Golden spiral
 CGolfExample: Golf tournament
 CGolfOptionsOptions for Golf example
 CGolombRulerExample: Finding optimal Golomb rulers
 CGraphGraph specification
 CGraphColorExample: Clique-based graph coloring
 CGraphColorSpecGraph specification
 CGroceryExample: Grocery puzzle
 CHammingExample: Generating Hamming codes
 CHammingOptionsOptions for Hamming problems
 CIndSetExample: Independent sets in a graph
 CKakuroExample: Kakuro
 CKnightsBase-class for knight's tour example
 CKnightsCircuitExample: n-Knights tour (model using circuit)
 CKnightsReifiedExample: n-Knight's tour (simple model)
 CLangfordNumberExample: Langford's number problem
 CLangfordNumberOptionsOptions taking two additional parameters
 CMagicSequenceExample: Magic sequence
 CMagicSquareExample: Magic squares
 CMineSweeperExample: Minesweeper
 CMoneyExample: SEND+MORE=MONEY puzzle
 CMultiBinPackingExample: Multi-dimensional bin packing
 CNonogramExample: Nonogram
 COpenShopExample: open-shop scheduling
 COrthoLatinSquareExample: Orthogonal latin squares
 CPartitionExample: partition numbers into two groups
 CPentominoesExample: Pentominoes
 CPerfectSquareExample: Packing squares into a rectangle
 CPhotoExample: Placing people on a photo
 CPhotoSpecSpecifications for the photo example
 CPlayEntry in round robin schedule
 CQueenArmiesExample: Peaceable co-existing armies of queens
 CQueensExample: n-Queens puzzle
 CRadiotherapyExample: Radiotherapy
 CRadiotherapyDataInstance data for radio therapy problem
 CRRSRound robin schedule
 CSatExample: CNF SAT solver
 CSatOptionsOptions for SAT problems
 CSchurExample: Schur's lemma
 CSchurOptionsOptions for Schur's Lemma
 CSortByWeightSort orders by weight
 CSportsLeagueExample: Sports league scheduling
 CSteelMillExample: Steel-mill slab design problem
 CSteelMillOptionsSteelMillOptions for examples with size option and an additional optional file name parameter
 CSteinerExample: Steiner triples
 CSudokuBase class for Sudoku puzzles
 CSudokuIntExample: Solving Sudoku puzzles using integer constraints
 CSudokuMixedExample: Solving Sudoku puzzles using both set and integer constraints
 CSudokuSetExample: Solving Sudoku puzzles using set constraints
 CTileSpecSpecification of one tile
 CTSPExample: Travelling salesman problem (TSP)
 CWarehousesExample: Locating warehouses
 CWarnsdorffCustom brancher for knight's tours using Warnsdorff's rule
 CWordSquareExample: Word-square puzzle