A Bipartite Graph is a graph where the vertices can be partitioned into two disjoint sets, and each edge is between two vertices in different sets.
Maximum Cardinality Bipartite Matching (MCBM) is the problem of maximizing the unique pairings between vertices on the two sets.
In the near future, we will expand this visualization to cover other forms of Graph Matching (weighted versus unweighted and bipartite versus general graphs).
View the visualisation here!
At the moment, we concentrate on Bipartite Graphs in this visualization.
Matched edges will have black color.
Free/matched edges along an augmenting path will have Orange/Blue colors.
Pro-tip: Since you are not logged-in, you may be a first time visitor who are not aware of the following keyboard shortcuts to navigate this e-Lecture mode: [PageDown] to advance to the next slide, [PageUp] to go back to the previous slide, [Esc] to toggle between this e-Lecture mode and exploration mode.
There are four different sources for specifying an input graph:
Another pro-tip: We designed this visualization and this e-Lecture mode to look good on 1366x768 resolution or larger (typical modern laptop resolution in 2017). We recommend using Google Chrome to access VisuAlgo. Go to full screen mode (F11) to enjoy this setup. However, you can use zoom-in (Ctrl +) or zoom-out (Ctrl -) to calibrate this.
There are two Max Cardinality Bipartite Matching (MCBM) algorithms in this visualization:
As the action is being carried out, each step will be described in the status panel.
e-Lecture: The content of this slide is hidden and only available for legitimate CS lecturer worldwide. Drop an email to visualgo.info at gmail dot com if you want to activate this CS lecturer-only feature and you are really a CS lecturer (show your University staff profile).
Control the animation with the player controls! Keyboard shortcuts are:
Return to 'Exploration Mode' to start exploring!
Note that if you notice any bug in this visualization or if you want to request for a new visualization feature, do not hesitate to drop an email to the project leader: Dr Steven Halim via his email address: stevenhalim at gmail dot com.