|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use GraphNode | |
---|---|
massim.competition2012 | |
massim.competition2012.scenario |
Uses of GraphNode in massim.competition2012 |
---|
Fields in massim.competition2012 declared as GraphNode | |
---|---|
GraphNode |
GraphSimulationAgentState.node
The current node of this agent (that is, the agent's position within the map). |
Fields in massim.competition2012 with type parameters of type GraphNode | |
---|---|
protected java.util.Map<GraphNode,java.util.List<GraphEdge>> |
GraphSimulationWorldState.connectedEdgesMap
A map holding the list of edges connected to each node. |
protected java.util.Map<GraphNode,java.util.List<GraphNode>> |
GraphSimulationWorldState.neighborsMap
A map holding the list of nodes directly connected to each node. |
protected java.util.Map<GraphNode,java.util.List<GraphNode>> |
GraphSimulationWorldState.neighborsMap
A map holding the list of nodes directly connected to each node. |
protected java.util.Map<java.lang.String,GraphNode> |
GraphSimulationWorldState.nodeNamesMap
A map from a node's name to its current state. |
protected java.util.Vector<GraphNode> |
GraphSimulationWorldState.nodes
The nodes conforming the map graph. |
java.util.Set<GraphNode> |
GraphSimulationAgentPerception.nodes
The set of nodes that are currently visible to the agent |
java.util.Set<GraphNode> |
GraphSimulationAgentPerception.probedNodes
The set of nodes that where probed in the previous step, for which the agent owner of this perception should get extended information. |
Methods in massim.competition2012 that return GraphNode | |
---|---|
GraphNode |
GraphSimulationWorldState.getNode(java.lang.String nodeName)
Returns the node object representation given its name. |
Methods in massim.competition2012 that return types with arguments of type GraphNode | |
---|---|
java.util.List<GraphNode> |
GraphSimulationWorldState.getNeighborNodes(GraphNode node)
Returns the list of the nodes directly connected to node |
java.util.Collection<GraphNode> |
GraphSimulationWorldState.getNodes()
getter for the vector holding all nodes of the map. |
Methods in massim.competition2012 with parameters of type GraphNode | |
---|---|
void |
GraphPolicy.drawNode(GraphNode n)
|
java.util.List<GraphEdge> |
GraphSimulationWorldState.getConnectedEdges(GraphNode node)
Returns the list of the edges connected to node |
java.util.List<GraphNode> |
GraphSimulationWorldState.getNeighborNodes(GraphNode node)
Returns the list of the nodes directly connected to node |
void |
GraphSimulationAgentState.setNode(GraphNode node)
Setter for the current node of this agent (that is, the agent's position within the map). |
Method parameters in massim.competition2012 with type arguments of type GraphNode | |
---|---|
void |
GraphPolicy.drawGraph(java.lang.String string,
int sizeX,
int sizeY,
java.util.Vector<GraphNode> nodes,
java.util.Vector<GraphEdge> edges)
|
Uses of GraphNode in massim.competition2012.scenario |
---|
Fields in massim.competition2012.scenario declared as GraphNode | |
---|---|
GraphNode |
GraphEdge.node1
|
GraphNode |
GraphEdge.node2
|
Fields in massim.competition2012.scenario with type parameters of type GraphNode | |
---|---|
java.util.Collection<GraphNode> |
DominatedArea.nodes
|
Methods in massim.competition2012.scenario that return types with arguments of type GraphNode | |
---|---|
java.util.HashMap<GraphNode,GraphNode> |
GraphGeneratorTriangulationBalanced.getCounterparts()
|
java.util.HashMap<GraphNode,GraphNode> |
GraphGeneratorTriangulationBalanced.getCounterparts()
|
java.util.HashMap<GraphNode,GraphNode> |
GraphGeneratorTriangBalOpt.getCounterparts()
|
java.util.HashMap<GraphNode,GraphNode> |
GraphGeneratorTriangBalOpt.getCounterparts()
|
protected static java.util.ArrayList<GraphNode> |
DominationCalculator.getEmptyNodesList(java.util.Collection<GraphNode> nodes)
|
Methods in massim.competition2012.scenario with parameters of type GraphNode | |
---|---|
boolean |
TeamState.addProbedNodes(GraphNode node)
|
protected static void |
DominationCalculator.calculateBasicNodeDomination(GraphNode node,
GraphSimulationWorldState world)
|
protected static java.lang.String |
DominationCalculator.calculateDominatorFromNeighbours(GraphNode node,
GraphSimulationWorldState world)
|
protected static boolean |
DominationCalculator.isEmptyOfActiveAgents(GraphNode node)
|
Method parameters in massim.competition2012.scenario with type arguments of type GraphNode | |
---|---|
void |
GraphGeneratorTriangulation.generate(java.util.Vector<GraphNode> nodes,
java.util.Vector<GraphEdge> edges,
int nodesNum,
int gridWidth,
int gridHeight,
int cellWidth,
int minNodeWeight,
int maxNodeWeight,
int minEdgeCost,
int maxEdgeCost,
java.util.Random random,
int randomWeight,
int gradientWeight,
int optimaWeight,
int blurIterations,
int optimaPercentage)
|
void |
GraphGeneratorTriangulationBalanced.generate(java.util.Vector<GraphNode> nodes,
java.util.Vector<GraphEdge> edges,
int nodesNum,
int gridWidth,
int gridHeight,
int cellWidth,
int minNodeWeight,
int maxNodeWeight,
int minEdgeCost,
int maxEdgeCost,
java.util.Random random,
int randomWeight,
int gradientWeight,
int optimaWeight,
int blurIterations,
int optimaPercentage)
|
void |
GraphGeneratorTriangBalOpt.generate(java.util.Vector<GraphNode> nodes,
java.util.Vector<GraphEdge> edges,
int nodesNum,
int gridWidth,
int gridHeight,
int cellWidth,
int minNodeWeight,
int maxNodeWeight,
int minEdgeCost,
int maxEdgeCost,
java.util.Random random,
int randomWeight,
int gradientWeight,
int optimaWeight,
int blurIterations,
int optimaPercentage)
|
abstract void |
GraphGenerator.generate(java.util.Vector<GraphNode> nodes,
java.util.Vector<GraphEdge> edges,
int nodesNum,
int gridWidth,
int gridHeight,
int cellWidth,
int minNodeWeight,
int maxNodeWeight,
int minEdgeCost,
int maxEdgeCost,
java.util.Random random,
int randomWeight,
int gradientWeight,
int optimaWeight,
int blurIterations,
int optimaPercentage)
Generates a graph. |
protected static java.util.ArrayList<GraphNode> |
DominationCalculator.getEmptyNodesList(java.util.Collection<GraphNode> nodes)
|
Constructors in massim.competition2012.scenario with parameters of type GraphNode | |
---|---|
GraphEdge(int weight,
GraphNode node1,
GraphNode node2)
|
Constructor parameters in massim.competition2012.scenario with type arguments of type GraphNode | |
---|---|
DominatedArea(java.lang.String team,
java.util.Collection<GraphSimulationAgentState> agents,
java.util.Collection<GraphNode> nodes,
int size,
int score)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |