HopcroftKarp
org.specs2.data.HopcroftKarp
object 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
Attributes
- Graph
-
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
HopcroftKarp.type
Members list
In this article