Description: Bipartite graph to find the maximum matching program through a two-dimensional array is given bipartite graph, so that after the initial find a match, the adoption of the initial match to find the greatest match.
- [Km] - Graph Theory in the bipartite graph matc
- [Walsh] - This is used vc++ Image transform source
- [nixufa] - err
- [SerialPort] - This procedure was developed in EVC seri
- [hook] - Complete hook ones using the Trojan code
- [warpImage] - Select the two images correspond to poin
- [PointMatch] - Point set matching algorithm. Including
File list (Check if you may need any files):
Download