Here is a list of all class members with links to the classes they belong to:

- b -

• B : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >.ComponentInfo, frodo2.benchmarks.kidneys.KidneyExchange.ABO
• backTrack() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.Original< Val extends Addable< Val >, U extends Addable< U > >
• backtrack() : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >
• BACKTRACK_MSG_TYPE : frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >
• BasicHypercube() : frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >
• BasicHypercubeIter() : frodo2.solutionSpaces.hypercube.BasicHypercubeIter< V extends Addable< V >, U extends Serializable >
• bestAssignment() : frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >
• BestFirstIterator() : frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >.BestFirstIterator
• bestOffer : frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >
• bestOfferer : frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >
• bestSol : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >.ComponentInfo, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.ComponentInfo
• bestUtil : frodo2.algorithms.duct.SearchNode< V extends Addable< V > >
• Bid() : frodo2.benchmarks.auctions.cats.Bid
• Bidder() : frodo2.benchmarks.auctions.cats.Bidder
• bidder : frodo2.benchmarks.auctions.cats.Bid
• bidderID : frodo2.benchmarks.auctions.cats.Bidder
• biddersList : frodo2.benchmarks.auctions.cats.Auction
• bidID : frodo2.benchmarks.auctions.cats.Bid
• bidPattern : frodo2.benchmarks.auctions.main.CATSToXCSP
• bidsList : frodo2.benchmarks.auctions.cats.Auction, frodo2.benchmarks.auctions.cats.Bidder, frodo2.benchmarks.auctions.cats.Good
• bigInt : frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.FakeEncryptedInteger
• BinaryAssignment() : frodo2.algorithms.localSearch.mgm.mgm2.BinaryAssignment< Val extends Addable< Val > >
• BinpackingCloneable() : org.jacop.constraints.binpacking.BinpackingCloneable
• bitLength : frodo2.algorithms.mpc_discsp.PaillierPublicKey
• blackHole : frodo2.algorithms.SingleQueueAgent< Val extends Addable< Val > >
• blindProject() : frodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >.NullHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.HypercubeLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >, frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ScalarHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ScalarHypercubeLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >, frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.UtilitySolutionSpaceLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• blindProjectAll() : frodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >.NullHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.HypercubeLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >, frodo2.solutionSpaces.hypercube.ScalarHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ScalarHypercubeLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >, frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.UtilitySolutionSpaceLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• BlindProjectOutput() : frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >
• BlindScoringHeuristic() : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.BlindScoringHeuristic< S extends Comparable< S > &Serializable >
• bloodA : frodo2.benchmarks.kidneys.KidneyExchange
• bloodB : frodo2.benchmarks.kidneys.KidneyExchange
• bloodO : frodo2.benchmarks.kidneys.KidneyExchange
• BoolClauseCloneable() : org.jacop.constraints.BoolClauseCloneable
• bound : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo, frodo2.algorithms.duct.tests.DUCTagentTest
• BOUND_MSG_TYPE : frodo2.algorithms.duct.Normalize< V extends Addable< V > >, frodo2.algorithms.duct.Sampling< V extends Addable< V > >
• boundClass : frodo2.algorithms.duct.Sampling< V extends Addable< V > >
• BoundInvLog() : frodo2.algorithms.duct.bound.BoundInvLog< V extends Addable< V > >
• BoundLog() : frodo2.algorithms.duct.bound.BoundLog< V extends Addable< V > >
• BoundLogSize() : frodo2.algorithms.duct.bound.BoundLogSize< V extends Addable< V > >
• BOUNDmsg() : frodo2.algorithms.duct.BOUNDmsg
• bounds : frodo2.algorithms.duct.SearchNode< V extends Addable< V > >
• BoundsMsg() : frodo2.algorithms.adopt.BoundsMsg< Val extends Addable< Val >, U extends Addable< U > >
• BoundSqrt() : frodo2.algorithms.duct.bound.BoundSqrt< V extends Addable< V > >
• BoundSqrtSize() : frodo2.algorithms.duct.bound.BoundSqrtSize< V extends Addable< V > >
• BoundStatsMsg() : frodo2.algorithms.duct.BoundStatsMsg
• branchingFactor : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• BTmsg() : frodo2.algorithms.synchbb.BTmsg
• build() : org.jacop.constraints.netflow.NetworkBuilderCloneable
• buildDomain() : frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >
• buildKnownVars() : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.ScoreBroadcastingHeuristic< S extends Comparable< S > &Serializable >
• buildSolution() : frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >, frodo2.algorithms.adopt.ADOPTsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.afb.AFBsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.DPOPsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.privacy.P3halves_DPOPsolver< V extends Addable< V > >, frodo2.algorithms.dpop.stochastic.Complete_E_DPOPsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.E_DPOPsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.duct.DUCTsolver< V extends Addable< V > >, frodo2.algorithms.localSearch.dsa.DSAsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.MGM2solver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.MGMsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.maxsum.MaxSumSolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.mpc_discsp.MPC_DisWCSP4solver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.ODPOPsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.synchbb.SynchBBsolver< V extends Addable< V >, U extends Addable< U > >
• byteArray : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.IntArrayWrapper