|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Vertex | |
---|---|
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. |
Uses of Vertex in mas.agentsHempelsSofa |
---|
Methods in mas.agentsHempelsSofa with parameters of type Vertex | |
---|---|
boolean |
StrategyBasedAgent.enemySaboteurAt(Vertex v)
|
boolean |
StrategyBasedAgent.enemyUnknownAgentAt(Vertex v)
|
Uses of Vertex in mas.agentsHempelsSofa.algorithms |
---|
Methods in mas.agentsHempelsSofa.algorithms that return types with arguments of type Vertex | |
---|---|
static java.util.LinkedList<java.util.LinkedList<Vertex>> |
GraphAlgorithms.dijkstra(Graph graph)
Runs the standard Dijkstra Algorithm on a given graph . |
static java.util.LinkedList<java.util.LinkedList<Vertex>> |
GraphAlgorithms.dijkstra(Graph graph,
double stepWeight,
double edgeWeight)
Runs a weighted Dijkstra Algorithm on a given graph . |
static java.util.LinkedList<Vertex> |
GraphAlgorithms.findConnectedComponent(Graph graph,
Vertex root)
Runs breadth first search on the graph. |
static java.util.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 java.util.LinkedList<Vertex> |
GraphAlgorithms.findSurveyedConnectedComponent(Graph graph,
Vertex root)
Runs breadth first search on the graph. |
static java.util.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 java.util.LinkedList<java.util.LinkedList<Vertex>> |
GraphAlgorithms.goTowards(Graph graph)
|
static java.util.LinkedList<java.util.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 java.util.LinkedList<java.util.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 java.util.LinkedList<Vertex> |
ZoneAlgorithms.testIsolated(Graph graph,
Zone zone,
java.lang.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. |
Methods in mas.agentsHempelsSofa.algorithms with parameters of type Vertex | |
---|---|
static java.util.LinkedList<Vertex> |
GraphAlgorithms.findConnectedComponent(Graph graph,
Vertex root)
Runs breadth first search on the graph. |
static java.util.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 java.util.LinkedList<Vertex> |
GraphAlgorithms.findSurveyedConnectedComponent(Graph graph,
Vertex root)
Runs breadth first search on the graph. |
static java.util.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 java.util.LinkedList<java.util.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 java.util.LinkedList<Vertex> |
ZoneAlgorithms.testIsolated(Graph graph,
Zone zone,
java.lang.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. |
Method parameters in mas.agentsHempelsSofa.algorithms with type arguments of type Vertex | |
---|---|
static void |
GeneralAlgorithms.sort(java.util.LinkedList<Vertex> criticalFrontierVertices,
int[] keys)
|
Uses of Vertex in mas.agentsHempelsSofa.data |
---|
Methods in mas.agentsHempelsSofa.data that return Vertex | |
---|---|
Vertex |
AgentToken.getNextPosition()
|
Vertex |
AgentToken.getPosition()
|
Vertex |
AgentToken.getTargetVertex()
|
Methods in mas.agentsHempelsSofa.data with parameters of type Vertex | |
---|---|
void |
AgentToken.setNextPosition(Vertex nextPosition)
|
void |
AgentToken.setPosition(Vertex position)
|
void |
AgentToken.setTargetVertex(Vertex targetVertex)
|
void |
AgentToken.update(Vertex position,
java.lang.String state,
int step)
|
Constructors in mas.agentsHempelsSofa.data with parameters of type Vertex | |
---|---|
AgentToken(java.lang.String name,
java.lang.String team,
Vertex position,
java.lang.String state,
int step)
Constructor which sets name , team , position and
state . |
|
AgentToken(java.lang.String name,
java.lang.String team,
Vertex position,
java.lang.String state,
java.lang.String role,
int energy,
int health,
int strength,
int visibilityRange,
int step)
The constructor for an inspection. |
|
AgentToken(java.lang.String name,
java.lang.String team,
Vertex position,
Vertex targetVertex,
java.lang.String state,
java.lang.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(java.lang.String name,
java.lang.String team,
Vertex position,
Vertex targetVertex,
java.lang.String state,
java.lang.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). |
Uses of Vertex in mas.agentsHempelsSofa.data.graph |
---|
Methods in mas.agentsHempelsSofa.data.graph that return Vertex | |
---|---|
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(java.lang.String vertexName)
|
Vertex |
Graph.getVertex(Vertex vertex)
|
Vertex[] |
Graph.getVertexArray()
|
Vertex[] |
Edge.getVertices()
|
Methods in mas.agentsHempelsSofa.data.graph that return types with arguments of type Vertex | |
---|---|
java.util.LinkedList<Vertex> |
Vertex.getAdjacentVertices()
|
java.util.LinkedList<Vertex> |
Graph.getConnectedComponent()
gets the connected component which contains the actual position. |
java.util.LinkedList<Vertex> |
Graph.getConnectedComponent(Vertex vertex)
gets the connected component which contains vertex . |
java.util.LinkedList<Vertex> |
Graph.getSurveyedConnectedComponent()
gets the connected component which contains the actual position. |
java.util.LinkedList<Vertex> |
Graph.getSurveyedConnectedComponent(Vertex vertex)
gets the connected component which contains vertex . |
java.util.LinkedList<Vertex> |
Graph.getVertices()
|
Methods in mas.agentsHempelsSofa.data.graph with parameters of type Vertex | |
---|---|
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)
|
java.util.LinkedList<Vertex> |
Graph.getConnectedComponent(Vertex vertex)
gets the connected component which contains vertex . |
Edge |
Graph.getEdge(Vertex vertex1,
Vertex vertex2)
|
java.util.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,
java.lang.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)
|
Method parameters in mas.agentsHempelsSofa.data.graph with type arguments of type Vertex | |
---|---|
boolean |
Graph.containsAllVertices(java.util.Collection<Vertex> vertices)
|
Constructors in mas.agentsHempelsSofa.data.graph with parameters of type Vertex | |
---|---|
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 . |
Uses of Vertex in mas.agentsHempelsSofa.data.zone |
---|
Methods in mas.agentsHempelsSofa.data.zone that return types with arguments of type Vertex | |
---|---|
java.util.LinkedList<Vertex> |
Zone.getCriticalFrontier()
gets the frontier vertices. |
java.util.LinkedList<Vertex> |
Zone.getIsolatedVertices()
|
java.util.LinkedList<Vertex> |
Zone.getMostPreciousVertices()
|
java.util.LinkedList<Vertex> |
Zone.getNonCriticalVertices()
|
java.util.LinkedList<Vertex> |
Zone.getVertices()
|
java.util.LinkedList<Vertex> |
Zone.getWeakestCriticalFrontierVertices()
|
Methods in mas.agentsHempelsSofa.data.zone with parameters of type Vertex | |
---|---|
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. |
Method parameters in mas.agentsHempelsSofa.data.zone with type arguments of type Vertex | |
---|---|
protected void |
Zone.setIsolatedVertices(java.util.LinkedList<Vertex> isolatedVertices)
|
Uses of Vertex in mas.agentsHempelsSofa.util |
---|
Methods in mas.agentsHempelsSofa.util with parameters of type Vertex | |
---|---|
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 |
Method parameters in mas.agentsHempelsSofa.util with type arguments of type Vertex | |
---|---|
eis.iilang.Action |
ActionGenerator.moveTowardsNearest(java.util.LinkedList<Vertex> targetList)
Is agent-type unspecific method that generates a goto action towards the closest of the given vertices |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |