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.