Packages

final case class LinKernighanTSP(init: I, weights: D, size: I, mode: I = 0, timeOut: D = 0.0) extends MultiOut[Any] with Product with Serializable

A UGen that solves the traveling salesman problem (TSP) using the Lin-Kernighan heuristic. For each input value of size, a corresponding initial tour and edge weight sequence are read, the tour is optimized and output along with the tour's cost.

Currently, we output two channels: - 0 - tour - the optimized tour - 1 - cost - the cost of the optimized tour, i.e. the sum of its edge weights

init

the initial tour, for example linear or randomized. Should consist of size zero-based vertex indices

weights

the symmetric edge weights, a sequence of length size * (size - 1) / 2, sorted as vertex connections (0,1), (0,2), (0,3), ... (0,size-1), (1,2), (1,3), ... (1,size-1), etc., until (size-2,size-1).

size

for each complete graph, the number of vertices.

mode

currently unused and should remain at the default value of zero.

timeOut

currently unused and should remain at the default value of zero.

Linear Supertypes
Serializable, MultiOut[Any], SomeOut[Any, IndexedSeq[StreamOut]], GE.Lazy[Any], GE[Any], UGenSource[UGenInLike[Any], IndexedSeq[StreamOut]], Expander[UGenInLike[Any]], Lazy, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LinKernighanTSP
  2. Serializable
  3. MultiOut
  4. SomeOut
  5. Lazy
  6. GE
  7. UGenSource
  8. Expander
  9. Lazy
  10. Product
  11. Equals
  12. AnyRef
  13. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new LinKernighanTSP(init: I, weights: D, size: I, mode: I = 0, timeOut: D = 0.0)

    init

    the initial tour, for example linear or randomized. Should consist of size zero-based vertex indices

    weights

    the symmetric edge weights, a sequence of length size * (size - 1) / 2, sorted as vertex connections (0,1), (0,2), (0,3), ... (0,size-1), (1,2), (1,3), ... (1,size-1), etc., until (size-2,size-1).

    size

    for each complete graph, the number of vertices.

    mode

    currently unused and should remain at the default value of zero.

    timeOut

    currently unused and should remain at the default value of zero.

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  6. def cost: D
  7. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  8. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  9. val init: I
  10. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  11. def makeUGen(args: IndexedSeq[UGenIn[_]])(implicit b: Builder): UGenInLike[Any]
    Attributes
    protected
    Definition Classes
    LinKernighanTSPUGenSource
  12. def makeUGens(implicit b: Builder): UGenInLike[Any]

    Abstract method which must be implemented by creating the actual UGens during expansion.

    Abstract method which must be implemented by creating the actual UGens during expansion. This method is at most called once during graph expansion

    returns

    the expanded object (depending on the type parameter U)

    Attributes
    protected
    Definition Classes
    LinKernighanTSPExpander
  13. val mode: I
  14. final def name: String
    Definition Classes
    UGenSource
  15. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  17. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  18. def productElementNames: Iterator[String]
    Definition Classes
    Product
  19. val size: I
  20. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  21. val timeOut: D
  22. def tour: I
  23. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  24. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  25. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  26. val weights: D

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

Inherited from Serializable

Inherited from MultiOut[Any]

Inherited from SomeOut[Any, IndexedSeq[StreamOut]]

Inherited from GE.Lazy[Any]

Inherited from GE[Any]

Inherited from UGenSource[UGenInLike[Any], IndexedSeq[StreamOut]]

Inherited from Expander[UGenInLike[Any]]

Inherited from Lazy

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped