massim.competition2012.scenario
Class GraphGenerator
java.lang.Object
massim.competition2012.scenario.GraphGenerator
- Direct Known Subclasses:
- GraphGeneratorTriangBalOpt, GraphGeneratorTriangulation, GraphGeneratorTriangulationBalanced
public abstract class GraphGenerator
- extends java.lang.Object
This abstract class should be overridden by the classes that will be used to generate different variations
of graphs (maps).
Method Summary |
abstract void |
generate(java.util.Vector<GraphNode> nodes,
java.util.Vector<GraphEdge> edges,
int nodesNum,
int gridWidth,
int gridHeight,
int cellWidth,
int minNodeWeight,
int maxNodeWeight,
int minEdgeCost,
int maxEdgeCost,
java.util.Random random,
int randomWeight,
int gradientWeight,
int optimaWeight,
int blurIterations,
int optimaPercentage)
Generates a graph. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
GraphGenerator
public GraphGenerator()
generate
public abstract void generate(java.util.Vector<GraphNode> nodes,
java.util.Vector<GraphEdge> edges,
int nodesNum,
int gridWidth,
int gridHeight,
int cellWidth,
int minNodeWeight,
int maxNodeWeight,
int minEdgeCost,
int maxEdgeCost,
java.util.Random random,
int randomWeight,
int gradientWeight,
int optimaWeight,
int blurIterations,
int optimaPercentage)
- Generates a graph.
- Parameters:
nodes
- an empty Vector<GraphNode>
where the nodes of the new graph shall be added.edges
- an empty Vector<GraphEdge>
where the edges of the new graph shall be added.nodesNum
- Number of node that the generated graph will have.gridWidth
- gridHeight
- cellWidth
- minNodeWeight
- maxNodeWeight
- minEdgeCost
- maxEdgeCost
-
Copyright © 2012. All Rights Reserved.