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

- n -

• n : frodo2.algorithms.mpc_discsp.Matrix, frodo2.algorithms.mpc_discsp.PaillierPublicKey
• name : frodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >.VarInfo, frodo2.algorithms.varOrdering.factorgraph.FunctionNode< V extends Addable< V >, U extends Addable< U > >, frodo2.benchmarks.auctions.xcsp.Constraint, frodo2.benchmarks.auctions.xcsp.Domain, frodo2.benchmarks.auctions.xcsp.Relation, frodo2.benchmarks.auctions.xcsp.Variable, frodo2.communication.tcp.QueueOutputPipeTCP, frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• nbGoods : frodo2.benchmarks.auctions.main.CATSToXCSP
• nbrAgents : frodo2.algorithms.adopt.test.ADOPTagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.tests.ASODPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.tests.ASODPOPBinaryAgentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.privacy.test.SecureRerootingTest, frodo2.algorithms.dpop.privacy.test.VariableObfuscationTest< V extends Addable< V > >, frodo2.algorithms.dpop.test.DPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.duct.tests.DUCTagentTest, frodo2.algorithms.localSearch.dsa.tests.DSAagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.tests.MGM2agentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.tests.MGMagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >, frodo2.algorithms.odpop.tests.ODPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.ODPOPagentTestBinaryDomains< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.ODPOPagentTestFullDomain< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.election.tests.LeaderElectionMaxIDTest< S extends Comparable< S > >, frodo2.benchmarks.meetings.MeetingScheduling
• nbrAgentsFinished : frodo2.algorithms.adopt.test.ADOPTagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.tests.ASODPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.tests.ASODPOPBinaryAgentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.test.DPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.duct.tests.DUCTagentTest, frodo2.algorithms.localSearch.dsa.tests.DSAagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.tests.MGM2agentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.tests.MGMagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.ODPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.ODPOPagentTestBinaryDomains< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.ODPOPagentTestFullDomain< V extends Addable< V >, U extends Addable< U > >
• nbrAgentsFinished_lock : frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >
• nbrAgentsPerMeeting : frodo2.benchmarks.meetings.MeetingScheduling
• nbrAssignments : frodo2.algorithms.synchbb.PathMsg< V extends Addable< V >, U extends Addable< U > >
• nbrBidsPattern : frodo2.benchmarks.auctions.main.CATSToXCSP
• nbrBitsOfPminus3 : frodo2.solutionSpaces.crypto.ElGamalScheme
• nbrChildren : frodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.ClusterInfo, frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo
• nbrColors : frodo2.benchmarks.graphcoloring.GraphColoring
• nbrConnections : frodo2.communication.tcp.QueueInputPipeTCP
• nbrCycles : frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >
• nbrFeasibleLocalSolutions : frodo2.algorithms.duct.SearchNode< V extends Addable< V > >
• nbrFlags : frodo2.algorithms.dpop.stochastic.test.LowestCommonAncestorsTest
• nbrIter : frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >.FunctionInfo, frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >.VarInfo
• nbrMeetings : frodo2.benchmarks.meetings.MeetingScheduling
• nbrMsgs : frodo2.algorithms.Solution< V, U >
• nbrMsgsLeft : frodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >.VarInfo
• nbrMsgsReceived : frodo2.algorithms.adopt.test.ADOPTagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.tests.ASODPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.tests.ASODPOPBinaryAgentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.test.DPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.duct.tests.DUCTagentTest, frodo2.algorithms.localSearch.dsa.tests.DSAagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.tests.MGM2agentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.tests.MGMagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.ODPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.ODPOPagentTestBinaryDomains< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.ODPOPagentTestFullDomain< V extends Addable< V >, U extends Addable< U > >
• nbrMsgsRemaining : frodo2.algorithms.adopt.test.testADOPT, frodo2.algorithms.asodpop.tests.ASODPOPBinaryTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.tests.ASODPOPTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfo, frodo2.algorithms.dpop.test.UTILpropagationTest< U extends Addable< U > >.Listener, frodo2.algorithms.dpop.test.VALUEpropagationTest< U extends Addable< U > >, frodo2.algorithms.duct.tests.NormalizeInfTest, frodo2.algorithms.duct.tests.NormalizeTest, frodo2.algorithms.odpop.tests.UTILpropagationTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.VALUEpropagationTest< V extends Addable< V >, U extends Addable< U > >
• nbrMsgsRemaining_lock : frodo2.algorithms.asodpop.tests.ASODPOPBinaryTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.tests.ASODPOPTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.duct.tests.NormalizeInfTest, frodo2.algorithms.duct.tests.NormalizeTest, frodo2.algorithms.odpop.tests.UTILpropagationTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.VALUEpropagationTest< V extends Addable< V >, U extends Addable< U > >
• nbrNeighbors : frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >.FunctionInfo, frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >.VarInfo, frodo2.algorithms.varOrdering.election.LeaderElectionMaxID< T extends Comparable< T > &Serializable >
• nbrOfSeparators : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >
• nbrOutputMessagesPerVar : frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest
• nbrSamples : frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.test.E_DPOPagentTest< V extends Addable< V > >, frodo2.algorithms.dpop.stochastic.test.ExpectedUTILtest
• nbrSharesPerAgent : frodo2.solutionSpaces.crypto.ElGamalSchemeTest
• nbrSlots : frodo2.benchmarks.meetings.MeetingScheduling
• nbrSolLeft : frodo2.solutionSpaces.hypercube.BasicHypercubeIter< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIterBestFirst< V extends Addable< V > >
• nbrSols : frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >, frodo2.solutionSpaces.hypercube.BasicHypercubeIter< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIterBestFirst< V extends Addable< V > >
• nbrSolsLeft : frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >.BestFirstIterator
• nbrSolutions : frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiteratorBestFirst
• nbrStatsMsgs : frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >
• nbrSteps : frodo2.algorithms.varOrdering.election.VariableElection< S extends Comparable< S > &Serializable >
• nbrSumSols : frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >.BestFirstIterator
• nbrSumSolsLeft : frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >.BestFirstIterator
• nbrSumVariables : frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >.BestFirstIterator
• nbrTruthfulSteps : frodo2.algorithms.varOrdering.election.VarElectionMessenger
• nbrUTIL : frodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.ClusterInfo
• nbrUtils : frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >
• nbrUtilsOut : frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.MyIter, frodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >.MyIter
• nbrVars : frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.dfs.DFSgenerationWithOrder< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.BasicHypercubeIter< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIter2< V extends Addable< V > >
• nbrVarsDone : frodo2.algorithms.dpop.VALUEpropagation< Val extends Addable< Val > >
• nbrVarsMin2 : frodo2.solutionSpaces.JaCoP.ExtensionalSupportHypercube
• nbrVehicles : frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• nbrVehiclesPerDepot : frodo2.benchmarks.vehiclerouting.CordeauToXCSP
• nbrVRPvariables : frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >.BestFirstIterator
• nbTuples : frodo2.benchmarks.auctions.xcsp.Relation
• ncccCount : frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >.ParamSolution< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.MASparser< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.Solution< V, U >, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >
• ncccs : frodo2.communication.MessageWrapper
• negXmatchHusbandDonorFactor : frodo2.benchmarks.kidneys.KidneyExchange
• neighborAgents : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.ScoreBroadcastingHeuristic< S extends Comparable< S > &Serializable >, frodo2.algorithms.varOrdering.dfs.LocalRandVarsDFS< V extends Addable< V >, U extends Addable< U > >
• neighborDomains : frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >
• neighborhoods : frodo2.algorithms.RandGraphFactory.Graph, frodo2.algorithms.varOrdering.election.VariableElection< S extends Comparable< S > &Serializable >, frodo2.algorithms.varOrdering.linear.CentralLinearOrdering< V extends Addable< V >, U extends Addable< U > >.MaxWidthMinDom< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >
• neighborPointer : frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >
• neighbors : frodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >.VarInfo, frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.election.LeaderElectionMaxID< T extends Comparable< T > &Serializable >
• neighborValue : frodo2.algorithms.localSearch.mgm.mgm2.BinaryAssignment< Val extends Addable< Val > >
• neighbourPointers : frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >
• neighbours : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >, frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.dsa.tests.TestDSA< U extends Addable< U > >, frodo2.algorithms.SingleQueueAgent< Val extends Addable< Val > >
• neighboursConnected : frodo2.algorithms.SingleQueueAgent< Val extends Addable< Val > >
• neighboursResponded : frodo2.controller.testFiles.TestAgent< V extends Addable< V > >
• newValue : frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >
• newVariable : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.VariableInfo
• NEXT_ID : frodo2.benchmarks.auctions.cats.Bidder
• NEXT_MSG_TYPE : frodo2.algorithms.dpop.privacy.SecureCircularRouting
• NEXT_VAR_MSG_TYPE : frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >
• nextAgent : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >.ClusterInfo, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.ClusterInfo
• nextAsked : frodo2.solutionSpaces.JaCoP.IterSolutionListener< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.JaCoPiterSearch< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIter2< V extends Addable< V > >
• nextCostMsg : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo
• nextDelivered : frodo2.solutionSpaces.JaCoP.IterSolutionListener< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.JaCoPiterSearch< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIter2< V extends Addable< V > >
• nextStepIDs : frodo2.algorithms.varOrdering.election.LeaderElectionMaxID< T extends Comparable< T > &Serializable >
• nextVar : frodo2.algorithms.varOrdering.linear.NextVarMsg, frodo2.algorithms.varOrdering.linear.ProposalMsg< S extends Comparable< S > &Serializable >
• NO_GO_MSG_TYPE : frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >
• node : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo
• node_order : frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationWithOrderTest
• nodes : frodo2.algorithms.RandGraphFactory.Graph, frodo2.gui.VisualizerControls
• NONE : frodo2.gui.Visualizer.MsgVisualization, frodo2.solutionSpaces.hypercube.tests.HypercubeTest.Infinity
• NORM_MSG_TYPE : frodo2.algorithms.duct.Normalize< V extends Addable< V > >
• normModule : frodo2.algorithms.duct.tests.DUCTagentTest
• notResponded : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo
• notRootElement : frodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >
• nSquare : frodo2.algorithms.mpc_discsp.PaillierInteger
• nsquare : frodo2.algorithms.mpc_discsp.PaillierPublicKey
• NULL : frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >.NullHypercube< V extends Addable< V >, U extends Addable< U > >
• number_of_neighbors : frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >
• number_of_utility_values : frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >
• numberOfActiveVariables : frodo2.algorithms.duct.Sampling< V extends Addable< V > >
• numberOfAgents : frodo2.controller.ConfigurationManager
• numberOfAgentsConnected : frodo2.controller.ConfigurationManager
• numberOfAgentsFinished : frodo2.controller.ConfigurationManager
• numberOfAgentsReported : frodo2.controller.ConfigurationManager
• numberOfAncestors : frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• numberOfChildren : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >, frodo2.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 > >, frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• numberOfCoordinationConstraints : frodo2.algorithms.Solution< V, U >
• numberOfDummies : frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.ODPOPsolution< V, U >, frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >.AssignmentMessage< Val extends Addable< Val >, U extends Addable< U > >
• numberOfDummyLeafNodes : frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
• numberOfGoodsProduced : frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
• numberOfGoodsSent : frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >.AssignmentMessage< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >
• numberOfLeafNodes : frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
• numberOfLocalVariables : frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
• numberOfMessagesReceived : frodo2.algorithms.duct.Normalize< V extends Addable< V > >
• numberOfMessagesToReceive : frodo2.algorithms.duct.Normalize< V extends Addable< V > >
• numberOfNeighbours : frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.dsa.tests.TestDSA< U extends Addable< U > >
• numberOfSolutions : frodo2.algorithms.dpop.count.CountSolutionsVALUE< Val extends Addable< Val >, U extends Addable< U > >
• numberOfSolutionsLeft : frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiteratorBestFirst
• numberOfSpaces : frodo2.algorithms.duct.Normalize< V extends Addable< V > >, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
• numberOfSpeculativeUTIlmessages : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.AssignmentMessage< Val extends Addable< Val >, U extends Addable< U > >
• numberOfUTILmessages : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.AssignmentMessage< Val extends Addable< Val >, U extends Addable< U > >
• numberOfValues : frodo2.algorithms.duct.SearchNode< V extends Addable< V > >
• numberOfVariables : frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >, frodo2.algorithms.Solution< V, U >
• numBits : frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >
• numDecrypt : frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >