graph

graph / MinimalBipartitePerfectMatching / 0.1.0

README.md
Given a bipartite graph, finds the perfect matching with minimal cost.
Inputs:
  • A graph represented as a map from vertices (strings) to a list of neighbors (list of strings) OR the url to the Data API file that holds the graph that you would like to be read (currently supported formats: GML)
  • First partition (list of strings)
  • Second partition (list of strings)