public class GraphGeneratorTriangulation extends GraphGenerator implements Serializable
Constructor and Description |
---|
GraphGeneratorTriangulation() |
Modifier and Type | Method and Description |
---|---|
void |
generate(Vector<GraphNode> nodes,
Vector<GraphEdge> edges,
int nodesNum,
int gridWidth,
int gridHeight,
int cellWidth,
int minNodeWeight,
int maxNodeWeight,
int minEdgeCost,
int maxEdgeCost,
Random random,
int randomWeight,
int gradientWeight,
int optimaWeight,
int blurIterations,
int optimaPercentage)
Generates a graph.
|
String |
toString() |
public void generate(Vector<GraphNode> nodes, Vector<GraphEdge> edges, int nodesNum, int gridWidth, int gridHeight, int cellWidth, int minNodeWeight, int maxNodeWeight, int minEdgeCost, int maxEdgeCost, Random random, int randomWeight, int gradientWeight, int optimaWeight, int blurIterations, int optimaPercentage)
GraphGenerator
generate
in class GraphGenerator
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.Copyright © 2013. All Rights Reserved.