|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectalgo.Graph
algo.PlaneGraph
public class PlaneGraph
A 2d Graph for an TSP Problem. Totaly connected graph with euclidean distance between points / nodes.
| Field Summary |
|---|
| Fields inherited from class algo.Graph |
|---|
g, INFINITY |
| Constructor Summary | |
|---|---|
PlaneGraph(Point[] p)
|
|
| Method Summary | |
|---|---|
(package private) double |
sqr(double s)
|
| Methods inherited from class algo.Graph |
|---|
connect, distance, size |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public PlaneGraph(Point[] p)
p - an array of points / cities.| Method Detail |
|---|
final double sqr(double s)
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||