JavaScript is disabled on your browser.
Skip navigation links
Overview
Package
Use
Tree
Deprecated
Index
Search
Episteme 1.0.0-beta3.0.14
org.episteme.core.mathematics.discrete.graph.matching
Contents
Description
Related Packages
Classes and Interfaces
Hide sidebar
Show sidebar
Package org.episteme.core.mathematics.discrete.graph.matching
package
org.episteme.core.mathematics.discrete.graph.matching
Related Packages
Package
Description
org.episteme.core.mathematics.discrete.graph
Provides pluggable traversal algorithms for graphs with optional
org.episteme.core.mathematics.discrete.graph.flow
org.episteme.core.mathematics.discrete.graph.providers
Classes
Class
Description
HungarianAlgorithm
Hungarian Algorithm (Kuhn-Munkres) for optimal bipartite matching.