HopcroftKarp

Hopcroft-Karp (https://en.wikipedia.org/wiki/Hopcroft%E2%80%93Karp_algorithm) algorithm for finding the maximum matching in a bipartite graph

This is used for "contain" matchers to find the best matches between actual and expected elements in 2 lists

class Object
trait Matchable
class Any

Value members

Concrete methods

def findMaximalMatching(vertex1: Seq[Int], vertex2: Seq[Int], edges: Map[Int, Seq[Int]]): List[(Int, Int)]