Package | Description |
---|---|
massim.competition2011 | |
massim.competition2011.scenario |
Modifier and Type | Field and Description |
---|---|
GraphNode |
GraphSimulationAgentState.node
The current node of this agent (that is, the agent's position within the map).
|
Modifier and Type | Field and Description |
---|---|
protected Map<GraphNode,List<GraphEdge>> |
GraphSimulationWorldState.connectedEdgesMap
A map holding the list of edges connected to each node.
|
protected Map<GraphNode,List<GraphNode>> |
GraphSimulationWorldState.neighborsMap
A map holding the list of nodes directly connected to each node.
|
protected Map<GraphNode,List<GraphNode>> |
GraphSimulationWorldState.neighborsMap
A map holding the list of nodes directly connected to each node.
|
protected Map<String,GraphNode> |
GraphSimulationWorldState.nodeNamesMap
A map from a node's name to its current state.
|
protected Vector<GraphNode> |
GraphSimulationWorldState.nodes
The nodes conforming the map graph.
|
Set<GraphNode> |
GraphSimulationAgentPerception.nodes
The set of nodes that are currently visible to the agent
|
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.
|
Modifier and Type | Method and Description |
---|---|
GraphNode |
GraphSimulationWorldState.getNode(String nodeName)
Returns the node object representation given its name.
|
Modifier and Type | Method and Description |
---|---|
List<GraphNode> |
GraphSimulationWorldState.getNeighborNodes(GraphNode node)
Returns the list of the nodes directly connected to
node |
Collection<GraphNode> |
GraphSimulationWorldState.getNodes()
getter for the vector holding all nodes of the map.
|
Modifier and Type | Method and Description |
---|---|
void |
GraphPolicy.drawNode(GraphNode n) |
List<GraphEdge> |
GraphSimulationWorldState.getConnectedEdges(GraphNode node)
Returns the list of the edges connected to
node |
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).
|
Modifier and Type | Method and Description |
---|---|
void |
GraphPolicy.drawGraph(String string,
int sizeX,
int sizeY,
Vector<GraphNode> nodes,
Vector<GraphEdge> edges) |
Modifier and Type | Field and Description |
---|---|
GraphNode |
GraphEdge.node1 |
GraphNode |
GraphEdge.node2 |
Modifier and Type | Field and Description |
---|---|
Collection<GraphNode> |
DominatedArea.nodes |
Modifier and Type | Method and Description |
---|---|
HashMap<GraphNode,GraphNode> |
GraphGeneratorTriangulationBalanced.getCounterparts() |
HashMap<GraphNode,GraphNode> |
GraphGeneratorTriangulationBalanced.getCounterparts() |
protected static ArrayList<GraphNode> |
DominationCalculator.getEmptyNodesList(Collection<GraphNode> nodes) |
Modifier and Type | Method and Description |
---|---|
boolean |
TeamState.addProbedNodes(GraphNode node) |
protected static void |
DominationCalculator.calculateBasicNodeDomination(GraphNode node,
GraphSimulationWorldState world) |
protected static String |
DominationCalculator.calculateDominatorFromNeighbours(GraphNode node,
GraphSimulationWorldState world) |
protected static boolean |
DominationCalculator.isEmptyOfActiveAgents(GraphNode node) |
Modifier and Type | Method and Description |
---|---|
void |
GraphGeneratorTriangulation.generate(Vector<GraphNode> nodes,
Vector<GraphEdge> edges,
int nodesNum,
int gridWidth,
int gridHeight,
int cellWidth,
int minNodeWeight,
int maxNodeWeight,
int minEdgeCost,
int maxEdgeCost,
int nodeWeighting,
Random random) |
void |
GraphGeneratorTriangulationBalanced.generate(Vector<GraphNode> nodes,
Vector<GraphEdge> edges,
int nodesNum,
int gridWidth,
int gridHeight,
int cellWidth,
int minNodeWeight,
int maxNodeWeight,
int minEdgeCost,
int maxEdgeCost,
int nodeWeighting,
Random random) |
abstract void |
GraphGenerator.generate(Vector<GraphNode> nodes,
Vector<GraphEdge> edges,
int nodesNum,
int gridWidth,
int gridHeight,
int cellWidth,
int minNodeWeight,
int maxNodeWeight,
int minEdgeCost,
int maxEdgeCost,
int nodeWeighting,
Random random)
Generates a graph.
|
protected static ArrayList<GraphNode> |
DominationCalculator.getEmptyNodesList(Collection<GraphNode> nodes) |
Constructor and Description |
---|
GraphEdge(int weight,
GraphNode node1,
GraphNode node2) |
Constructor and Description |
---|
DominatedArea(String team,
Collection<GraphSimulationAgentState> agents,
Collection<GraphNode> nodes,
int size,
int score) |
Copyright © 2013. All Rights Reserved.