Maximum cardinality matching in general

Category: Python - Education

This is an implementation of Edmonds' blossom-contraction algorithm for maximum cardinality matching in general graphs. Date: 03 February, 2012


Cardinality Matching - Contraction Algorithm - General Graphs - Cardinality - Matching - Contraction

Homepage: http://code.activestate.com/

Developer: code.activestate.com

License: Freeware

Operating System: All

Add a Comment

all are required fields

     
What do you think of this resource?

Select Your Rate:

Votes:0

 

Related Scripts Download

Bean matching puzzle/battle game.

developer Developer: puzzlebeans
license License: GNU General Public License (GPL)
operating systems Operating System: OS Independent (Written in an interpreted language)


Amor Matchmaking and Online Dating site grants you a special opportunity to build up an exclusive “social life with rewarding experiences”.

developer Developer: edison kelley
license License: GNU General Public License (GPL)
operating systems Operating System: Not Available


Our script is something like other popular and strong matching websites (ex: Match.

developer Developer: ExactProduct, Inc.
license License: Common Public License
operating systems Operating System: Linux,Unix,Windows Vista


B can be used to match w characters ([a-zA-Z_0-9]) inside words.

developer Developer: snippets.dzone.com
license License: Freeware
operating systems Operating System: Windows, Linux


This simple import hook script can resolve Windows shortcuts refering to directories.

developer Developer: code.activestate.com
license License: Freeware
operating systems Operating System: All


Finds a (near) optimal solution to a variation of the M-TSP by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exactly once without returning to their starting location).

developer Developer: mathworks.com
license License: Freeware
operating systems Operating System: All