Package | Description |
---|---|
massim.competition2012 | |
massim.competition2012.scenario |
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 Vector<GraphEdge> |
GraphSimulationWorldState.edges
The edges conforming the map graph.
|
Set<GraphEdge> |
GraphSimulationAgentPerception.edges
The set of edges that are currently visible to the agent
|
Set<GraphEdge> |
GraphSimulationAgentPerception.surveyedEdges
The set of edges that where surveyed in the previous step, for which the
agent owner of this perception should get extended information.
|
Modifier and Type | Method and Description |
---|---|
List<GraphEdge> |
GraphSimulationWorldState.getConnectedEdges(GraphNode node)
Returns the list of the edges connected to
node |
Modifier and Type | Method and Description |
---|---|
void |
GraphPolicy.drawEdge(GraphEdge e) |
Modifier and Type | Method and Description |
---|---|
void |
GraphPolicy.drawGraph(String string,
int sizeX,
int sizeY,
Vector<GraphNode> nodes,
Vector<GraphEdge> edges)
Draws the graph/topology
|
Modifier and Type | Method and Description |
---|---|
boolean |
TeamState.addSurveyedEdge(GraphEdge e) |
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,
Random random,
int randomWeight,
int gradientWeight,
int optimaWeight,
int blurIterations,
int optimaPercentage) |
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,
Random random,
int randomWeight,
int gradientWeight,
int optimaWeight,
int blurIterations,
int optimaPercentage) |
void |
GraphGeneratorTriangBalOpt.generate(Vector<GraphNode> nodes,
Vector<GraphEdge> edges,
int nodesNum,
int gridWidth,
int gridHeight,
int cellWidth,
int minNodeWeight,
int maxNodeWeight,
int minEdgeCost,
int maxEdgeCost,
Random random,
int randomWeight,
int gradientWeight,
int optimaWeight,
int blurIterations,
int optimaPercentage) |
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,
Random random,
int randomWeight,
int gradientWeight,
int optimaWeight,
int blurIterations,
int optimaPercentage)
Generates a graph.
|
Copyright © 2013. All Rights Reserved.