LeaderElectionMaxID.java File Reference

import java.io.Serializable;
import java.lang.reflect.Constructor;
import java.util.ArrayList;
import java.util.Collection;
import java.util.HashMap;
import java.util.HashSet;
import org.jdom2.Element;
import frodo2.algorithms.heuristics.AgentNameHeuristic;
import frodo2.algorithms.heuristics.AgentScoringHeuristic;
import frodo2.communication.IncomingMsgPolicyInterface;
import frodo2.communication.Message;
import frodo2.communication.MessageType;
import frodo2.communication.MessageWith3Payloads;
import frodo2.communication.Queue;
import frodo2.solutionSpaces.DCOPProblemInterface;

Include dependency graph for LeaderElectionMaxID.java:

Classes
class	frodo2.algorithms.varOrdering.election.LeaderElectionMaxID< T extends Comparable< T > &Serializable >
	This distributed leader election protocol chooses a leader agent as the one with highest unique ID. More...
class	frodo2.algorithms.varOrdering.election.LeaderElectionMaxID< T extends Comparable< T > &Serializable >.MessageLEoutput< T extends Comparable< T > &Serializable >
	Message class used for the output of the protocol. More...

Packages
package	frodo2.algorithms.varOrdering.election
	Algorithms to elect a variable.