Package | Description |
---|---|
mas.agentsHempelsSofa |
This package contains everything to run all agents of the HempelsSofa team.
|
mas.agentsHempelsSofa.algorithms |
This package contains general algorithms used by the agents.
|
mas.agentsHempelsSofa.data |
This package contains general data structures.
|
mas.agentsHempelsSofa.data.graph |
This package contains data structures to define a graph.
|
mas.agentsHempelsSofa.data.zone |
This package contains data structures to define a zone.
|
mas.agentsHempelsSofa.util |
This package contains technical utilities.
|
Modifier and Type | Method and Description |
---|---|
boolean |
StrategyBasedAgent.enemySaboteurAt(Vertex v) |
boolean |
StrategyBasedAgent.enemyUnknownAgentAt(Vertex v) |
Modifier and Type | Method and Description |
---|---|
static LinkedList<LinkedList<Vertex>> |
GraphAlgorithms.dijkstra(Graph graph)
Runs the standard Dijkstra Algorithm on a given
graph . |
static LinkedList<LinkedList<Vertex>> |
GraphAlgorithms.dijkstra(Graph graph,
double stepWeight,
double edgeWeight)
Runs a weighted Dijkstra Algorithm on a given
graph . |
static LinkedList<Vertex> |
GraphAlgorithms.findConnectedComponent(Graph graph,
Vertex root)
Runs breadth first search on the graph.
|
static LinkedList<Vertex> |
GraphAlgorithms.findFastestPath(Graph graph,
Vertex source,
Vertex target)
Runs breadth first search on the graph to find the fastest path
difference to findConnectdComponent is that this algorithm stops when the
target is found
|
static LinkedList<Vertex> |
GraphAlgorithms.findSurveyedConnectedComponent(Graph graph,
Vertex root)
Runs breadth first search on the graph.
|
static LinkedList<Vertex> |
GraphAlgorithms.getSurrounding(Vertex core)
returns a list of all the neighbours which are at most 2 steps away of
the position. the position itself is not included
|
static LinkedList<LinkedList<Vertex>> |
GraphAlgorithms.goTowards(Graph graph) |
static LinkedList<LinkedList<Vertex>> |
GraphAlgorithms.goTowards(Graph graph,
double stepWeight,
double edgeWeight,
int maxEdgeCost)
this action is pretty similar to dijkstra() above only difference: it
considers the unsurveyed edges as well, weighting them by 5
|
static LinkedList<LinkedList<Vertex>> |
GraphAlgorithms.goTowards(Vertex root,
Graph graph,
double stepWeight,
double edgeWeight)
this method call finds all shortest path from a given Vertex root
|
static LinkedList<Vertex> |
ZoneAlgorithms.testIsolated(Graph graph,
Zone zone,
String[] dominatingTeams,
Vertex start)
tests whether vertices in the zone is isolated by a frontier. this fails,
if there are no enemy vertices known yet.
|
Modifier and Type | Method and Description |
---|---|
static LinkedList<Vertex> |
GraphAlgorithms.findConnectedComponent(Graph graph,
Vertex root)
Runs breadth first search on the graph.
|
static LinkedList<Vertex> |
GraphAlgorithms.findFastestPath(Graph graph,
Vertex source,
Vertex target)
Runs breadth first search on the graph to find the fastest path
difference to findConnectdComponent is that this algorithm stops when the
target is found
|
static LinkedList<Vertex> |
GraphAlgorithms.findSurveyedConnectedComponent(Graph graph,
Vertex root)
Runs breadth first search on the graph.
|
static LinkedList<Vertex> |
GraphAlgorithms.getSurrounding(Vertex core)
returns a list of all the neighbours which are at most 2 steps away of
the position. the position itself is not included
|
static LinkedList<LinkedList<Vertex>> |
GraphAlgorithms.goTowards(Vertex root,
Graph graph,
double stepWeight,
double edgeWeight)
this method call finds all shortest path from a given Vertex root
|
static LinkedList<Vertex> |
ZoneAlgorithms.testIsolated(Graph graph,
Zone zone,
String[] dominatingTeams,
Vertex start)
tests whether vertices in the zone is isolated by a frontier. this fails,
if there are no enemy vertices known yet.
|
Modifier and Type | Method and Description |
---|---|
static void |
GeneralAlgorithms.sort(LinkedList<Vertex> criticalFrontierVertices,
int[] keys) |
Modifier and Type | Method and Description |
---|---|
Vertex |
AgentToken.getNextPosition() |
Vertex |
AgentToken.getPosition() |
Vertex |
AgentToken.getTargetVertex() |
Modifier and Type | Method and Description |
---|---|
void |
AgentToken.setNextPosition(Vertex nextPosition) |
void |
AgentToken.setPosition(Vertex position) |
void |
AgentToken.setTargetVertex(Vertex targetVertex) |
void |
AgentToken.update(Vertex position,
String state,
int step) |
Constructor and Description |
---|
AgentToken(String name,
String team,
Vertex position,
String state,
int step)
Constructor which sets
name , team , position and
state . |
AgentToken(String name,
String team,
Vertex position,
String state,
String role,
int energy,
int health,
int strength,
int visibilityRange,
int step)
The constructor for an inspection.
|
AgentToken(String name,
String team,
Vertex position,
Vertex targetVertex,
String state,
String role,
int energy,
int maxEnergy,
int maxEnergyDisabled,
int health,
int maxHealth,
int strength,
int visibilityRange,
int step)
The complete constructor (for agents of same team).
|
AgentToken(String name,
String team,
Vertex position,
Vertex targetVertex,
String state,
String role,
int energy,
int maxEnergy,
int maxEnergyDisabled,
int health,
int maxHealth,
int strength,
int visibilityRange,
int lastUpdate,
int lastInspection)
The complete constructor (for agents of same team).
|
Modifier and Type | Method and Description |
---|---|
Vertex |
Graph.add(eis.iilang.Parameter identifier)
Adds a new node to the graph with an
identifier . |
Vertex |
Graph.add(Vertex vertex)
Adds a node to the graph, if there is no equal vertex in the graph.
|
Vertex |
Graph.getPosition() |
Vertex |
Graph.getVertex(eis.iilang.Parameter param) |
Vertex |
Graph.getVertex(String vertexName) |
Vertex |
Graph.getVertex(Vertex vertex) |
Vertex[] |
Graph.getVertexArray() |
Vertex[] |
Edge.getVertices() |
Modifier and Type | Method and Description |
---|---|
LinkedList<Vertex> |
Vertex.getAdjacentVertices() |
LinkedList<Vertex> |
Graph.getConnectedComponent()
gets the connected component which contains the actual position.
|
LinkedList<Vertex> |
Graph.getConnectedComponent(Vertex vertex)
gets the connected component which contains
vertex . |
LinkedList<Vertex> |
Graph.getSurveyedConnectedComponent()
gets the connected component which contains the actual position.
|
LinkedList<Vertex> |
Graph.getSurveyedConnectedComponent(Vertex vertex)
gets the connected component which contains
vertex . |
LinkedList<Vertex> |
Graph.getVertices() |
Modifier and Type | Method and Description |
---|---|
Vertex |
Graph.add(Vertex vertex)
Adds a node to the graph, if there is no equal vertex in the graph.
|
int |
Vertex.compareTo(Vertex v) |
boolean |
Graph.contains(Vertex vertex) |
LinkedList<Vertex> |
Graph.getConnectedComponent(Vertex vertex)
gets the connected component which contains
vertex . |
Edge |
Graph.getEdge(Vertex vertex1,
Vertex vertex2) |
LinkedList<Vertex> |
Graph.getSurveyedConnectedComponent(Vertex vertex)
gets the connected component which contains
vertex . |
Vertex |
Graph.getVertex(Vertex vertex) |
boolean |
Vertex.isAdjacentTo(Vertex adjacentVertex) |
boolean |
Graph.isAdjacentToEnemyAgent(Vertex vertex,
String team) |
void |
Graph.moveToken(AgentToken token,
Vertex targetVertex)
moves a token to another
vertex . |
void |
Graph.setPosition(Vertex vertex) |
void |
Graph.setProbed(Vertex vertex,
int value) |
void |
Graph.setVertexArray(Vertex[] vertexArray) |
void |
Edge.setVertices(Vertex[] vertices) |
Modifier and Type | Method and Description |
---|---|
boolean |
Graph.containsAllVertices(Collection<Vertex> vertices) |
Constructor and Description |
---|
Edge(Vertex vertex1,
Vertex vertex2)
Creates a new unsurveyed edge from
vertex1 to vertex2
with unknown weight (0). |
Edge(Vertex vertex1,
Vertex vertex2,
int weight)
Creates a new edge from
vertex1 to vertex2 with a
specified weight . |
Modifier and Type | Method and Description |
---|---|
LinkedList<Vertex> |
Zone.getCriticalFrontier()
gets the frontier vertices.
|
LinkedList<Vertex> |
Zone.getIsolatedVertices() |
LinkedList<Vertex> |
Zone.getMostPreciousVertices() |
LinkedList<Vertex> |
Zone.getNonCriticalVertices() |
LinkedList<Vertex> |
Zone.getVertices() |
LinkedList<Vertex> |
Zone.getWeakestCriticalFrontierVertices() |
Modifier and Type | Method and Description |
---|---|
void |
Zone.addVertex(Vertex vertex) |
boolean |
Zone.contains(Vertex vertex)
Looks up a vertex in this zone.
|
int |
ZoneManager.getValue(Vertex vertex) |
Zone |
ZoneManager.getZone(Vertex vertex) |
boolean |
ZoneManager.isInMostPreciousZone(Vertex vertex) |
boolean |
Zone.isOnCriticalFrontier(Vertex vertex)
Checks whether a vertex is on the critical frontier of this zone.
|
Modifier and Type | Method and Description |
---|---|
protected void |
Zone.setIsolatedVertices(LinkedList<Vertex> isolatedVertices) |
Modifier and Type | Method and Description |
---|---|
int |
ActionGenerator.determineConnectivity(Vertex vertex,
Zone zone)
this method tells with how many frontier agents of a zone a vertex is
connected when you call this method from an agents surrounding.
|
eis.iilang.Action |
ActionGenerator.moveFastTo(Vertex target)
generates an action, which leads to the path with least number of
vertices
|
eis.iilang.Action |
ActionGenerator.moveTowards(Vertex vertex)
Is agent-type unspecific method that generates a goto action towards the
closest vertex part of the frontier
|
Modifier and Type | Method and Description |
---|---|
eis.iilang.Action |
ActionGenerator.moveTowardsNearest(LinkedList<Vertex> targetList)
Is agent-type unspecific method that generates a goto action towards the
closest of the given vertices
|
Copyright © 2013. All Rights Reserved.