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.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.tools |
This package contains tools for the user.
|
mas.agentsHempelsSofa.util |
This package contains technical utilities.
|
Modifier and Type | Field and Description |
---|---|
protected Graph |
StrategyBasedAgent.graph
The believed Looking of the graph.
|
Modifier and Type | Method and Description |
---|---|
Graph |
StrategyBasedAgent.getGraph() |
Modifier and Type | Method and Description |
---|---|
protected void |
StrategyBasedAgent.setGraph(Graph graph)
b
|
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<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 Graph |
Util.generateRandomGraph(int numberOfNodes,
int numberOfEdges,
boolean allSurveyed)
Generates a random graph.
|
Modifier and Type | Method and Description |
---|---|
static Edge |
Util.generateRandomEdge(Graph graph,
boolean surveyed)
Generates a random edge
|
static LinkedList<AgentToken> |
Util.genereateRandomTokens(int numberOfTokens,
Graph g,
String team,
String state,
String role,
int energy,
int health,
int strength,
int visRange,
int lastInspection)
Generates tokens on graph g
|
static Edge |
Util.getRandomEdge(Graph graph)
Gets a random edge of a graph
|
Constructor and Description |
---|
AdjacencyMatrix(Graph g)
Creates a new adjacency matrix of a given graph g.
|
Constructor and Description |
---|
ZoneManager(Graph graph)
Creates a new zone manager.
|
Constructor and Description |
---|
GraphWindow(Graph g,
ZoneManager zm,
Environment env)
Creates a new Graph Window.
|
Modifier and Type | Method and Description |
---|---|
Graph |
ActionGenerator.getGraph() |
Modifier and Type | Method and Description |
---|---|
void |
ActionGenerator.setGraph(Graph graph) |
Constructor and Description |
---|
ActionGenerator(Graph graph,
ZoneManager zoneManager,
StrategyBasedAgent agent) |
Copyright © 2013. All Rights Reserved.