Skip to content

Bipartite-Matching algorithm.md

Latest commit

 

History

History
23 lines (11 loc) · 587 Bytes

Bipartite-Matching algorithm.md

File metadata and controls

23 lines (11 loc) · 587 Bytes

[[Graph and Networking Algoriithms]]

Bipartite matching can be weighted and unweighted. Bipartite matching consists of a graph, vertexes of which can be devided in two groups, i.e. job seekers and job listings. It does not neccessarily gives back the max flow, and best result, unless it's run a max flow algorithm, such as [[Ford-Fulkerson algorithm]].

Unweighted

![[Pasted image 20220326102519.png]] not optimal

![[Pasted image 20220326102550.png]] optimal

Weighted aka Hungarian Algorithm

![[Weighted-bipartite-graph-and-its-MWBM.png]]

#algorithms #networking