scalation.graphalytics

BipartiteMatching

class BipartiteMatching extends AnyRef

The BipartiteMatching class provides an implementation of finding maximal Bipartite Matching.

See also

http://www.geeksforgeeks.org/maximum-bipartite-matching/

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

Instance Constructors

  1. new BipartiteMatching(bpGraph: Array[Array[Boolean]])

    bpGraph

    the bipartitte graph

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 bpm(u: Int, seen: Array[Boolean], matchR: Array[Int]): Boolean

    A DFS based recursive function that returns true if a matching for vertex u is possible.

    A DFS based recursive function that returns true if a matching for vertex u is possible.

    u

    vertex u to be check, whether matching is possible of u to any unmatched v

    seen

    array of vertex v, to keep track of whether v is already seen by some other u

    matchR

    array which contain information of vertex v is assigned to vertex u

  6. def clone(): AnyRef

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

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

    Definition Classes
    AnyRef

  8. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  9. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  11. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  12. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  13. def maxBPM(): Int

    Returns maximum number of matching from M to N.

    Returns maximum number of matching from M to N. The value of matchR(i) is the applicant number assigned to job i, the value -1 indicates nobody is assigned.

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

    Definition Classes
    AnyRef

  15. final def notify(): Unit

    Definition Classes
    AnyRef

  16. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    AnyRef

  18. def toString(): String

    Definition Classes
    AnyRef → Any

  19. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped