FRODO Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
Loading...
Searching...
No Matches
Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 123456]
 Cfrodo2.benchmarks.kidneys.KidneyExchange.ABOBlood types
 Cfrodo2.algorithms.AbstractProblem< V, U >
 Cfrodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >A solver for a general problem
 Cfrodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >
 CAbsXeqY
 CActionListener
 Cfrodo2.solutionSpaces.Addable< AddableBigDecimal >
 Cfrodo2.solutionSpaces.Addable< AddableConflicts< U > >
 Cfrodo2.solutionSpaces.Addable< AddableInteger >
 Cfrodo2.solutionSpaces.Addable< AddableReal >
 Cfrodo2.solutionSpaces.AddableDelayed< T extends Addable< T > >
 Cfrodo2.solutionSpaces.AddableDelayed< AddableBigDecimal >
 Cfrodo2.solutionSpaces.AddableDelayed< AddableInteger >
 Cfrodo2.solutionSpaces.AddableDelayed< AddableReal >
 Cfrodo2.solutionSpaces.AddableLimited< T, T >
 Cfrodo2.algorithms.afb.AFBBaseMsg< V, U >
 Cfrodo2.algorithms.AgentInterface< V extends Addable< V > >All agents corresponding to various algorithms should implement this interface
 Cfrodo2.algorithms.AgentInterface< Val >
 Cfrodo2.algorithms.heuristics.AgentScoringHeuristic< S extends Comparable< S > &Serializable >Interface for a heuristic that associates a score to every agent
 Cfrodo2.algorithms.heuristics.AgentScoringHeuristic< String >
 Cfrodo2.solutionSpaces.JaCoP.tests.JaCoPtests< V extends Addable< V > >.AlgorithmThe different algorithms to be tested
 CAlldiff
 CAlldifferent
 CAlldistinct
 CAllEqual
 Cfrodo2.algorithms.test.AllTestsJUnit test suite for all the tests in frodo2.algorithms.dpop.test
 Cfrodo2.communication.AllTestsJUnit test suite for all unit tests in this package
 Cfrodo2.controller.AllTestsJUnit test suite for all unit tests in this package
 Cfrodo2.daemon.AllTestsJUnit test suite for all unit tests in this package
 Cfrodo2.algorithms.adopt.test.AllTestsADOPTTest suite for all ADOPT tests
 Cfrodo2.algorithms.afb.test.AllTestsAFBJUnit test suite for all the tests in frodo2.algorithms.afb.test
 Cfrodo2.algorithms.varOrdering.dfs.tests.AllTestsDFSJUnit test suite for all the tests in frodo2.algorithms.varOrdering.dfs.tests
 Cfrodo2.algorithms.dpop.test.AllTestsDPOPJUnit test suite for all the tests in frodo2.algorithms.dpop.test
 Cfrodo2.algorithms.varOrdering.election.tests.AllTestsElectionJUnit test suite for all the tests in frodo2.algorithms.varOrdering.election.tests
 Cfrodo2.solutionSpaces.hypercube.tests.AllTestsHypercubeThe hypercube tests
 Cfrodo2.solutionSpaces.JaCoP.tests.AllTestsJaCoPThe JaCoP tests
 Cfrodo2.algorithms.dpop.privacy.test.AllTestsP_DPOPJUnit test suite for all the tests in frodo2.algorithms.dpop.privacy.test
 Cfrodo2.algorithms.dpop.param.test.AllTestsParamDPOPJUnit test suite for all the tests in frodo2.algorithms.dpop.param.test
 Cfrodo2.algorithms.dpop.restart.test.AllTestsS_DPOPJUnit test suite for all the tests in frodo2.algorithms.dpop.restart.test
 Cfrodo2.solutionSpaces.tests.AllTestsSpacesAll solution spaces tests
 Cfrodo2.algorithms.dpop.stochastic.test.AllTestsStochDPOPJUnit test suite for all the tests in frodo2.algorithms.dpop.stochastic.test
 Cfrodo2.algorithms.synchbb.test.AllTestsSynchBBJUnit test suite for all the tests in frodo2.algorithms.synchbb.test
 CAmong
 CAmongVar
 CAnd
 CAndBool
 CAndBoolSimple
 CAndBoolVector
 CArgMax
 CArgMin
 CArithmetic
 Cfrodo2.algorithms.asodpop.ASODPOPsolver< V, U >
 CAssignment
 Cfrodo2.algorithms.odpop.Assignment< Val extends Addable< Val > >Class to hold an assignment of variables
 Cfrodo2.solutionSpaces.hypercube.HyperCubeIterBestFirst< V extends Addable< V >, U extends Addable< U > >.Assignment< U extends Addable< U > >Class containing a single assignment with its utility
 Cfrodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >.AssignmentMessage< Val, U >
 Cfrodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V, U >
 CAtLeast
 CAtMost
 Cfrodo2.benchmarks.auctions.cats.AuctionThis class represents an auction generated by the CATS program
 Cfrodo2.solutionSpaces.hypercube.BasicHypercube< V, U >
 Cfrodo2.solutionSpaces.hypercube.BasicHypercube< V, UL >
 Cfrodo2.solutionSpaces.hypercube.BasicHypercubeIter< V, U >
 Cfrodo2.solutionSpaces.BasicUtilitySolutionSpace< V, UL >
 Cfrodo2.benchmarks.auctions.cats.BidThis class represents a bid placed in an auction
 Cfrodo2.benchmarks.auctions.cats.BidderThis class represents a bidder in the auction
 CBinpacking
 Cfrodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.BlindScoringHeuristic< S >
 CBoolClause
 Cfrodo2.algorithms.duct.bound.Bound< V extends Addable< V > >
 Cfrodo2.algorithms.duct.bound.Bound< V >
 Cfrodo2.benchmarks.auctions.main.CATSToXCSPThis is the main class for converting a CATS (Combinatorial Auctions Test Suite) into a DCOP (Distributed Constraint Optimization Problem)
 Cfrodo2.algorithms.varOrdering.linear.CentralLinearOrdering< V, U >
 CChangeListener
 CChannelImply
 CChannelReif
 CCircuit
 CCloneable
 Corg.jacop.core.CloneableInto< V >An interface for JaCoP variables that are cloneable into another store
 Corg.jacop.core.CloneableInto< IntVarCloneable >
 Cfrodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >.ClusterInfoInformation about a cluster of variables owned by this agent
 Cfrodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.ClusterInfoA convenience class used to store information about a cluster
 Cfrodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.ClusterInfoInformation about a cluster of variables owned by this agent
 CComparable
 CComparator
 Cfrodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >.ComponentInfoThe information about a particular component of the constraint graph
 Cfrodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.ComponentInfoThe information about a particular component of the constraint graph
 Cfrodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.ComponentInfoAll relevant information about a connected component of the constraint graph
 CConditional
 CConsistencyListener
 CConstraint
 Corg.jacop.constraints.ConstraintCloneableInterface< C extends DecomposedConstraint<? extends Constraint > >A constraint is clonable if a state-less copy of it can be created into a target store
 Corg.jacop.constraints.ConstraintCloneableInterface< AbsXeqYCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< AlldiffCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< AlldifferentCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< AlldistinctCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< AllEqualCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< AmongCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< AmongVarCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< AndBoolCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< AndBoolSimpleCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< AndBoolVectorCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< AndCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< ArgMaxCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< ArgMinCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< AssignmentCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< AtLeastCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< AtMostCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< BoolClauseCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< ChannelImplyCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< ChannelReifCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< CircuitCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< Constraint >
 Corg.jacop.constraints.ConstraintCloneableInterface< CountBoundsCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< CountCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< CountValuesBoundsCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< CountValuesCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< CountVarCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< CumulativeCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< DecreasingCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< Diff2Cloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< DiffCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< DisjointCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< DisjointConditionalCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< DistanceCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< ElementIntegerCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< ElementIntegerFastCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< ElementVariableCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< ElementVariableFastCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< EqBoolCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< ExtensionalConflictVACloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< ExtensionalSupportMDDCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< ExtensionalSupportSTRCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< ExtensionalSupportVACloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< GCCCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< IfThenBoolCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< InCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< IncreasingCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< LexCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< LexOrderCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< LinearIntCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< LinearIntDomCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< MaxCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< MaxSimpleCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< MemberCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< MinCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< MinSimpleCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< NoGoodCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< NotCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< OrBoolCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< OrBoolSimpleCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< OrBoolVectorCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< OrCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< PrimitiveConstraint >
 Corg.jacop.constraints.ConstraintCloneableInterface< SeqPrecedeChainCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< SequenceCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< SoftAlldifferentCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< SoftGCCCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< StretchCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< SubcircuitCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< SumBoolCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< SumCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< SumIntCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< SumWeightCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< ValuePrecedeCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< ValuesCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XdivYeqZCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XeqCCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XeqYCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XexpYeqZCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XgtCCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XgteqCCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XgteqYCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XgtYCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XltCCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XlteqCCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XlteqYCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XltYCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XmodYeqZCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XmulCeqZCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XmulYeqCCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XmulYeqZCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XneqCCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XneqYCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XorBoolCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XplusCeqZCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XplusClteqZCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XplusYeqCCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XplusYeqZCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XplusYgtCCloneable >
 Corg.jacop.constraints.ConstraintCloneableInterface< XplusYlteqZCloneable >
 Cfrodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >.ConstraintTypeConstraint type
 Cfrodo2.controller.ControllerThe controller class, a container for the listeners that do the actual work
 Cfrodo2.algorithms.Convergence< V extends Addable< V >, U extends Addable< U > >An optimal solution to the problem
 Cfrodo2.algorithms.ConvergenceInterface< V extends Addable< V > >Interface for all modules that should be able to store convergence data
 Cfrodo2.algorithms.ConvergenceInterface< V >
 Cfrodo2.benchmarks.vehiclerouting.CordeauToXCSPA file converter from Cordeau's MDVRP format into FRODO XCSP format
 CCount
 CCountBounds
 CCountValues
 CCountValuesBounds
 CCountVar
 Cfrodo2.solutionSpaces.crypto.CryptoScheme< AddableInteger, ElGamalBigInteger, ElGamalScheme.ElGamalPublicKeyShare >
 CCumulative
 CCumulativeBasic
 CCumulativeOptional
 CCumulativePrimary
 CCumulativeUnary
 CCumulativeUnaryOptional
 Cfrodo2.algorithms.StatsReporterWithConvergence< Val extends Addable< Val > >.CurrentAssignment< Val >A convenience class to store an assignment
 Cfrodo2.benchmarks.vehiclerouting.CordeauToXCSP.CustomerA customer
 Cfrodo2.daemon.Daemon
 Cfrodo2.communication.OutgoingMsgPolicyInterface< T >.DecisionThe decision made
 CDecomposedConstraint
 Corg.jacop.constraints.DecomposedConstraintCloneableInterfaceAn interface that defines additional methods for a DecomposedConstraint
 CDecreasing
 CDefaultMutableTreeNode
 Cfrodo2.communication.mailer.CentralMailer.DelayGeneratorAbstract class that defines the functions needed in a delay generator
 Cfrodo2.benchmarks.vehiclerouting.CordeauToXCSP.DepotA depot
 Cfrodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.DetermineAssignment< Val extends Addable< Val >, U extends Addable< U > >Interface used to implement the different decision strategies of DSA
 Cfrodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.determineAssignment< Val extends Addable< Val >, U extends Addable< U > >In the future we might want to experiment with different ways of determining a variables assignment
 Cfrodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.determineAssignment< Val extends Addable< Val >, U extends Addable< U > >In the future we might want to experiment with different ways of determining a variables assignment
 Cfrodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.DetermineAssignment< Val, U >
 Cfrodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.determineAssignment< Val, U >
 Cfrodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.determineAssignment< Val, U >
 Cfrodo2.algorithms.varOrdering.dfs.DFSgeneration< V, U >
 CDiff
 CDiff2
 CDiffn
 CDiffnDecomposed
 CDisjoint
 CDisjointConditional
 CDistance
 Cfrodo2.controller.DistributedSolverDemoA demo for the distributed solver
 CDoubleI
 Cfrodo2.algorithms.dpop.stochastic.E_DPOPsolver< V, U >
 Cfrodo2.algorithms.Eavesdroppable< T >Defines a module that eavesdrops on the messages exchanged
 Cfrodo2.algorithms.RandGraphFactory.EdgeAn edge
 CElement
 CElementInteger
 CElementIntegerFast
 CElementVariable
 CElementVariableFast
 CEq
 CEqBool
 CExtensionalConflictVA
 CExtensionalSupportMDD
 CExtensionalSupportSTR
 CExtensionalSupportVA
 CExternalConstraint
 CExternalizable
 Cfrodo2.benchmarks.FileCopierHelper utility that copies a file for use by frodo2.py when running experiments from a repository of problem instances
 CFSM
 Cfrodo2.algorithms.varOrdering.factorgraph.FunctionNode< V extends Addable< V >, U extends Addable< U > >A function node in a factor graph
 CGCC
 CGeost
 CGeostObject
 Cfrodo2.algorithms.odpop.Good< Val extends Addable< Val >, U extends Addable< U > >Class that represents a good being send from child to parent It contains
 Cfrodo2.benchmarks.auctions.cats.GoodThis class represents a good sold in the auction
 Cfrodo2.algorithms.odpop.Good< Val, U >
 Cfrodo2.algorithms.RandGraphFactory.GraphA graph
 Cfrodo2.benchmarks.graphcoloring.GraphColoringA graph coloring problem generator
 Cfrodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.Heuristic< T extends Comparable< T > &Serializable >Variable ordering heuristic
 Cfrodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.Heuristic< IntIntStringTuple >
 Cfrodo2.solutionSpaces.hypercube.Hypercube< V, U >
 Cfrodo2.solutionSpaces.hypercube.HypercubeIter< V, U >
 Cfrodo2.solutionSpaces.hypercube.HypercubeLimited< V, U, U >
 Cfrodo2.solutionSpaces.hypercube.HypercubeLimited< V, U, UL >
 CIfThen
 CIfThenBool
 CIfThenElse
 CImplies
 CIn
 CInArea
 Cfrodo2.communication.IncomingMsgPolicyInterface< MessageType >
 CIncreasing
 Cfrodo2.solutionSpaces.hypercube.tests.HypercubeTest.InfinityVariables are used to determine whether infinite values are allowed
 Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode< U, L >
 Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode< U, LeafNode< U > >
 Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val, U, L >
 Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val, U, LeafNode< U > >
 Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTreeBinaryDomains.InnerNodeTree< Val, U, LeafNode< U > >
 Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.IntArrayWrapperThe IntArrayWrapper is used as a key for (partial) assignments
 Corg.jacop.core.IntVar
 CItemListener
 CJFrame
 Cfrodo2.benchmarks.kidneys.KidneyExchangeCreates a sample population of kidney donor-patient pairs and generates a graph which is then written into a DCOP problem statement
 CKnapsack
 Cfrodo2.algorithms.varOrdering.election.LeaderElectionMaxID< Integer >
 Cfrodo2.algorithms.varOrdering.election.tests.LeaderElectionMaxIDTest< Integer >
 Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTree.LeafNode< U >
 Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.LeafNode< U >
 Cfrodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >
 CLex
 CLexOrder
 CLinearInt
 CLinearIntDom
 Cfrodo2.algorithms.mpc_discsp.MatrixA matrix over a finite field
 CMax
 Cfrodo2.benchmarks.maxdiscsp.MaxDisCSPProblemGeneratorMax-DisCSP problem generator
 CMaxSimple
 CMDD
 Cfrodo2.benchmarks.meetings.MeetingSchedulingDistributed meeting scheduling problem generator
 CMember
 Cfrodo2.algorithms.varOrdering.election.LeaderElectionMaxID< T extends Comparable< T > &Serializable >.MessageLEoutput< String >
 Cfrodo2.communication.MessageListener< T >A general interface for modules listening for messages
 Cfrodo2.communication.MessageWrapperMessage wrapper, used to store information on
 Cfrodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > >.MethodThe method to use to choose the optimal value for a variable
 Cfrodo2.benchmarks.party.PartyGame.MethodThe method used to formulate the game as a DisCSP
 CMin
 CMinSimple
 Cfrodo2.benchmarks.meetings.MeetingScheduling.ModeThe mode of encoding
 Cfrodo2.algorithms.mpc_discsp.MPC_DisCSP4< V >
 Cfrodo2.gui.Visualizer.MsgVisualizationWhether and how long to display a message type
 Cfrodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >.MultiPhaseThe phases in a multiplication operation
 CNetworkBuilder
 CNetworkFlow
 Cfrodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.NextChildChoiceHeuristicInterface for heuristics used to choose a variable's next child from its list of open neighbors
 Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U extends Addable< U > >Class for every node in the GoodsTree
 Cfrodo2.algorithms.odpop.goodsTree.leafNodeTree.Node
 Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U >
 Cfrodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfoInformation about a node in the DFS
 CNoGood
 CNonOverlapping
 CNooverlap
 Cfrodo2.algorithms.duct.Normalize< V >
 CNot
 COr
 COrBool
 COrBoolSimple
 COrBoolVector
 Cfrodo2.communication.OutgoingMsgPolicyInterface< MessageType >
 Cfrodo2.algorithms.dpop.privacy.test.P2_DPOPagentTest< V, E >
 Cfrodo2.algorithms.dpop.privacy.P_DPOPsolver< V >
 Cfrodo2.algorithms.mpc_discsp.PaillierCryptoSchemeThe Paillier crypto scheme
 Cfrodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >.ParamSolution< V extends Addable< V >, U extends Addable< U > >An optimal solution to the problem
 Cfrodo2.algorithms.ParserInterface< V extends Addable< V >, U extends Addable< U > >Interface for a parser that produces a ProblemInterface
 Cfrodo2.algorithms.ParserInterface< V, U >
 Cfrodo2.benchmarks.party.PartyGameA random problem generator for the party game
 Cfrodo2.benchmarks.party.PartyGame.PartyInstanceAn instance of a party game
 Cfrodo2.benchmarks.kidneys.KidneyExchange.PatientDonorPairA patient-donor pair
 Cfrodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >.PhaseA phase of the algorithm
 Cfrodo2.communication.PipeFactory
 CPoint
 Cfrodo2.benchmarks.kidneys.KidneyExchange.PRAPanel Reactive Antibody levels
 Cfrodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.PreprocessingHeuristic< Val extends Addable< Val >, U extends Addable< U > >This interface is used to implement the different heuristics for obtaining lower bounds
 Cfrodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.PreprocessingHeuristic< Val, U >
 Cfrodo2.solutionSpaces.ProblemInterface< V, U >
 Cfrodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.ProjOutput< V extends Addable< V >, U extends Addable< U > >The result of a projection
 Cfrodo2.communication.QueueInputPipeInterfaceInterface for classes used as an input to a Queue object
 Cfrodo2.communication.QueueOutputPipeInterfaceInterface for classes used as an output of a Queue object
 Cfrodo2.algorithms.RandGraphFactoryGenerator of random graphs
 Cfrodo2.communication.tcp.QueueOutputPipeTCP.RawDataInfoA convenience class used to store information about raw data
 CRegular
 CReified
 Cfrodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >.Relation< V extends Addable< V >, U extends Addable< U > >The representation of an XCSP relation
 CRunnable
 Cfrodo2.algorithms.duct.Sampling< V >
 CSampling< V >VariableInfo
 Cfrodo2.algorithms.dpop.stochastic.SamplingPhase< V, U >
 Cfrodo2.algorithms.duct.samplingMethods.SamplingProcedure< V extends Addable< V > >
 Cfrodo2.algorithms.duct.samplingMethods.SamplingProcedure< V >
 Cfrodo2.algorithms.duct.SamplingPruning< V >
 CSamplingPruning< V >VariableInfo
 Cfrodo2.algorithms.duct.SamplingPruningSearch< V >
 CSamplingPruningSearch< V >VariableInfo
 Cfrodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V, U >
 Cfrodo2.solutionSpaces.hypercube.ScalarSpaceIter< V, U >
 Cfrodo2.algorithms.heuristics.ScoringHeuristic< S extends Comparable< S > &Serializable >Interface for a heuristic that associates a score to every variable
 Cfrodo2.algorithms.heuristics.ScoringHeuristic< Integer >
 Cfrodo2.algorithms.heuristics.ScoringHeuristic< ScorePair< S1, S2 > >
 Cfrodo2.algorithms.heuristics.ScoringHeuristic< Short >
 Cfrodo2.algorithms.heuristics.ScoringHeuristic< String >
 Cfrodo2.algorithms.duct.SearchNode< V extends Addable< V > >Convenience class to store information associated to a specific state
 Cfrodo2.algorithms.duct.SearchNode< V >
 CSeqPrecedeChain
 CSequence
 CSerializable
 CShape
 CSimpleSolutionListener
 CSimpleTable
 CSoftAlldifferent
 CSoftGCC
 Cfrodo2.algorithms.Solution< V, U >An optimal solution to the problem
 Cfrodo2.algorithms.dpop.count.SolutionCounter< V extends Addable< V >, U extends Addable< U > >Counts the number of optimal solutions in a DCOP
 Cfrodo2.solutionSpaces.SolutionSpace< V >
 Cfrodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >.SparseIterator< V >A SolutionSpace iterator that skips infeasible solutions
 Cfrodo2.algorithms.duct.Sampling< V extends Addable< V > >.State< V extends Addable< V > >Convenience class to store a context
 Cfrodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.StateValueThe state of the current variable:
 Cfrodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.StateValueThe state of the current variable:
 Corg.jacop.core.Store
 CStretch
 CSubcircuit
 CSum
 CSumBool
 Corg.jacop.constraints.SumInt
 CSumWeight
 CTable
 Cfrodo2.algorithms.duct.termination.TerminationCondition< V extends Addable< V > >
 Cfrodo2.algorithms.duct.termination.TerminationCondition< V >
 CTestCase
 CThread
 Cfrodo2.algorithms.Convergence< V extends Addable< V >, U extends Addable< U > >.TimeStamp< U extends Addable< U > >Convenience class containing a timestamp and utility value
 CTreeCellEditor
 CTreeCellRenderer
 CTreeExpansionListener
 Cfrodo2.solutionSpaces.UtilitySolutionSpaceLimited< V, U, U >
 Cfrodo2.algorithms.asodpop.UTILmsg< Val, U >
 Cfrodo2.algorithms.odpop.UTILmsg< Val, U >
 Cfrodo2.algorithms.odpop.UTILpropagationFullDomain< Val, U, LeafNode< U > >
 CUTILpropagationTest< AddableReal >Listener
 CUTILpropagationTest< U >Listener
 Cfrodo2.algorithms.odpop.UTILvarsDomsMsg< Val, U >
 Cfrodo2.algorithms.asodpop.UTILvarsMsg< Val, U >
 Cfrodo2.algorithms.odpop.UTILvarsMsg< Val, U >
 CValuePrecede
 CVALUEpropagationTest< U >Listener
 CValues
 Cfrodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VarAssignment< Val extends Addable< Val >, U extends Addable< U > >Container for a value assignment and its utility
 Cfrodo2.algorithms.varOrdering.election.VariableElection< Integer >
 Cfrodo2.algorithms.varOrdering.election.tests.VariableElectionTest< Integer >
 Cfrodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >Helper class that contains all the info belonging to a specific variable
 Cfrodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.PreprocessingHeuristic< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >Container for information belonging to a specific variable
 Cfrodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.VariableInfoA convenience class that contains the following information for a variable
 Cfrodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.VariableInfoA convenience class that contains the following information for a variable
 Cfrodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >.VariableInfoA convenience class used to store information about a variable
 Cfrodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >.VariableInfoConvent class to store information about a variable
 Cfrodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >.VariableInfoA convenience class used to store information about a variable
 Cfrodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >.VariableInfoConvenient class to store information about a variable of this agent
 Cfrodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfoConvenience class to hold variable information
 Cfrodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >Container class for information needed for each variable
 Cfrodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >Convenience class that contains all necessary information on a single variable
 Cfrodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >Convenience class that contains all necessary information on a single variable
 Cfrodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.VariableInfoConvenience class that contains information for a specific variable
 Cfrodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.PreprocessingHeuristic< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val, U >
 Cfrodo2.algorithms.varOrdering.factorgraph.VariableNode< V extends Addable< V >, U extends Addable< U > >A variable node in a factor graph
 Cfrodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >.VarInfoA class containing all the useful information about one of the agent's variables
 Cfrodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.Version< Val extends Addable< Val >, U extends Serializable &Addable< U > >The different versions of adopt handle some things differently
 Cfrodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.Version< Val, U >
 Cfrodo2.gui.VisualizerAn interface for visualizing agents, variables, constraints, and message exchanges
 Cfrodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.WhereToProjectWhere the random variables should be projected out
 Cfrodo2.benchmarks.vehiclerouting.XCSPparserVRP< U >
 CXdivYeqZ
 CXeqC
 CXeqY
 CXexpYeqZ
 CXgtC
 CXgteqC
 CXgteqY
 CXgtY
 CXltC
 CXlteqC
 CXlteqY
 CXltY
 CXmodYeqZ
 CXmulCeqZ
 CXmulYeqC
 CXmulYeqZ
 CXneqC
 CXneqY
 CXor
 CXorBool
 CXplusCeqZ
 CXplusClteqZ
 CXplusYeqC
 CXplusYeqZ
 CXplusYgtC
 CXplusYlteqZ