|
FRODO Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
|
Distributed DFS generation protocol. More...

Classes | |
| class | DFSview |
| The view of the DFS from one variable. More... | |
| class | MessageDFSoutput |
| Message class used for the output of the protocol. More... | |
| interface | NextChildChoiceHeuristic |
| Interface for heuristics used to choose a variable's next child from its list of open neighbors. More... | |
| class | BlindScoringHeuristic |
| A DFS heuristic based on a ScoringHeuristic that does not require message exchange between agents. More... | |
| class | ScoreBroadcastingHeuristic |
| Selects the next child as the one that has the highest score. More... | |
Public Member Functions | |
| DFSgeneration () | |
| Default constructor. | |
| DFSgeneration (DCOPProblemInterface< V, U > problem, NextChildChoiceHeuristic heuristic) | |
| Constructor. | |
| DFSgeneration (DCOPProblemInterface< V, U > problem, Element parameters) throws ClassNotFoundException | |
| Constructor. | |
| DFSgeneration (Element parameters, DCOPProblemInterface< V, U > problem) | |
| The constructor called in "statistics gatherer" mode. | |
| DFSgeneration (DCOPProblemInterface< V, U > problem) | |
| Manual constructor for the "statistics gatherer" mode. | |
| HashMap< String, DFSview< V, U > > | getDFS () |
| Collection< MessageType > | getMsgTypes () |
| void | notifyIn (Message msg) |
| The algorithm. | |
| void | setQueue (Queue queue) |
| void | getStatsFromQueue (Queue queue) |
| void | setSilent (boolean silent) |
| String | dfsToString () |
| void | reset () |
| long | getFinalTime () |
| Returns the time at which the DFS phase has finished, determined by looking at the timestamp of the stat messages. | |
| Public Member Functions inherited from frodo2.communication.IncomingMsgPolicyInterface< T > | |
| default void | notifyIn (Message msg, Object toAgent) |
| Notifies the listener of an incoming message. | |
Static Public Member Functions | |
| static< V extends Addable< V > U extends Addable< U > String | dfsToString (Map< String, DFSview< V, U > > dfs) |
Static Public Attributes | |
| static MessageType | FINISH_MSG_TYPE = AgentInterface.AGENT_FINISHED |
| The type of the message telling the agent finished. | |
| static MessageType | START_MSG_TYPE = AgentInterface.START_AGENT |
| The type of the message telling the module to start. | |
| static MessageType | ROOT_VAR_MSG_TYPE = LeaderElectionMaxID.OUTPUT_MSG_TYPE |
| The type of the messages telling whether a given variable is a root. | |
| static final MessageType | CHILD_MSG_TYPE = new MessageType ("VarOrdering", "DFSgeneration", "Child") |
| The type of the message used to tell the recipient that it is a child of the sender. | |
| static MessageType | PSEUDO_MSG_TYPE = new MessageType ("VarOrdering", "DFSgeneration", "Pseudo") |
| The type of the message used to tell the recipient that it is a pseudo-child of the sender. | |
| static MessageType | OUTPUT_MSG_TYPE = new MessageType ("VarOrdering", "DFSgeneration", "Output") |
| The type of the output messages. | |
| static final MessageType | STATS_MSG_TYPE = new MessageType ("VarOrdering", "DFSgeneration", "Stats") |
| The type of the messages containing statistics. | |
Protected Member Functions | |
| MessageType | getRootVarMsgType () |
| MessageType | getChildMsgType () |
| MessageType | getPseudoMsgType () |
| MessageType | getOutputMsgType () |
| DFSgeneration (boolean withSharedVars) | |
| Empty constructor. | |
| void | init () |
| Parses the problem. | |
| void | init (String var) |
| Parses the problem for only one variable. | |
| void | processAdditionalMsgInformation (Message msg, String var, DFSview< V, U > dfsView) |
| allows to process information included in messages which extend CHILDmsg | |
| CHILDmsg | makeChildToken (Serializable rootID, String var, String dest, Collection< String > openNeighbors) |
| makes the ChildToken Message with all the information required by the module | |
| void | sendAdditionalDFSoutput (Serializable rootID, String myVar) |
| Use this method to send additional output from DFS generation. | |
| boolean | sendDownCHILDtoken (Serializable rootID, String var, Collection< String > openList, DFSview< V, U > myDFSview, Message msg) |
| Attempts to choose the next child and sends it a CHILD token. | |
Protected Attributes | |
| Queue | queue |
| The queue on which it should call sendMessage(). | |
| boolean | started = false |
| Whether the execution of the algorithm has started. | |
| Map< String, Collection< String > > | openNeighbors |
| For each variable that this agent owns, a collection of open neighbor variables. | |
| HashMap< String, DFSview< V, U > > | dfsViews |
| For every variable this agent owns, its view of the DFS. | |
| Map< String, String > | owners |
| For each known variable, the name of the agent that owns it. | |
| int | totalNbrVars |
| The total number of variables in the problem (used only in "statistics gatherer" mode). | |
| NextChildChoiceHeuristic | heuristic |
| The heuristic used to choose a variable's next child from its list of open neighbors. | |
| DCOPProblemInterface< V, U > | problem |
| The problem. | |
| HashMap< Serializable, LinkedList< String > > | partialPaths = new HashMap< Serializable, LinkedList<String> > () |
| For each component, the current partial constraint graph traversal path. | |
Private Member Functions | |
| NextChildChoiceHeuristic | createHeuristic (Class<? extends NextChildChoiceHeuristic > heuristicClass, Element heuristicParams) |
| Instantiates a heuristic using reflection, based on the class name and the XCSP problem description. | |
| void | parseSpaces (String myVar, DFSview< V, U > myDFSview) |
| Parses and records the spaces for the input variable. | |
| void | resetComponent (String var) |
| Resets all entries in this.dfsViews corresponding to variables in the component of the input variable. | |
Private Attributes | |
| HashSet< String > | sentOutputs = new HashSet<String> () |
| The variables for which a DFSoutput has already been sent. | |
| boolean | silent = false |
| Whether the stats reporter should print its stats. | |
| String | dotRendererClass = null |
| Renderer to display DOT code. | |
| long | finalTime = Long.MIN_VALUE |
| The time at which the DFS procedure has finished. | |
| final boolean | withSharedVars |
| When parsing the constraints, whether to take into account variables with no specified owners. | |
Distributed DFS generation protocol.
| <V> | the type used for variable values |
| <U> | the type used for utility values |
| frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSgeneration | ( | ) |
Default constructor.
Referenced by DFSgeneration().
| frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSgeneration | ( | DCOPProblemInterface< V, U > | problem, |
| NextChildChoiceHeuristic | heuristic ) |
| frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSgeneration | ( | DCOPProblemInterface< V, U > | problem, |
| Element | parameters ) throws ClassNotFoundException |
Constructor.
| problem | this agent's problem |
| parameters | the parameters for DFSgeneration |
| ClassNotFoundException | if the heuristic class is unknown |
References createHeuristic(), DFSgeneration(), and problem.

| frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSgeneration | ( | Element | parameters, |
| DCOPProblemInterface< V, U > | problem ) |
The constructor called in "statistics gatherer" mode.
| problem | the overall problem |
| parameters | the description of what statistics should be reported (currently unused) |
References dfsViews, dotRendererClass, and problem.
| frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSgeneration | ( | DCOPProblemInterface< V, U > | problem | ) |
|
protected |
Empty constructor.
| withSharedVars | When parsing the constraints, whether to take into account variables with no specified owners |
References withSharedVars.
|
private |
Instantiates a heuristic using reflection, based on the class name and the XCSP problem description.
| heuristicClass | the class of the heuristic |
| heuristicParams | the XML description of the heuristic |
References problem.
Referenced by DFSgeneration().
| String frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.dfsToString | ( | ) |
References dfsToString().
Referenced by dfsToString().

|
static |
References frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >.getAllPseudoChildren(), frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >.getChildren(), frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >.getParent(), and frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >.getPseudoParents().

|
protected |
References CHILD_MSG_TYPE.
Referenced by getMsgTypes().
| HashMap< String, DFSview< V, U > > frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.getDFS | ( | ) |
References dfsViews.
Referenced by frodo2.algorithms.dpop.DPOPsolver< V extends Addable< V >, U extends Addable< U > >.getDFS().
| long frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.getFinalTime | ( | ) |
Returns the time at which the DFS phase has finished, determined by looking at the timestamp of the stat messages.
References finalTime.
| Collection< MessageType > frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.getMsgTypes | ( | ) |
Implements frodo2.communication.MessageListener< T >.
References FINISH_MSG_TYPE, getChildMsgType(), getPseudoMsgType(), getRootVarMsgType(), and START_MSG_TYPE.

|
protected |
|
protected |
References PSEUDO_MSG_TYPE.
Referenced by getMsgTypes().
|
protected |
References ROOT_VAR_MSG_TYPE.
Referenced by getMsgTypes().
| void frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.getStatsFromQueue | ( | Queue | queue | ) |
Implements frodo2.algorithms.StatsReporter.
References queue, and STATS_MSG_TYPE.
Referenced by frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.getStatsFromQueue(), frodo2.algorithms.dpop.privacy.test.SecureRerootingTest.randomTest(), frodo2.algorithms.dpop.privacy.test.VariableObfuscationTest< V extends Addable< V > >.randomTest(), frodo2.algorithms.dpop.privacy.test.SecureCircularRoutingTest.setUp(), frodo2.algorithms.dpop.test.DPOPagentTest< V extends Addable< V >, U extends Addable< U > >.setUp(), frodo2.algorithms.duct.tests.DUCTagentChildSearchTest.setUp(), frodo2.algorithms.duct.tests.DUCTagentChildTest.setUp(), frodo2.algorithms.duct.tests.DUCTagentPruningSearchTest.setUp(), frodo2.algorithms.duct.tests.DUCTagentPruningTest.setUp(), frodo2.algorithms.duct.tests.DUCTagentTest.setUp(), and frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest.testRandom().
|
protected |
Parses the problem.
References dfsViews, init(), openNeighbors, and problem.
Referenced by init().

|
protected |
Parses the problem for only one variable.
| var | the specified variable |
References dfsViews, getOutputMsgType(), problem, and frodo2.communication.Queue.sendMessageToSelf().

|
protected |
makes the ChildToken Message with all the information required by the module
| rootID | The ID of the root |
| var | The variable concerned |
| dest | The destination variable |
| openNeighbors | The list of open neighbors of the current variable |
References openNeighbors.
Referenced by sendDownCHILDtoken().
| void frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.notifyIn | ( | Message | msg | ) |
The algorithm.
The algorithm is triggered by the receipt of a messages of type LeaderElectionMaxID.OUTPUT_MSG_TYPE, telling the agent whether each variable is a root. The actual implementation corresponds to the one described in the P-DPOP paper published in WI-IAT 2008.
| msg | the message received |
Implements frodo2.communication.IncomingMsgPolicyInterface< T >.
References frodo2.communication.MessageType.equals(), notifyIn(), and STATS_MSG_TYPE.
Referenced by notifyIn().

|
private |
Parses and records the spaces for the input variable.
| myVar | the variable |
| myDFSview | the variable's view of the DFS |
References frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >.getAllPseudoChildren(), frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >.getChildren(), and frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >.getSolutionSpaces().

|
protected |
allows to process information included in messages which extend CHILDmsg
| msg | The message received |
| var | The variable concerned |
| dfsView | The dfsView of myVar |
| void frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.reset | ( | ) |
Implements frodo2.algorithms.StatsReporter.
References frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >.getVariables().
Referenced by frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.reset().

|
private |
Resets all entries in this.dfsViews corresponding to variables in the component of the input variable.
| var | a variable in the component to be reset |
|
protected |
Use this method to send additional output from DFS generation.
| rootID | The ID of the root |
| myVar | Variable name |
|
protected |
Attempts to choose the next child and sends it a CHILD token.
| rootID | the ID of the root |
| var | the variable whose next child must be chosen |
| openList | the list of open neighbors |
| myDFSview | the known dfsView for the input variable |
| msg | the message just received |
References frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >.addChild(), makeChildToken(), frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.NextChildChoiceHeuristic.popNextChild(), and queue.

| void frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.setQueue | ( | Queue | queue | ) |
Implements frodo2.communication.MessageListener< T >.
References queue, and setQueue().
Referenced by setQueue().

| void frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.setSilent | ( | boolean | silent | ) |
Implements frodo2.algorithms.StatsReporter.
References silent.
Referenced by frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.getStatsFromQueue(), frodo2.algorithms.dpop.privacy.test.SecureRerootingTest.randomTest(), frodo2.algorithms.dpop.privacy.test.VariableObfuscationTest< V extends Addable< V > >.randomTest(), frodo2.algorithms.dpop.privacy.test.SecureCircularRoutingTest.setUp(), frodo2.algorithms.dpop.test.DPOPagentTest< V extends Addable< V >, U extends Addable< U > >.setUp(), frodo2.algorithms.duct.tests.DUCTagentChildSearchTest.setUp(), frodo2.algorithms.duct.tests.DUCTagentChildTest.setUp(), frodo2.algorithms.duct.tests.DUCTagentPruningSearchTest.setUp(), frodo2.algorithms.duct.tests.DUCTagentPruningTest.setUp(), frodo2.algorithms.duct.tests.DUCTagentTest.setUp(), and frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest.testRandom().
|
static |
The type of the message used to tell the recipient that it is a child of the sender.
Referenced by frodo2.algorithms.varOrdering.dfs.CHILDmsg.CHILDmsg(), frodo2.algorithms.varOrdering.dfs.CHILDmsg.CHILDmsg(), getChildMsgType(), and frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.notifyIn().
|
protected |
For every variable this agent owns, its view of the DFS.
Referenced by DFSgeneration(), DFSgeneration(), getDFS(), init(), and init().
|
private |
Renderer to display DOT code.
Referenced by DFSgeneration().
|
private |
The time at which the DFS procedure has finished.
Referenced by getFinalTime().
|
static |
The type of the message telling the agent finished.
Referenced by getMsgTypes(), frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.ScoreBroadcastingHeuristic< S extends Comparable< S > &Serializable >.getMsgTypes(), and frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.ScoreBroadcastingHeuristic< S extends Comparable< S > &Serializable >.notifyIn().
|
protected |
The heuristic used to choose a variable's next child from its list of open neighbors.
Referenced by DFSgeneration().
|
protected |
For each variable that this agent owns, a collection of open neighbor variables.
Referenced by init(), makeChildToken(), frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.BlindScoringHeuristic< S extends Comparable< S > &Serializable >.popNextChild(), frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.NextChildChoiceHeuristic.popNextChild(), and frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.ScoreBroadcastingHeuristic< S extends Comparable< S > &Serializable >.popNextChild().
|
static |
The type of the output messages.
Referenced by frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.getMsgTypes(), frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.getMsgTypes(), frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.getMsgTypes(), frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.getMsgTypes(), frodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >.getMsgTypes(), frodo2.algorithms.dpop.param.ParamVALUE< Val extends Addable< Val > >.getMsgTypes(), frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >.getMsgTypes(), frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable< U > >.getMsgTypes(), frodo2.algorithms.dpop.privacy.test.SecureRerootingTest.getMsgTypes(), frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >.getMsgTypes(), frodo2.algorithms.duct.Normalize< V extends Addable< V > >.getMsgTypes(), frodo2.algorithms.duct.Sampling< V extends Addable< V > >.getMsgTypes(), frodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.getMsgTypes(), frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >.getMsgTypes(), getOutputMsgType(), frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest.getOutputMsgType(), frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.MessageDFSoutput< V extends Addable< V >, U extends Addable< U > >.MessageDFSoutput(), frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.MessageDFSoutput< V extends Addable< V >, U extends Addable< U > >.MessageDFSoutput(), frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.notifyIn(), frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.notifyIn(), frodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >.notifyIn(), frodo2.algorithms.dpop.privacy.test.SecureRerootingTest.notifyIn(), frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > >.notifyIn(), frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.notifyIn(), frodo2.algorithms.duct.Normalize< V extends Addable< V > >.notifyIn(), frodo2.algorithms.duct.NormalizeInf< V extends Addable< V > >.notifyIn(), frodo2.algorithms.duct.Sampling< V extends Addable< V > >.notifyIn(), frodo2.algorithms.duct.SamplingChild< V extends Addable< V > >.notifyIn(), frodo2.algorithms.duct.SamplingChildSearch< V extends Addable< V > >.notifyIn(), frodo2.algorithms.duct.SamplingPruning< V extends Addable< V > >.notifyIn(), frodo2.algorithms.duct.SamplingPruningSearch< V extends Addable< V > >.notifyIn(), frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >.notifyIn(), frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.FakeQueue.notifyInListeners(), frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >.notifyOut(), frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.FakeQueue.sendMessageToSelf(), and frodo2.algorithms.dpop.privacy.test.SecureCircularRoutingTest.setUp().
|
protected |
For each known variable, the name of the agent that owns it.
|
protected |
For each component, the current partial constraint graph traversal path.
|
protected |
The problem.
Referenced by frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.BlindScoringHeuristic< S extends Comparable< S > &Serializable >.BlindScoringHeuristic(), createHeuristic(), DFSgeneration(), DFSgeneration(), DFSgeneration(), DFSgeneration(), init(), and init().
|
static |
The type of the message used to tell the recipient that it is a pseudo-child of the sender.
Referenced by getPseudoMsgType().
|
protected |
The queue on which it should call sendMessage().
Referenced by getStatsFromQueue(), sendDownCHILDtoken(), and setQueue().
|
static |
The type of the messages telling whether a given variable is a root.
Referenced by frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.clear(), frodo2.algorithms.dpop.privacy.P3halves_DPOPsolver< V extends Addable< V > >.clear(), frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationWithOrderTest.getMsgTypes(), getRootVarMsgType(), frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationWithOrderTest.notifyIn(), and frodo2.algorithms.dpop.privacy.test.SecureRerootingTest.randomTest().
|
private |
The variables for which a DFSoutput has already been sent.
|
private |
Whether the stats reporter should print its stats.
Referenced by setSilent().
|
static |
The type of the message telling the module to start.
Referenced by getMsgTypes(), frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.ScoreBroadcastingHeuristic< S extends Comparable< S > &Serializable >.getMsgTypes(), and frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.ScoreBroadcastingHeuristic< S extends Comparable< S > &Serializable >.notifyIn().
|
protected |
Whether the execution of the algorithm has started.
|
static |
The type of the messages containing statistics.
Referenced by frodo2.algorithms.dpop.privacy.test.SecureCircularRoutingTest.getMsgTypes(), frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable< U > >.getStatsFromQueue(), frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.getStatsFromQueue(), getStatsFromQueue(), frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable< U > >.notifyIn(), frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.notifyIn(), notifyIn(), frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest.notifyIn(), frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.FakeQueue.sendMessage(), and frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest.testRandom().
|
protected |
The total number of variables in the problem (used only in "statistics gatherer" mode).
|
private |
When parsing the constraints, whether to take into account variables with no specified owners.
Referenced by DFSgeneration().