Uses of Class
mas.agentsHempelsSofa.data.graph.Graph

Packages that use Graph
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. 
 

Uses of Graph in mas.agentsHempelsSofa
 

Fields in mas.agentsHempelsSofa declared as Graph
protected  Graph StrategyBasedAgent.graph
          The believed Looking of the graph.
 

Methods in mas.agentsHempelsSofa that return Graph
 Graph StrategyBasedAgent.getGraph()
           
 

Methods in mas.agentsHempelsSofa with parameters of type Graph
protected  void StrategyBasedAgent.setGraph(Graph graph)
          b
 

Uses of Graph in mas.agentsHempelsSofa.algorithms
 

Methods in mas.agentsHempelsSofa.algorithms with parameters of type Graph
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<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.
 

Uses of Graph in mas.agentsHempelsSofa.data.graph
 

Methods in mas.agentsHempelsSofa.data.graph that return Graph
static Graph Util.generateRandomGraph(int numberOfNodes, int numberOfEdges, boolean allSurveyed)
          Generates a random graph.
 

Methods in mas.agentsHempelsSofa.data.graph with parameters of type Graph
static Edge Util.generateRandomEdge(Graph graph, boolean surveyed)
          Generates a random edge
static java.util.LinkedList<AgentToken> Util.genereateRandomTokens(int numberOfTokens, Graph g, java.lang.String team, java.lang.String state, java.lang.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
 

Constructors in mas.agentsHempelsSofa.data.graph with parameters of type Graph
AdjacencyMatrix(Graph g)
          Creates a new adjacency matrix of a given graph g.
 

Uses of Graph in mas.agentsHempelsSofa.data.zone
 

Constructors in mas.agentsHempelsSofa.data.zone with parameters of type Graph
ZoneManager(Graph graph)
          Creates a new zone manager.
 

Uses of Graph in mas.agentsHempelsSofa.tools
 

Constructors in mas.agentsHempelsSofa.tools with parameters of type Graph
GraphWindow(Graph g, ZoneManager zm, Environment env)
          Creates a new Graph Window.
 

Uses of Graph in mas.agentsHempelsSofa.util
 

Methods in mas.agentsHempelsSofa.util that return Graph
 Graph ActionGenerator.getGraph()
           
 

Methods in mas.agentsHempelsSofa.util with parameters of type Graph
 void ActionGenerator.setGraph(Graph graph)
           
 

Constructors in mas.agentsHempelsSofa.util with parameters of type Graph
ActionGenerator(Graph graph, ZoneManager zoneManager, StrategyBasedAgent agent)
           
 



Copyright © 2012. All Rights Reserved.