breeze.optimize.linear

KuhnMunkres

object KuhnMunkres extends BipartiteMatching

Algorithm to find a minimum cost matching on a bipartite graph.

Implements the hungarian algorithm.

Linear Supertypes
BipartiteMatching, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. KuhnMunkres
  2. BipartiteMatching
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  8. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  9. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  10. def extractMatching(costs: Seq[Seq[Double]]): (WrappedArray[Int], Double)

    Given a matrix of positive weights, finds the minimum weight bipartite matching between to arrays.

    Given a matrix of positive weights, finds the minimum weight bipartite matching between to arrays. Returns a matching from the rows (the first index into the matrix) to the columns (-1 for unmatched rows in the case of unbalanced entries) along with the total score of the matching.

    Definition Classes
    KuhnMunkres → BipartiteMatching

  11. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  12. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  13. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  14. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  15. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  16. final def notify(): Unit

    Definition Classes
    AnyRef

  17. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  18. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

  19. def toString(): String

    Definition Classes
    AnyRef → Any

  20. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

  21. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

  22. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from BipartiteMatching

Inherited from AnyRef

Inherited from Any

Ungrouped