Algorithm
Development Kit 1.0

Package algs.model.network.matching

Defines classes to show how to convert a Matching problem into a Flow Network problem.

See:
          Description

Class Summary
BipartiteMatching Computes a matching in a bipartite graph whose vertices are divided into two distinct sets S and T and whose edges only exist between vertices in S and vertices in T.
Pair Represents a matching from the potential set of vertices in S and T.
 

Package algs.model.network.matching Description

Defines classes to show how to convert a Matching problem into a Flow Network problem.


Algorithm Development Kit 1.0

This code supports the Algorithms in a Nutshell book, published by O'Reilly Media, Inc. in November 2008. Please visit the book web page to learn of any changes to the code repository or to record a potential defect.