|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--drasys.or.graph.tsp.TSPBase | +--drasys.or.graph.tsp.ConstructBase | +--drasys.or.graph.tsp.FullEnumeration
This is TSP construction algorithm which fully enumerates all possibilities and retains the best.
Constructor Summary | |
FullEnumeration()
|
|
FullEnumeration(GraphI graph)
|
Method Summary | |
protected void |
construct()
|
Methods inherited from class drasys.or.graph.tsp.ConstructBase |
constructClosedTour,
constructOpenTour,
constructOpenTour,
constructOpenTourFrom,
constructOpenTourTo,
saveTour,
selectVertex,
selectVertex,
selectVertex |
Methods inherited from class drasys.or.graph.tsp.TSPBase |
checkChangeCount,
countVertices,
forwardCost,
getCost,
getTour,
initVertices,
initVertices,
reverseCost,
rotateClosedTour,
setEdgeKey,
setGraph,
setProperties |
Methods inherited from class java.lang.Object |
clone,
equals,
finalize,
getClass,
hashCode,
notify,
notifyAll,
toString,
wait,
wait,
wait |
Constructor Detail |
public FullEnumeration()
public FullEnumeration(GraphI graph)
Method Detail |
protected void construct() throws TourNotFoundException
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |